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

1999 All-Russian Olympiad Regional Round, 9.4

The maze is an $8 \times 8 $square, each cell contains $1 \times 1$ which has one of four arrows drawn (up, down, right, left). The upper side of the upper right cell is the exit from the maze.In the lower left cell there is a chip that, with each move, moves one square in the direction indicated by the arrow. After each move, the shooter in the cell in which there was just a chip rotates $90^o$ clockwise. If a chip must move, taking it outside the $8 \times 8$ square, it remains in place, and the arrow also rotates $90^o$ clockwise. Prove that sooner or later, the chip will come out of the maze.

2013 IMO Shortlist, N7

Let $\nu$ be an irrational positive number, and let $m$ be a positive integer. A pair of $(a,b)$ of positive integers is called [i]good[/i] if \[a \left \lceil b\nu \right \rceil - b \left \lfloor a \nu \right \rfloor = m.\] A good pair $(a,b)$ is called [i]excellent[/i] if neither of the pair $(a-b,b)$ and $(a,b-a)$ is good. Prove that the number of excellent pairs is equal to the sum of the positive divisors of $m$.

2021 AMC 12/AHSME Spring, 16

Tags:
In the following list of numbers, the integer $n$ appears $n$ times in the list for $1 \leq n \leq 200.$ $$1, 2, 2, 3, 3, 3, 4, 4, 4, 4, …, 200, 200, …, 200$$ What is the median of the numbers in this list? $\textbf{(A)}\ 100.5 \qquad\textbf{(B)}\ 134 \qquad\textbf{(C)}\ 142 \qquad\textbf{(D)}\ 150.5 \qquad\textbf{(E)}\ 167$

2015 AMC 8, 19

A triangle with vertices as $A=(1,3)$, $B=(5,1)$, and $C=(4,4)$ is plotted on a $6\times5$ grid. What fraction of the grid is covered by the triangle? $\textbf{(A) }\frac{1}{6} \qquad \textbf{(B) }\frac{1}{5} \qquad \textbf{(C) }\frac{1}{4} \qquad \textbf{(D) }\frac{1}{3} \qquad \textbf{(E) }\frac{1}{2}$ [asy] draw((1,0)--(1,5),linewidth(.5)); draw((2,0)--(2,5),linewidth(.5)); draw((3,0)--(3,5),linewidth(.5)); draw((4,0)--(4,5),linewidth(.5)); draw((5,0)--(5,5),linewidth(.5)); draw((6,0)--(6,5),linewidth(.5)); draw((0,1)--(6,1),linewidth(.5)); draw((0,2)--(6,2),linewidth(.5)); draw((0,3)--(6,3),linewidth(.5)); draw((0,4)--(6,4),linewidth(.5)); draw((0,5)--(6,5),linewidth(.5)); draw((0,0)--(0,6),EndArrow); draw((0,0)--(7,0),EndArrow); draw((1,3)--(4,4)--(5,1)--cycle); label("$y$",(0,6),W); label("$x$",(7,0),S); label("$A$",(1,3),dir(230)); label("$B$",(5,1),SE); label("$C$",(4,4),dir(50)); [/asy]

2014 Argentine National Olympiad, Level 3, 2.

Given several numbers, one of them, $a$, is chosen and replaced by the three numbers $\frac{a}{3}, \frac{a}{3}, \frac{a}{3}$. This process is repeated with the new set of numbers, and so on. Originally, there are $1000$ ones, and we apply the process several times. A number $m$ is called [i]good[/i] if there are $m$ or more numbers that are the same after each iteration, no matter how many or what operations are performed. Find the largest possible good number.

2019 IMO Shortlist, A5

Let $x_1, x_2, \dots, x_n$ be different real numbers. Prove that \[\sum_{1 \leqslant i \leqslant n} \prod_{j \neq i} \frac{1-x_{i} x_{j}}{x_{i}-x_{j}}=\left\{\begin{array}{ll} 0, & \text { if } n \text { is even; } \\ 1, & \text { if } n \text { is odd. } \end{array}\right.\]

2015 Baltic Way, 1

For $n\geq 2$ , an equilateral triangle is divided into $n^2$ congruent smaller equilateral triangles. Detemine all ways in which real numbers can be assigned to the $\frac{(n+1)(n+2)}{2}$ vertices so that three such numbers sum to zero whenever the three vertices form a triangle with edges parallel to the sides of the big triangle.

2022 Bulgaria JBMO TST, 1

Are there positive integers $a$, $b$, $c$ and $d$ such that: a) $a^{2021} + b^{2023} = 11(c^{2022} + d^{2024})$; b) $a^{2022} + b^{2022} = 11(c^{2022} + d^{2022})$?

2005 Greece Junior Math Olympiad, 4

Tags:
Find all nonzero integers $a, b, c, d$ with $a>b>c>d$ that satisfy $ab+cd=34$ and $ac-bd=19.$

2012-2013 SDML (Middle School), 6

Tags:
What is the largest two-digit integer for which the product of its digits is $17$ more than their sum?

2004 Manhattan Mathematical Olympiad, 3

Tags:
Start with a six-digit whole number $X$, and for a new whole number $Y$, by moving the first three digits of $X$ after the last three digits. (For example, if $X = \textbf{154},377$, then $Y = 377,\textbf{154}$.) Show that, when divided by $27$, both $X$ and $Y$ give the same remainder.

2025 Azerbaijan Junior NMO, 1

A teacher creates a fraction using numbers from $1$ to $12$ (including $12$). He writes some of the numbers on the numerator, and writes $\times$ (multiplication) between each number. Then he writes the rest of the numbers in the denominator and also writes $\times$ between each number. There is at least one number both in numerator and denominator. The teacher ensures that the fraction is equal to the smallest possible integer possible. What is this positive integer, which is also the value of the fraction?

2008 Iran MO (3rd Round), 1

Let $ k>1$ be an integer. Prove that there exists infinitely many natural numbers such as $ n$ such that: \[ n|1^n\plus{}2^n\plus{}\dots\plus{}k^n\]

2010 AIME Problems, 1

Let $ N$ be the greatest integer multiple of $ 36$ all of whose digits are even and no two of whose digits are the same. Find the remainder when $ N$ is divided by $ 1000$.

1958 November Putnam, A1

Let $f(m,1)=f(1,n)=1$ for $m\geq 1, n\geq 1$ and let $f(m,n)=f(m-1, n)+ f(m, n-1) +f(m-1 ,n-1)$ for $m>1$ and $n>1$. Also let $$ S(n)= \sum_{a+b=n} f(a,b) \,\,\;\; a\geq 1 \,\, \text{and} \,\; b\geq 1.$$ Prove that $$S(n+2) =S(n) +2S(n+1) \,\, \; \text{for} \, \, n \geq 2.$$

1999 Moldova Team Selection Test, 9

Let $P(X)$ be a nonconstant polynomial with real coefficients such that for every rational number $q{}$ the equation $P(X)=q$ has no irrational solutions. Show that $P(X)$ is a first degree polynomial.

2023 Germany Team Selection Test, 3

Let $A$ be a non-empty set of integers with the following property: For each $a \in A$, there exist not necessarily distinct integers $b,c \in A$ so that $a=b+c$. (a) Proof that there are examples of sets $A$ fulfilling above property that do not contain $0$ as element. (b) Proof that there exist $a_1,\ldots,a_r \in A$ with $r \ge 1$ and $a_1+\cdots+a_r=0$. (c) Proof that there exist pairwise distinct $a_1,\ldots,a_r$ with $r \ge 1$ and $a_1+\cdots+a_r=0$.

2018 BMT Spring, 4

Tags: geometry
There are six lines in the plane. No two of them are parallel and no point lies on more than three lines. What is the minimum possible number of points that lie on at least two lines?

2022 AMC 12/AHSME, 21

Let $P(x) = x^{2022} + x^{1011} + 1$. Which of the following polynomials divides $P(x)$? $\textbf{(A)}~x^2 - x + 1\qquad\textbf{(B)}~x^2 + x + 1\qquad\textbf{(C)}~x^4 + 1\qquad\textbf{(D)}~x^6 - x^3 + 1\qquad\textbf{(E)}~x^6 + x^3 + 1$

2007 Bulgarian Autumn Math Competition, Problem 9.3

Let the intersection of the diagonals $AC$ and $BD$ of the convex quadrilateral $ABCD$ be point $E$. Let $M$ be the midpoint of $AE$ and $N$ be the midpoint of $CD$. It's known that $BD$ bisects $\angle ABC$. Prove that $ABCD$ is cyclic if and only if $MBCN$ is cyclic.

2011 Tuymaada Olympiad, 4

Tags: duke , college , geometry
The Duke of Squares left to his three sons a square estate, $100\times 100$ square miles, made up of ten thousand $1\times 1$ square mile square plots. The whole estate was divided among his sons as follows. Each son was assigned a point inside the estate. A $1\times 1$ square plot was bequeathed to the son whose assigned point was closest to the center of this square plot. Is it true that, irrespective of the choice of assigned points, each of the regions bequeathed to the sons is connected (that is, there is a path between every two of its points, never leaving the region)?

2007 All-Russian Olympiad, 5

The distance between Maykop and Belorechensk is $24$ km. Two of three friends need to reach Belorechensk from Maykop and another friend wants to reach Maykop from Belorechensk. They have only one bike, which is initially in Maykop. Each guy may go on foot (with velocity at most $6$ kmph) or on a bike (with velocity at most $18$ kmph). It is forbidden to leave a bike on a road. Prove that all of them may achieve their goals after $2$ hours $40$ minutes. (Only one guy may seat on the bike simultaneously). [i]Folclore[/i]

2006 Petru Moroșan-Trident, 2

Solve in the positive real numbers the following system. $$ \left\{\begin{matrix} x^y=2^3\\y^z=3^4\\z^x=2^4 \end{matrix}\right. $$ [i]Aurel Ene[/i]

1987 Greece National Olympiad, 2

Let $A=(\alpha_{ij})$ be a $m\,x\,n$ matric and $B=(\beta_{kl})$ be a $n\,x\, m$ matric with $m>n$ . Prove that $D(A\cdot B)=0$.

2023 Stanford Mathematics Tournament, 1

Tags: geometry
Let $A_1A_2 . . . A_{12}$ be a regular dodecagon. Equilateral triangles $\vartriangle A_1A_2B_1$, $\vartriangle A_2A_3B_2$, $. . . $, and $\vartriangle A_{12}A_1B_{12}$ are drawn such that points $B_1$, $B_2$,$ . . . $, and B_{12} lie outside dodecagon $A_1A_2 . . . A_{12}$. Then, equilateral triangles $\vartriangle A_1A_2C_1$, $\vartriangle A_2A_3C_2$, $. . .$ , and $\vartriangle A_{12}A_1C_{12}$ are drawn such that points $C_1$, $C_2$, $. . .$ , and $C_{12}$ lie inside dodecagon $A_1A_2 . . . A_{12}$. Compute the ratio of the area of dodecagon $B_1B_2 . . . B_{12}$ to the area of dodecagon $C_1C_2 . . . C_{12}$.