MathLabs

Asian Pacific Mathematics Olympiad · 2009

Problems

  1. Problem 1Consider the following operation on positive real numbers written on a blackboard: choose a number rr written on the blackboard, erase that number, and then write a pair of positive real numbers aa and bb satisfying 2r2=ab2r^2=ab on the board. Assume that you start out with just one positive real number rr on the blackboard, and apply this operation k2−1k^2-1 times to end up with k2k^2 positive real numbers, not necessarily distinct. Show that there exists a number on the board which does not exceed krkr.Solutions: 1
  2. Problem 2Let a1,a2,a3,a4,a5a_1,a_2,a_3,a_4,a_5 be real numbers satisfying a1k2+1+a2k2+2+a3k2+3+a4k2+4+a5k2+5=1k2\frac{a_1}{k^2+1}+\frac{a_2}{k^2+2}+\frac{a_3}{k^2+3}+\frac{a_4}{k^2+4}+\frac{a_5}{k^2+5}=\frac1{k^2} for k=1,2,3,4,5k=1,2,3,4,5. Find the value of a137+a238+a339+a440+a541\frac{a_1}{37}+\frac{a_2}{38}+\frac{a_3}{39}+\frac{a_4}{40}+\frac{a_5}{41} (express the value in a single fraction).Solutions: 1
  3. Problem 3Let three circles Γ1,Γ2,Γ3\Gamma_1,\Gamma_2,\Gamma_3, which are non-overlapping and mutually external, be given in the plane. For each point PP in the plane, outside the three circles, construct six points A1,B1,A2,B2,A3,B3A_1,B_1,A_2,B_2,A_3,B_3 as follows: for each i=1,2,3i=1,2,3, Ai,BiA_i,B_i are distinct points on Γi\Gamma_i such that the lines PAiPA_i and PBiPB_i are both tangents to Γi\Gamma_i. Call PP exceptional if the three lines A1B1,A2B2,A3B3A_1B_1,A_2B_2,A_3B_3 are concurrent. Show that every exceptional point of the plane, if any exists, lies on the same circle.Solutions: 1
  4. Problem 4Prove that for any positive integer kk, there exists an arithmetic sequence a1b1,a2b2,…,akbk\frac{a_1}{b_1},\frac{a_2}{b_2},\ldots,\frac{a_k}{b_k} of rational numbers, where ai,bia_i,b_i are relatively prime positive integers for each i=1,2,…,ki=1,2,\ldots,k, such that the positive integers a1,b1,a2,b2,…,ak,bka_1,b_1,a_2,b_2,\ldots,a_k,b_k are all distinct.Solutions: 1
  5. Problem 5Larry and Rob are two robots travelling in one car from Argovia to Zillis. Both robots have control over the steering and steer according to this algorithm: Larry makes a 90° left turn after every ℓ\ell kilometer driving from the start; Rob makes a 90° right turn after every rr kilometer driving from the start, where ℓ\ell and rr are relatively prime positive integers. If both turns occur simultaneously, the car keeps going without changing direction. Assume the ground is flat and the car can move in any direction. The car starts from Argovia facing towards Zillis. For which pairs (ℓ,r)(\ell,r) is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?Solutions: 1