Found problems: 892
2004 India IMO Training Camp, 1
Let $ABCD$ be a cyclic quadrilateral. Let $P$, $Q$, $R$ be the feet of the perpendiculars from $D$ to the lines $BC$, $CA$, $AB$, respectively. Show that $PQ=QR$ if and only if the bisectors of $\angle ABC$ and $\angle ADC$ are concurrent with $AC$.
2015 IMO, 3
Let $ABC$ be an acute triangle with $AB > AC$. Let $\Gamma $ be its circumcircle, $H$ its orthocenter, and $F$ the foot of the altitude from $A$. Let $M$ be the midpoint of $BC$. Let $Q$ be the point on $\Gamma$ such that $\angle HQA = 90^{\circ}$ and let $K$ be the point on $\Gamma$ such that $\angle HKQ = 90^{\circ}$. Assume that the points $A$, $B$, $C$, $K$ and $Q$ are all different and lie on $\Gamma$ in this order.
Prove that the circumcircles of triangles $KQH$ and $FKM$ are tangent to each other.
Proposed by Ukraine
1962 IMO Shortlist, 6
Consider an isosceles triangle. let $R$ be the radius of its circumscribed circle and $r$ be the radius of its inscribed circle. Prove that the distance $d$ between the centers of these two circle is \[ d=\sqrt{R(R-2r)} \]
1979 IMO Shortlist, 15
Determine all real numbers a for which there exists positive reals $x_{1}, \ldots, x_{5}$ which satisfy the relations $ \sum_{k=1}^{5} kx_{k}=a,$ $ \sum_{k=1}^{5} k^{3}x_{k}=a^{2},$ $ \sum_{k=1}^{5} k^{5}x_{k}=a^{3}.$
1972 IMO, 1
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}
1997 IMO, 3
Let $ x_1$, $ x_2$, $ \ldots$, $ x_n$ be real numbers satisfying the conditions:
\[ \left\{\begin{array}{cccc} |x_1 \plus{} x_2 \plus{} \cdots \plus{} x_n | & \equal{} & 1 & \ \\
|x_i| & \leq & \displaystyle \frac {n \plus{} 1}{2} & \ \textrm{ for }i \equal{} 1, 2, \ldots , n. \end{array} \right.
\]
Show that there exists a permutation $ y_1$, $ y_2$, $ \ldots$, $ y_n$ of $ x_1$, $ x_2$, $ \ldots$, $ x_n$ such that
\[ | y_1 \plus{} 2 y_2 \plus{} \cdots \plus{} n y_n | \leq \frac {n \plus{} 1}{2}.
\]
1969 IMO Longlists, 55
For each of $k=1,2,3,4,5$ find necessary and sufficient conditions on $a>0$ such that there exists a tetrahedron with $k$ edges length $a$ and the remainder length $1$.
2003 IMO, 5
Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers.
Prove that
\[
\left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2.
\]
Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.
1960 IMO Shortlist, 1
Determine all three-digit numbers $N$ having the property that $N$ is divisible by 11, and $\dfrac{N}{11}$ is equal to the sum of the squares of the digits of $N$.
2013 IMO Shortlist, C7
Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$.
Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$
2020 CHMMC Winter (2020-21), 3
[i](6 pts)[/i] Find all positive integers $n \ge 3$ such that there exists a permutation $a_{1}, a_{2}, \dots, a_{n}$ of $1, 2, \dots, n$ such that $a_{1}, 2a_{2}, \dots, na_{n}$ can be rearranged into an arithmetic progression.
1986 IMO Longlists, 36
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$?
1965 IMO, 5
Consider $\triangle OAB$ with acute angle $AOB$. Thorugh a point $M \neq O$ perpendiculars are drawn to $OA$ and $OB$, the feet of which are $P$ and $Q$ respectively. The point of intersection of the altitudes of $\triangle OPQ$ is $H$. What is the locus of $H$ if $M$ is permitted to range over
a) the side $AB$;
b) the interior of $\triangle OAB$.
2011 IMO Shortlist, 8
Let $ABC$ be an acute triangle with circumcircle $\Gamma$. Let $\ell$ be a tangent line to $\Gamma$, and let $\ell_a, \ell_b$ and $\ell_c$ be the lines obtained by reflecting $\ell$ in the lines $BC$, $CA$ and $AB$, respectively. Show that the circumcircle of the triangle determined by the lines $\ell_a, \ell_b$ and $\ell_c$ is tangent to the circle $\Gamma$.
[i]Proposed by Japan[/i]
1989 IMO Shortlist, 23
A permutation $ \{x_1, x_2, \ldots, x_{2n}\}$ of the set $ \{1,2, \ldots, 2n\}$ where $ n$ is a positive integer, is said to have property $ T$ if $ |x_i \minus{} x_{i \plus{} 1}| \equal{} n$ for at least one $ i$ in $ \{1,2, \ldots, 2n \minus{} 1\}.$ Show that, for each $ n$, there are more permutations with property $ T$ than without.
2003 IMO Shortlist, 6
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.
1966 IMO Longlists, 60
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.
2009 IMO, 5
Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths
\[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\]
(A triangle is non-degenerate if its vertices are not collinear.)
[i]Proposed by Bruno Le Floch, France[/i]
1996 IMO, 2
Let $ P$ be a point inside a triangle $ ABC$ such that
\[ \angle APB \minus{} \angle ACB \equal{} \angle APC \minus{} \angle ABC.
\]
Let $ D$, $ E$ be the incenters of triangles $ APB$, $ APC$, respectively. Show that the lines $ AP$, $ BD$, $ CE$ meet at a point.
1973 IMO Shortlist, 10
Let $a_1, \ldots, a_n$ be $n$ positive numbers and $0 < q < 1.$ Determine $n$ positive numbers $b_1, \ldots, b_n$ so that:
[i]a.)[/i] $ a_{k} < b_{k}$ for all $k = 1, \ldots, n,$
[i]b.)[/i] $q < \frac{b_{k+1}}{b_{k}} < \frac{1}{q}$ for all $k = 1, \ldots, n-1,$
[i]c.)[/i] $\sum \limits^n_{k=1} b_k < \frac{1+q}{1-q} \cdot \sum \limits^n_{k=1} a_k.$
1978 IMO, 3
Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$
1965 IMO Shortlist, 4
Find all sets of four real numbers $x_1, x_2, x_3, x_4$ such that the sum of any one and the product of the other three is equal to 2.
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.
1989 IMO Shortlist, 1
$ 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$.
1991 IMO, 1
Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1.
[b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.