Found problems: 476
2011 India IMO Training Camp, 2
Let the real numbers $a,b,c,d$ satisfy the relations $a+b+c+d=6$ and $a^2+b^2+c^2+d^2=12.$ Prove that
\[36 \leq 4 \left(a^3+b^3+c^3+d^3\right) - \left(a^4+b^4+c^4+d^4 \right) \leq 48.\]
[i]Proposed by Nazar Serdyuk, Ukraine[/i]
2023 USEMO, 1
A positive integer $n$ is called [i]beautiful[/i] if, for every integer $4 \le b \le 10000$, the base-$b$ representation of $n$ contains the consecutive digits $2$, $0$, $2$, $3$ (in this order, from left to right). Determine whether the set of all beautiful integers is finite.
[i]Oleg Kryzhanovsky[/i]
2016 Iran Team Selection Test, 1
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
2017 Brazil Team Selection Test, 4
Find all functions $f:(0,\infty)\rightarrow (0,\infty)$ such that for any $x,y\in (0,\infty)$, $$xf(x^2)f(f(y)) + f(yf(x)) = f(xy) \left(f(f(x^2)) + f(f(y^2))\right).$$
2010 IMO Shortlist, 6
Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$
[i]Proposed by Alex Schreiber, Germany[/i]
2023 USAJMO Solutions by peace09, 3
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$.
[i]Proposed by Holden Mui[/i]
2018 APMO, 4
Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.
2016 USAMO, 2
Prove that for any positive integer $k$, \[(k^2)!\cdot\displaystyle\prod_{j=0}^{k-1}\frac{j!}{(j+k)!}\]is an integer.
2020 SIME, 14
Let $P(x) = x^3 - 3x^2 + 3$. For how many positive integers $n < 1000$ does there not exist a pair $(a, b)$ of positive integers such that the equation
\[ \underbrace{P(P(\dots P}_{a \text{ times}}(x)\dots))=\underbrace{P(P(\dots P}_{b \text{ times}}(x)\dots))\]
has exactly $n$ distinct real solutions?
1998 USAMO, 4
A computer screen shows a $98 \times 98$ chessboard, colored in the usual way. One can select with a mouse any rectangle with sides on the lines of the chessboard and click the mouse button: as a result, the colors in the selected rectangle switch (black becomes white, white becomes black). Find, with proof, the minimum number of mouse clicks needed to make the chessboard all one color.
2010 USAMO, 6
A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer $k$ at most one of the pairs $(k, k)$ and $(-k, -k)$ is written on the blackboard. A student erases some of the 136 integers, subject to the condition that no two erased integers may add to 0. The student then scores one point for each of the 68 pairs in which at least one integer is erased. Determine, with proof, the largest number $N$ of points that the student can guarantee to score regardless of which 68 pairs have been written on the board.
2022 USEMO, 1
A [i]stick[/i] is defined as a $1 \times k$ or $k\times 1$ rectangle for any integer $k \ge 1$. We wish to partition the cells of a $2022 \times 2022$ chessboard into $m$ non-overlapping sticks, such that any two of these $m$ sticks share at most one unit of perimeter. Determine the smallest $m$ for which this is possible.
[i]Holden Mui[/i]
2024 USA IMO Team Selection Test, 3
Let $n>k \geq 1$ be integers and let $p$ be a prime dividing $\tbinom{n}{k}$. Prove that the $k$-element subsets of $\{1,\ldots,n\}$ can be split into $p$ classes of equal size, such that any two subsets with the same sum of elements belong to the same class.
[i]Ankan Bhattacharya[/i]
EGMO 2017, 2
Find the smallest positive integer $k$ for which there exists a colouring of the positive integers $\mathbb{Z}_{>0}$ with $k$ colours and a function $f:\mathbb{Z}_{>0}\to \mathbb{Z}_{>0}$ with the following two properties:
$(i)$ For all positive integers $m,n$ of the same colour, $f(m+n)=f(m)+f(n).$
$(ii)$ There are positive integers $m,n$ such that $f(m+n)\ne f(m)+f(n).$
[i]In a colouring of $\mathbb{Z}_{>0}$ with $k$ colours, every integer is coloured in exactly one of the $k$ colours. In both $(i)$ and $(ii)$ the positive integers $m,n$ are not necessarily distinct.[/i]
2023 USA TSTST, 4
Let $n\ge 3$ be an integer and let $K_n$ be the complete graph on $n$ vertices. Each edge of $K_n$ is colored either red, green, or blue. Let $A$ denote the number of triangles in $K_n$ with all edges of the same color, and let $B$ denote the number of triangles in $K_n$ with all edges of different colors. Prove
\[ B\le 2A+\frac{n(n-1)}{3}.\]
(The [i]complete graph[/i] on $n$ vertices is the graph on $n$ vertices with $\tbinom n2$ edges, with exactly one edge joining every pair of vertices. A [i]triangle[/i] consists of the set of $\tbinom 32=3$ edges between $3$ of these $n$ vertices.)
[i]Proposed by Ankan Bhattacharya[/i]
2008 Germany Team Selection Test, 2
The diagonals of a trapezoid $ ABCD$ intersect at point $ P$. Point $ Q$ lies between the parallel lines $ BC$ and $ AD$ such that $ \angle AQD \equal{} \angle CQB$, and line $ CD$ separates points $ P$ and $ Q$. Prove that $ \angle BQP \equal{} \angle DAQ$.
[i]Author: Vyacheslav Yasinskiy, Ukraine[/i]
2022 Germany Team Selection Test, 2
Let $ABCD$ be a parallelogram with $AC=BC.$ A point $P$ is chosen on the extension of ray $AB$ past $B.$ The circumcircle of $ACD$ meets the segment $PD$ again at $Q.$ The circumcircle of triangle $APQ$ meets the segment $PC$ at $R.$ Prove that lines $CD,AQ,BR$ are concurrent.
2014 India IMO Training Camp, 2
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
2022 Indonesia MO, 8
Determine the smallest positive real $K$ such that the inequality
\[ K + \frac{a + b + c}{3} \ge (K + 1) \sqrt{\frac{a^2 + b^2 + c^2}{3}} \]holds for any real numbers $0 \le a,b,c \le 1$.
[i]Proposed by Fajar Yuliawan, Indonesia[/i]
Russian TST 2018, P2
An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ [i]Shiny[/i] if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have
$$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$
Find the largest constant $K = K(n)$ such that
$$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$
holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.
2019 USEMO, 4
Prove that for any prime $p,$ there exists a positive integer $n$ such that
\[1^n+2^{n-1}+3^{n-2}+\cdots+n^1\equiv 2020\pmod{p}.\]
[i]Robin Son[/i]
2019 China National Olympiad, 1
Let $a,b,c,d,e\geq -1$ and $a+b+c+d+e=5.$ Find the maximum and minimum value of $S=(a+b)(b+c)(c+d)(d+e)(e+a).$
2007 Canada National Olympiad, 5
Let the incircle of triangle $ ABC$ touch sides $ BC,\, CA$ and $ AB$ at $ D,\, E$ and $ F,$ respectively. Let $ \omega,\,\omega_{1},\,\omega_{2}$ and $ \omega_{3}$ denote the circumcircles of triangle $ ABC,\, AEF,\, BDF$ and $ CDE$ respectively.
Let $ \omega$ and $ \omega_{1}$ intersect at $ A$ and $ P,\,\omega$ and $ \omega_{2}$ intersect at $ B$ and $ Q,\,\omega$ and $ \omega_{3}$ intersect at $ C$ and $ R.$
$ a.$ Prove that $ \omega_{1},\,\omega_{2}$ and $ \omega_{3}$ intersect in a common point.
$ b.$ Show that $ PD,\, QE$ and $ RF$ are concurrent.
2008 Brazil Team Selection Test, 1
Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$.
[i]Author: Dan Brown, Canada[/i]
2021 Peru Iberoamerican Team Selection Test, P1
Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$