A $100\times \sqrt{3}$ rectangular table is given. What is the minimum number of disk-shaped napkins of radius $1$ required to cover the table completely? [i]Remark:[/i] The napkins are allowed to overlap and protrude the table's edges.

Jackson's paintbrush makes a narrow strip that is $6.5$ mm wide. Jackson has enough paint to make a strip of 25 meters. How much can he paint, in $\text{cm}^2$? $\textbf{(A) }162{,}500\qquad\textbf{(B) }162.5\qquad\textbf{(C) }1{,}625\qquad\textbf{(D) }1{,}625{,}000\qquad\textbf{(E) }16{,}250$

A cube-shaped container has vertices $A$, $B$, $C$, and $D$ where $\overline{AB}$ and $\overline{CD}$ are parallel edges of the cube, and $\overline{AC}$ and $\overline{BD}$ are diagonals of the faces of the cube. Vertex $A$ of the cube is set on a horizontal plane $\mathcal P$ so that the plane of the rectangle $ABCD$ is perpendicular to $\mathcal P$, vertex $B$ is $2$ meters above $\mathcal P$, vertex $C$ is $8$ meters above $\mathcal P$, and vertex $D$ is $10$ meters above $\mathcal P$. The cube contains water whose surface is $7$ meters above $\mathcal P$. The volume of the water is $\tfrac mn$ cubic meters, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(250); defaultpen(linewidth(0.6)); pair A = origin, B = (6,3), X = rotate(40)*B, Y = rotate(70)*X, C = X+Y, Z = X+B, D = B+C, W = B+Y; pair P1 = 0.8*C+0.2*Y, P2 = 2/3*C+1/3*X, P3 = 0.2*D+0.8*Z, P4 = 0.63*D+0.37*W; pair E = (-20,6), F = (-6,-5), G = (18,-2), H = (9,8); filldraw(E--F--G--H--cycle,rgb(0.98,0.98,0.2)); fill(A--Y--P1--P4--P3--Z--B--cycle,rgb(0.35,0.7,0.9)); draw(A--B--Z--X--A--Y--C--X^^C--D--Z); draw(P1--P2--P3--P4--cycle^^D--P4); dot("$A$",A,S); dot("$B$",B,S); dot("$C$",C,N); dot("$D$",D,N); label("$\mathcal P$",(-13,4.5)); [/asy]

The function $F$ is a one-to-one transformation of the plane into itself that maps rectangles into rectangles (rectangles are closed; continuity is not assumed). Prove that $F$ maps squares into squares.

Let $ABC$ be an acute triangle. Find the locus of the centers of the rectangles which have their vertices on the sides of $ABC$.

Consider a $5\times 5$ grid with $25$ cells. What is the least number of cells that should be colored, such that every $2\times 3$ or $3\times 2$ rectangle in the grid has at least two colored cells?

Does there exist a rectangle which can be dissected into $15$ congruent polygons which are not rectangles? Can a square be dissected into $15$ congruent polygons which are not rectangles?

A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary. [i]Author: Kei Irie, Japan[/i]

Consider two polygons $ P$ and $ Q$. We want to cut $ P$ into some smaller polygons and put them together in such a way to obtain $ Q$. We can translate the pieces but we can not rotate them or reflect them. We call $ P,Q$ equivalent if and only if we can obtain $ Q$ from $ P$(which is obviously an equivalence relation). [img]http://i3.tinypic.com/4lrb43k.png[/img] a) Let $ P,Q$ be two rectangles with the same area(their sides are not necessarily parallel). Prove that $ P$ and $ Q$ are equivalent. b) Prove that if two triangles are not translation of each other, they are not equivalent. c) Find a necessary and sufficient condition for polygons $ P,Q$ to be equivalent.

Two vertices of the rectangle are located on side $BC$ of triangle $ABC$, and the other two are on sides $AB$ and $AC$. It is known that the midpoint of the altitude of this triangle, drawn on the side $BC$, lies on one of the diagonals of the rectangle, and the side of the rectangle located on $BC$ is three times less than $BC$. In what ratio does the altitude of the triangle divide the side $BC$ ?

Rectangle $ABCD$ has sides $AB = 3$, $BC = 2$. Point $ P$ lies on side $AB$ is such that the bisector of the angle $CDP$ passes through the midpoint $M$ of $BC$. Find $BP$.

Let $A=(a_{jk})$ be a $10\times 10$ array of positive real numbers such that the sum of numbers in row as well as in each column is $1$. Show that there exists $j<k$ and $l<m$ such that \[a_{jl}a_{km}+a_{jm}a_{kl}\ge \frac{1}{50}\]

Let $ABC$ be a triangle with incenter $I$, and suppose the incircle is tangent to $CA$ and $AB$ at $E$ and $F$. Denote by $G$ and $H$ the reflections of $E$ and $F$ over $I$. Let $Q$ be the intersection of $BC$ with $GH$, and let $M$ be the midpoint of $BC$. Prove that $IQ$ and $IM$ are perpendicular.

The $ 8\times 18$ rectangle $ ABCD$ is cut into two congruent hexagons, as shown, in such a way that the two hexagons can be repositioned without overlap to form a square. What is $ y$? [asy] unitsize(2mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; draw((0,4)--(18,4)--(18,-4)--(0,-4)--cycle); draw((6,4)--(6,0)--(12,0)--(12,-4)); label("$D$",(0,4),NW); label("$C$",(18,4),NE); label("$B$",(18,-4),SE); label("$A$",(0,-4),SW); label("$y$",(9,1)); [/asy]$ \textbf{(A) } 6\qquad \textbf{(B) } 7\qquad \textbf{(C) } 8\qquad \textbf{(D) } 9\qquad \textbf{(E) } 10$

Find the least number $A$ such that for any two squares of combined area $1$, a rectangle of area $A$ exists such that the two squares can be packed in the rectangle (without the interiors of the squares overlapping) . You may assume the sides of the squares will be parallel to the sides of the rectangle.