A square is cut into red and blue rectangles. The sum of areas of red triangles is equal to the sum of areas of the blue ones. For each blue rectangle, we write the ratio of the length of its vertical side to the length of its horizontal one and for each red rectangle, the ratio of the length of its horizontal side to the length of its vertical side. Find the smallest possible value of the sum of all the written numbers.

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Let $ ABCD $ be a rectangle of area $ S $, and $ P $ be a point inside it. We denote by $ a, b, c, d $ the distances from $ P $ to the vertices $ A, B, C, D $ respectively. Prove that $ a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2\ge 2S $. When there is equality?

Given an $ a \times b$ rectangle with $ a > b > 0,$ determine the minimum side of a square that covers the rectangle. (A square covers the rectangle if each point in the rectangle lies inside the square.)

Given real $a$. Find the least possible area of the rectangle with the sides parallel to the coordinate axes and containing the figure determined by the system of inequalities $$y \le -x^2 \,\,\, and \,\,\, y \ge x^2 - 2x + a$$

In quadrilateral $ ABCD$, it is given that $ \angle A \equal{} 120^\circ$, angles $ B$ and $ D$ are right angles, $ AB \equal{} 13$, and $ AD \equal{} 46$. Then $ AC \equal{}$ $ \textbf{(A)}\ 60 \qquad \textbf{(B)}\ 62 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 65 \qquad \textbf{(E)}\ 72$

A $5\times5$ grid of squares is filled with integers. Call a rectangle [i]corner-odd[/i] if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangles must have four distinct corners to be considered [i]corner-odd[/i]; i.e. no $1\times k$ rectangle can be [i]corner-odd[/i] for any positive integer $k$.

Of the following statements, the one that is incorrect is: $ \textbf{(A)}\ \text{Doubling the base of a given rectangle doubles the area.}$ $ \textbf{(B)}\ \text{Doubling the altitude of a triangle doubles the area.}$ $ \textbf{(C)}\ \text{Doubling the radius of a given circle doubles the area.}$ $ \textbf{(D)}\ \text{Doubling the divisor of a fraction and dividing its numerator by 2 changes the quotient.}$ $ \textbf{(E)}\ \text{Doubling a given quantity may make it less than it originally was.}$

Let $T$ be the answer to question $18$. Rectangle $ZOMR$ has $ZO = 2T$ and $ZR = T$. Point $B$ lies on segment $ZO$, $O'$ lies on segment $OM$, and $E$ lies on segment $RM$ such that $BR = BE = EO'$, and $\angle BEO' = 90^o$. Compute $2(ZO + O'M + ER)$. PS. You had better calculate it in terms of $T$.

Let $ABCD$ be a rectangle with $AB>BC$. Let points $E,F$ be on side $CD$ such that $CE=ED$ and $BC=CF$. Show that if $AC$ is prependicular to $BE$ then $AB=BF$.

Let $ABCD$ be a rectangle with $P$ lies on the segment $AC$. Denote $Q$ as a point on minor arc $PB$ of $(PAB)$ such that $QB = QC$. Denote $R$ as a point on minor arc $PD$ of $(PAD)$ such that $RC = RD$. The lines $CB$, $CD$ meet $(CQR)$ again at $M, N$ respectively. Prove that $BM = DN$. by Tran Quang Hung

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$.

A rectangular field has dimensions $120$ meters and $192$ meters. You want to divide it into equal square plots. The measure of the sides of these squares must be an integer number . In addition, you want to place a post in each corner of plot. Determine the smallest number of plots in which you can divide the land and the number of posts needed. [hide=Original wording]Un terreno de forma rectangular de 120 metros por 192 metros se quiere dividir en parcelas cuadradas iguales sin que sobre terreno. La medida de los lados de estos cuadrados debe ser un nu´mero entero. Adem´as se desea colocar un poste en cada esquina de parcela. Determinar el menor nu´mero de parcelas en que se puede dividir el terreno y el nu´mero de postes que se necesitan.[/hide]

Some squares of the infinite sheet of cross-lined paper are red. Each $2\times 3$ rectangle (of $6$ squares) contains exactly two red squares. How many red squares can be in the $9\times 11$ rectangle of $99$ squares?

A regular octagon $ ABCDEFGH$ has an area of one square unit. What is the area of the rectangle $ ABEF$? [asy]unitsize(8mm); defaultpen(linewidth(.8pt)+fontsize(6pt)); pair C=dir(22.5), B=dir(67.5), A=dir(112.5), H=dir(157.5), G=dir(202.5), F=dir(247.5), E=dir(292.5), D=dir(337.5); draw(A--B--C--D--E--F--G--H--cycle); label("$A$",A,NNW); label("$B$",B,NNE); label("$C$",C,ENE); label("$D$",D,ESE); label("$E$",E,SSE); label("$F$",F,SSW); label("$G$",G,WSW); label("$H$",H,WNW);[/asy]$ \textbf{(A)}\ 1\minus{}\frac{\sqrt2}{2} \qquad \textbf{(B)}\ \frac{\sqrt2}{4} \qquad \textbf{(C)}\ \sqrt2\minus{}1 \qquad \textbf{(D)}\ \frac12 \qquad \textbf{(E)}\ \frac{1\plus{}\sqrt2}{4}$

A rectangular piece of of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called [i]basic [/i]if (i) all four sides of the rectangle are segments of drawn line segments, and (ii) no segments of drawn lines lie inside the rectangle. Given that the total length of all lines drawn is exactly 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000.