Olympiad problems

1982 IMO Shortlist, 1

The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.

2007 IMO Shortlist, 7

Tags: algebra , 3D geometry , nullstellensatz , IMO , IMO 2007 , IMO Shortlist , Gerhard Woeginger

Let $ n$ be a positive integer. Consider \[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \} \] as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$. [i]Author: Gerhard Wöginger, Netherlands [/i]

1970 IMO, 3

Tags: acute , Triangle , point set , counting , combinatorial geometry , IMO , IMO 1970

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

2005 IMO Shortlist, 2

Tags: counting , IMO , IMO 2005 , number theory , combinatorics , IMO Shortlist , Hi

Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.

2018 IMO, 6

Tags: IMO , imo 2018 , geometry , IMO Shortlist , isogonal conjugates , symmedian

A convex quadrilateral $ABCD$ satisfies $AB\cdot CD = BC\cdot DA$. Point $X$ lies inside $ABCD$ so that \[\angle{XAB} = \angle{XCD}\quad\,\,\text{and}\quad\,\,\angle{XBC} = \angle{XDA}.\] Prove that $\angle{BXA} + \angle{DXC} = 180^\circ$. [i]Proposed by Tomasz Ciesla, Poland[/i]

2002 IMO Shortlist, 1

Tags: IMO , combinatorics

Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.

1971 IMO Longlists, 8

Tags: geometry , combinatorial geometry , euclidean distance , point set , IMO , IMO 1971

Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.

2020 IMO Shortlist, A4

Tags: inequalities , IMO 2020 , IMO , algebra , IMO Shortlist 2020 , Mount Inquality , Hi

The real numbers $a, b, c, d$ are such that $a\geq b\geq c\geq d>0$ and $a+b+c+d=1$. Prove that \[(a+2b+3c+4d)a^ab^bc^cd^d<1\] [i]Proposed by Stijn Cambie, Belgium[/i]

2006 IMO Shortlist, 2

Tags: combinatorics , polygon , Extremal combinatorics , IMO , IMO 2006 , IMO Shortlist , Dusan Djukic

Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i]. Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

2018 IMO, 1

Tags: geometry , IMO , imo 2018 , IMO P1 , 2018

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]

1972 IMO Shortlist, 1

Tags: function , algebra , functional equation , Functional inequality , IMO , IMO 1972

$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$.

2011 IMO, 5

Tags: function , symmetry , modular arithmetic , number theory , IMO , IMO Shortlist , Hi

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$. [i]Proposed by Mahyar Sefidgaran, Iran[/i]

1986 IMO, 3

Tags: graph theory , combinatorics , IMO , Coloring , Ramsey Theory , Extremal combinatorics , IMO 1986

Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?

1992 IMO, 1

Tags: number theory , IMO

Find all integers $\,a,b,c\,$ with $\,1<a<b<c\,$ such that \[ (a-1)(b-1)(c-1) \] is a divisor of $abc-1.$

1981 IMO, 2

Tags: geometry , incenter , circumcircle , similar triangles , IMO , IMO 1981

Three circles of equal radius have a common point $O$ and lie inside a given triangle. Each circle touches a pair of sides of the triangle. Prove that the incenter and the circumcenter of the triangle are collinear with the point $O$.

2020 IMO, 6

Tags: IMO 2020 , IMO , combinatorial geometry , combinatorics , geometry , IMO Shortlist , IMO Shortlist 2020

Prove that there exists a positive constant $c$ such that the following statement is true: Consider an integer $n > 1$, and a set $\mathcal S$ of $n$ points in the plane such that the distance between any two different points in $\mathcal S$ is at least 1. It follows that there is a line $\ell$ separating $\mathcal S$ such that the distance from any point of $\mathcal S$ to $\ell$ is at least $cn^{-1/3}$. (A line $\ell$ separates a set of points S if some segment joining two points in $\mathcal S$ crosses $\ell$.) [i]Note. Weaker results with $cn^{-1/3}$ replaced by $cn^{-\alpha}$ may be awarded points depending on the value of the constant $\alpha > 1/3$.[/i] [i]Proposed by Ting-Feng Lin and Hung-Hsun Hans Yu, Taiwan[/i]

1987 IMO Shortlist, 20

Tags: number theory , polynomial , prime numbers , quadratics , IMO Shortlist , IMO , IMO 1987

Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.[i](IMO Problem 6)[/i] [b][i]Original Formulation[/i][/b] Let $f(x) = x^2 + x + p$, $p \in \mathbb N.$ Prove that if the numbers $f(0), f(1), \cdots , f(\sqrt{p\over 3} )$ are primes, then all the numbers $f(0), f(1), \cdots , f(p - 2)$ are primes. [i]Proposed by Soviet Union. [/i]

1988 IMO Shortlist, 9

Tags: number theory , Divisibility , Diophantine equation , Perfect Square , Vieta Jumping , IMO , IMO 1988

Let $ a$ and $ b$ be two positive integers such that $ a \cdot b \plus{} 1$ divides $ a^{2} \plus{} b^{2}$. Show that $ \frac {a^{2} \plus{} b^{2}}{a \cdot b \plus{} 1}$ is a perfect square.

1962 IMO, 7

Tags: geometry , 3D geometry , tetrahedron , sphere , incenter , IMO , IMO 1962

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.

1964 IMO, 4

Tags: combinatorics , Ramsey Theory , Coloring , graph theory , IMO , IMO 1964 , Extremal combinatorics

Seventeen people correspond by mail with one another-each one with all the rest. In their letters only three different topics are discussed. each pair of correspondents deals with only one of these topics. Prove that there are at least three people who write to each other about the same topic.

2007 Singapore MO Open, 1

Tags: pigeonhole principle , n-variable inequality , IMO , IMO 1987 , algebra , combinatorics

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.

1996 IMO Shortlist, 1

Tags: rectangle , combinatorics , graph theory , IMO , IMO 1996 , modular arithmetic , IMO Shortlist

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

2014 IMO, 2

Tags: pigeonhole principle , IMO , IMO 2014 , combinatorics , IMO Shortlist , global

Let $n \ge 2$ be an integer. Consider an $n \times n$ chessboard consisting of $n^2$ unit squares. A configuration of $n$ rooks on this board is [i]peaceful[/i] if every row and every column contains exactly one rook. Find the greatest positive integer $k$ such that, for each peaceful configuration of $n$ rooks, there is a $k \times k$ square which does not contain a rook on any of its $k^2$ unit squares.

2004 IMO Shortlist, 4

Tags: algebra , polynomial , functional equation , IMO , IMO 2004 , hojoo lee , Hi

Find all polynomials $f$ with real coefficients such that for all reals $a,b,c$ such that $ab+bc+ca = 0$ we have the following relations \[ f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c). \]

2002 IMO, 3

Tags: algebra , polynomial , IMO , IMO 2002 , IMO Shortlist , Laurentiu Panaitopol

Find all pairs of positive integers $m,n\geq3$ for which there exist infinitely many positive integers $a$ such that \[ \frac{a^m+a-1}{a^n+a^2-1} \] is itself an integer. [i]Laurentiu Panaitopol, Romania[/i]