Found problems: 1342
A rectangle $ABCD$ with $AB>AD$ is given. The circle with center $B$ and radius $AB$ intersects the line $CD$ at $E$ and $F$.
(a) Prove that the circumcircle of triangle $EBF$ is tangent to the circle with diameter $AD$. Denote the tangency point by $G$.
(b) Prove that the points $D,G,$ and $B$ are collinear.
A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares.
Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.
A rectangle is divided into several similar isosceles triangles. Determine the possible values of the angles of the triangles.
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}$
Let $p,q$ be two distinct odd primes. Calculate
$\displaystyle \sum_{j=1}^{\frac{p-1}{2}}\left \lfloor \frac{qj}{p}\right \rfloor +\sum_{j=1}^{\frac{q-1}{2}}\left \lfloor \frac{pj}{q}\right\rfloor$.
We consider a game on an infinite chessboard similar to that of solitaire: If two adjacent fields are occupied by pawns and the next field is empty (the three fields lie on a vertical or horizontal line), then we may remove these two pawns and put one of them on the third field. Prove that if in the initial position pawns fill a $3k \times n$ rectangle, then it is impossible to reach a position with only one pawn on the board.
Let $A_1,B_1,C_1,D_1$ be the midpoints of the sides of a convex quadrilateral $ABCD$ and let $A_2, B_2, C_2, D_2$ be the midpoints of the sides of the quadrilateral $A_1B_1C_1D_1$. If $A_2B_2C_2D_2$ is a rectangle with sides $4$ and $6$, then what is the product of the lengths of the diagonals of $ABCD$ ?
In rectangle $ABCD$, $AB=20$ and $BC=10$. Let $E$ be a point on $\overline{CD}$ such that $\angle CBE=15^\circ$. What is $AE$?
$ \textbf{(A)}\ \dfrac{20\sqrt3}3\qquad\textbf{(B)}\ 10\sqrt3\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 11\sqrt3\qquad\textbf{(E)}\ 20 $
Two rectangles of unit area overlap to form a convex octagon. Show that the area of the octagon is at least $\dfrac {1} {2}$.
[i]Kvant Magazine [/i]
The incircle $\mathcal{C}_1$ of triangle $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. The incircle $\mathcal{C}_2$ of the triangle $ADE$ touches the sides $AB$ and $AC$ at the points $P$ and $Q$, and intersects the circle $\mathcal{C}_1$ at the points $M$ and $n$. Prove that
(a) the center of the circle $\mathcal{C}_2$ lies on the circle $\mathcal{C}_1$.
(b) the four points $M,N,P,Q$ in appropriate order form a rectangle if and only if twice the radius of $\mathcal{C}_1$ is three times the radius of $\mathcal{C}_2$.
Given in the plane is a lattice and a grid rectangle with sides parallel to the coordinate axes. We divide the rectangle into grid triangles with area $\frac12$. Prove that the number of right angled triangles is at least twice as much as the shorter side of the rectangle.
(A grid polygon is a polygon such that both coordinates of each vertex is an integer.)
A $9 \times 9$ square consists of $81$ unit squares. Some of these unit squares are painted black, and the others are painted white, such that each $2 \times 3$ rectangle and each $3 \times 2$ rectangle contain exactly 2 black unit squares and 4 white unit squares. Determine the number of black unit squares.
$ABCD$ is a cyclic quadrilateral inscribed in circle $O$. Let $O_1$ be the $A$-excenter of $ABC$ and $O_2$ the $A$-excenter of $ABD$. Show that $A, B, O_1, O_2$ is concyclic, and $O$ passes through the center of $(ABO_1O_2)$.
Recall that for concyclic $X, Y, Z, W$, the notation $(XYZW)$ denotes the circumcircle of $XYZW$.
The following diagram shows an eight-sided polygon $ABCDEFGH$ with side lengths $8,15,8,8,8,6,8,$ and $29$ as shown. All of its angles are right angles. Turn this eight-sided polygon into a six-sided polygon by connecting $B$ to $D$ with an edge and $E$ to $G$ with an edge to form polygon $ABDEGH$. Find the perimeter of $ABDEGH$.
[asy]
size(200);
defaultpen(linewidth(2));
pen qq=font("phvb");
pair rectangle[] = {origin,(0,-8),(15,-8),(15,-16),(23,-16),(23,-8),(29,-8),(29,0)};
string point[] = {"A","B","C","D","E","F","G","H"};
int dirlbl[] = {135,225,225,225,315,315,315,45};
string value[] = {"8","15","8","8","8","6","8","29"};
int direction[] = {0,90,0,90,180,90,180,270};
for(int i=0;i<=7;i=i+1)
{
draw(rectangle[i]--rectangle[(i+1) % 8]);
label(point[i],rectangle[i],dir(dirlbl[i]),qq);
label(value[i],(rectangle[i]+rectangle[(i+1) % 8])/2,dir(direction[i]),qq);
}
[/asy]
In the Cartesian plane, a line segment is called [i]tame[/i] if it lies parallel to one of the coordinate axes and its distance to this axis is an integer. Otherwise it is called [i]wild[/i].
Let $m$ and $n$ be odd positive integers. The rectangle with vertices $(0,0),(m,0),(m,n)$ and $(0,n)$ is partitioned into finitely many triangles. Let $M$ be the set of these triangles. Assume that
(1) Each triangle from $M$ has at least one tame side.
(2) For each tame side of a triangle from $M$, the corresponding altitude has length $1$.
(3) Each wild side of a triangle from $M$ is a common side of exactly two triangles from $M$.
Show that at least two triangles from $M$ have two tame sides each.
Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola $ xy\equal{}1$ and both branches of the hyperbola $ xy\equal{}\minus{}1.$ (A set $ S$ in the plane is called [i]convex[/i] if for any two points in $ S$ the line segment connecting them is contained in $ S.$)
When a rectangle frames a parabola such that a side of the rectangle is parallel to the parabola's axis of symmetry, the parabola divides the rectangle into regions whose areas are in the ratio $2$ to $1$. How many integer values of $k$ are there such that $0<k\leq 2007$ and the area between the parabola $y=k-x^2$ and the $x$-axis is an integer?
[asy]
import graph;
size(300);
defaultpen(linewidth(0.8)+fontsize(10));
real k=1.5;
real endp=sqrt(k);
real f(real x) {
return k-x^2;
}
path parabola=graph(f,-endp,endp)--cycle;
filldraw(parabola, lightgray);
draw((endp,0)--(endp,k)--(-endp,k)--(-endp,0));
label("Region I", (0,2*k/5));
label("Box II", (51/64*endp,13/16*k));
label("area(I) = $\frac23$\,area(II)",(5/3*endp,k/2));
[/asy]
Consider a rectangle $R$ partitioned into $2016$ smaller rectangles such that the sides of each smaller rectangle is parallel to one of the sides of the original rectangle. Call the corners of each rectangle a vertex. For any segment joining two vertices, call it basic if no other vertex lie on it. (The segments must be part of the partitioning.) Find the maximum/minimum possible number of basic segments over all possible partitions of $R$.
Let $f(x,y)$ be a continuous, real-valued function on $\mathbb{R}^2.$ Suppose that, for every rectangular region $R$ of area $1,$ the double integral of $f(x,y)$ over $R$ equals $0.$ Must $f(x,y)$ be identically $0?$
The Proenc has a new $8\times 8$ chess board and requires composing it into rectangles that do not overlap, so that:
(i) each rectangle has as many white squares as black ones;
(ii) there are no two rectangles with the same number of squares.
Determines the maximum value of $n$ for which such a decomposition is possible. For this value of $n$, determine all possible sets ${A_1,... ,A_n}$, where $A_i$ is the number of rectangle $i$ in squares, for which a decomposition of the board under the conditions intended actions is possible.
The sports ground has the shape of a rectangle $ABCD$, with the angle between the diagonals $AC$ and $BD$ is equal to $60^o$ and $AB >BC$. The trainer instructed Andriyka to go first $10$ times on the route $A-C-B-D-A$, and then $15$ more times along the route $A-D-A$. Andriyka performed the task, moving a total of $4.5$ km. What is the distance $AC$?
All the vertices of a convex pentagon are on lattice points. Prove that the area of the pentagon is at least $\frac{5}{2}$.
[i]Bogdan Enescu[/i]
Rectangle $ABCD$ has sides $CD=3$ and $DA=5$. A circle of radius $1$ is centered at $A$, a circle of radius $2$ is centered at $B$, and a circle of radius $3$ is centered at $C$. Which of the following is closest to the area of the region inside the rectangle but outside all three circles?
[asy]
draw((0,0)--(5,0)--(5,3)--(0,3)--(0,0));
draw(Circle((0,0),1));
draw(Circle((0,3),2));
draw(Circle((5,3),3));
label("A",(0.2,0),W);
label("B",(0.2,2.8),NW);
label("C",(4.8,2.8),NE);
label("D",(5,0),SE);
label("5",(2.5,0),N);
label("3",(5,1.5),E);
[/asy]
$\textbf{(A) }3.5\qquad\textbf{(B) }4.0\qquad\textbf{(C) }4.5\qquad\textbf{(D) }5.0\qquad \textbf{(E) }5.5$
The rectangle is cut into $10$ squares as shown in the figure on the right. Find its sides if the side of the smallest square is $3$.[img]https://cdn.artofproblemsolving.com/attachments/e/5/1fe3a0e41b2d3182338a557d3d44ff5ef9385d.png[/img]
Let $ABCD$ be a quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent.
[i]Proposed by Robin Park[/i]