Found problems: 892
1970 IMO Shortlist, 12
Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.
1982 IMO Shortlist, 16
Prove that if $n$ is a positive integer such that the equation \[ x^3-3xy^2+y^3=n \] has a solution in integers $x,y$, then it has at least three such solutions. Show that the equation has no solutions in integers for $n=2891$.
1987 IMO Shortlist, 16
Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.[i](IMO Problem 1)[/i]
[b][i]Original formulation [/i][/b]
Let $S$ be a set of $n$ elements. We denote the number of all permutations of $S$ that have exactly $k$ fixed points by $p_n(k).$ Prove:
(a) $\sum_{k=0}^{n} kp_n(k)=n! \ ;$
(b) $\sum_{k=0}^{n} (k-1)^2 p_n(k) =n! $
[i]Proposed by Germany, FR[/i]
2007 IMO, 1
Real numbers $ a_{1}$, $ a_{2}$, $ \ldots$, $ a_{n}$ are given. For each $ i$, $ (1 \leq i \leq n )$, define
\[ d_{i} \equal{} \max \{ a_{j}\mid 1 \leq j \leq i \} \minus{} \min \{ a_{j}\mid i \leq j \leq n \}
\]
and let $ d \equal{} \max \{d_{i}\mid 1 \leq i \leq n \}$.
(a) Prove that, for any real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$,
\[ \max \{ |x_{i} \minus{} a_{i}| \mid 1 \leq i \leq n \}\geq \frac {d}{2}. \quad \quad (*)
\]
(b) Show that there are real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$ such that the equality holds in (*).
[i]Author: Michael Albert, New Zealand[/i]
1966 IMO, 2
Let $a,b,c$ be the lengths of the sides of a triangle, and $\alpha, \beta, \gamma$ respectively, the angles opposite these sides. Prove that if \[ a+b=\tan{\frac{\gamma}{2}}(a\tan{\alpha}+b\tan{\beta}) \] the triangle is isosceles.
1978 IMO Shortlist, 3
Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.
1959 IMO Shortlist, 6
Two planes, $P$ and $Q$, intersect along the line $p$. The point $A$ is given in the plane $P$, and the point $C$ in the plane $Q$; neither of these points lies on the straight line $p$. Construct an isosceles trapezoid $ABCD$ (with $AB \parallel CD$) in which a circle can be inscribed, and with vertices $B$ and $D$ lying in planes $P$ and $Q$ respectively.
1963 IMO, 4
Find all solutions $x_1, x_2, x_3, x_4, x_5$ of the system \[ x_5+x_2=yx_1 \] \[ x_1+x_3=yx_2 \] \[ x_2+x_4=yx_3 \] \[ x_3+x_5=yx_4 \] \[ x_4+x_1=yx_5 \] where $y$ is a parameter.
2018 IMO, 3
An [i]anti-Pascal[/i] triangle is an equilateral triangular array of numbers such that, except for the numbers in the bottom row, each number is the absolute value of the difference of the two numbers immediately below it. For example, the following is an anti-Pascal triangle with four rows which contains every integer from $1$ to $10$.
\[\begin{array}{
c@{\hspace{4pt}}c@{\hspace{4pt}}
c@{\hspace{4pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{4pt}}c
} \vspace{4pt}
& & & 4 & & & \\\vspace{4pt}
& & 2 & & 6 & & \\\vspace{4pt}
& 5 & & 7 & & 1 & \\\vspace{4pt}
8 & & 3 & & 10 & & 9 \\\vspace{4pt}
\end{array}\]
Does there exist an anti-Pascal triangle with $2018$ rows which contains every integer from $1$ to $1 + 2 + 3 + \dots + 2018$?
[i]Proposed by Morteza Saghafian, Iran[/i]
2020 IMO, 5
A deck of $n > 1$ cards is given. A positive integer is written on each card. The deck has the property that the arithmetic mean of the numbers on each pair of cards is also the geometric mean of the numbers on some collection of one or more cards.
For which $n$ does it follow that the numbers on the cards are all equal?
[i]Proposed by Oleg Košik, Estonia[/i]
1967 IMO Shortlist, 1
Prove that a tetrahedron with just one edge length greater than $1$ has volume at most $ \frac{1}{8}.$
1999 IMO, 4
Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.
2006 IMO Shortlist, 4
Let $P(x)$ be a polynomial of degree $n > 1$ with integer coefficients and let $k$ be a positive integer. Consider the polynomial $Q(x) = P(P(\ldots P(P(x)) \ldots ))$, where $P$ occurs $k$ times. Prove that there are at most $n$ integers $t$ such that $Q(t) = t$.
1976 IMO, 2
We consider the following system
with $q=2p$:
\[\begin{matrix} a_{11}x_{1}+\ldots+a_{1q}x_{q}=0,\\ a_{21}x_{1}+\ldots+a_{2q}x_{q}=0,\\ \ldots ,\\ a_{p1}x_{1}+\ldots+a_{pq}x_{q}=0,\\ \end{matrix}\]
in which every coefficient is an element from the set $\{-1,0,1\}$$.$ Prove that there exists a solution $x_{1}, \ldots,x_{q}$ for the system with the properties:
[b]a.)[/b] all $x_{j}, j=1,\ldots,q$ are integers$;$
[b]b.)[/b] there exists at least one j for which $x_{j} \neq 0;$
[b]c.)[/b] $|x_{j}| \leq q$ for any $j=1, \ldots ,q.$
2001 IMO Shortlist, 5
Let $a > b > c > d$ be positive integers and suppose that \[ ac + bd = (b+d+a-c)(b+d-a+c). \] Prove that $ab + cd$ is not prime.
1981 IMO Shortlist, 12
Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.
2019 IMO Shortlist, C3
The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations.
(a) Show that, for each initial configuration, Harry stops after a finite number of operations.
(b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$.
[i]Proposed by David Altizio, USA[/i]
1970 IMO Shortlist, 4
Find all positive integers $n$ such that the set $\{n,n+1,n+2,n+3,n+4,n+5\}$ can be partitioned into two subsets so that the product of the numbers in each subset is equal.
1969 IMO, 6
Given real numbers $x_1,x_2,y_1,y_2,z_1,z_2$ satisfying $x_1>0,x_2>0,x_1y_1>z_1^2$, and $x_2y_2>z_2^2$, prove that: \[ {8\over(x_1+x_2)(y_1+y_2)-(z_1+z_2)^2}\le{1\over x_1y_1-z_1^2}+{1\over x_2y_2-z_2^2}. \] Give necessary and sufficient conditions for equality.
1972 IMO, 2
$f$ and $g$ are real-valued functions defined on the real line. For all $x$ and $y, f(x+y)+f(x-y)=2f(x)g(y)$. $f$ is not identically zero and $|f(x)|\le1$ for all $x$. Prove that $|g(x)|\le1$ for all $x$.
1998 IMO, 6
Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$,
\[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]
1976 IMO Longlists, 13
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$
2014 IMO Shortlist, A1
Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that
\[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\]
[i]Proposed by Gerhard Wöginger, Austria.[/i]
1983 IMO, 2
Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?
2006 IMO, 6
Assign to each side $b$ of a convex polygon $P$ the maximum area of a triangle that has $b$ as a side and is contained in $P$. Show that the sum of the areas assigned to the sides of $P$ is at least twice the area of $P$.