This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1342

Let $ABCD$ be a rectangle inscribed in circle $\omega$ with center $O$. Line $l$ passes trough $O$ and intersects lines $BC$ and $AD$ at points $E$ and $F$ respectively. Points $K$ and $L$ are the intersection points of $l$ and $\omega$ and points $K, E, F, L$ lie in this order on the line $l$. Lines tangent to $w$ in $K$ and $L$ intersect $CD$ at $M$ and $N$ respectively. Prove that $E, F, M, N$ lie on a common circle.
In rectangle $ ABCD$, points $ F$ and $ G$ lie on $ \overline{AB}$ so that $ AF \equal{} FG \equal{} GB$ and $ E$ is the midpoint of $ \overline{DC}$. Also, $ \overline{AC}$ intersects $ \overline{EF}$ at $ H$ and $ \overline{EG}$ at $ J$. The area of the rectangle $ ABCD$ is $ 70$. Find the area of triangle $ EHJ$. [asy] size(180); pair A, B, C, D, E, F, G, H, J; A = origin; real length = 6; real width = 3.5; B = length*dir(0); C = (length, width); D = width*dir(90); F = length/3*dir(0); G = 2*length/3*dir(0); E = (length/2, width); H = extension(A, C, E, F); J = extension(A, C, E, G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$", A, dir(180)); label("$D$", D, dir(180)); label("$B$", B, dir(0)); label("$C$", C, dir(0)); label("$F$", F, dir(270)); label("$E$", E, dir(90)); label("$G$", G, dir(270)); label("$H$", H, dir(140)); label("$J$", J, dir(340)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {5}{2} \qquad \textbf{(B)} \ \frac {35}{12} \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ \frac {7}{2} \qquad \textbf{(E)} \ \frac {35}{8}$
A square is divided into congruent rectangles with sides of integer lengths. A rectangle is important if it has at least one point in common with a given diagonal of the square. Prove that this diagonal bisects the total area of the important rectangles
Cells of a $2000\times2000$ board are colored according to the following rules: 1)At any moment a cell can be colored, if none of its neighbors are colored 2)At any moment a $1\times2$ rectangle can be colored, if exactly two of its neighbors are colored. 3)At any moment a $2\times2$ squared can be colored, if 8 of its neighbors are colored (Two cells are considered to be neighboring, if they share a common side). Can the entire $2000\times2000$ board be colored? [I]Proposed by K. Kohas[/i]
Rectangle $ABCD$ and right triangle $DCE$ have the same area. They are joined to form a trapezoid, as shown. What is $DE$? [asy] size(250); defaultpen(linewidth(0.8)); pair A=(0,5),B=origin,C=(6,0),D=(6,5),E=(18,0); draw(A--B--E--D--cycle^^C--D); draw(rightanglemark(D,C,E,30)); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,S); label("$D$",D,N); label("$E$",E,S); label("$5$",A/2,W); label("$6$",(A+D)/2,N); [/asy] $\textbf{(A) }12\qquad\textbf{(B) }13\qquad\textbf{(C) }14\qquad\textbf{(D) }15\qquad \textbf{(E) }16$
A square of side $n$ ($n$ natural) is divided into $n^2$ squares of side $1$. Each pair of "horizontal" boundary lines and each pair of "vertical" boundary lines enclose a rectangle (a square is also considered a rectangle). A rectangle has a length and a width; the width is less than or equal to the length. (a) Prove that there are $8$ rectangles of width $n - 1$. (b) Determine the number of rectangles with width $n -k$ ($0\le k \le n -1,k$ integer). (c) Determine a formula for $1^3 + 2^3 +...+ n^3$.
Let $ABC$ be an isosceles triangle with $AB=AC$. Consider a variable point $P$ on the extension of the segment $BC$ beyound $B$ (in other words, $P$ lies on the line $BC$ such that the point $B$ lies inside the segment $PC$). Let $r_{1}$ be the radius of the incircle of the triangle $APB$, and let $r_{2}$ be the radius of the $P$-excircle of the triangle $APC$. Prove that the sum $r_{1}+r_{2}$ of these two radii remains constant when the point $P$ varies. [i]Remark.[/i] The $P$-excircle of the triangle $APC$ is defined as the circle which touches the side $AC$ and the [i]extensions[/i] of the sides $AP$ and $CP$.
Consider the rectangle in the coordinate plane with corners $(0, 0)$, $(16, 0)$, $(16, 4)$, and $(0, 4)$. For a constant $x_0 \in [0, 16]$, the curves \[ \{(x, y) : y = \sqrt{x} \,\text{ and }\, 0 \leq x \leq 16\} \quad \text{and} \quad \{(x_0, y) : 0 \leq y \leq 4\} \] partition this rectangle into four 2D regions. Over all choices of $x_0$, determine the smallest possible sum of the areas of the bottom-left and top-right 2D regions in this partition. (The bottom-left region is $\{(x, y) : 0 \leq x < x_0 \,\text{ and }\, 0 \leq y < \sqrt{x}\}$, and the top-right region is $\{(x, y) : x_0 < x \leq 16 \,\text{ and }\, \sqrt{x} < y \leq 4\}$.)
Is it possible to write a natural number in every cell of an infinite chessboard in such a manner that for all integers $m, n > 100$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n \ ?$
The figure shows a network of roads bounding $12$ blocks. Person $P$ goes from $A$ to $B,$ and person $Q$ goes from $B$ to $A,$ each going by a shortest path (along roads). The persons start simultaneously and go at the same constant speed. At each point with two possible directions to take, both have the same probability. Find the probability that the persons meet. [asy] import graph; size(150); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; draw((0,3)--(4,3),linewidth(1.2pt)); draw((4,3)--(4,0),linewidth(1.2pt)); draw((4,0)--(0,0),linewidth(1.2pt)); draw((0,0)--(0,3),linewidth(1.2pt)); draw((1,3)--(1,0),linewidth(1.2pt)); draw((2,3)--(2,0),linewidth(1.2pt)); draw((3,3)--(3,0),linewidth(1.2pt)); draw((0,1)--(4,1),linewidth(1.2pt)); draw((4,2)--(0,2),linewidth(1.2pt)); dot((0,0),ds); label("$A$", (-0.3,-0.36),NE*lsf); dot((4,3),ds); label("$B$", (4.16,3.1),NE*lsf); clip((-4.3,-10.94)--(-4.3,6.3)--(16.18,6.3)--(16.18,-10.94)--cycle); [/asy]
Suppose $ABCD$ is a cyclic quadrilateral inscribed in a circle of radius one unit. If $AB \cdot BC \cdot CD \cdot DA \geq 4$, prove that $ABCD$ is a square.
a) Given a big square consisting of $7\times 7$ squares. You should mark the centres of $k$ points in such a way, that no quadruple of the marked points will be the vertices of a rectangle with the sides parallel to the sides of the given squares. What is the greatest $k$ such that the problem has solution? b) The same problem for $13\times 13$ square.
A point $E$ on side $CD$ of a rectangle $ABCD$ is such that $\triangle DBE$ is isosceles and $\triangle ABE$ is right-angled. Find the ratio between the side lengths of the rectangle.
A tortoise walks $60$ meters per hour and a lizard walks at $240$ meters per hour. There is a rectangle $ABCD$ where $AB =60$ and $AD =120$. Both start from the vertex $A$ and in the same direction ($A \to B \to D \to A$), crossing the edge of the rectangle. The lizard has the habit of advancing two consecutive sides of the rectangle, turning to go back one, turning to go forward two, turning to go back one and so on. How many times and in what places do the tortoise and the lizard meet when the tortoise completes its third turn?
The figure below shows a barn in the shape of two congruent pentagonal prisms that intersect at right angles and have a common center. The ends of the prisms are made of a 12 foot by 7 foot rectangle surmounted by an isosceles triangle with sides 10 feet, 10 feet, and 12 feet. Each prism is 30 feet long. Find the volume of the barn in cubic feet. [center][img]https://snag.gy/Ox9CUp.jpg[/img][/center]
Let $C_1$ and $C_2$ be two tangent unit circles inside a circle $C$ of radius $2$. Circle $C_3$ inside $C$ is tangent to the circles $C,C_1,C_2$, and circle $C_4$ inside $C$ is tangent to $C,C_1,C_3$. Prove that the centers of $C,C_1,C_3$ and $C_4$ are vertices of a rectangle.
Let $ABCD$ be a cyclic quadrilateral inscribed in circle $\omega$ whose diagonals meet at $F$. Lines $AB$ and $CD$ meet at $E$. Segment $EF$ intersects $\omega$ at $X$. Lines $BX$ and $CD$ meet at $M$, and lines $CX$ and $AB$ meet at $N$. Prove that $MN$ and $BC$ concur with the tangent to $\omega$ at $X$. [i]Proposed by Allen Liu[/i]
$ABCD$ is a rectangle. $I$ is the midpoint of $CD$. $BI$ meets $AC$ at $M$. Show that the line $DM$ passes through the midpoint of $BC$. $E$ is a point outside the rectangle such that $AE = BE$ and $\angle AEB = 90^o$. If $BE = BC = x$, show that $EM$ bisects $\angle AMB$. Find the area of $AEBM$ in terms of $x$.
We have an $n \times n$ board, and in every square there is an integer. The sum of all integers on the board is $0$. We define an action on a square where the integer in the square is decreased by the number of neighbouring squares, and the number inside each of the neighbouring squares is increased by 1. Determine if there exists $n\geq 2$ such that we can turn all the integers into zeros in a finite number of actions.
The quadrilateral $ABCD$ is circumscribed about the circle, touches the sides $AB, BC, CD, DA$ in the points $K, L, M, N,$ respectively. Let $P, Q, R, S$ midpoints of the sides $KL, LM, MN, NK$. Prove that $PR = QS$ if and only if $ABCD$ is inscribed.
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.
In convex hexagon $ABCDEF$, all six sides are congruent, $\angle A$ and $\angle D$ are right angles, and $\angle B$, $\angle C$, $\angle E$, and $\angle F$ are congruent. The area of the hexagonal region is $2116(\sqrt{2}+1)$. Find $AB$.
A game is played on a $23\times 23$ board. The first player controls two white chips which start in the bottom left and top right corners. The second player controls two black ones which start in bottom right and top left corners. The players move alternately. In each move, a player moves one of the chips under control to a square which shares a side with the square the chip is currently in. The first player wins if he can bring the white chips to squares which share a side with each other. Can the second player prevent the first player from winning?
Today was realized the National Olimpiad in Cuba, this is the 3rd problem of the second day: Prof that we can color the lattice points in the plane with two color so that every rectangle with vertices in the lattice points and edges parallels to the co-ordinate axis that have area 2^n is not monocromatic [/img]
Let $A_1A_2$ and $B_1B_2$ be the diagonals of a rectangle, and let $O$ be its center. Find and construct the set of all points $P$ that satisfy simultaneously the four inequaliies: $$A_1P > OP , \\A_2P > OP, \ \ B_1P > OP , \ \ B_2P > OP.$$