Found problems: 892
2020 IMO, 4
There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car which starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed). Determine the smallest positive integer $k$ for which one can guarantee that there are two stations that are linked by both companies.
[i]Proposed by Tejaswi Navilarekallu, India[/i]
1962 IMO Shortlist, 7
The tetrahedron $SABC$ has the following property: there exist five spheres, each tangent to the edges $SA, SB, SC, BC, CA, AB,$ or to their extensions.
a) Prove that the tetrahedron $SABC$ is regular.
b) Prove conversely that for every regular tetrahedron five such spheres exist.
1968 IMO Shortlist, 4
Let $a,b,c$ be real numbers with $a$ non-zero. It is known that the real numbers $x_1,x_2,\ldots,x_n$ satisfy the $n$ equations:
\[ ax_1^2+bx_1+c = x_{2} \]\[ ax_2^2+bx_2 +c = x_3\]\[ \ldots \quad \ldots \quad \ldots \quad \ldots\]\[ ax_n^2+bx_n+c = x_1 \] Prove that the system has [b]zero[/b], [u]one[/u] or [i]more than one[/i] real solutions if $(b-1)^2-4ac$ is [b]negative[/b], equal to [u]zero[/u] or [i]positive[/i] respectively.
1960 IMO Shortlist, 6
Consider a cone of revolution with an inscribed sphere tangent to the base of the cone. A cylinder is circumscribed about this sphere so that one of its bases lies in the base of the cone. let $V_1$ be the volume of the cone and $V_2$ be the volume of the cylinder.
a) Prove that $V_1 \neq V_2$;
b) Find the smallest number $k$ for which $V_1=kV_2$; for this case, construct the angle subtended by a diamter of the base of the cone at the vertex of the cone.
1974 IMO Longlists, 30
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.
2004 China Team Selection Test, 2
Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.
1977 IMO Longlists, 2
Find all functions $f : \mathbb{N}\rightarrow \mathbb{N}$ satisfying following condition:
\[f(n+1)>f(f(n)), \quad \forall n \in \mathbb{N}.\]
1976 IMO Shortlist, 6
A box whose shape is a parallelepiped can be completely filled with cubes of side $1.$ If we put in it the maximum possible number of cubes, each of volume $2$, with the sides parallel to those of the box, then exactly $40$ percent of the volume of the box is occupied. Determine the possible dimensions of the box.
2017 IMO Shortlist, C5
A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order:
[list=i]
[*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$
[*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$
[*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$
[/list]
Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$
[i]Proposed by Gerhard Woeginger, Austria[/i]
1970 IMO Longlists, 52
The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$.
[b]a.)[/b] Prove that $0\le b_n<2$.
[b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.
1977 IMO, 3
Let $\mathbb{N}$ be the set of positive integers. Let $f$ be a function defined on $\mathbb{N}$, which satisfies the inequality $f(n + 1) > f(f(n))$ for all $n \in \mathbb{N}$. Prove that for any $n$ we have $f(n) = n.$
1983 IMO Longlists, 6
Let $ABC$ be an equilateral triangle and $\mathcal{E}$ the set of all points contained in the three segments $AB$, $BC$, and $CA$ (including $A$, $B$, and $C$). Determine whether, for every partition of $\mathcal{E}$ into two disjoint subsets, at least one of the two subsets contains the vertices of a right-angled triangle.
2018 IMO Shortlist, G1
Let $\Gamma$ be the circumcircle of acute triangle $ABC$. Points $D$ and $E$ are on segments $AB$ and $AC$ respectively such that $AD = AE$. The perpendicular bisectors of $BD$ and $CE$ intersect minor arcs $AB$ and $AC$ of $\Gamma$ at points $F$ and $G$ respectively. Prove that lines $DE$ and $FG$ are either parallel or they are the same line.
[i]Proposed by Silouanos Brazitikos, Evangelos Psychas and Michael Sarantis, Greece[/i]
2000 IMO, 3
Let $ n \geq 2$ be a positive integer and $ \lambda$ a positive real number. Initially there are $ n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $ A$ and $ B$, with $ A$ to the left of $ B$, and letting the flea from $ A$ jump over the flea from $ B$ to the point $ C$ so that $ \frac {BC}{AB} \equal{} \lambda$.
Determine all values of $ \lambda$ such that, for any point $ M$ on the line and for any initial position of the $ n$ fleas, there exists a sequence of moves that will take them all to the position right of $ M$.
2008 IMO, 1
Let $ H$ be the orthocenter of an acute-angled triangle $ ABC$. The circle $ \Gamma_{A}$ centered at the midpoint of $ BC$ and passing through $ H$ intersects the sideline $ BC$ at points $ A_{1}$ and $ A_{2}$. Similarly, define the points $ B_{1}$, $ B_{2}$, $ C_{1}$ and $ C_{2}$.
Prove that the six points $ A_{1}$, $ A_{2}$, $ B_{1}$, $ B_{2}$, $ C_{1}$ and $ C_{2}$ are concyclic.
[i]Author: Andrey Gavrilyuk, Russia[/i]
1992 IMO Longlists, 26
Let $\,{\mathbb{R}}\,$ denote the set of all real numbers. Find all functions $\,f: {\mathbb{R}}\rightarrow {\mathbb{R}}\,$ such that \[ f\left( x^{2}+f(y)\right) =y+\left( f(x)\right) ^{2}\hspace{0.2in}\text{for all}\,x,y\in \mathbb{R}. \]
1997 IMO, 1
In the plane the points with integer coordinates are the vertices of unit squares. The squares are coloured alternately black and white (as on a chessboard). For any pair of positive integers $ m$ and $ n$, consider a right-angled triangle whose vertices have integer coordinates and whose legs, of lengths $ m$ and $ n$, lie along edges of the squares. Let $ S_1$ be the total area of the black part of the triangle and $ S_2$ be the total area of the white part. Let $ f(m,n) \equal{} | S_1 \minus{} S_2 |$.
a) Calculate $ f(m,n)$ for all positive integers $ m$ and $ n$ which are either both even or both odd.
b) Prove that $ f(m,n) \leq \frac 12 \max \{m,n \}$ for all $ m$ and $ n$.
c) Show that there is no constant $ C\in\mathbb{R}$ such that $ f(m,n) < C$ for all $ m$ and $ n$.
1972 IMO Longlists, 27
Given $n>4$, prove that every cyclic quadrilateral can be dissected into $n$ cyclic quadrilaterals.
1984 IMO Shortlist, 12
Find one pair of positive integers $a,b$ such that $ab(a+b)$ is not divisible by $7$, but $(a+b)^7-a^7-b^7$ is divisible by $7^7$.
1970 IMO Shortlist, 10
The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$.
[b]a.)[/b] Prove that $0\le b_n<2$.
[b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.
1985 IMO Shortlist, 4
Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that:
[i](i)[/i] $i$ and $n - i$ always receive the same color, and
[i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$
Prove that all numbers in $N$ must receive the same color.
1968 IMO, 2
Find all natural numbers $n$ the product of whose decimal digits is $n^2-10n-22$.
1989 IMO, 2
$ ABC$ is a triangle, the bisector of angle $ A$ meets the circumcircle of triangle $ ABC$ in $ A_1$, points $ B_1$ and $ C_1$ are defined similarly. Let $ AA_1$ meet the lines that bisect the two external angles at $ B$ and $ C$ in $ A_0$. Define $ B_0$ and $ C_0$ similarly. Prove that the area of triangle $ A_0B_0C_0 \equal{} 2 \cdot$ area of hexagon $ AC_1BA_1CB_1 \geq 4 \cdot$ area of triangle $ ABC$.
2010 IMO Shortlist, 4
Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed
Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$;
Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$.
Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins.
[i]Proposed by Hans Zantema, Netherlands[/i]
2005 IMO, 6
In a mathematical competition, in which $6$ problems were posed to the participants, every two of these problems were solved by more than $\frac 25$ of the contestants. Moreover, no contestant solved all the $6$ problems. Show that there are at least $2$ contestants who solved exactly $5$ problems each.
[i]Radu Gologan and Dan Schwartz[/i]