Amy has divided a square into finitely many white and red rectangles, each with sides parallel to the sides of the square. Within each white rectangle, she writes down its width divided by its height. Within each red rectangle, she writes down its height divided by its width. Finally, she calculates $x$, the sum of these numbers. If the total area of white equals the total area of red, determine the minimum of $x$.

Every point of the rectangle $R=[0,4] \times [0,40]$ is coloured using one of four colours. Show that there exist four points in $R$ with the same colour that form a rectangle having integer side lengths.

For a regular $n$-gon, let $M$ be the set of the lengths of the segments joining its vertices. Show that the sum of the squares of the elements of $M$ is greater than twice the area of the polygon.

Let $P$ and $Q$ be the midpoints of the sides $BC$ and $CD$, respectively in a rectangle $ABCD$. Let $K$ and $M$ be the intersections of the line $PD$ with the lines $QB$ and $QA$, respectively, and let $N$ be the intersection of the lines $PA$ and $QB$. Let $X$, $Y$ and $Z$ be the midpoints of the segments $AN$, $KN$ and $AM$, respectively. Let $\ell_1$ be the line passing through $X$ and perpendicular to $MK$, $\ell_2$ be the line passing through $Y$ and perpendicular to $AM$ and $\ell_3$ the line passing through $Z$ and perpendicular to $KN$. Prove that the lines $\ell_1$, $\ell_2$ and $\ell_3$ are concurrent.

A 2 x 3 rectangle and a 3 x 4 rectangle are contained within a square without overlapping at any interior point, and the sides of the square are parallel to the sides of the two given rectangles. What is the smallest possible area of the square? $ \textbf{(A) } 16 \qquad \textbf{(B) } 25 \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 49 \qquad \textbf{(E) } 64$

Given is trapezoid $ABCD$, $M$ and $N$ being the midpoints of the bases of $AD$ and $BC$, respectively. a) Prove that the trapezoid is isosceles if it is known that the intersection point of perpendicular bisectors of the lateral sides belongs to the segment $MN$. b) Does the statement of point a) remain true if it is only known that the intersection point of perpendicular bisectors of the lateral sides belongs to the line $MN$?

If $R$ and $S$ are two rectangles with integer sides such that the perimeter of $R$ equals the area of $S$ and the perimeter of $S$ equals the area of $R$, then we call $R$ and $S$ a friendly pair of rectangles. Find all friendly pairs of rectangles.

Let $ A_1,A_2,...,A_{2002}$ be arbitrary points in the plane. Prove that for every circle of radius $ 1$ and for every rectangle inscribed in this circle, there exist $3$ vertices $ M,N,P$ of the rectangle such that $ MA_1 + MA_2 + \cdots + MA_{2002} + $ $NA_1 + NA_2 + \cdots + NA_{2002} + $ $PA_1 + PA_2 + \cdots + PA_{2002}\ge 6006$.

On the sides $AD$ and $BC$ of a rectangle $ABCD$ select points $M, N$ and $P, Q$ respectively such that $AM = MN = ND = BP = PQ = QC$. On segment $QC$ selected point $X$, different from the ends of the segment. Prove that the perimeter of $\vartriangle ANX$ is more than the perimeter of $\vartriangle MDX$.

The points of intersection of $ xy \equal{} 12$ and $ x^2 \plus{} y^2 \equal{} 25$ are joined in succession. The resulting figure is: $ \textbf{(A)}\ \text{a straight line} \qquad\textbf{(B)}\ \text{an equilateral triangle} \qquad\textbf{(C)}\ \text{a parallelogram}$ $ \textbf{(D)}\ \text{a rectangle} \qquad\textbf{(E)}\ \text{a square}$

Rectangle $ABCD$ has $AB=6$ and $BC=3$. Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$. What is the degree measure of $\angle AMD$? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 60 \qquad \textbf{(E)}\ 75 $

There are $n$ rectangles drawn on the rectangular sheet of paper with the sides of the rectangles parallel to the sheet sides. The rectangles do not have pairwise common interior points. Prove that after cutting out the rectangles the sheet will split into not more than $n+1$ part.

Let $f:[0,1]\to\mathbb{R}$ be a continuous function and let $\{a_n\}_n$, $\{b_n\}_n$ be sequences of reals such that \[ \lim_{n\to\infty} \int^1_0 | f(x) - a_nx - b_n | dx = 0 . \] Prove that: a) The sequences $\{a_n\}_n$, $\{b_n\}_n$ are convergent; b) The function $f$ is linear.

In a multiplication table, the entry in the $i$-th row and the $j$-th column is the product $ij$ From an $m\times n$ subtable with both $m$ and $n$ odd, the interior $(m-2) (n-2)$ rectangle is removed, leaving behind a frame of width $1$. The squares of the frame are painted alternately black and white. Prove that the sum of the numbers in the black squares is equal to the sum of the numbers in the white squares.

The columns and the row of a $3n \times 3n$ square board are numbered $1,2,\ldots ,3n$. Every square $(x,y)$ with $1 \leq x,y \leq 3n$ is colored asparagus, byzantium or citrine according as the modulo $3$ remainder of $x+y$ is $0,1$ or $2$ respectively. One token colored asparagus, byzantium or citrine is placed on each square, so that there are $3n^2$ tokens of each color. Suppose that one can permute the tokens so that each token is moved to a distance of at most $d$ from its original position, each asparagus token replaces a byzantium token, each byzantium token replaces a citrine token, and each citrine token replaces an asparagus token. Prove that it is possible to permute the tokens so that each token is moved to a distance of at most $d+2$ from its original position, and each square contains a token with the same color as the square.

Prove that one can cut $a \times b$ rectangle, $\frac{b}{2} < a < b$, into three pieces and rearrange them into a square (without overlaps and holes).

An angle is given in a plane. Using only a compass, one must find out $(a)$ if this angle is acute. Find the minimal number of circles one must draw to be sure. $(b)$ if this angle equals $31^{\circ}$.(One may draw as many circles as one needs).

Square $ABCD$ is divided into four rectangles by $EF$ and $GH$. $EF$ is parallel to $AB$ and $GH$ parallel to $BC$. $\angle BAF = 18^\circ$. $EF$ and $GH$ meet at point $P$. The area of rectangle $PFCH$ is twice that of rectangle $AGPE$. Given that the value of $\angle FAH$ in degrees is $x$, find the nearest integer to $x$. [asy] size(100); defaultpen(linewidth(0.7)+fontsize(10)); pair D2(pair P) { dot(P,linewidth(3)); return P; } // NOTE: I've tampered with the angles to make the diagram not-to-scale. The correct numbers should be 72 instead of 76, and 45 instead of 55. pair A=(0,1), B=(0,0), C=(1,0), D=(1,1), F=intersectionpoints(A--A+2*dir(-76),B--C)[0], H=intersectionpoints(A--A+2*dir(-76+55),D--C)[0], E=F+(0,1), G=H-(1,0), P=intersectionpoints(E--F,G--H)[0]; draw(A--B--C--D--cycle); draw(F--A--H); draw(E--F); draw(G--H); label("$A$",D2(A),NW); label("$B$",D2(B),SW); label("$C$",D2(C),SE); label("$D$",D2(D),NE); label("$E$",D2(E),plain.N); label("$F$",D2(F),S); label("$G$",D2(G),W); label("$H$",D2(H),plain.E); label("$P$",D2(P),SE); [/asy]

Show that it is possible to cut any triangle into several pieces, so that a rectangle is formed when they are joined together.

A figure $\Phi$ composed of unit squares has the following property: if the squares of an $m \times n$ rectangle ($m,n$ are fixed) are filled with numbers whose sum is positive, the figure $\Phi$ can be placed within the rectangle (possibly after being rotated) so that the sum of the covered numbers is also positive. Prove that a number of such figures can be put on the $m\times n$ rectangle so that each square is covered by the same number of figures.

Let the $JHIZ$ be a rectangle and let $A$ and $C$ be points on the sides $ZI$ and $ZJ$, respectively. The perpendicular from $A$ on $CH$ intersects line $HI$ at point $X$ and perpendicular from $C$ on $AH$ intersects line $HJ$ at point $Y$. Show that points $X, Y$, and $Z$ are collinear.

Consider the $2\times3$ rectangle below. We fill in the small squares with the numbers $1,2,3,4,5,6$ (one per square). Define a [i]tasty[/i] filling to be one such that each row is [b]not[/b] in numerical order from left to right and each column is [b]not[/b] in numerical order from top to bottom. If the probability that a randomly selected filling is tasty is $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, what is $m+n$? \begin{tabular}{|c|c|c|c|} \hline & & \\ \hline & & \\ \hline \end{tabular} [i]2016 CCA Math Bonanza Lightning #4.2[/i]

What is the largest number of squares on $9 \times 9$ square board that can be cut along their both diagonals so that the board does not fall apart into several pieces?

Determine all integers $m$, for which it is possible to dissect the square $m\times m$ into five rectangles, with the side lengths being the integers $1, 2, … ,10$ in some order.

Into each box of a $ 2012 \times 2012 $ square grid, a real number greater than or equal to $ 0 $ and less than or equal to $ 1 $ is inserted. Consider splitting the grid into $2$ non-empty rectangles consisting of boxes of the grid by drawing a line parallel either to the horizontal or the vertical side of the grid. Suppose that for at least one of the resulting rectangles the sum of the numbers in the boxes within the rectangle is less than or equal to $ 1 $, no matter how the grid is split into $2$ such rectangles. Determine the maximum possible value for the sum of all the $ 2012 \times 2012 $ numbers inserted into the boxes.