Tournament Of Towns 2008

Day 1
1 100 Queens are placed on a 100 100 chessboard so that no two attack each other. Prove that each of four 50 50 corners of the board contains at least one Queen. 2 Each of 4 stones weights the integer number of grams. A balance with arrow indicates the dierence of weights on the left and the right sides of it. Is it possible to determine the weights of all stones in 4 weighings, if the balance can make a mistake in 1 gram in at most one weighing? 3 In his triangle ABC Serge made some measurements and informed Ilias about the lengths of median AD and side AC . Based on these data Ilias proved the assertion: angle CAB is obtuse, while angle DAB is acute. Determine a ratio AD/AC and prove Ilias assertion (for any triangle with such a ratio). 4 Baron Munchausen claims that he got a map of a country that consists of ve cities. Each two cities are connected by a direct road. Each road intersects no more than one another road (and no more than once). On the map, the roads are colored in yellow or red, and while circling any city (along its border) one can notice that the colors of crossed roads alternate. Can Barons claim be true?
1 5 Let a1 , a2 , , an be a sequence of positive numbers, so that a1 + a2 + + an 2 . Prove that (1 + a1 )(1 + a2 ) (1 + an ) < 2.

[hide=Remark]Remark. I think this problem was posted before, but I cant nd the link now. 6 Let ABC be a non-isosceles triangle. Two isosceles triangles AB C with base AC and CA B with base BC are constructed outside of triangle ABC . Both triangles have the same base angle . Let C1 be a point of intersection of the perpendicular from C to A B and the perpendicular bisector of the segment AB . Determine the value of AC1 B. 7 In an in nite sequence a1 , a2 , a3 , , the number a1 equals 1, and each an , n > 1, is obtained from an1 as follows: - if the greatest odd divisor of n has residue 1 modulo 4, then an = an1 + 1, - and if this residue equals 3, then an = an1 1. Prove that in this sequence (a) the number 1 occurs in

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 1

Tournament Of Towns 2008

nitely many times; (b) each positive integer occurs in nitely many times. (The initial terms of this sequence are 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, )

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 2

Tournament Of Towns 2008

Day 2
1 Each of ten boxes contains a dierent number of pencils. No two pencils in the same box are of the same colour. Prove that one can choose one pencil from each box so that no two are of the same colour. 2 Twenty- ve of the numbers 1, 2, , 50 are chosen. Twentyve of the numbers51, 52, , 100 are also chosen. No two chosen numbers dier by 0 or 50. Find the sum of all 50 chosen numbers. 3 Acute triangle A1 A2 A3 is inscribed in a circle of radius 2. Prove that one can choose points B1 , B2 , B3 on the arcs A1 A2 , A2 A3 , A3 A1 respectively, such that the numerical value of the area of the hexagon A1 B1 A2 B2 A3 B3 is equal to the numerical value of the perimeter of the triangle A1 A2 A3 . 4 Given three distinct positive integers such that one of them is the average of the two others. Can the product of these three integers be the perfect 2008th power of a positive integer? 5 On a straight track are several runners, each running at a dierent constant speed. They start at one end of the track at the same time. When a runner reaches any end of the track, he immediately turns around and runs back with the same speed (then he reaches the other end and turns back again, and so on). Some time after the start, all runners meet at the same point. Prove that this will happen again.

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 3

Tournament Of Towns 2008

Day 3
1 A square board is divided by lines parallel to the board sides (7 lines in each direction, not necessarily equidistant ) into 64 rectangles. Rectangles are colored into white and black in alternating order. Assume that for any pair of white and black rectangles the ratio between area of white rectangle and area of black rectangle does not exceed 2. Determine the maximal ratio between area of white and black part of the board. White (black) part of the board is the total sum of area of all white (black) rectangles. 2 Space is dissected into congruent cubes. Is it necessarily true that for each cube there exists another cube so that both cubes have a whole face in common? 3 There are N piles each consisting of a single nut. Two players in turns play the following game. At each move, a player combines two piles that contain coprime numbers of nuts into a new pile. A player who can not make a move, loses. For every N > 2 de ne which of the players, the rst or the second has a winning strategy. 4 Let ABCD be a non-isosceles trapezoid. De ne a point A1 as intersection of circumcircle of triangle BCD and line AC . (Choose A1 distinct from C ). Points B1 , C1 , D1 are de ned in similar way. Prove that A1 B1 C1 D1 is a trapezoid as well. 5 In an in nite sequence a1 , a2 , a3 , , the number a1 equals 1, and each an , n > 1, is obtained from an1 as follows: - if the greatest odd divisor of n has residue 1 modulo 4, then an = an1 + 1, - and if this residue equals 3, then an = an1 1. Prove that in this sequence (a) the number 1 occurs in nitely many times; (b) each positive integer occurs in nitely many times. (The initial terms of this sequence are 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, )

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 4

Tournament Of Towns 2008

6 Let P (x) be a polynomial with real coecients so that equation P (m) + P (n) = 0 has in nitely many pairs of integer solutions (m, n). Prove that graph of y = P (x) has a center of symmetry. 7 A test consists of 30 true or false questions. After the test (answering all 30 questions), Victor gets his score: the number of correct answers. Victor is allowed to take the test (the same questions ) several times. Can Victor work out a strategy that insure him to get a perfect score after (a) 30th attempt? (b) 25th attempt? (Initially, Victor does not know any answer)

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 5

Tournament Of Towns 2008

Day 4
1 Alex distributes some cookies into several boxes and records the number of cookies in each box. If the same number appears more than once, it is recorded only once. Serge takes one cookie from each box and puts them on the rst plate. Then he takes one cookie from each box that is still non-empty and puts the cookies on the second plate. He continues until all the boxes are empty. Then Serge records the number of cookies on each plate. Again, if the same number appears more than once, it is recorded only once. Prove that Alexs record contains the same number of numbers as Serges record. 2 Solve the system of equations (n > 2)

x1 +

x2 + x3 + + xn =

x2 +

x3 + x4 + + xn + x1 = = x1 x2 = 1.

xn +

x1 + x2 + + xn1 ,

3 A 30-gon A1 A2 A30 is inscribed in a circle of radius 2. Prove that one can choose a point Bk on the arc Ak Ak+1 for 1 k 29 and a point B30 on the arc A30 A1 , such that the numerical value of the area of the 60-gon A1 B1 A2 B2 . . . A30 B30 is equal to the numerical value of the perimeter of the original 30-gon. 4 Five distinct positive integers form an arithmetic progression. Can their product be equal to a2008 for some positive integer a ? 5 On the in nite chessboard several rectangular pieces are placed whose sides run along the grid lines. Each two have no squares in common, and each consists of an odd number of squares. Prove that these pieces can be painted in four colours such that two pieces painted in the same colour do not share any boundary points.

This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

Page 6