For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Three circles touch each other externally and all these cirlces also touch a fixed straight line. Let $A,B,C$ be the mutual points of contact of these circles. If $\omega$ denotes the Brocard angle of the triangle $ABC$, prove that $\cot{\omega}$ = 2.

Let $ABCD$ be the rectangle. Points $E$, $F$ lies on the sides $BC$ and $CD$ respectively, such that $\sphericalangle EAF = 45^{\circ}$ and $BE = DF$. Prove that area of the triangle $AEF$ is equal to the sum of the areas of the triangles $ABE$ and $ADF$.

How many non-intersecting pairs of paths we have from (0,0) to (n,n) so that path can move two ways:top or right?

$P$ is a point interior to rectangle $ABCD$ and such that $PA=3$ inches, $PD=4$ inches, and $PC=5$ inches. Then $PB$, in inches, equals: $\textbf{(A) }2\sqrt{3}\qquad\textbf{(B) }3\sqrt{2}\qquad\textbf{(C) }3\sqrt{3}\qquad\textbf{(D) }4\sqrt{2}\qquad \textbf{(E) }2$ [asy] draw((0,0)--(6.5,0)--(6.5,4.5)--(0,4.5)--cycle); draw((2.5,1.5)--(0,0)); draw((2.5,1.5)--(0,4.5)); draw((2.5,1.5)--(6.5,4.5)); draw((2.5,1.5)--(6.5,0),linetype("8 8")); label("$A$",(0,0),dir(-135)); label("$B$",(6.5,0),dir(-45)); label("$C$",(6.5,4.5),dir(45)); label("$D$",(0,4.5),dir(135)); label("$P$",(2.5,1.5),dir(-90)); label("$3$",(1.25,0.75),dir(120)); label("$4$",(1.25,3),dir(35)); label("$5$",(4.5,3),dir(120)); //Credit to bobthesmartypants for the diagram [/asy]

Two circles touch in $M$, and lie inside a rectangle $ABCD$. One of them touches the sides $AB$ and $AD$, and the other one touches $AD,BC,CD$. The radius of the second circle is four times that of the first circle. Find the ratio in which the common tangent of the circles in $M$ divides $AB$ and $CD$.

The numbers $1,2,\ldots,100$ are written in the cells of a $10\times 10$ table, each number is written once. In one move, Nazar may interchange numbers in any two cells. Prove that he may get a table where the sum of the numbers in every two adjacent (by side) cells is composite after at most $35$ such moves. [i]N. Agakhanov[/i]

Let $m$, $n$ be two positive integers greater than 3. Consider the table of size $m\times n$ ($m$ rows and $n$ columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions: $-$ each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click [url=http://www.mathlinks.ro/Forum/download.php?id=4425]here[/url] to view the pictures). In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same? a) $m=2004$, $n=2006$; b) $m=2005$, $n=2006$.

Given natural numbers $p < k < n$. On an endless checkered plane some cells are marked so that in any rectangle $(k + 1) \times n$ ($n$ cells horizontally, $k + 1$ vertically) marked exactly $p$ cells. Prove that there is a $k \times (n + 1)$ rectangle ($n + 1$ cell horizontally, $k$ - vertically), in which no less than $p + 1$ cells.

The figure below shows a polygon $ABCDEFGH$, consisting of rectangles and right triangles. When cut out and folded on the dotted lines, the polygon forms a triangular prism. Suppose that $AH = EF = 8$ and $GH = 14$. What is the volume of the prism? [asy] // djmathman diagram unitsize(1cm); defaultpen(linewidth(0.7)+fontsize(11)); real r = 2, s = 2.5, theta = 14; pair G = (0,0), F = (r,0), C = (r,s), B = (0,s), M = (C+F)/2, I = M + s/2 * dir(-theta); pair N = (B+G)/2, J = N + s/2 * dir(180+theta); pair E = F + r * dir(- 45 - theta/2), D = I+E-F; pair H = J + r * dir(135 + theta/2), A = B+H-J; draw(A--B--C--I--D--E--F--G--J--H--cycle^^rightanglemark(F,I,C)^^rightanglemark(G,J,B)); draw(J--B--G^^C--F--I,linetype ("4 4")); dot("$A$",A,N); dot("$B$",B,1.2*N); dot("$C$",C,N); dot("$D$",D,dir(0)); dot("$E$",E,S); dot("$F$",F,1.5*S); dot("$G$",G,S); dot("$H$",H,W); dot("$I$",I,NE); dot("$J$",J,1.5*S); [/asy] $\textbf{(A)} ~112\qquad\textbf{(B)} ~128\qquad\textbf{(C)} ~192\qquad\textbf{(D)} ~240\qquad\textbf{(E)} ~288\qquad$

In right triangle $ABC$ with right angle $C$, $CA=30$ and $CB=16$. Its legs $\overline{CA}$ and $\overline{CB}$ are extended beyond $A$ and $B$. Points $O_{1}$ and $O_{2}$ lie in the exterior of the triangle and are the centers of two circles with equal radii. The circle with center $O_{1}$ is tangent to the hypotenuse and to the extension of leg CA, the circle with center $O_{2}$ is tangent to the hypotenuse and to the extension of leg CB, and the circles are externally tangent to each other. The length of the radius of either circle can be expressed as $p/q$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Find all triplets $(k, m, n)$ of positive integers having the following property: Square with side length $m$ can be divided into several rectangles of size $1\times k$ and a square with side length $n$.

$M$ is an interior point of a rectangle $ABCD$ and $S$ is its area. Prove that $S \le AM \cdot CM + BM \cdot DM$. (I.J . Goldsheyd)

In how many ways can we place the numbers from $1$ to $100$ in a $2\times 50$ rectangle (divided into $100$ unit squares) so that any two consecutive numbers are always placed in squares with a common side?

Let $ABC$ be a triangle such that $CA \neq CB$, the points $A_{1}$ and $B_{1}$ are tangency points for the ex-circles relative to sides $CB$ and $CA$, respectively, and $I$ the incircle. The line $CI$ intersects the cincumcircle of the triangle $ABC$ in the point $P$. The line that trough $P$ that is perpendicular to $CP$, intersects the line $AB$ in $Q$. Prove that the lines $QI$ and $A_{1}B_{1}$ are parallels.

The bases of a trapezoid have lengths 10 and 21, and the legs have lengths $\sqrt{34}$ and $3 \sqrt{5}$. What is the area of the trapezoid?

A circle of radius 1 is randomly placed in a 15-by-36 rectangle $ABCD$ so that the circle lies completely within the rectangle. Given that the probability that the circle will not touch diagonal $AC$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $C_1$ and $C_2$ be two tangent unit circles inside a circle $C$ of radius $2$. Circle $C_3$ inside $C$ is tangent to the circles $C,C_1,C_2$, and circle $C_4$ inside $C$ is tangent to $C,C_1,C_3$. Prove that the centers of $C,C_1,C_3$ and $C_4$ are vertices of a rectangle.

Inside the rectangle $ABCD$ is taken a point $M$ such that $\angle BMC + \angle AMD = 180^o$. Determine the sum of the angles $BCM$ and $DAM$.

Let $ABCD$ be a rectangle. A line $r$ moves parallel to $AB$ and intersects diagonal $AC$ , forming two triangles opposite the vertex, inside the rectangle. Prove that the sum of the areas of these triangles is minimal when $r$ passes through the midpoint of segment $AD$ .

Let $a, b, c, d$ be the lengths of the sides of a quadrilateral circumscribed about a circle and let $S$ be its area. Prove that $S \leq \sqrt{abcd}$ and find conditions for equality.

The incircle of triangle $ABC$ touches the sides $BC,CA,AB$ at the points $D,E,F$, respectively. Let $K$ be a point on the side $BC$ and let $M$ be the point on the line segment $AK$ such that $AM=AE=AF$. Denote by $L,N$ the incenters of triangles $ABK,ACK$, respectively. Prove that $K$ is the foot of the altitude from $A$ if and only if $DLMN$ is a square. [hide="Remark"]This problem is slightly connected to [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=344774#p344774]GMB-IMAR 2005, Juniors, Problem 2[/url] [/hide] [i]Bogdan Enescu[/i]

Annie drew a rectangle and partitioned it into $n$ rows and $k$ columns with horizontal and vertical lines. Annie knows the area of the resulting $n \cdot k$ little rectangles while Benny does not. Annie reveals the area of some of these small rectangles to Benny. Given $n$ and $k$ at least how many of the small rectangle’s areas did Annie have to reveal, if from the given information Benny can determine the areas of all the $n \cdot k$ little rectangles? For example in the case $n = 3$ and $k = 4$ revealing the areas of the $10$ small rectangles if enough information to find the areas of the remaining two little rectangles. [img]https://cdn.artofproblemsolving.com/attachments/b/1/c4b6e0ab6ba50068ced09d2a6fe51e24dd096a.png[/img]

In rectangle $ABCD$, $AB=6$ and $AD=8$. Point $M$ is the midpoint of $\overline{AD}$. What is the area of $\triangle AMC$? $\textbf{(A) }12\qquad\textbf{(B) }15\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad \textbf{(E) }24$

Let $ABCD$ be a rectangle with $AB \ne BC$ and the center the point $O$. Perpendicular from $O$ on $BD$ intersects lines $AB$ and $BC$ in points $E$ and $F$ respectively. Points $M$ and $N$ are midpoints of segments $[CD]$ and $[AD]$ respectively. Prove that $FM \perp EN$ .