Olympiad problems

2006 IMO Shortlist, 6

Determine the least real number $M$ such that the inequality \[|ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2})| \leq M(a^{2}+b^{2}+c^{2})^{2}\] holds for all real numbers $a$, $b$ and $c$.

1986 IMO Shortlist, 17

Tags: geometry , rotation , Triangles , Fixed point , Equilateral Triangle , IMO , IMO 1986

Given a point $P_0$ in the plane of the triangle $A_1A_2A_3$. Define $A_s=A_{s-3}$ for all $s\ge4$. Construct a set of points $P_1,P_2,P_3,\ldots$ such that $P_{k+1}$ is the image of $P_k$ under a rotation center $A_{k+1}$ through an angle $120^o$ clockwise for $k=0,1,2,\ldots$. Prove that if $P_{1986}=P_0$, then the triangle $A_1A_2A_3$ is equilateral.

2018 IMO Shortlist, C2

Tags: IMO , imo 2018 , combinatorics , IMO Shortlist , game , game strategy

A [i]site[/i] is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones. [i]Proposed by Gurgen Asatryan, Armenia[/i]

1966 IMO Shortlist, 60

Tags: geometry , 3D geometry , tetrahedron , sphere , IMO , IMO 1966

Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space.

2003 IMO, 1

Tags: algorithm , IMO , IMO 2003 , combinatorics , greedy , independent sets , IMO Shortlist

Let $A$ be a $101$-element subset of the set $S=\{1,2,\ldots,1000000\}$. Prove that there exist numbers $t_1$, $t_2, \ldots, t_{100}$ in $S$ such that the sets \[ A_j=\{x+t_j\mid x\in A\},\qquad j=1,2,\ldots,100 \] are pairwise disjoint.

PEN A Problems, 103

Tags: modular arithmetic , Divisibility , Digits , decimal representation , IMO , IMO 1975 , digit sum

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

1996 IMO, 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$?

1971 IMO Shortlist, 2

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

2009 Indonesia TST, 2

Tags: geometry , incenter , triangle inequality , geometric inequality , angle bisector , IMO , imo 1991

Given a triangle $ \,ABC,\,$ let $ \,I\,$ be the center of its inscribed circle. The internal bisectors of the angles $ \,A,B,C\,$ meet the opposite sides in $ \,A^{\prime },B^{\prime },C^{\prime }\,$ respectively. Prove that \[ \frac {1}{4} < \frac {AI\cdot BI\cdot CI}{AA^{\prime }\cdot BB^{\prime }\cdot CC^{\prime }} \leq \frac {8}{27}. \]

1976 IMO Shortlist, 9

Tags: algebra , polynomial , recurrence relation , roots , IMO , chebyshev polynomial , imo 1976

Let $P_{1}(x)=x^{2}-2$ and $P_{j}(x)=P_{1}(P_{j-1}(x))$ for j$=2,\ldots$ Prove that for any positive integer n the roots of the equation $P_{n}(x)=x$ are all real and distinct.

2014 IMO Shortlist, G5

Tags: geometry , circumcircle , IMO , IMO 2014 , quadrilateral , tangent circles , tangent

Convex quadrilateral $ABCD$ has $\angle ABC = \angle CDA = 90^{\circ}$. Point $H$ is the foot of the perpendicular from $A$ to $BD$. Points $S$ and $T$ lie on sides $AB$ and $AD$, respectively, such that $H$ lies inside triangle $SCT$ and \[ \angle CHS - \angle CSB = 90^{\circ}, \quad \angle THC - \angle DTC = 90^{\circ}. \] Prove that line $BD$ is tangent to the circumcircle of triangle $TSH$.

1993 IMO Shortlist, 5

Tags: combinatorics , invariant , game , infinite chessboard , IMO , IMO 1993 , Hi

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

2000 IMO Shortlist, 1

Tags: function , arithmetic sequence , combinatorics , Set partition , IMO , IMO Shortlist , Hi

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?

2003 IMO, 2

Tags: number theory , IMO Shortlist , IMO

Determine all pairs of positive integers $(a,b)$ such that \[ \dfrac{a^2}{2ab^2-b^3+1} \] is a positive integer.

1986 IMO, 3

Tags: invariant , algorithm , combinatorics , pentagon , game strategy , IMO , IMO 1986

To each vertex of a regular pentagon an integer is assigned, so that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers $x,y,z$ respectively, and $y<0$, then the following operation is allowed: $x,y,z$ are replaced by $x+y,-y,z+y$ respectively. Such an operation is performed repeatedly as long as at least one of the five numbers is negative. Determine whether this procedure necessarily comes to an end after a finite number of steps.

1978 IMO Longlists, 16

Tags: rearrangement inequality , algebra , Inequality , Summation , IMO , IMO 1978

Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$

1984 IMO Shortlist, 8

Tags: geometry , combinatorial geometry , Coloring , Ramsey Theory , IMO , IMO 1984

Given points $O$ and $A$ in the plane. Every point in the plane is colored with one of a finite number of colors. Given a point $X$ in the plane, the circle $C(X)$ has center $O$ and radius $OX+{\angle AOX\over OX}$, where $\angle AOX$ is measured in radians in the range $[0,2\pi)$. Prove that we can find a point $X$, not on $OA$, such that its color appears on the circumference of the circle $C(X)$.

1999 IMO Shortlist, 1

Tags: inequalities , algebra , IMO , IMO 1999 , maximization , IMO Shortlist , Marcin Kuczma

Let $n \geq 2$ be a fixed integer. Find the least constant $C$ such the inequality \[\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C \left(\sum_{i}x_{i} \right)^4\] holds for any $x_{1}, \ldots ,x_{n} \geq 0$ (the sum on the left consists of $\binom{n}{2}$ summands). For this constant $C$, characterize the instances of equality.

1984 IMO, 3

Tags: number theory , equation , Divisibility , power of 2 , IMO , IMO 1984 , Hi

Let $a,b,c,d$ be odd integers such that $0<a<b<c<d$ and $ad=bc$. Prove that if $a+d=2^k$ and $b+c=2^m$ for some integers $k$ and $m$, then $a=1$.

1968 IMO, 3

Tags: algebra , system of equations , polynomial , IMO , IMO 1968 , Discriminant

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.

1999 IMO Shortlist, 3

Tags: geometry , symmetry , 3D geometry , reflection , IMO , IMO 1999 , Convex hull

A set $ S$ of points from the space will be called [b]completely symmetric[/b] if it has at least three elements and fulfills the condition that for every two distinct points $ A$ and $ B$ from $ S$, the perpendicular bisector plane of the segment $ AB$ is a plane of symmetry for $ S$. Prove that if a completely symmetric set is finite, then it consists of the vertices of either a regular polygon, or a regular tetrahedron or a regular octahedron.

1975 IMO Shortlist, 15

Tags: trigonometry , algebra , point set , rational , roots of unity , IMO , IMO 1975

Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?

2015 IMO Shortlist, G2

Tags: geometry , IMO Shortlist , IMO , IMO 2015 , circumcircle , Circumcenter , Triangle

Triangle $ABC$ has circumcircle $\Omega$ and circumcenter $O$. A circle $\Gamma$ with center $A$ intersects the segment $BC$ at points $D$ and $E$, such that $B$, $D$, $E$, and $C$ are all different and lie on line $BC$ in this order. Let $F$ and $G$ be the points of intersection of $\Gamma$ and $\Omega$, such that $A$, $F$, $B$, $C$, and $G$ lie on $\Omega$ in this order. Let $K$ be the second point of intersection of the circumcircle of triangle $BDF$ and the segment $AB$. Let $L$ be the second point of intersection of the circumcircle of triangle $CGE$ and the segment $CA$. Suppose that the lines $FK$ and $GL$ are different and intersect at the point $X$. Prove that $X$ lies on the line $AO$. [i]Proposed by Greece[/i]

1996 IMO, 4

Tags: modular arithmetic , number theory , Perfect Squares , IMO , IMO 1996 , quadratic reciprocity , IMO Shortlist

The positive integers $ a$ and $ b$ are such that the numbers $ 15a \plus{} 16b$ and $ 16a \minus{} 15b$ are both squares of positive integers. What is the least possible value that can be taken on by the smaller of these two squares?

1967 IMO, 1

Tags: geometry , parallelogram , trigonometry , geometric inequality , Trigonometric inequality , IMO , IMO 1967

The parallelogram $ABCD$ has $AB=a,AD=1,$ $\angle BAD=A$, and the triangle $ABD$ has all angles acute. Prove that circles radius $1$ and center $A,B,C,D$ cover the parallelogram if and only \[a\le\cos A+\sqrt3\sin A.\]