International Competitions IMO Longlists 1987 - Art of Problem Solving
International Competitions IMO Longlists 1987 - Art of Problem Solving
International Competitions IMO Longlists 1987 - Art of Problem Solving
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
1 Let x 1 , x 2 , · · · , x n be n integers. Let n = p + q, where p and q are positive integers. For<br />
i = 1, 2, · · · , n, put<br />
S i = x i + x i+1 + · · · + x i+p−1 and T i = x i+p + x i+p+1 + · · · + x i+n−1<br />
(it is assumed that x i+n = x i for all i). Next, let m(a, b) be the number <strong>of</strong> indices i for which<br />
S i leaves the remainder a and T i leaves the remainder b on division by 3, where a, b ∈ {0, 1, 2}.<br />
Show that m(1, 2) and m(2, 1) leave the same remainder when divided by 3.<br />
2 Suppose we have a pack <strong>of</strong> 2n cards, in the order 1, 2, ..., 2n. A perfect shuffle <strong>of</strong> these cards<br />
changes the order to n + 1, 1, n + 2, 2, ..., n − 1, 2n, n ; i.e., the cards originally in the first<br />
n positions have been moved to the places 2, 4, ..., 2n, while the remaining n cards, in their<br />
original order, fill the odd positions 1, 3, ..., 2n − 1. Suppose we start with the cards in the<br />
above order 1, 2, ..., 2n and then successively apply perfect shuffles. What conditions on the<br />
number n are necessary for the cards eventually to return to their original order? Justify<br />
your answer.<br />
[hide=”Remark”] Remark. This problem is trivial. Alternatively, it may be required to find<br />
the least number <strong>of</strong> shuffles after which the cards will return to the original order.<br />
3 A town has a road network that consists entirely <strong>of</strong> one-way streets that are used for bus<br />
routes. Along these routes, bus stops have been set up. If the one-way signs permit travel<br />
from bus stop X to bus stop Y ≠ X, then we shall say Y can be reached from X. We shall<br />
use the phrase Y comes after X when we wish to express that every bus stop from which<br />
the bus stop X can be reached is a bus stop from which the bus stop Y can be reached, and<br />
every bus stop that can be reached from Y can also be reached from X. A visitor to this<br />
town discovers that if X and Y are any two different bus stops, then the two sentences Y can<br />
be reached from X and Y comes after X have exactly the same meaning in this town. Let A<br />
and B be two bus stops. Show that <strong>of</strong> the following two statements, exactly one is true: (i)<br />
B can be reached from A; (ii) A can be reached from B.<br />
4 Let a 1 , a 2 , a 3 , b 1 , b 2 , b 3 be positive real numbers. Prove that<br />
(a 1 b 2 + a 2 b 1 + a 1 b 3 + a 3 b 1 + a 2 b 3 + a 3 b 2 ) 2 ≥ 4(a 1 a 2 + a 2 a 3 + a 3 a 1 )(b 1 b 2 + b 2 b 3 + b 3 b 1 )<br />
and show that the two sides <strong>of</strong> the inequality are equal if and only if a 1<br />
b 1<br />
= a 2<br />
b 2<br />
= a 3<br />
b 3<br />
.<br />
5 Let there be given three circles K 1 , K 2 , K 3 with centers O 1 , O 2 , O 3 respectively, which meet<br />
at a common point P . Also, let K 1 ∩ K 2 = {P, A}, K 2 ∩ K 3 = {P, B}, K 3 ∩ K 1 = {P, C}.<br />
Given an arbitrary point X on K 1 , join X to A to meet K 2 again in Y , and join X to C to<br />
meet K 3 again in Z. (a) Show that the points Z, B, Y are collinear. (b) Show that the area<br />
<strong>of</strong> triangle XY Z is less than or equal to 4 times the area <strong>of</strong> triangle O 1 O 2 O 3 .<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 1<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
6 Let f be a function that satisfies the following conditions:<br />
(i) If x > y and f(y) − y ≥ v ≥ f(x) − x, then f(z) = v + z, for some number z between<br />
x and y. (ii) The equation f(x) = 0 has at least one solution, and among the solutions <strong>of</strong><br />
this equation, there is one that is not smaller than all the other solutions; (iii) f(0) = 1. (iv)<br />
f(<strong>1987</strong>) ≤ 1988. (v) f(x)f(y) = f(xf(y) + yf(x) − xy).<br />
Find f(<strong>1987</strong>).<br />
Proposed by Australia.<br />
7 Let f : (0, +∞) → R be a function having the property that f(x) = f ( 1<br />
x)<br />
for all x > 0. Prove<br />
( x+<br />
1 )<br />
that there exists a function u : [1, +∞) → R satisfying u = f(x) for all x > 0.<br />
8 Determine the least possible value <strong>of</strong> the natural number n such that n! ends in exactly <strong>1987</strong><br />
zeros.<br />
[hide=”Note”]Note.<br />
positive.<br />
Here (and generally in MathLinks) natural numbers supposed to be<br />
9 In the set <strong>of</strong> 20 elements {1, 2, 3, 4, 5, 6, 7, 8, 9, 0, A, B, C, D, J, K, L, U, X, Y, Z} we have made a<br />
random sequence <strong>of</strong> 28 throws. What is the probability that the sequence CUBA JULY <strong>1987</strong><br />
appears in this order in the sequence already thrown?<br />
10 In a Cartesian coordinate system, the circle C 1 has center O 1 (−2, 0) and radius 3. Denote<br />
the point (1, 0) by A and the origin by O.Prove that there is a constant c > 0 such that for<br />
every X that is exterior to C1,<br />
Find the largest possible c.<br />
OX − 1 ≥ c min{AX, AX 2 }.<br />
11 Let S ⊂ [0, 1] be a set <strong>of</strong> 5 points with {0, 1} ⊂ S. The graph <strong>of</strong> a real function f : [0, 1] → [0, 1]<br />
is continuous and increasing, and it is linear on every subinterval I in [0, 1] such that the<br />
endpoints but no interior points <strong>of</strong> I are in S.<br />
We want to compute, using a computer, the extreme values <strong>of</strong> g(x, t) = f(x+t)−f(x)<br />
f(x)−f(x−t)<br />
for<br />
x − t, x + t ∈ [0, 1]. At how many points (x, t) is it necessary to compute g(x, t) with the<br />
computer?<br />
12 Does there exist a second-degree polynomial p(x, y) in two variables such that every nonnegative<br />
integer n equals p(k, m) for one and only one ordered pair (k, m) <strong>of</strong> non-negative<br />
integers?<br />
x<br />
2<br />
Proposed by Finland.<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 2<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
13 Let A be an infinite set <strong>of</strong> positive integers such that every n ∈ A is the product <strong>of</strong> at most<br />
<strong>1987</strong> prime numbers. Prove that there is an infinite set B ⊂ A and a number p such that the<br />
greatest common divisor <strong>of</strong> any two distinct numbers in B is p.<br />
14 Given n real numbers 0 < t 1 ≤ t 2 ≤ · · · ≤ t n < 1, prove that<br />
(<br />
)<br />
(1 − t 2 t 1<br />
n)<br />
(1 − t 2 + t 2<br />
1 )2 (1 − t 3 + · · · + t n<br />
2 )2 (1 − t n+1 n ) 2<br />
< 1.<br />
15 Let a 1 , a 2 , a 3 , b 1 , b 2 , b 3 , c 1 , c 2 , c 3 be nine strictly positive real numbers. We set<br />
S 1 = a 1 b 2 c 3 , S 2 = a 2 b 3 c 1 , S 3 = a 3 b 1 c 2 ;<br />
T 1 = a 1 b 3 c 2 , T 2 = a 2 b 1 c 3 , T 3 = a 3 b 2 c 1 .<br />
Suppose that the set {S1, S2, S3, T 1, T 2, T 3} has at most two elements.<br />
Prove that<br />
S 1 + S 2 + S 3 = T 1 + T 2 + T 3 .<br />
16 Let ABC be a triangle. For every point M belonging to segment BC we denote by B ′ and C ′<br />
the orthogonal projections <strong>of</strong> M on the straight lines AC and BC. Find points M for which<br />
the length <strong>of</strong> segment B ′ C ′ is a minimum.<br />
17 Consider the number α obtained by writing one after another the decimal representations <strong>of</strong><br />
1, <strong>1987</strong>, <strong>1987</strong> 2 , . . . to the right the decimal point. Show that α is irrational.<br />
18 Let ABCDEF GH be a parallelepiped with AE ‖ BF ‖ CG ‖ DH. Prove the inequality<br />
In what cases does equality hold?<br />
AF + AH + AC ≤ AB + AD + AE + AG.<br />
Proposed by France.<br />
19 How many words with n digits can be formed from the alphabet {0, 1, 2, 3, 4}, if neighboring<br />
digits must differ by exactly one?<br />
Proposed by Germany, FR.<br />
20 Let x 1 , x 2 , . . . , x n be real numbers satisfying x 2 1 + x2 2 + . . . + x2 n = 1. Prove that for every<br />
integer k ≥ 2 there are integers a 1 , a 2 , . . . , a n , not all zero, such that |a i | ≤ k − 1 for all i, and<br />
|a 1 x 1 + a 2 x 2 + . . . + a n x n | ≤ (k−1)√ n<br />
k n −1 . (<strong>IMO</strong> <strong>Problem</strong> 3) Proposed by Germany, FR<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 3<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
21 Let p n (k) be the number <strong>of</strong> permutations <strong>of</strong> the set {1, 2, 3, . . . , n} which have exactly k fixed<br />
points. Prove that ∑ n<br />
k=0 kp n(k) = n!.(<strong>IMO</strong> <strong>Problem</strong> 1)<br />
Original formulation<br />
Let S be a set <strong>of</strong> n elements. We denote the number <strong>of</strong> all permutations <strong>of</strong> S that have<br />
exactly k fixed points by p n (k). Prove:<br />
(a) ∑ n<br />
k=0 kp n(k) = n! ;<br />
(b) ∑ n<br />
k=0 (k − 1)2 p n (k) = n!<br />
Proposed by Germany, FR<br />
22 Find, with pro<strong>of</strong>, the point P in the interior <strong>of</strong> an acute-angled triangle ABC for which<br />
BL 2 + CM 2 + AN 2 is a minimum, where L, M, N are the feet <strong>of</strong> the perpendiculars from P<br />
to BC, CA, AB respectively.<br />
Proposed by United Kingdom.<br />
23 A lampshade is part <strong>of</strong> the surface <strong>of</strong> a right circular cone whose axis is vertical. Its upper<br />
and lower edges are two horizontal circles. Two points are selected on the upper smaller circle<br />
and four points on the lower larger circle. Each <strong>of</strong> these six points has three <strong>of</strong> the others that<br />
are its nearest neighbors at a distance d from it. By distance is meant the shortest distance<br />
measured over the curved survace <strong>of</strong> the lampshade. Prove that the area <strong>of</strong> the lampshade is<br />
d 2 (2θ + √ 3) where cot θ 2 = 3 θ .<br />
24 Prove that if the equation x 4 + ax 3 + bx + c = 0 has all its roots real, then ab ≤ 0.<br />
25 Numbers d(n, m), with m, n integers, 0 ≤ m ≤ n, are defined by d(n, 0) = d(n, n) = 0 for all<br />
n ≥ 0 and<br />
md(n, m) = md(n − 1, m) + (2n − m)d(n − 1, m − 1) for all 0 < m < n.<br />
Prove that all the d(n, m) are integers.<br />
26 Prove that if x, y, z are real numbers such that x 2 + y 2 + z 2 = 2, then<br />
x + y + z ≤ xyz + 2.<br />
27 Find, with pro<strong>of</strong>, the smallest real number C with the following property: For every infinite<br />
sequence {x i } <strong>of</strong> positive real numbers such that x 1 + x 2 + · · · + x n ≤ x n+1 for n = 1, 2, 3, · · · ,<br />
we have<br />
√<br />
x1 + √ x 2 + · · · + √ x n ≤ C √ x 1 + x 2 + · · · + x n ∀n ∈ N.<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 4<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
28 In a chess tournament there are n ≥ 5 players, and they have already played<br />
(each pair have played each other at most once).<br />
[ ]<br />
n 2<br />
4<br />
+ 2 games<br />
(a) Prove that there are five players a, b, c, d, e for which the pairs ab, ac, bc, ad, ae, de have<br />
already played.<br />
[ ]<br />
(b) Is the statement also valid for the n 2<br />
4<br />
+ 1 games played?<br />
Make the pro<strong>of</strong> by induction over n.<br />
29 Is it possible to put <strong>1987</strong> points in the Euclidean plane such that the distance between each<br />
pair <strong>of</strong> points is irrational and each three points determine a non-degenerate triangle with<br />
rational area? (<strong>IMO</strong> <strong>Problem</strong> 5)<br />
Proposed by Germany, DR<br />
30 Consider the regular <strong>1987</strong>-gon A 1 A 2 ...A <strong>1987</strong> with center O. Show that the sum <strong>of</strong> vectors<br />
belonging to any proper subset <strong>of</strong> M = {OA j |j = 1, 2, ..., <strong>1987</strong>} is nonzero.<br />
31 Construct a triangle ABC given its side a = BC, its circumradius R (2R ≥ a), and the<br />
difference 1 k = 1 c − 1 b<br />
, where c = AB and b = AC.<br />
32 Solve the equation 28 x = 19 y + 87 z , where x, y, z are integers.<br />
33 Show that if a, b, c are the lengths <strong>of</strong> the sides <strong>of</strong> a triangle and if 2S = a + b + c, then<br />
a n<br />
b + c +<br />
bn<br />
c + a +<br />
( ) cn 2 n−2<br />
a + b ≥ S n−1 ∀n ∈ N<br />
3<br />
Proposed by Greece.<br />
34 (a) Let gcd(m, k) = 1. Prove that there exist integers a 1 , a 2 , ..., a m and b 1 , b 2 , ..., b k such that<br />
each product a i b j (i = 1, 2, · · · , m; j = 1, 2, · · · , k) gives a different residue when divided by<br />
mk.<br />
(b) Let gcd(m, k) > 1. Prove that for any integers a 1 , a 2 , ..., a m and b 1 , b 2 , ..., b k there must<br />
be two products a i b j and a s b t ((i, j) ≠ (s, t)) that give the same residue when divided by mk.<br />
Proposed by Hungary.<br />
35 Does there exist a set M in usual Euclidean space such that for every plane λ the intersection<br />
M ∩ λ is finite and nonempty ?<br />
Proposed by Hungary.<br />
[hide=”Remark”]I’m not sure I’m posting this in a right Forum.<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 5<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
36 A game consists in pushing a flat stone along a sequence <strong>of</strong> squares S 0 , S 1 , S 2 , ... that are<br />
arranged in linear order. The stone is initially placed on square S 0 . When the stone stops on<br />
a square S k it is pushed again in the same direction and so on until it reaches S <strong>1987</strong> or goes<br />
beyond it; then the game stops. Each time the stone is pushed, the probability that it will<br />
advance exactly n squares is 1<br />
2<br />
. Determine the probability that the stone will stop exactly<br />
n<br />
on square S <strong>1987</strong> .<br />
37 Five distinct numbers are drawn successively and at random from the set {1, · · · , n}. Show<br />
that the probability <strong>of</strong> a draw in which the first three numbers as well as all five numbers can<br />
be arranged to form an arithmetic progression is greater than<br />
6<br />
(n−2) 3<br />
38 Let S 1 and S 2 be two spheres with distinct radii that touch externally. The spheres lie inside<br />
a cone C, and each sphere touches the cone in a full circle. Inside the cone there are n<br />
additional solid spheres arranged in a ring in such a way that each solid sphere touches the<br />
cone C, both <strong>of</strong> the spheres S 1 and S 2 externally, as well as the two neighboring solid spheres.<br />
What are the possible values <strong>of</strong> n?<br />
Proposed by Iceland.<br />
39 Let A be a set <strong>of</strong> polynomials with real coefficients and let them satisfy the following conditions:<br />
(i) if f ∈ A and deg(f) ≤ 1, then f(x) = x − 1;<br />
(ii) if f ∈ A and deg deg(f) ≥ 2, then either there exists g ∈ A such that f(x) = x 2+deg(g) +<br />
xg(x) − 1 or there exist g, h ∈ A such that f(x) = x 1+deg(g) g(x) + h(x);<br />
(iii) for every f, g ∈ A, both x 2+deg(g) + xg(x) − 1 and x 1+deg(g) g(x) + h(x) belong to A.<br />
Let R n (f) be the remainder <strong>of</strong> the Euclidean division <strong>of</strong> the polynomial f(x) by x n . Prove<br />
that for all f ∈ A and for all natural numbers n ≥ 1 we have<br />
R n (f)(1) ≤ 0 and R n (f)(1) = 0 =⇒ R n (f) ∈ A.<br />
40 The perpendicular line issued from the center <strong>of</strong> the circumcircle to the bisector <strong>of</strong> angle C<br />
in a triangle ABC divides the segment <strong>of</strong> the bisector inside ABC into two segments with<br />
ratio <strong>of</strong> lengths . Given b = AC and a = BC, find the length <strong>of</strong> side c.<br />
41 Let n points be given arbitrarily in the plane, no three <strong>of</strong> them collinear. Let us draw segments<br />
between pairs <strong>of</strong> these points. What is the minimum number <strong>of</strong> segments that can be colored<br />
red in such a way that among any four points, three <strong>of</strong> them are connected by segments that<br />
form a red triangle?<br />
42 Find the integer solutions <strong>of</strong> the equation<br />
[√ ] [<br />
2m = n(2 + √ ]<br />
2)<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 6<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
43 Let 2n + 3 points be given in the plane in such a way that no three lie on a line and no four<br />
lie on a circle. Prove that the number <strong>of</strong> circles that pass through three <strong>of</strong> these points and<br />
contain exactly n interior points is not less than 1 ( 2n+3<br />
)<br />
3 2 .<br />
44 Let θ 1 , θ 2 , · · · , θ n be n real numbers such that sin θ 1 + sin θ 2 + · · · , + sin θ n = 0. Prove that<br />
[ ] n<br />
2<br />
| sin θ 1 + 2 sin θ 2 + · · · , +n sin θ n | ≤<br />
4<br />
45 Let us consider a variable polygon with 2n sides (n ∈ N) in a fixed circle such that 2n − 1 <strong>of</strong><br />
its sides pass through 2n − 1 fixed points lying on a straight line ∆. Prove that the last side<br />
also passes through a fixed point lying on ∆.<br />
46 Given five real numbers u 0 , u 1 , u 2 , u 3 , u 4 , prove that it is always possible to find five real<br />
numbers v0, v 1 , v 2 , v 3 , v 4 that satisfy the following conditions:<br />
(i) u i − v i ∈ N, 0 ≤ i ≤ 4<br />
(ii) ∑ 0≤i
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
51 The function F is a one-to-one transformation <strong>of</strong> the plane into itself that maps rectangles<br />
into rectangles (rectangles are closed; continuity is not assumed). Prove that F maps squares<br />
into squares.<br />
52 Given a nonequilateral triangle ABC, the vertices listed counterclockwise, find the locus <strong>of</strong><br />
the centroids <strong>of</strong> the equilateral triangles A ′ B ′ C ′ (the vertices listed counterclockwise) for<br />
which the triples <strong>of</strong> points A, B ′ , C ′ ; A ′ , B, C ′ ; and A ′ , B ′ , C are collinear.<br />
Proposed by Poland.<br />
53 Prove that there exists a four-coloring <strong>of</strong> the set M = {1, 2, · · · , <strong>1987</strong>} such that any arithmetic<br />
progression with 10 terms in the set M is not monochromatic.<br />
Alternative formulation<br />
Let M = {1, 2, · · · , <strong>1987</strong>}. Prove that there is a function f : M → {1, 2, 3, 4} that is not<br />
constant on every set <strong>of</strong> 10 terms from M that form an arithmetic progression.<br />
54 Let n be a natural number. Solve in integers the equation<br />
x n + y n = (x − y) n+1 .<br />
Proposed by Romania<br />
55 Two moving bodies M 1 , M 2 are displaced uniformly on two coplanar straight lines. Describe<br />
the union <strong>of</strong> all straight lines M 1 M 2 .<br />
56 For any integer r ≥ 1, determine the smallest integer h(r) ≥ 1 such that for any partition<br />
<strong>of</strong> the set {1, 2, · · · , h(r)} into r classes, there are integers a ≥ 0 ; 1 ≤ x ≤ y, such that<br />
a + x, a + y, a + x + y belong to the same class.<br />
Proposed by Romania<br />
57 The bisectors <strong>of</strong> the angles B, C <strong>of</strong> a triangle ABC intersect the opposite sides in B ′ , C ′<br />
respectively. Prove that the straight line B ′ C ′ intersects the inscribed circle in two different<br />
points.<br />
58 Find, with argument, the integer solutions <strong>of</strong> the equation<br />
3z 2 = 2x 3 + 385x 2 + 256x − 58195.<br />
59 It is given that a 11 , a 22 are real numbers, that x 1 , x 2 , a 12 , b 1 , b 2 are complex numbers, and<br />
that a 11 a 22 = a 12 a 12 (Where a 12 is he conjugate <strong>of</strong> a 12 ). We consider the following system in<br />
x 1 , x 2 :<br />
x 1 (a 11 x 1 + a 12 x 2 ) = b 1 ,<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 8<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
x 2 (a 12 x 1 + a 22 x 2 ) = b 2 .<br />
(a) Give one condition to make the system consistent.<br />
(b) Give one condition to make arg x 1 − arg x 2 = 98 ◦ .<br />
60 It is given that x = −2272, y = 10 3 + 10 2 c + 10b + a, and z = 1 satisfy the equation<br />
ax + by + cz = 1, where a, b, c are positive integers with a < b < c. Find y.<br />
61 Let P Q be a line segment <strong>of</strong> constant length λ taken on the side BC <strong>of</strong> a triangle ABC with<br />
the order B, P, Q, C, and let the lines through P and Q parallel to the lateral sides meet AC<br />
at P 1 and Q 1 and AB at P 2 and Q 2 respectively. Prove that the sum <strong>of</strong> the areas <strong>of</strong> the<br />
trapezoids P QQ 1 P 1 and P QQ 2 P 2 is independent <strong>of</strong> the position <strong>of</strong> P Q on BC.<br />
62 Let l, l ′ be two lines in 3-space and let A, B, C be three points taken on l with B as midpoint<br />
<strong>of</strong> the √ segment AC. If a, b, c are the distances <strong>of</strong> A, B, C from l ′ , respectively, show that<br />
a<br />
b ≤<br />
2 +c 2<br />
2<br />
, equality holding if l, l ′ are parallel.<br />
63 Compute ∑ 2n<br />
k=0 (−1)k a 2 k where a k are the coefficients in the expansion<br />
(1 − √ 2x + x 2 ) n =<br />
2n∑<br />
k=0<br />
a k x k .<br />
64 Let r > 1 be a real number, and let n be the largest integer smaller than r. Consider<br />
an arbitrary real number x with 0 ≤ x ≤<br />
n<br />
r−1<br />
. By a base-r expansion <strong>of</strong> x we mean a<br />
representation <strong>of</strong> x in the form<br />
where the a i are integers with 0 ≤ a i < r.<br />
x = a 1<br />
r + a 2<br />
r 2 + a 3<br />
r 3 + · · ·<br />
You may assume without pro<strong>of</strong> that every number x with 0 ≤ x ≤<br />
expansion.<br />
Prove that if r is not an integer, then there exists a number p, 0 ≤ p ≤<br />
infinitely many distinct base-r expansions.<br />
n<br />
r−1<br />
has at least one base-r<br />
n<br />
r−1<br />
, which has<br />
65 The runs <strong>of</strong> a decimal number are its increasing or decreasing blocks <strong>of</strong> digits. Thus 024379<br />
has three runs : 024, 43, and 379. Determine the average number <strong>of</strong> runs for a decimal number<br />
in the set {d 1 d 2 · · · d n |d k ≠ d k+1 , k = 1, 2, · · · , n − 1}, where n ≥ 2.<br />
66 At a party attended by n married couples, each person talks to everyone else at the party<br />
except his or her spouse. The conversations involve sets <strong>of</strong> persons or cliques C 1 , C 2 , · · · , C k<br />
with the following property: no couple are members <strong>of</strong> the same clique, but for every other<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 9<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
pair <strong>of</strong> persons there is exactly one clique to which both members belong. Prove that if n ≥ 4,<br />
then k ≥ 2n.<br />
Proposed by USA.<br />
67 If a, b, c, d are real numbers such that a 2 +b 2 +c 2 +d 2 ≤ 1, find the maximum <strong>of</strong> the expression<br />
(a + b) 4 + (a + c) 4 + (a + d) 4 + (b + c) 4 + (b + d) 4 + (c + d) 4 .<br />
68 Let α, β, γ be positive real numbers such that α + β + γ < π, α + β > γ,β + γ > α, γ + α > β.<br />
Prove that with the segments <strong>of</strong> lengths sin α, sin β, sin γ we can construct a triangle and that<br />
its area is not greater than<br />
A = 1 (sin 2α + sin 2β + sin 2γ) .<br />
8<br />
Proposed<br />
by Soviet Union<br />
69 Let n ≥ 2 be an integer. Prove that if k 2 + k + n is prime for all integers k such that<br />
0 ≤ k ≤ √ n<br />
3 , then k2 +k +n is prime for all integers k such that 0 ≤ k ≤ n−2.(<strong>IMO</strong> <strong>Problem</strong><br />
6)<br />
Original Formulation<br />
Let f(x) = x 2 + x + p, p ∈ N. Prove that if the numbers f(0), f(1), · · · , f(<br />
√<br />
p<br />
3<br />
) are primes, then all the numbers f(0), f(1), · · · , f(p − 2) are primes.<br />
Proposed by Soviet Union.<br />
70 In an acute-angled triangle ABC the interior bisector <strong>of</strong> angle A meets BC at L and meets the<br />
circumcircle <strong>of</strong> ABC again at N. From L perpendiculars are drawn to AB and AC, with feet<br />
K and M respectively. Prove that the quadrilateral AKNM and the triangle ABC have equal<br />
areas.(<strong>IMO</strong> <strong>Problem</strong> 2)<br />
Proposed by Soviet Union.<br />
71 To every natural number k, k ≥ 2, there corresponds a sequence a n (k) according to the following<br />
rule:<br />
a 0 = k, a n = τ(a n−1 ) ∀n ≥ 1,<br />
in which τ(a) is the number <strong>of</strong> different divisors <strong>of</strong> a. Find all k for which the sequence a n (k) does<br />
not contain the square <strong>of</strong> an integer.<br />
72 Is it possible to cover a rectangle <strong>of</strong> dimensions m × n with bricks that have the trimino angular<br />
shape (an arrangement <strong>of</strong> three unit squares forming the letter L) if:<br />
(a) m × n = 1985 × <strong>1987</strong>;<br />
(b) m × n = <strong>1987</strong> × 1989 ?<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 10<br />
http://www.art<strong>of</strong>problemsolving.com/
<strong>IMO</strong> <strong>Longlists</strong> <strong>1987</strong><br />
73 Let f(x) be a periodic function <strong>of</strong> period T > 0 defined over R. Its first derivative is continuous on<br />
R. Prove that there exist x, y ∈ [0, T ) such that x ≠ y and<br />
f(x)f ′ (y) = f ′ (x)f(y).<br />
74 Does there exist a function f : N → N, such that f(f(n)) = n + <strong>1987</strong> for every natural number n?<br />
(<strong>IMO</strong> <strong>Problem</strong> 4)<br />
Proposed by Vietnam.<br />
75 Let a k be positive numbers such that a 1 ≥ 1 and a k+1 − a k ≥ 1 (k = 1, 2, ...). Prove that for every<br />
n ∈ N,<br />
<strong>1987</strong><br />
∑<br />
k=1<br />
1<br />
a k+1<br />
<strong>1987</strong> √ a k<br />
< <strong>1987</strong><br />
76 Given two sequences <strong>of</strong> positive numbers {a k } and {b k } (k ∈ N) such that:<br />
(i) a k < b k ,<br />
(ii) cos a k x + cos b k x ≥ − 1 k<br />
prove the existence <strong>of</strong> lim k→∞<br />
a k<br />
b k<br />
for all k ∈ N and x ∈ R,<br />
and find this limit.<br />
77 Find the least positive integer k such that for any a ∈ [0, 1] and any positive integer n,<br />
a k (1 − a) n <<br />
1<br />
(n + 1) 3 .<br />
78 Prove that for every natural number k (k ≥ 2) there exists an irrational number r such that for<br />
every natural number m,<br />
[r m ] ≡ −1 (mod k).<br />
Remark. An easier variant: Find r as a root <strong>of</strong> a polynomial <strong>of</strong> second degree with integer coefficients.<br />
Proposed by Yugoslavia.<br />
This file was downloaded from the AoPS Math Olympiad Resources Page Page 11<br />
http://www.art<strong>of</strong>problemsolving.com/