Tracey baked a square cake whose surface is dissected in a $ 10 \times 10$ grid. In some of the fields she wants to put a strawberry such that for each four fields that compose a rectangle whose edges run in parallel to the edges of the cake boundary there is at least one strawberry. What is the minimum number of required strawberries?

Prove the inequality for all positive integer $n$ : \[ \left(\frac{2n-1}{e}\right)^{\frac{2n-1}{2}}<1\cdot 3\cdot 5\cdots (2n-1)<\left(\frac{2n+1}{e}\right)^{\frac{2n+1}{2}} \]

We call a tiling of an $m\times$ n rectangle with arabos (see figure below) [i]regular[/i] if there is no sub-rectangle which is tiled with arabos. Prove that if for some $m$ and $n$ there exists a [i]regular[/i] tiling of the $m\times n$ rectangle then there exists a [i]regular[/i] tiling also for the $2m \times 2n$ rectangle. [img]https://cdn.artofproblemsolving.com/attachments/1/1/2ab41cc5107a21760392253ed52d9e4ecb22d1.png[/img]

Given is an acute angled triangle $ \triangle ABC$ with side lengths $ a$, $ b$ and $ c$ (in an usual way) and circumcenter $ O$. Angle bisector of angle $ \angle BAC$ intersects circumcircle at points $ A$ and $ A_{1}$. Let $ D$ be projection of point $ A_{1}$ onto line $ AB$, $ L$ and $ M$ be midpoints of $ AC$ and $ AB$ , respectively. (i) Prove that $ AD\equal{}\frac{1}{2}(b\plus{}c)$ (ii) If triangle $ \triangle ABC$ is an acute angled prove that $ A_{1}D\equal{}OM\plus{}OL$

In the coordinate plane a rectangle with vertices $ (0, 0),$ $ (m, 0),$ $ (0, n),$ $ (m, n)$ is given where both $ m$ and $ n$ are odd integers. The rectangle is partitioned into triangles in such a way that [i](i)[/i] each triangle in the partition has at least one side (to be called a “good” side) that lies on a line of the form $ x \equal{} j$ or $ y \equal{} k,$ where $ j$ and $ k$ are integers, and the altitude on this side has length 1; [i](ii)[/i] each “bad” side (i.e., a side of any triangle in the partition that is not a “good” one) is a common side of two triangles in the partition. Prove that there exist at least two triangles in the partition each of which has two good sides.

A rectangle with perimeter $ 176$ is divided into five congruent rectangles as shown in the diagram. What is the perimeter of one of the five congruent rectangles? [asy]defaultpen(linewidth(.8pt)); draw(origin--(0,3)--(4,3)--(4,0)--cycle); draw((0,1)--(4,1)); draw((2,0)--midpoint((0,1)--(4,1))); real r = 4/3; draw((r,3)--foot((r,3),(0,1),(4,1))); draw((2r,3)--foot((2r,3),(0,1),(4,1)));[/asy]$ \textbf{(A)}\ 35.2\qquad \textbf{(B)}\ 76\qquad \textbf{(C)}\ 80\qquad \textbf{(D)}\ 84\qquad \textbf{(E)}\ 86$

Points $E$ and $F$ lie inside rectangle $ABCD$ with $AE=DE=BF=CF=EF$. If $AB=11$ and $BC=8$, find the area of the quadrilateral $AEFB$.

$ABCD$ is a quadrilateral with right angles at $A$ and $C$. Points $E$ and $F$ are on $AC$, and $DE$ and $BF$ are perpendicular to $AC$. If $AE=3$, $DE=5$, and $CE=7$, then $BF=$ [asy] draw((0,0)--(10,0)--(3,-5)--(0,0)--(6.5,3)--(10,0)); draw((6.5,0)--(6.5,3)); draw((3,0)--(3,-5)); dot((0,0)); dot((10,0)); dot((3,0)); dot((3,-5)); dot((6.5,0)); dot((6.5,3)); label("A", (0,0), W); label("B", (6.5,3), N); label("C", (10,0), E); label("D", (3,-5), S); label("E", (3,0), N); label("F", (6.5,0), S);[/asy] $\text{(A)} \ 3.6 \qquad \text{(B)} \ 4 \qquad \text{(C)} \ 4.2 \qquad \text{(D)} \ 4.5 \qquad \text{(E)} \ 5$

A cylindrical oil tank, lying horizontally, has an interior length of $ 10$ feet and an interior diameter of $ 6$ feet. If the rectangular surface of the oil has an area of $ 40$ square feet, the depth of the oil is: $ \textbf{(A)}\ \sqrt{5} \qquad \textbf{(B)}\ 2\sqrt{5} \qquad \textbf{(C)}\ 3\minus{}\sqrt{5} \qquad \textbf{(D)}\ 3\plus{}\sqrt{5} \\ \textbf{(E)}\ \text{either }3\minus{}\sqrt{5}\text{ or }3\plus{}\sqrt{5}$

Let $n$ be an integer greater than $1$. For a positive integer $m$, let $S_{m}= \{ 1,2,\ldots, mn\}$. Suppose that there exists a $2n$-element set $T$ such that (a) each element of $T$ is an $m$-element subset of $S_{m}$; (b) each pair of elements of $T$ shares at most one common element; and (c) each element of $S_{m}$ is contained in exactly two elements of $T$. Determine the maximum possible value of $m$ in terms of $n$.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

The triangle $ \triangle SFA$ has a right angle at $ F$. The points $ P$ and $ Q$ lie on the line $ SF$ such that the point $ P$ lies between $ S$ and $ F$ and the point $ F$ is the midpoint of the segment $ [PQ]$. The circle $ k_1$ is th incircle of the triangle $ \triangle SPA$. The circle $ k_2$ lies outside the triangle $ \triangle SQA$ and touches the segment $ [QA]$ and the lines $ SQ$ and $ SA$. Prove that the sum of the radii of the circles $ k_1$ and $ k_2$ equals the length of $ [FA]$.

Carl has a rectangle whose side lengths are positive integers. This rectangle has the property that when he increases the width by 1 unit and decreases the length by 1 unit, the area increases by $x$ square units. What is the smallest possible positive value of $x$? [i]Proposed by Ray Li[/i]

[b]a)[/b] Show that if four distinct complex numbers have the same absolute value and their sum vanishes, then they represent a rectangle. [b]b)[/b] Let $ x,y,z,t $ be four real numbers, and $ k $ be an integer. Prove the following implication: $$ \sum_{j\in\{ x,y,z,t\}} \sin j = 0 = \sum_{j\in\{ x,y,z,t\}} \cos j\implies \sum_{j\in\{ x,y,z,t\}} \sin (1+2n)j. $$

$f(n)$ is the least number that there exist a $f(n)-$mino that contains every $n-$mino. Prove that $10000\leq f(1384)\leq960000$. Find some bound for $f(n)$

A rectangle is divided into $2\times 1$ and $1\times 2$ dominoes. In each domino, a diagonal is drawn, and no two diagonals have common endpoints. Prove that exactly two corners of the rectangle are endpoints of these diagonals.

We consider a game on an infinite chessboard similar to that of solitaire: If two adjacent fields are occupied by pawns and the next field is empty (the three fields lie on a vertical or horizontal line), then we may remove these two pawns and put one of them on the third field. Prove that if in the initial position pawns fill a $3k \times n$ rectangle, then it is impossible to reach a position with only one pawn on the board.

Two circles of equal radius intersect at two distinct points $A$ and $B$. Let their radii $r$ and their midpoints respectively be $O_1$ and $O_2$. Find the greatest possible value of the area of the rectangle $O_1AO_2B$.

Does the bellow depicted figure fit into a square $5\times5$.

A triangle $ABC$ is inscribed in a rectangle $APQR$ so that points $B$ and $C$ lie on segments $PQ$ and $QR$, respectively. If $\alpha,\beta,\gamma$ are the angles of the triangle, prove that $$\cot\alpha\cdot S_{BCQ}=\cot\beta\cdot S_{ACR}+\cot\gamma\cdot S_{ABP}.$$

In a square $ABCD$, $E$ is a point on diagonal $BD$. $P$ and $Q$ are the circumcentres of $\triangle ABE$ and $\triangle ADE$ respectively. Prove that $APEQ$ is a square.

Let $ ABCD$ be a trapezoid with $ AB\parallel{}CD$, $ AB\equal{}11$, $ BC\equal{}5$, $ CD\equal{}19$, and $ DA\equal{}7$. Bisectors of $ \angle A$ and $ \angle D$ meet at $ P$, and bisectors of $ \angle B$ and $ \angle C$ meet at $ Q$. What is the area of hexagon $ ABQCDP$? $ \textbf{(A)}\ 28\sqrt{3}\qquad \textbf{(B)}\ 30\sqrt{3}\qquad \textbf{(C)}\ 32\sqrt{3}\qquad \textbf{(D)}\ 35\sqrt{3}\qquad \textbf{(E)}\ 36\sqrt{3}$

We build a tower of $2\times 1$ dominoes in the following way. First, we place $55$ dominoes on the table such that they cover a $10\times 11$ rectangle; this is the first story of the tower. We then build every new level with $55$ domioes above the exact same $10\times 11$ rectangle. The tower is called [i]stable[/i] if for every non-lattice point of the $10\times 11$ rectangle, we can find a domino that has an inner point above it. How many stories is the lowest [i]stable[/i] tower?

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

Let $ O$ be the circumcenter of an acute triangle $ ABC$ and let $ k$ be the circle with center $ P$ that is tangent to $ O$ at $ A$ and tangent to side $ BC$ at $ D$. Circle $ k$ meets $ AB$ and $ AC$ again at $ E$ and $ F$ respectively. The lines $ OP$ and $ EP$ meet $ k$ again at $ I$ and $ G$. Lines $ BO$ and $ IG$ intersect at $ H$. Prove that $ \frac{{DF}^2}{AF}\equal{}GH$.