olymmath

APMO 1997

Asian Pacific Mathematics Olympiad 1997.

Paper

Problem 1

  • Paper

Given: S=1+11+13+11+13+16+⋯+11+13+16+⋯+11993006S = 1 + \frac{1}{1 + \frac{1}{3}} + \frac{1}{1 + \frac{1}{3} + \frac{1} {6}} + \cdots + \frac{1}{1 + \frac{1}{3} + \frac{1}{6} + \cdots + \frac{1} {1993006}} where the denominators contain partial sums of the sequence of reciprocals of triangular numbers (i.e. k=n(n+1)2k=\frac{n(n+1)}{2} for n=1n = 1 , 22 , …\ldots , 19961996 ). Prove that S>1001S>1001 .

Answer, solutions and source

Problem 3

  • Paper

Let ABCABC be a triangle inscribed in a circle and let la=maMa ,  lb=mbMb ,  lc=mcMc ,l_a = \frac{m_a}{M_a} \ , \ \ l_b = \frac{m_b}{M_b} \ , \ \ l_c = \frac{m_c}{M_c} \ , where mam_a , mbm_b , mcm_c are the lengths of the angle bisectors (internal to the triangle) and MaM_a , MbM_b , McM_c are the lengths of the angle bisectors extended until they meet the circle. Prove that lasin⁡2A+lbsin⁡2B+lcsin⁡2C≥3\frac{l_a}{\sin^2 A} + \frac{l_b}{\sin^2 B} + \frac{l_c}{\sin^2 C} \geq 3 and that equality holds iff ABCABC is an equilateral triangle.

Answer, solutions and source

Problem 4

  • Paper

Triangle A1A2A3A_1 A_2 A_3 has a right angle at A3A_3 . A sequence of points is now defined by the following iterative process, where nn is a positive integer. From AnA_n ( n≥3n \geq 3 ), a perpendicular line is drawn to meet An−2An−1A_{n-2}A_{n-1} at An+1A_{n+1} . (a) Prove that if this process is continued indefinitely, then one and only one point PP is interior to every triangle An−2An−1AnA_{n-2} A_{n-1} A_{n} , n≥3n \geq 3 . (b) Let A1A_1 and A3A_3 be fixed points. By considering all possible locations of A2A_2 on the plane, find the locus of PP .

Answer, solutions and source

Problem 5

  • Paper

Suppose that nn people A1A_1 , A2A_2 , …\ldots , AnA_n , ( n≥3n \geq 3 ) are seated in a circle and that AiA_i has aia_i objects such that a1+a2+⋯+an=nNa_1 + a_2 + \cdots + a_n = nN where NN is a positive integer. In order that each person has the same number of objects, each person AiA_i is to give or to receive a certain number of objects to or from its two neighbours Ai−1A_{i-1} and Ai+1A_{i+1} . (Here An+1A_{n+1} means A1A_1 and AnA_n means A0A_0 .) How should this redistribution be performed so that the total number of objects transferred is minimum?

Answer, solutions and source