Let be any positive integer not equal to 2, 5, or 13. Show that one can find distinct , in the set such that is not a perfect square.
International Mathematical Olympiad 1986
Documents
| Year | Filename | Language | Source |
|---|---|---|---|
| 1986 | IMO-1986-problems-eng.pdf | en | — |
A triangle and a point are given in the plane. We define for all . We construct a set of points , such that is the image of under a rotation with center through angle clockwise (for ). Prove that if , then the triangle is equilateral.
To each vertex of a regular pentagon an integer is assigned in such a way that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers respectively and then the following operation is allowed: the numbers are replaced by 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 and end after a finite number of steps.
Let , be adjacent vertices of a regular -gon () in the plane having center at . A triangle , which is congruent to and initially coincides with , moves in the plane in such a way that and each trace out the whole boundary of the polygon, remaining inside the polygon. Find the locus of .
Find all functions , defined on the non-negative real numbers and taking non-negative real values, such that:
(i) for all ,
(ii) ,
(iii) for .
One is given a finite set of points in the plane, each point having integer coordinates. Is it always possible to color some of the points in the set red and the remaining points white in such a way that for any straight line parallel to either one of the coordinate axes the difference (in absolute value) between the numbers of white point and red points on is not greater than 1?