Found problems: 1342
2009 JBMO TST - Macedonia, 4
In every $1\times1$ cell of a rectangle board a natural number is written. In one step it is allowed the numbers written in every cell of arbitrary chosen row, to be doubled, or the numbers written in the cells of the arbitrary chosen column to be decreased by 1. Will after final number of steps all the numbers on the board be $0$?
1993 India Regional Mathematical Olympiad, 4
Let $ABCD$ be a rectangle with $AB = a$ and $BC = b$. Suppose $r_1$ is the radius of the circle passing through $A$ and $B$ touching $CD$; and similarly $r_2$ is the radius of the circle passing through $B$ and $C$ and touching $AD$. Show that \[ r_1 + r_2 \geq \frac{5}{8} ( a + b) . \]
2005 Baltic Way, 15
Let the lines $e$ and $f$ be perpendicular and intersect each other at $H$. Let $A$ and $B$ lie on $e$ and $C$ and $D$ lie on $f$, such that all five points $A,B,C,D$ and $H$ are distinct. Let the lines $b$ and $d$ pass through $B$ and $D$ respectively, perpendicularly to $AC$; let the lines $a$ and $c$ pass through $A$ and $C$ respectively, perpendicularly to $BD$. Let $a$ and $b$ intersect at $X$ and $c$ and $d$ intersect at $Y$. Prove that $XY$ passes through $H$.
2006 ISI B.Math Entrance Exam, 5
A domino is a $2$ by $1$ rectangle . For what integers $m$ and $n$ can we cover an $m*n$ rectangle with non-overlapping dominoes???
2011 Paraguay Mathematical Olympiad, 5
In a rectangle triangle, let $I$ be its incenter and $G$ its geocenter. If $IG$ is parallel to one of the catheti and measures $10 cm$, find the lengths of the two catheti of the triangle.
1936 Moscow Mathematical Olympiad, 023
All rectangles that can be inscribed in an isosceles triangle with two of their vertices on the triangle’s base have the same perimeter. Construct the triangle.
2008 Junior Balkan Team Selection Tests - Romania, 2
Let $ m,n$ be two natural nonzero numbers and sets $ A \equal{} \{ 1,2,...,n\}, B \equal{} \{1,2,...,m\}$. We say that subset $ S$ of Cartesian product $ A \times B$ has property $ (j)$ if $ (a \minus{} x)(b \minus{} y)\le 0$ for each pairs $ (a,b),(x,y) \in S$. Prove that every set $ S$ with propery $ (j)$ has at most $ m \plus{} n \minus{} 1$ elements.
[color=#FF0000]The statement was edited, in order to reflect the actual problem asked. The sign of the inequality was inadvertently reversed into $ (a \minus{} x)(b \minus{} y)\ge 0$, and that accounts for the following two posts.[/color]
2010 Contests, 3
Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.
2003 Baltic Way, 13
In a rectangle $ABCD$ be a rectangle and $BC = 2AB$, let $E$ be the midpoint of $BC$ and $P$ an arbitrary inner point of $AD$. Let $F$ and $G$ be the feet of perpendiculars drawn correspondingly from $A$ to $BP$ and from $D$ to $CP$. Prove that the points $E,F,P,G$ are concyclic.
2012 AMC 12/AHSME, 2
A circle of radius $5$ is inscribed in a rectangle as shown. The ratio of the the length of the rectangle to its width is $2\ :\ 1$. What is the area of the rectangle?
[asy]
draw((0,0)--(0,10)--(20,10)--(20,0)--cycle);
draw(circle((10,5),5));
[/asy]
$ \textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200 $
2014 Tuymaada Olympiad, 6
Each of $n$ black squares and $n$ white squares can be obtained by a translation from each other. Every two squares of different colours have a common point. Prove that ther is a point belonging at least to $n$ squares.
[i](V. Dolnikov)[/i]
2016 Dutch IMO TST, 2
In a $2^n \times 2^n$ square with $n$ positive integer is covered with at least two non-overlapping rectangle pieces with integer dimensions and a power of two as surface. Prove that two rectangles of the covering have the same dimensions (Two rectangles have the same dimensions as they have the same width and the same height, wherein they, not allowed to be rotated.)
2007 Middle European Mathematical Olympiad, 3
Let $ k$ be a circle and $ k_{1},k_{2},k_{3},k_{4}$ four smaller circles with their centres $ O_{1},O_{2},O_{3},O_{4}$ respectively, on $ k$. For $ i \equal{} 1,2,3,4$ and $ k_{5}\equal{} k_{1}$ the circles $ k_{i}$ and $ k_{i\plus{}1}$ meet at $ A_{i}$ and $ B_{i}$ such that $ A_{i}$ lies on $ k$. The points $ O_{1},A_{1},O_{2},A_{2},O_{3},A_{3},O_{4},A_{4}$ lie in that order on $ k$ and are pairwise different.
Prove that $ B_{1}B_{2}B_{3}B_{4}$ is a rectangle.
1978 Czech and Slovak Olympiad III A, 5
Let $ABCS$ be an isosceles trapezoid. Denote $A',B',C',D'$ the incenters of triangles $BCD,CDA,$ $DAB,ABC,$ respectively. Show that $A',B',C',D'$ are vertices of a rectangle.
2018 Harvard-MIT Mathematics Tournament, 10
Let $n$ and $m$ be positive integers in the range $[1, 10^{10}]$. Let $R$ be the rectangle with corners at $(0, 0), (n, 0), (n, m), (0, m)$ in the coordinate plane. A simple non-self-intersecting quadrilateral with vertices at integer coordinates is called [i]far-reaching[/i] if each of its vertices lie on or inside $R$, but each side of $R$ contains at least one vertex of the quadrilateral. Show that there is a far-reaching quadrilateral with area at most $10^6$.
2015 Romanian Master of Mathematics, 6
Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that
$\bullet$ the sides of $T$ are parallel to the sides of $U$;
$\bullet$ the interior of $T$ contains exactly one point of $C$;
$\bullet$ the area of $T$ is at least $\mu$.
2016 Stars of Mathematics, 2
Let $ m,n\ge 2 $ and consider a rectangle formed by $ m\times n $ unit squares that are colored, either white, or either black. A [i]step[/i] is the action of selecting from it a rectangle of dimensions $ 1\times k, $ where $ k $ is an odd number smaller or equal to $ n, $ or a rectangle of dimensions $ l\times 1, $ where $ l $ is and odd number smaller than $ m, $ and coloring all the unit squares of this chosen rectangle with the color that appears the least in it.
[b]a)[/b] Show that, for any $ m,n\ge 5, $ there exists a succession of [i]steps[/i] that make the rectagle to be single-colored.
[b]b)[/b] What about $ m=n+1=5? $
1971 AMC 12/AHSME, 9
An uncrossed belt is fitted without slack around two circular pulleys with radii of $14$ inches and $4$ inches. If the distance between the points of contact of the belt with the pulleys is $24$ inches, then the distance between the centers of the pulleys in inches is
$\textbf{(A) }24\qquad\textbf{(B) }2\sqrt{119}\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad \textbf{(E) }4\sqrt{35}$
2003 All-Russian Olympiad, 4
Find the greatest natural number $N$ such that, for any arrangement of the numbers $1, 2, \ldots, 400$ in a chessboard $20 \times 20$, there exist two numbers in the same row or column, which differ by at least $N.$
1966 Miklós Schweitzer, 5
A "letter $ T$" erected at point $ A$ of the $ x$-axis in the $ xy$-plane is the union of a segment $ AB$ in the upper half-plane perpendicular to the $ x$-axis and a segment $ CD$ containing $ B$ in its interior and parallel to the $ x$-axis. Show that it is impossible to erect a letter $ T$ at every point of the $ x$-axis so that the union of those erected at rational points is disjoint from the union of those erected at irrational points.
[i]A.Csaszar[/i]
2012 Denmark MO - Mohr Contest, 2
It is known about a given rectangle that it can be divided into nine squares which are situated relative to each other as shown. The black rectangle has side length $1$. Are there more than one possibility for the side lengths of the rectangle?
[img]https://cdn.artofproblemsolving.com/attachments/1/0/af6bc5b867541c04586e4b03db0a7f97f8fe87.png[/img]
2003 Tournament Of Towns, 5
Is it possible to tile $2003 \times 2003$ board by $1 \times 2$ dominoes placed horizontally and $1 \times 3$ rectangles placed vertically?
2000 South africa National Olympiad, 6
Let $A_n$ be the number of ways to tile a $4 \times n$ rectangle using $2 \times 1$ tiles. Prove that $A_n$ is divisible by 2 if and only if $A_n$ is divisible by 3.
2004 IberoAmerican, 1
It is given a 1001*1001 board divided in 1*1 squares. We want to amrk m squares in such a way that:
1: if 2 squares are adjacent then one of them is marked.
2: if 6 squares lie consecutively in a row or column then two adjacent squares from them are marked.
Find the minimun number of squares we most mark.
2023 Israel National Olympiad, P5
Let $ABC$ be an equilateral triangle whose sides have length $1$. The midpoints of $AB,BC$ are $M,N$ respectively. Points $K,L$ were chosen on $AC$ so that $KLMN$ is a rectangle. Inside this rectangle are three semi-circles with the same radius, as in the picture (the endpoints are on the edges of the rectangle, and the arcs are tangent).
Find the minimum possible value of the radii of the semi-circles.