2005年IMO德国国家队选拔考试1-9.pdfVIP

Germany Team Selection Tests 2005 Day 1 1 Given the positive numbers a and b and the natural number n, find the greatest among the n + 1 monomials in the binomial expansion of (a + b)n . 2 Let M be a set of points in the Cartesian plane, and let (S) be a set of segments (whose endpoints not necessarily have to belong to M ) such that one can walk from any point of M to any other point of M by travelling along segments which are in (S). Find the smallest total length of the segments of (S) in the cases (a) M = {(−1, 0) , (0, 0) , (1, 0) , (0, −1) , (0, 1)}. (b) M = {(−1, −1) , (−1, 0) , (−1, 1) , (0, −1) , (0, 0) , (0, 1) , In other words, find the Steiner trees of the set M in the above two cases. 3 n 2 2 2 2 Let a, b, c, d and n be positive integers such that 7 · 4 = a + b + c + d . Prove that the numbers a, b, c, d are all ≥ 2n−1 . This file was downloaded from the AoPS − MathLinks Math Olympiad Resources Page / Page 1 http://www.mathlinks.ro/ Germany Team Selection Tests 2005 Day 2 1 Let a , a , a , ... be an infinite sequence of real numbers satisfying the equation a = 0 1 2 n |an+1 − an+2 | for all n ≥ 0, where a0 and a1 are two different positive reals. Can this sequence a , a , a , ... be bounded? 0 1 2 2 Let a circle Γ and a line d have no