BW 00 Probl

Baltic Way 2000
Oslo, November 5, 2000
Problem 1
Let K be a point inside the triangle ABC. Let M and N be points such that M and
K are on opposite sides of the line AB, and N and K are on opposite sides of the
line BC. Assume that 6 M AB = 6 M BA = 6 N BC = 6 N CB = 6 KAC = 6 KCA.
Show that M BN K is a parallelogram.
Problem 2
Given an isosceles triangle ABC with 6 A = 90◦ . Let M be the midpoint of AB.
The line passing through A and perpendicular to CM intersects the side BC at P .
Prove that
6 AM C = 6 BM P.
Problem 3
Given a triangle ABC with 6 A = 90◦ and AB 6= AC. The points D, E, F lie on the
sides BC, CA, AB, respectively, in such a way that AF DE is a square. Prove that
the line BC, the line F E and the line tangent at the point A to the circumcircle of
the triangle ABC intersect in one point.
Problem 4
Given a triangle ABC with 6 A = 120◦ . The points K and L lie on the sides AB and
AC, respectively. Let BKP and CLQ√be equilateral triangles constructed outside
the triangle ABC. Prove that P Q ≥ 23 (AB + AC) .
Problem 5
Let ABC be a triangle such that
BC AB + BC
= .
AB − BC AC
Determine the ratio 6 A : 6 C.
Problem 6
Fredek runs a private hotel. He claims that whenever n ≥ 3 guests visit the hotel,
it is possible to select two guests that have equally many acquaintances among the
other guests, and that also have a common acquaintance or a common unknown
among the guests. For which values of n is Fredek right?
(Acquaintance is a symmetric relation.)
1
Problem 7
In a 40 × 50 array of control buttons, each button has two states: on and off. By
touching a button, its state and the states of all buttons in the same row and in
the same column are switched. Prove that the array of control buttons may be
altered from the all-off state to the all-on state by touching buttons successively,
and determine the least number of touches needed to do so.
Problem 8
Fourteen friends met at a party. One of them, Fredek, wanted to go to bed early.
He said goodbye to 10 of his friends, forgot about the remaining 3, and went to
bed. After a while he returned to the party, said goodbye to 10 of his friends (not
necessarily the same as before), and went to bed. Later Fredek came back a number
of times, each time saying goodbye to exactly 10 of his friends, and then went back
to bed. As soon as he had said goodbye to each of his friends at least once, he
did not come back again. In the morning Fredek realised that he had said goodbye
a different number of times to each of his thirteen friends! What is the smallest
possible number of times that Fredek returned to the party?
Problem 9
There is a frog jumping
√ on a 2k × 2k chessboard, composed of unit squares. The
2
frog’s jumps are 1 + k long and they carry the frog from the center of a square
to the center of another square. Some m squares of the board are marked with an
×, and all the squares into which the frog can jump from an ×’d square (whether
they carry an × or not) are marked with an ◦. There are n ◦’d squares. Prove that
n ≥ m.
Problem 10
Two positive integers are written on the blackboard. Initially, one of them is 2000
and the other is smaller than 2000. If the arithmetic mean m of the two numbers
on the blackboard is an integer, the following operation is allowed: One of the two
numbers is erased and replaced by m. Prove that this operation cannot be performed
more than ten times. Give an example where the operation is performed ten times.
Problem 11
A sequence of positive integers a1 , a2 , . . . is such that for each m and n the following
holds: if m is a divisor of n and m < n, then am is a divisor of an and am < an .
Find the least possible value of a2000 .
Problem 12
Let x1 , x2 , . . . , xn be positive integers such that no one of them is an initial fragment
of any other (for example, 12 is an initial fragment of 12, 125 and 12405). Prove
that
1 1 1
+ + ··· + < 3.
x1 x2 xn
2
Problem 13
Let a1 , a2 , . . . , an be an arithmetic progression of integers such that i | ai for i =
1, 2, . . . , n − 1 and n 6 |an . Prove that n is a prime power.
Problem 14
Find all positive integers n such that n is equal to 100 times the number of positive
divisors of n.
Problem 15
Let n be a positive integer not divisible by 2 or 3. Prove that for all integers k, the
number (k + 1)n − k n − 1 is divisible by k 2 + k + 1.
Problem 16
Prove that for all positive real numbers a, b, c we have
√ √ √
a2 − ab + b2 + b2 − bc + c2 ≥ a2 + ac + c2 .
Problem 17
Find all real solutions to the following system of equations:


 x + y + z + t = 5
xy + yz + zt + tx = 4




 xyz + yzt + ztx + txy = 3
xyzt = −1.

Problem 18
Determine all positive real numbers x and y satisfying the equation
1 1 √ q
x+y+ + + 4 = 2 · ( 2x + 1 + 2y + 1).
x y
Problem 19
1
Let t ≥ 2
be a real number and n a positive integer. Prove that
t2n ≥ (t − 1)2n + (2t − 1)n .
Problem 20
For every positive integer n, let
(2n + 1)(2n + 3) · · · (4n − 1)(4n + 1)

xn = .
(2n)(2n + 2) · · · (4n − 2)(4n)
1
√
Prove that 4n
< xn − 2 < n2 .

BW 00 Probl

Uploaded by

Copyright:

Available Formats

BW 00 Probl

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BW 00 Probl

Uploaded by

Copyright:

Available Formats

Baltic Way 2000

Oslo, November 5, 2000

t2n ≥ (t − 1)2n + (2t − 1)n .

(2n + 1)(2n + 3) · · · (4n − 1)(4n + 1)

You might also like