Found problems: 892
1994 IMO Shortlist, 4
Let $ ABC$ be an isosceles triangle with $ AB \equal{} AC$. $ M$ is the midpoint of $ BC$ and $ O$ is the point on the line $ AM$ such that $ OB$ is perpendicular to $ AB$. $ Q$ is an arbitrary point on $ BC$ different from $ B$ and $ C$. $ E$ lies on the line $ AB$ and $ F$ lies on the line $ AC$ such that $ E, Q, F$ are distinct and collinear. Prove that $ OQ$ is perpendicular to $ EF$ if and only if $ QE \equal{} QF$.
1996 IMO Shortlist, 2
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?
1984 IMO Longlists, 40
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$.
2011 IMO Shortlist, 1
Let $n > 0$ be an integer. We are given a balance and $n$ weights of weight $2^0, 2^1, \cdots, 2^{n-1}$. We are to place each of the $n$ weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed.
Determine the number of ways in which this can be done.
[i]Proposed by Morteza Saghafian, Iran[/i]
2000 IMO, 6
Let $ AH_1, BH_2, CH_3$ be the altitudes of an acute angled triangle $ ABC$. Its incircle touches the sides $ BC, AC$ and $ AB$ at $ T_1, T_2$ and $ T_3$ respectively. Consider the symmetric images of the lines $ H_1H_2, H_2H_3$ and $ H_3H_1$ with respect to the lines $ T_1T_2, T_2T_3$ and $ T_3T_1$. Prove that these images form a triangle whose vertices lie on the incircle of $ ABC$.
1987 IMO, 2
In an acute-angled triangle $ABC$ the interior bisector of angle $A$ meets $BC$ at $L$ and meets the circumcircle of $ABC$ again at $N$. From $L$ perpendiculars are drawn to $AB$ and $AC$, with feet $K$ and $M$ respectively. Prove that the quadrilateral $AKNM$ and the triangle $ABC$ have equal areas.
2023 ISL, C3
Let $n$ be a positive integer. A [i]Japanese triangle[/i] consists of $1 + 2 + \dots + n$ circles arranged in an equilateral triangular shape such that for each $i = 1$, $2$, $\dots$, $n$, the $i^{th}$ row contains exactly $i$ circles, exactly one of which is coloured red. A [i]ninja path[/i] in a Japanese triangle is a sequence of $n$ circles obtained by starting in the top row, then repeatedly going from a circle to one of the two circles immediately below it and finishing in the bottom row. Here is an example of a Japanese triangle with $n = 6$, along with a ninja path in that triangle containing two red circles.
[asy]
// credit to vEnhance for the diagram (which was better than my original asy):
size(4cm);
pair X = dir(240); pair Y = dir(0);
path c = scale(0.5)*unitcircle;
int[] t = {0,0,2,2,3,0};
for (int i=0; i<=5; ++i) {
for (int j=0; j<=i; ++j) {
filldraw(shift(i*X+j*Y)*c, (t[i]==j) ? lightred : white);
draw(shift(i*X+j*Y)*c);
}
}
draw((0,0)--(X+Y)--(2*X+Y)--(3*X+2*Y)--(4*X+2*Y)--(5*X+2*Y),linewidth(1.5));
path q = (3,-3sqrt(3))--(-3,-3sqrt(3));
draw(q,Arrows(TeXHead, 1));
label("$n = 6$", q, S);
label("$n = 6$", q, S);
[/asy]
In terms of $n$, find the greatest $k$ such that in each Japanese triangle there is a ninja path containing at least $k$ red circles.
2016 IMO Shortlist, C7
There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time.
(a) Prove that Geoff can always fulfill his wish if $n$ is odd.
(b) Prove that Geoff can never fulfill his wish if $n$ is even.
1982 IMO, 3
Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$.
[b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \]
[b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]
1983 IMO Longlists, 50
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?
1982 IMO, 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)$.
1973 IMO Shortlist, 11
Determine the minimum value of $a^{2} + b^{2}$ when $(a,b)$ traverses all the pairs of real numbers for which the equation \[ x^{4} + ax^{3} + bx^{2} + ax + 1 = 0 \] has at least one real root.
2003 IMO, 3
Each pair of opposite sides of a convex hexagon has the following property: the distance between their midpoints is equal to $\dfrac{\sqrt{3}}{2}$ times the sum of their lengths. Prove that all the angles of the hexagon are equal.
2010 IMO, 1
Find all function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following equality holds \[
f(\left\lfloor x\right\rfloor y)=f(x)\left\lfloor f(y)\right\rfloor \] where $\left\lfloor a\right\rfloor $ is greatest integer not greater than $a.$
[i]Proposed by Pierre Bornsztein, France[/i]
1985 IMO, 1
A circle has center on the side $AB$ of the cyclic quadrilateral $ABCD$. The other three sides are tangent to the circle. Prove that $AD+BC=AB$.
1971 IMO Shortlist, 5
Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.
1972 IMO Longlists, 44
Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.
1978 IMO, 1
In a triangle $ABC$ we have $AB = AC.$ A circle which is internally tangent with the circumscribed circle of the triangle is also tangent to the sides $AB, AC$ in the points $P,$ respectively $Q.$ Prove that the midpoint of $PQ$ is the center of the inscribed circle of the triangle $ABC.$
1986 IMO Shortlist, 5
Let $d$ be any positive integer not equal to $2, 5$ or $13$. Show that one can find distinct $a,b$ in the set $\{2,5,13,d\}$ such that $ab-1$ is not a perfect square.
2004 IMO, 6
We call a positive integer [i]alternating[/i] if every two consecutive digits in its decimal representation are of different parity.
Find all positive integers $n$ such that $n$ has a multiple which is alternating.
1994 IMO, 2
Let $ ABC$ be an isosceles triangle with $ AB \equal{} AC$. $ M$ is the midpoint of $ BC$ and $ O$ is the point on the line $ AM$ such that $ OB$ is perpendicular to $ AB$. $ Q$ is an arbitrary point on $ BC$ different from $ B$ and $ C$. $ E$ lies on the line $ AB$ and $ F$ lies on the line $ AC$ such that $ E, Q, F$ are distinct and collinear. Prove that $ OQ$ is perpendicular to $ EF$ if and only if $ QE \equal{} QF$.
1978 IMO, 1
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.
1998 IMO, 1
A convex quadrilateral $ABCD$ has perpendicular diagonals. The perpendicular bisectors of the sides $AB$ and $CD$ meet at a unique point $P$ inside $ABCD$. Prove that the quadrilateral $ABCD$ is cyclic if and only if triangles $ABP$ and $CDP$ have equal areas.
1980 IMO, 17
Ten gamblers start playing with the same amount of money. In turn they cast five dice. If the dice show a total of $n$, the player must pay each other player $\frac{1}{n}$ times the sum which that player owns at the moment. They throw and pay one after the other. At the $10^{\text{th}}$ round (i.e. after each player has cast the five die once), the dice shows a total of $12$ and after the payment it turns out that every player has exactly the same sum as he had in the beginning. Is it possible to determine the totals shown by the dice at the nine former rounds?
1997 IMO Shortlist, 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$.