Found problems: 1342
Let $p$ be a prime number. Prove that from a $p^2\times p^2$ array of squares, we can select $p^3$ of the squares such that the centers of any four of the selected squares are not the vertices of a rectangle with sides parallel to the edges of the array.
A circle of radius $5$ is inscribed in a rectangle as shown. The ratio of the the length of the rectangle to its width is $2\ :\ 1$. What is the area of the rectangle?
[asy]
draw((0,0)--(0,10)--(20,10)--(20,0)--cycle);
draw(circle((10,5),5));
[/asy]
$ \textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200 $
A paper rectangle $ABCD $ of area $1$ is folded along a straight line so that $C$ coincides with $A$. Prove that the area of the pentagon thus obtained is less than $3/4$.
Rectangle $ PQRS$ lies in a plane with $ PQ = RS = 2$ and $ QR = SP = 6$. The rectangle is rotated $ 90^\circ$ clockwise about $ R$, then rotated $ 90^\circ$ clockwise about the point that $ S$ moved to after the first rotation. What is the length of the path traveled by point $ P$?
${ \textbf{(A)}\ (2\sqrt3 + \sqrt5})\pi \qquad \textbf{(B)}\ 6\pi \qquad \textbf{(C)}\ (3 + \sqrt {10})\pi \qquad \textbf{(D)}\ (\sqrt3 + 2\sqrt5)\pi \\ \textbf{(E)}\ 2\sqrt {10}\pi$
A round table has radius $ 4$. Six rectangular place mats are placed on the table. Each place mat has width $ 1$ and length $ x$ as shown. They are positioned so that each mat has two corners on the edge of the table, these two corners being end points of the same side of length $ x$. Further, the mats are positioned so that the inner corners each touch an inner corner of an adjacent mat. What is $ x$?
[asy]unitsize(4mm);
defaultpen(linewidth(.8)+fontsize(8));
draw(Circle((0,0),4));
path mat=(-2.687,-1.5513)--(-2.687,1.5513)--(-3.687,1.5513)--(-3.687,-1.5513)--cycle;
draw(mat);
draw(rotate(60)*mat);
draw(rotate(120)*mat);
draw(rotate(180)*mat);
draw(rotate(240)*mat);
draw(rotate(300)*mat);
label("$x$",(-2.687,0),E);
label("$1$",(-3.187,1.5513),S);[/asy]$ \textbf{(A)}\ 2\sqrt {5} \minus{} \sqrt {3} \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ \frac {3\sqrt {7} \minus{} \sqrt {3}}{2} \qquad \textbf{(D)}\ 2\sqrt {3} \qquad \textbf{(E)}\ \frac {5 \plus{} 2\sqrt {3}}{2}$
Two tangents $AT$ and $BT$ touch a circle at $A$ and $B$, respectively, and meet perpendicularly at $T$. $Q$ is on $AT$, $S$ is on $BT$, and $R$ is on the circle, so that $QRST$ is a rectangle with $QT = 8$ and $ST = 9$. Determine the radius of the circle.
Two congruent squares, $ABCD$ and $PQRS$, have side length $15$. They overlap to form the $15$ by $25$ rectangle $AQRD$ shown. What percent of the area of rectangle $AQRD$ is shaded?
[asy]
filldraw((0,0)--(25,0)--(25,15)--(0,15)--cycle,white,black);
label("D",(0,0),S);
label("R",(25,0),S);
label("Q",(25,15),N);
label("A",(0,15),N);
filldraw((10,0)--(15,0)--(15,15)--(10,15)--cycle,mediumgrey,black);
label("S",(10,0),S);
label("C",(15,0),S);
label("B",(15,15),N);
label("P",(10,15),N);
[/asy]
$\textbf{(A)}\ 15\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 25$
The circles $S_{1}$ and $S_{2}$ intersect at $M$ and $N$.Show that if vertices $A$ and $C$ of a rectangle $ABCD$ lie on $S_{1}$ while vertices $B$ and $D$ lie on $S_{2}$,then the intersection of the diagonals of the rectangle lies on the line $MN$.
Given a regular dodecahedron of side $a$. Take two pairs of opposite faces: $E, E' $ and $F, F'$. For the pair $E, E'$ take the line joining the centers of the faces and take points $A$ and $C$ on the line each a distance $m$ outside one of the faces. Similarly, take $B$ and $D$ on the line joining the centers of $F, F'$ each a distance $m$ outside one of the faces. Show that $ABCD$ is a rectangle and find the ratio of its side lengths.
Jerry cuts a wedge from a $6$-cm cylinder of bologna as shown by the dashed curve. Which answer choice is closest to the volume of his wedge in cubic centimeters?
[asy]
defaultpen(linewidth(0.65));
real d=90-63.43494882;
draw(ellipse((origin), 2, 4));
fill((0,4)--(0,-4)--(-8,-4)--(-8,4)--cycle, white);
draw(ellipse((-4,0), 2, 4));
draw((0,4)--(-4,4));
draw((0,-4)--(-4,-4));
draw(shift(-2,0)*rotate(-d-5)*ellipse(origin, 1.82, 4.56), linetype("10 10"));
draw((-4,4)--(-8,4), dashed);
draw((-4,-4)--(-8,-4), dashed);
draw((-4,4.3)--(-4,5));
draw((0,4.3)--(0,5));
draw((-7,4)--(-7,-4), Arrows(5));
draw((-4,4.7)--(0,4.7), Arrows(5));
label("$8$ cm", (-7,0), W);
label("$6$ cm", (-2,4.7), N);[/asy]
$\textbf{(A)} 48 \qquad
\textbf{(B)} 75 \qquad
\textbf{(C)}151\qquad
\textbf{(D)}192 \qquad
\textbf{(E)}603$
Straight rod of 2 meter length is cut into $N$ sticks. The length of each piece is an integer number of centimeters. For which smallest $N$ can one guarantee that it is possible to form the contour of some rectangle, while using all sticks and not breaking them further?
(Author: A. Magazinov)
Do there exist a rectangle that can be partitioned into a regular hexagon with side length $1$, and several right triangles with side lengths $1, \sqrt3 , 2$?
An infinite set of rectangles in the Cartesian coordinate plane is given. The vertices of each of these rectangles have coordinates $(0, 0), (p, 0), (p, q), (0, q)$ for some positive integers $p, q$. Show that there must exist two among them one of which is entirely contained in the other.
A cube with side length $2$ is inscribed in a sphere. A second cube, with faces parallel to the first, is inscribed between the sphere and one face of the first cube. What is the length of a side of the smaller cube?
In the plane we have $n$ rectangles with parallel sides. The sides of distinct rectangles lie on distinct lines. The boundaries of the rectangles cut the plane into connected regions. A region is [i]nice[/i] if it has at least one of the vertices of the $n$ rectangles on the boundary. Prove that the sum of the numbers of the vertices of all nice regions is less than $40n$. (There can be nonconvex regions as well as regions with more than one boundary curve.)
With $21$ tiles, some white and some black, a $3 \times 7$ rectangle is formed. Show that there are always four tokens of the same color located at the vertices of a rectangle.
We divide up the plane into disjoint regions using a circle, a rectangle and a triangle. What is the greatest number of regions that we can get?