Found problems: 1342
We build a tower of $2\times 1$ dominoes in the following way. First, we place $55$ dominoes on the table such that they cover a $10\times 11$ rectangle; this is the first story of the tower. We then build every new level with $55$ domioes above the exact same $10\times 11$ rectangle. The tower is called [i]stable[/i] if for every non-lattice point of the $10\times 11$ rectangle, we can find a domino that has an inner point above it. How many stories is the lowest [i]stable[/i] tower?
A ball was launched on a rectangular billiard table at an angle of $45^o$ to one of the sides. Reflected from all sides (the angle of incidence is equal to the angle of reflection), he returned to his original position . It is known that one of the sides of the table has a length of one meter. Find the length of the second side.
[img]https://cdn.artofproblemsolving.com/attachments/3/d/e0310ea910c7e3272396cd034421d1f3e88228.png[/img]
Rose fills each of the rectangular regions of her rectangular flower bed with a different type of flower. The lengths, in feet, of the rectangular regions in her flower bed are as shown in the figure. She plants one flower per square foot in each region. Asters cost $ \$$1 each, begonias $ \$$1.50 each, cannas $ \$$2 each, dahlias $ \$$2.50 each, and Easter lilies $ \$$3 each. What is the least possible cost, in dollars, for her garden?
[asy]unitsize(5mm);
defaultpen(linewidth(.8pt)+fontsize(8pt));
draw((6,0)--(0,0)--(0,1)--(6,1));
draw((0,1)--(0,6)--(4,6)--(4,1));
draw((4,6)--(11,6)--(11,3)--(4,3));
draw((11,3)--(11,0)--(6,0)--(6,3));
label("1",(0,0.5),W);
label("5",(0,3.5),W);
label("3",(11,1.5),E);
label("3",(11,4.5),E);
label("4",(2,6),N);
label("7",(7.5,6),N);
label("6",(3,0),S);
label("5",(8.5,0),S);[/asy]$ \textbf{(A)}\ 108 \qquad
\textbf{(B)}\ 115 \qquad
\textbf{(C)}\ 132 \qquad
\textbf{(D)}\ 144 \qquad
\textbf{(E)}\ 156$
Given a convex figure in the Cartesian plane that is symmetric with respect of both axis, we construct a rectangle $A$ inside it with maximum area (over all posible rectangles). Then we enlarge it with center in the center of the rectangle and ratio lamda such that is covers the convex figure. Find the smallest lamda such that it works for all convex figures.
Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$?
[asy]
size(250);defaultpen(linewidth(0.8));
pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=tangent(X, P, 4, 2);
pair top=X+15*dir(X--A), bottom=X+15*dir(X--B);
draw(Circle(O, 2)^^Circle(P, 4));
draw(bottom--X--top);
draw(A--O--B^^O--P^^D--P--C);
pair point=X;
label("$2$", midpoint(O--A), dir(point--midpoint(O--A)));
label("$4$", midpoint(P--D), dir(point--midpoint(P--D)));
label("$O$", O, SE);
label("$P$", P, dir(point--P));
pair point=O;
label("$A$", A, dir(point--A));
label("$B$", B, dir(point--B));
pair point=P;
label("$C$", C, dir(point--C));
label("$D$", D, dir(point--D));
fill((-3,7)--(-3,-7)--(-7,-7)--(-7,7)--cycle, white);[/asy]
$ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$
Rectangle $ ABCD$ has $ AB\equal{}8$ and $ BC\equal{}6$. Point $ M$ is the midpoint of diagonal $ \overline{AC}$, and E is on $ \overline{AB}$ with $ \overline{ME}\perp\overline{AC}$. What is the area of $ \triangle AME$?
$ \textbf{(A)}\ \frac{65}{8} \qquad
\textbf{(B)}\ \frac{25}{3} \qquad
\textbf{(C)}\ 9 \qquad
\textbf{(D)}\ \frac{75}{8} \qquad
\textbf{(E)}\ \frac{85}{8}$
A rectangle is said to be inscribed in a parallelogram if its vertices lie one on each side of the parallelogram. On the larger side $AB$ of the parallelogram $ABCD$, find all those points $K$ that are the vertices of the rectangles inscribed in $ABCD$.
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 a rectangle with sidelengths 3 and 4, pick an arbitrary inner point on each side of this rectangle. Let $x, y, z$ and $u$ denote the side lengths of the quadrilateral spanned by these four points. Prove that $25 \leq x^2+y^2+z^2+u^2 \leq 50$.
A rectangle $ABCD$ has side lengths $AB = m$, $AD = n$, with $m$ and $n$ relatively prime and both odd. It is divided into unit squares and the diagonal AC intersects the sides of the unit squares at the points $A_1 = A, A_2, A_3, \ldots , A_k = C$. Show that \[ A_1A_2 - A_2A_3 + A_3A_4 - \cdots + A_{k-1}A_k = {\sqrt{m^2+n^2}\over mn}. \]
On a rectangular piece of paper there are
(a) several marked points all on one straight line,
(b) three marked points (not necessarily on a straight line).
We are allowed to fold the paper several times along a straight line not containing marked points and then puncture the folded paper with a needle. Show that this can be done so that after the paper has been unfolded all the marked points are punctured and there are no extra holes.
(A Shapovalov)
$S_{1}$ and $S_{2}$ are two circles that intersect at distinct points $P$ and $Q$. $\ell_{1}$ and $\ell_{2}$ are two parallel lines through $P$ and $Q$. $\ell_{1}$ intersects $S_{1}$ and $S_{2}$ at points $A_{1}$ and $A_{2}$, different from $P$, respectively. $\ell_{2}$ intersects $S_{1}$ and $S_{2}$ at points $B_{1}$ and $B_{2}$, different from $Q$, respectively. Show that the perimeters of the triangles $A_{1}QA_{2}$ and $B_{1}PB_{2}$ are equal.
Dirock has a very neat rectangular backyard that can be represented as a $32\times 32$ grid of unit squares. The rows and columns are each numbered $1,2,\ldots, 32$. Dirock is very fond of rocks, and places a rock in every grid square whose row and column number are both divisible by $3$. Dirock would like to build a rectangular fence with vertices at the centers of grid squares and sides parallel to the sides of the yard such that
[list] [*] The fence does not pass through any grid squares containing rocks; [*] The interior of the fence contains exactly 5 rocks. [/list]
In how many ways can this be done?
[i]Ray Li[/i]
Let $ABCD$ be a square, and let $E$ and $F$ be points on $\overline{AB}$ and $\overline{BC}$, respectively. The line through $E$ parallel to $\overline{BC}$ and the line through $F$ parallel to $\overline{AB}$ divide $ABCD$ into two squares and two non square rectangles. The sum of the areas of the two squares is $\frac{9}{10}$ of the area of square $ABCD$. Find $\frac{AE}{EB} + \frac{EB}{AE}$.
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$ .
Four circles in a plane have a common center. Their radii form a strictly increasing arithmetic progression. Prove that there is no square with each vertex lying on a different circle.
In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$, $ n\in\mathbb{Z}$ and color each strip black or white. Prove that any rectangle which is not a square can be placed in the plane so that its vertices have the same color.
[b]IMO Shortlist 2007 Problem C5 as it appears in the official booklet:[/b]
In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$ for every integer $ n.$ Assume each strip $ S_n$ is colored either red or blue, and let $ a$ and $ b$ be two distinct positive integers. Prove that there exists a rectangle with side length $ a$ and $ b$ such that its vertices have the same color.
([i]Edited by Orlando Döhring[/i])
[i]Author: Radu Gologan and Dan Schwarz, Romania[/i]
Sebastian has a certain number of rectangles with areas that sum up to 3 and with side lengths all less than or equal to $1$. Demonstrate that with each of these rectangles it is possible to cover a square with side $1$ in such a way that the sides of the rectangles are parallel to the sides of the square.
[b]Note:[/b] The rectangles can overlap and they can protrude over the sides of the square.
All rectangles that can be inscribed in an isosceles triangle with two of their vertices on the triangle’s base have the same perimeter. Construct the triangle.
The $8$ eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of $50$ mm and a length of $80$ mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least $200$ mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters.
[asy]
size(200);
defaultpen(linewidth(0.7));
path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin;
path laceR=reflect((75,0),(75,-240))*laceL;
draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray);
for(int i=0;i<=3;i=i+1)
{
path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5);
unfill(circ1); draw(circ1);
unfill(circ2); draw(circ2);
}
draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy]
In each unit square of square $100*100$ write any natural number. Called rectangle with sides parallel sides of square $good$ if sum of number inside rectangle divided by $17$. We can painted all unit squares in $good$ rectangle. One unit square cannot painted twice or more.
Find maximum $d$ for which we can guaranteed paint at least $d$ points.
Consider a rectangle with sides $2a$ and $2b$, where $a > b$. There should be four congruent right triangles (one triangle at each vertex of this rectangle , whose legs are on the sides of the rectangle lie) must be cut off so that the remaining figure forms an octagon with sides of equal length. The side of the octagon is to be expressed in terms of a and $b$ and constructed from $a$ and $b$. Besides that it must be stated under which conditions the problem can be solved.
Four congruent rectangles are placed as shown. The area of the outer square is $ 4$ times that of the inner square. What is the ratio of the length of the longer side of each rectangle to the length of its shorter side?
[asy]unitsize(6mm);
defaultpen(linewidth(.8pt));
path p=(1,1)--(-2,1)--(-2,2)--(1,2);
draw(p);
draw(rotate(90)*p);
draw(rotate(180)*p);
draw(rotate(270)*p);[/asy]$ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \sqrt {10} \qquad \textbf{(C)}\ 2 \plus{} \sqrt2 \qquad \textbf{(D)}\ 2\sqrt3 \qquad \textbf{(E)}\ 4$
In the coordinate plane a rectangle with vertices $ (0, 0),$ $ (m, 0),$ $ (0, n),$ $ (m, n)$ is given where both $ m$ and $ n$ are odd integers. The rectangle is partitioned into triangles in such a way that
[i](i)[/i] each triangle in the partition has at least one side (to be called a “good” side) that lies on a line of the form $ x \equal{} j$ or $ y \equal{} k,$ where $ j$ and $ k$ are integers, and the altitude on this side has length 1;
[i](ii)[/i] each “bad” side (i.e., a side of any triangle in the partition that is not a “good” one) is a common side of two triangles in the partition.
Prove that there exist at least two triangles in the partition each of which has two good sides.
Let the sides of two rectangles be $ \{a,b\}$ and $ \{c,d\},$ respectively, with $ a < c \leq d < b$ and $ ab < cd.$ Prove that the first rectangle can be placed within the second one if and only if
\[ \left(b^2 \minus{} a^2\right)^2 \leq \left(bc \minus{} ad \right)^2 \plus{} \left(bd \minus{} ac \right)^2.\]