0 valutazioniIl 0% ha trovato utile questo documento (0 voti)
28 visualizzazioni1 pagina
This document contains 6 math problems that were part of the Chinese IMO Team Selection Test in 2008. The test was divided into two days, with 3 problems each day. The problems cover a range of mathematical topics including geometry, sequences, combinatorics, and inequalities. They require skills like proof by contradiction, analyzing recursive sequences, arranging subsets of a set to satisfy certain properties, and finding maximum and minimum values of expressions.
This document contains 6 math problems that were part of the Chinese IMO Team Selection Test in 2008. The test was divided into two days, with 3 problems each day. The problems cover a range of mathematical topics including geometry, sequences, combinatorics, and inequalities. They require skills like proof by contradiction, analyzing recursive sequences, arranging subsets of a set to satisfy certain properties, and finding maximum and minimum values of expressions.
This document contains 6 math problems that were part of the Chinese IMO Team Selection Test in 2008. The test was divided into two days, with 3 problems each day. The problems cover a range of mathematical topics including geometry, sequences, combinatorics, and inequalities. They require skills like proof by contradiction, analyzing recursive sequences, arranging subsets of a set to satisfy certain properties, and finding maximum and minimum values of expressions.
First Day 1. Let ABC be a triangle such that AB > AC. Let E be the point of tangency of BC with the incircle of ABC. Let D be the second intersection point of the incircle with the segment AE. Point F AE (F 6= E) satisfies CE = CF. The ray CF intersects BD at G. Prove that CF = FG. 2. The sequence (xn ) is defined by x1 = 2, x2 = 12, and xn+2 = 6xn+1 xn , for n 1. Let p be an odd prime number and let q be a prime divisor of x p . Prove that if q 6 {2, 3} then q 2p 1. 3. Suppose that every positive integer has been painted in one of the two colors. Prove that there exists an infinite sequence of positive integers a1 < a2 < a2 +a3 2 such that a1 , a1 +a 2 , a2 , 2 , a3 , . . . is an infinite sequence of positive integers of the same color. Second Day 4. Let n 4 be an integer. Consider all the subsets of Gn = {1, 2, . . ., n} with at least two elements. Prove it is possible to arrange those subsets in a sequence P1 , P2 , . . . , P2n n1 such that |Pi Pi+1 | = 2 for every i = 1, 2, . . . , 2n n 2. 5. Let m, n be two positive integers. Positive real numbers ai, j (1 i n, 1 j m) are not all equal to zero. If
2 n ni=1 mj=1 ai j + m mj=1 (ni=1 ai j )2 , f= 2 ni=1 mj=1 ai j + mn ni=1 mj=1 a2i j find the maximum and minimum of f . 6. Find the maximal constant M such that for arbitrary integer n 3, there exists two sequences of positive real numbers a1 , . . . , an and b1 , . . . , bn such that (i) nk=1 bk = 1, 2bk bk1 + bk+1, k = 2, 3, . . . , n 1; (ii) a2k 1 + ki=1 ai bi , k = 1, 2, . . . , n, an = M.
The IMO Compendium Group,
D. Djukic, V. Jankovic, I. Matic, N. Petrovic www.imomath.com
Ten-Decimal Tables of the Logarithms of Complex Numbers and for the Transformation from Cartesian to Polar Coordinates: Volume 33 in Mathematical Tables Series