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: 603

The Math Team designed a logo shaped like a multiplication symbol, shown below on a grid of 1-inch squares. What is the area of the logo in square inches? [asy] usepackage("mathptmx"); defaultpen(linewidth(0.5)); size(5cm); defaultpen(fontsize(14pt)); label("$\textbf{Math}$", (2.1,3.7)--(3.9,3.7)); label("$\textbf{Team}$", (2.1,3)--(3.9,3)); filldraw((1,2)--(2,1)--(3,2)--(4,1)--(5,2)--(4,3)--(5,4)--(4,5)--(3,4)--(2,5)--(1,4)--(2,3)--(1,2)--cycle, mediumgray*0.5 + lightgray*0.5); draw((0,0)--(6,0), gray); draw((0,1)--(6,1), gray); draw((0,2)--(6,2), gray); draw((0,3)--(6,3), gray); draw((0,4)--(6,4), gray); draw((0,5)--(6,5), gray); draw((0,6)--(6,6), gray); draw((0,0)--(0,6), gray); draw((1,0)--(1,6), gray); draw((2,0)--(2,6), gray); draw((3,0)--(3,6), gray); draw((4,0)--(4,6), gray); draw((5,0)--(5,6), gray); draw((6,0)--(6,6), gray); [/asy] $\textbf{(A) } 10 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 13 \qquad \textbf{(D) } 14 \qquad \textbf{(E) } 15$
[hide=E stands for Euclid, L stands for Lobachevsky]they had two problem sets under those two names[/hide] [b]E1.[/b] What is the perimeter of a rectangle if its area is $24$ and one side length is $6$? [b]E2.[/b] John moves 3 miles south, then $2$ miles west, then $7$ miles north, and then $5$ miles east. What is the length of the shortest path, in miles, from John's current position to his original position? [b]E3.[/b] An equilateral triangle $ABC$ is drawn with side length $2$. The midpoints of sides $AB$, $BC$, and $CA$ are constructed, and are connected to form a triangle. What is the perimeter of the newly formed triangle? [b]E4.[/b] Let triangle $ABC$ have sides $AB = 74$ and $AC = 5$. What is the sum of all possible integral side lengths of BC? [b]E5.[/b] What is the area of quadrilateral $ABCD$ on the coordinate plane with $A(1, 0)$, $B(0, 1)$, $C(1, 3)$, and $D(5, 2)$? [b]E6 / L1.[/b] Let $ABCD$ be a square with side length $30$. A circle centered at the center of $ABCD$ with diameter $34$ is drawn. Let $E$ and $F$ be the points at which the circle intersects side $AB$. What is $EF$? [b]E7 / L2.[/b] What is the area of the quadrilateral bounded by $|2x| + |3y| = 6$? [b]E8.[/b] A circle $O$ with radius $2$ has a regular hexagon inscribed in it. Upon the sides of the hexagon, equilateral triangles of side length $2$ are erected outwards. Find the area of the union of these triangles and circle $O$. [b]L3.[/b] Right triangle $ABC$ has hypotenuse $AB$. Altitude $CD$ divides $AB$ into segments $AD$ and $DB$, with $AD = 20$ and $DB = 16$. What is the area of triangle $ABC$? [b]L4.[/b] Circle $O$ has chord $AB$. Extend $AB$ past $B$ to a point $C$. A ray from $C$ is drawn, and this ray intersects circle $O$. Let point $D$ be the point of intersection of the ray and the circle that is closest to point $C$. Given $AB = 20$, $BC = 16$, and $OA = \frac{201}{6}$ , find the longest possible length of $CD$. [b]L5.[/b] Consider a circular cone with vertex $A$. The cone's height is $4$ and the radius of its base is $3$. Inscribe a sphere inside the cone. Find the ratio of the volume of the cone to the volume of the sphere. [b]L6.[/b] A disk of radius $\frac12$ is randomly placed on the coordinate plane. What is the probability that it contains a lattice point (point with integer coordinates)? [b]L7.[/b] Let $ABC$ be an equilateral triangle of side length $2$. Let $D$ be the midpoint of $BC$, and let $P$ be a variable point on $AC$. By moving $P$ along $AC$, what is the minimum perimeter of triangle $BDP$? [b]L8.[/b] Let $ABCD$ be a rectangle with $AB = 8$ and $BC = 9$. Let $DEFG$ be a rhombus, where $G$ is on line $BC$ and $A$ is on line $EF$. If $m\angle EFG = 30^o, what is $DE$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Do there exist two bounded sequences $a_1, a_2,\ldots$ and $b_1, b_2,\ldots$ such that for each positive integers $n$ and $m>n$ at least one of the two inequalities $|a_m-a_n|>1/\sqrt{n},$ and $|b_m-b_n|>1/\sqrt{n}$ holds?
Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]
A cake has the form of an $ n$ x $ n$ square composed of $ n^{2}$ unit squares. Strawberries lie on some of the unit squares so that each row or column contains exactly one strawberry; call this arrangement $\mathcal{A}$. Let $\mathcal{B}$ be another such arrangement. Suppose that every grid rectangle with one vertex at the top left corner of the cake contains no fewer strawberries of arrangement $\mathcal{B}$ than of arrangement $\mathcal{A}$. Prove that arrangement $\mathcal{B}$ can be obtained from $ \mathcal{A}$ by performing a number of switches, defined as follows: A switch consists in selecting a grid rectangle with only two strawberries, situated at its top right corner and bottom left corner, and moving these two strawberries to the other two corners of that rectangle.
Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.
A pile of $n$ pebbles is placed in a vertical column. This configuration is modified according to the following rules. A pebble can be moved if it is at the top of a column which contains at least two more pebbles than the column immediately to its right. (If there are no pebbles to the right, think of this as a column with 0 pebbles.) At each stage, choose a pebble from among those that can be moved (if there are any) and place it at the top of the column to its right. If no pebbles can be moved, the configuration is called a [i]final configuration[/i]. For each $n$, show that, no matter what choices are made at each stage, the final configuration obtained is unique. Describe that configuration in terms of $n$. [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=119189]IMO ShortList 2001, combinatorics problem 7, alternative[/url]
Let $n \ge 2$ be an integer. A cube of size $n \times n \times n$ is dissected into $n^3$ unit cubes. A nonzero real number is written at the center of each unit cube so that the sum of the $n^2$ numbers in each slab of size $1 \times n \times n$, $n \times 1 \times n$, or $n \times n \times 1$ equals zero. (There are a total of $3n$ such slabs, forming three groups of $n$ slabs each such that slabs in the same group are parallel and slabs in different groups are perpendicular.) Could it happen that some plane in three-dimensional space separates the positive and the negative written numbers? (The plane should not pass through any of the numbers.) [i]Nikolai Beluhov[/i]
Determine the locus of points $M$ in the plane of a given rhombus $ABCD$ such that $MA\cdot MC+MB\cdot MD=AB^2$.
Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.
Let $u, v$ be real numbers. The minimum value of $\sqrt{u^2+v^2} +\sqrt{(u-1)^2+v^2}+\sqrt {u^2+ (v-1)^2}+ \sqrt{(u-1)^2+(v-1)^2}$ can be written as $\sqrt{n}$. Find the value of $10n$.
A rectangular array of numbers is given. In each row and each column, the sum of all numbers is an integer. Prove that each nonintegral number $x$ in the array can be changed into either $\lceil x\rceil $ or $\lfloor x\rfloor $ so that the row-sums and column-sums remain unchanged. (Note that $\lceil x\rceil $ is the least integer greater than or equal to $x$, while $\lfloor x\rfloor $ is the greatest integer less than or equal to $x$.)
In $\triangle PAT,$ $\angle P=36^{\circ},$ $\angle A=56^{\circ},$ and $PA=10.$ Points $U$ and $G$ lie on sides $\overline{TP}$ and $\overline{TA},$ respectively, so that $PU=AG=1.$ Let $M$ and $N$ be the midpoints of segments $\overline{PA}$ and $\overline{UG},$ respectively. What is the degree measure of the acute angle formed by lines $MN$ and $PA?$ $\textbf{(A) } 76 \qquad \textbf{(B) } 77 \qquad \textbf{(C) } 78 \qquad \textbf{(D) } 79 \qquad \textbf{(E) } 80 $
Let $n$ be an odd positive integer, and consider an infinite square grid. Prove that it is impossible to fill in one of $1,2$ or $3$ in every cell, which simultaneously satisfies the following conditions: (1) Any two cells which share a common side does not have the same number filled in them. (2) For any $1\times 3$ or $3\times 1$ subgrid, the numbers filled does not contain $1,2,3$ in that order be it reading from top to bottom, bottom to top, or left to right, or right to left. (3) The sum of numbers of any $n\times n$ subgrid is the same.
What is the area of the shaded region of the given $8 \times 5$ rectangle? [asy] size(6cm); defaultpen(fontsize(9pt)); draw((0,0)--(8,0)--(8,5)--(0,5)--cycle); filldraw((7,0)--(8,0)--(8,1)--(0,4)--(0,5)--(1,5)--cycle,gray(0.8)); label("$1$",(1/2,5),dir(90)); label("$7$",(9/2,5),dir(90)); label("$1$",(8,1/2),dir(0)); label("$4$",(8,3),dir(0)); label("$1$",(15/2,0),dir(270)); label("$7$",(7/2,0),dir(270)); label("$1$",(0,9/2),dir(180)); label("$4$",(0,2),dir(180)); [/asy] $\textbf{(A)}\ 4\dfrac{3}{5} \qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 5\dfrac{1}{4} \qquad \textbf{(D)}\ 6\dfrac{1}{2} \qquad \textbf{(E)}\ 8$
Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.
$ABCD$ is a tetrahedron. Let $K$ be the center of the incircle of $CBD$. Let $M$ be the center of the incircle of $ABD$. Let $L$ be the gravycenter of $DAC$. Let $N$ be the gravycenter of $BAC$. Suppose $AK$, $BL$, $CM$, $DN$ have one common point. Is $ABCD$ necessarily regular?
Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]
The pentagon $ABCDE$ is inscirbed in a circle $w$. Suppose that $w_a,w_b,w_c,w_d,w_e$ are reflections of $w$ with respect to sides $AB,BC,CD,DE,EA$ respectively. Let $A'$ be the second intersection point of $w_a,w_e$ and define $B',C',D',E'$ similarly. Prove that \[2\le \frac{S_{A'B'C'D'E'}}{S_{ABCDE}}\le 3,\] where $S_X$ denotes the surface of figure $X$. [i]Proposed by Morteza Saghafian, Ali khezeli[/i]
Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.
On a square table of $2011$ by $2011$ cells we place a finite number of napkins that each cover a square of $52$ by $52$ cells. In each cell we write the number of napkins covering it, and we record the maximal number $k$ of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of $k$? [i]Proposed by Ilya Bogdanov and Rustem Zhenodarov, Russia[/i]
A [i]site[/i] is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones. [i]Proposed by Gurgen Asatryan, Armenia[/i]
In the coordinate plane with the origin $O$, consider points $P(t+2,\ 0),\ Q(0, -2t^2-2t+4)\ (t\geq 0).$ If the $y$-coordinate of $Q$ is nonnegative, then find the area of the region swept out by the line segment $PQ$. [i]2011 Ritsumeikan University entrance exam/Pharmacy[/i]
Let $n $ be a positive integer. Let $f $ be a function from nonnegative integers to themselves. Let $f (0,i)=f (i,0)=0$, $f (1, 1)=n $, and $ f(i, j)= [\frac {f(i-1,j)}{2}]+ [\frac {f(i, j-1)}{2}] $ for positive integers $i, j$ such that $i*j>1$. Find the number of pairs $(i,j) $ such that $f (i, j) $ is an odd number.( $[x]$ is the floor function).
Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.