MathLabs

Asian Pacific Mathematics Olympiad · 1997

Problems

  1. Problem 1Let Tn=1+2+⋯+n=n(n+1)/2T_n=1+2+\cdots+n=n(n+1)/2 and Sn=1/T1+1/T2+⋯+1/TnS_n=1/T_1+1/T_2+\cdots+1/T_n. Prove that 1/S1+1/S2+⋯+1/S1996>10011/S_1+1/S_2+\cdots+1/S_{1996}>1001.Solutions: 1
  2. Problem 2Find an integer nn in the range 100≤n≤1997100\le n\le1997 such that nn divides 2n+22^n+2.Solutions: 1
  3. Problem 3Let ABCABC be a triangle. The bisector of angle AA meets segment BCBC at XX and the circumcircle at YY. Let rA=AX/AYr_A=AX/AY, and define rB,rCr_B,r_C similarly. Prove that rA/sin⁡2A+rB/sin⁡2B+rC/sin⁡2C≥3r_A/\sin^2A+r_B/\sin^2B+r_C/\sin^2C\ge3, with equality if and only if the triangle is equilateral.Solutions: 1
  4. Problem 4Let P1P_1 and P3P_3 be fixed points. Let P2P_2 lie on the line through P3P_3 perpendicular to P1P3P_1P_3. Define Pn+1P_{n+1} as the foot of the perpendicular from PnP_n to Pn−1Pn−2P_{n-1}P_{n-2}. Show that the sequence converges to a point PP, and determine the locus of PP as P2P_2 varies.Solutions: 1
  5. Problem 5nn people are seated in a circle. A total of nknk coins are distributed among them, not necessarily equally. A move transfers one coin between two adjacent people. Find an algorithm using the minimum number of moves that leaves everyone with the same number of coins.Solutions: 1