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

Three ants are at three corners of a rectangle. It is assumed that each ant moves only when the other two are stopped and always parallel to the line defined by them. Will be is it possible that the three ants are simultaneously at midpoints on the sides of the rectangle?
Problems 7, 8 and 9 are about these kites. To promote her school's annual Kite Olympics, Genevieve makes a small kite and a large kite for a bulletin board display. The kites look like the one in the diagram. For her small kite Genevieve draws the kite on a one-inch grid. For the large kite she triples both the height and width of the entire grid. [asy] for (int a = 0; a < 7; ++a) { for (int b = 0; b < 8; ++b) { dot((a,b)); } } draw((3,0)--(0,5)--(3,7)--(6,5)--cycle);[/asy] What is the number of square inches in the area of the small kite? $ \text{(A)}\ 21\qquad\text{(B)}\ 22\qquad\text{(C)}\ 23\qquad\text{(D)}\ 24\qquad\text{(E)}\ 25 $
A semicircle with diameter $d$ is contained in a square whose sides have length $8$. Given the maximum value of $d$ is $m- \sqrt{n}$, find $m+n$.
Given $2009 \times 4018$ rectangular board. Frame is a rectangle $n \times n$ or $n \times(n + 2)$ for $ ( n \geq 3 )$ without all cells which don’t have any common points with boundary of rectangle. Rectangles $1\times1,1\times 2,1\times 3$ and $ 2\times 4$ are also frames. Two players by turn paint all cells of some frame that has no painted cells yet. Player that can't make such move loses. Who has a winning strategy?
A $5\times5$ grid of squares is filled with integers. Call a rectangle [i]corner-odd[/i] if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangles must have four distinct corners to be considered [i]corner-odd[/i]; i.e. no $1\times k$ rectangle can be [i]corner-odd[/i] for any positive integer $k$.
This is the one with the 8 circles? I made each circle into the square in which the circle is inscribed, then calculated it with that. It got the right answer but I don't think that my method is truly valid...
At the vertices $A, B, C, D, E, F, G, H$ of a cube, $2001, 2002, 2003, 2004, 2005, 2008, 2007$ and $2006$ stones respectively are placed. It is allowed to move a stone from a vertex to each of its three neighbours, or to move a stone to a vertex from each of its three neighbours. Which of the following arrangements of stones at $A, B, \ldots , H$ can be obtained? $(\text{a})\quad 2001, 2002, 2003, 2004, 2006, 2007, 2008, 2005;$ $(\text{b})\quad 2002, 2003, 2004, 2001, 2006, 2005, 2008, 2007;$ $(\text{c})\quad 2004, 2002, 2003, 2001, 2005, 2008, 2007, 2006.$
Let $ABCD$ be a rectangle with sides $AB = 4$ and $BC = 3$. The perpendicular on the diagonal $BD$ drawn from $ A$ intersects $BD$ at the point $H$. We denote by $M$ the midpoint of $BH$ and $N$ the midpoint of $CD$. Calculate the length of segment $MN$.
Let $f:[0,1]\to\mathbb{R}$ be a continuous function and let $\{a_n\}_n$, $\{b_n\}_n$ be sequences of reals such that \[ \lim_{n\to\infty} \int^1_0 | f(x) - a_nx - b_n | dx = 0 . \] Prove that: a) The sequences $\{a_n\}_n$, $\{b_n\}_n$ are convergent; b) The function $f$ is linear.
Rectangle $p*q,$ where $p,q$ are relatively coprime positive integers with $p <q$ is divided into squares $1*1$.Diagonal which goes from lowest left vertice to highest right cuts triangles from some squares.Find sum of perimeters of all such triangles.
In rectangle $ ABCD$, $ AB\equal{}5$ and $ BC\equal{}3$. Points $ F$ and $ G$ are on $ \overline{CD}$ so that $ DF\equal{}1$ and $ GC\equal{}2$. Lines $ AF$ and $ BG$ intersect at $ E$. Find the area of $ \triangle{AEB}$. [asy]unitsize(6mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); pair A=(0,0), B=(5,0), C=(5,3), D=(0,3), F=(1,3), G=(3,3); pair E=extension(A,F,B,G); draw(A--B--C--D--A--E--B); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,NE); label("$D$",D,NW); label("$E$",E,N); label("$F$",F,SE); label("$G$",G,SW); label("$B$",B,SE); label("1",midpoint(D--F),N); label("2",midpoint(G--C),N); label("3",midpoint(B--C),E); label("3",midpoint(A--D),W); label("5",midpoint(A--B),S);[/asy]$ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ \frac{21}{2} \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ \frac{25}{2} \qquad \textbf{(E)}\ 15$
Given a square $ABCD$, let $P, Q, R$, and $S$ be four variable points on the sides $AB, BC, CD$, and $DA$, respectively. Determine the positions of the points $P, Q, R$, and $S$ for which the quadrilateral $PQRS$ is a parallelogram, a rectangle, a square, or a trapezoid.
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]
Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]
Given an infinite sheet of square ruled paper. Some of the squares contain a piece. A move consists of a piece jumping over a piece on a neighbouring square (which shares a side) onto an empty square and removing the piece jumped over. Initially, there are no pieces except in an $m x n$ rectangle ($m, n > 1$) which has a piece on each square. What is the smallest number of pieces that can be left after a series of moves?
A circle of radius $ r$ is concentric with and outside a regular hexagon of side length 2. The probability that three entire sides of hexagon are visible from a randomly chosen point on the circle is 1/2. What is $ r$? $ \textbf{(A) } 2\sqrt {2} \plus{} 2\sqrt {3} \qquad \textbf{(B) } 3\sqrt {3} \plus{} \sqrt {2} \qquad \textbf{(C) } 2\sqrt {6} \plus{} \sqrt {3} \qquad \textbf{(D) } 3\sqrt {2} \plus{} \sqrt {6}\\ \textbf{(E) } 6\sqrt {2} \minus{} \sqrt {3}$
A $(3n + 1) \times (3n + 1)$ table $(n \in \mathbb{N})$ is given. Prove that deleting any one of its squares yields a shape cuttable into pieces of the following form and its rotations: ''L" shape formed by cutting one square from a $2 \times 2$ squares.
Let $ABCD$ be a rectangle with $AB\ge BC$ Point $M$ is located on the side $(AD)$, and the perpendicular bisector of $[MC]$ intersects the line $BC$ at the point $N$. Let ${Q} =MN\cup AB$ . Knowing that $\angle MQA= 2\cdot \angle BCQ $, show that the quadrilateral $ABCD$ is a square.
Determine all integer $n$ such that a surface of an $n \times n \times n$ grid cube can be pasted in one layer by paper $1 \times 2$ rectangles so that each rectangle has exactly five neighbors (by a line segment). (A.Shapovalov)
Let $ABDE, BCFZ$ and $CAKL$ be three arbitrary rectangles constructed outside a triangle $ABC$. Let $EF$ meet $ZK$ at $M$, and $N$ be the intersection of the lines through $F,Z$ perpendicular to $FL,ZD$. Prove that $A,M,N$ are collinear. Kostas Vittas
Given a rectangle $ ABCD,$ let $ AB \equal{} b, AD \equal{} a ( a\geq b),$ three points $ X,Y,Z$ are put inside or on the boundary of the rectangle, arbitrarily. Find the maximum of the minimum of the distances between any two points among the three points. (Denote it by $ a,b$)
The vertices of hexagon $ABCDEF$ lie on a circle. Sides $AB = CD = EF = 6$, and sides $BC = DE = F A = 10$. The area of the hexagon is $m\sqrt3$. Find $m$.
Determine the poles of the inversions that transform four collienar points $A,B, C, D$, aligned in this order, at four points $A' $, $B' $, $C'$ , $D'$ that are vertices of a rectangle, and such that $A'$ and $C'$ are opposite vertices.
A circle that passes through the vertex $A$ of a rectangle $ABCD$ intersects the side $AB$ at a second point $E$ different from $B.$ A line passing through $B$ is tangent to this circle at a point $T,$ and the circle with center $B$ and passing through $T$ intersects the side $BC$ at the point $F.$ Show that if $\angle CDF= \angle BFE,$ then $\angle EDF=\angle CDF.$
Let $ ABC$ be an acute angled triangle and let $ H$ be its ortho centre. Let $ h_{max}$ denote the largest altitude of the triangle $ ABC$. Prove that: $AH \plus{} BH \plus{} CH\leq2h_{max}$