Asian Pacific Mathematics Olympiad · 2009
Problems
- Problem 1Consider the following operation on positive real numbers written on a blackboard: choose a number written on the blackboard, erase that number, and then write a pair of positive real numbers and satisfying on the board. Assume that you start out with just one positive real number on the blackboard, and apply this operation times to end up with positive real numbers, not necessarily distinct. Show that there exists a number on the board which does not exceed .Solutions: 1
- Problem 2Let be real numbers satisfying for . Find the value of (express the value in a single fraction).Solutions: 1
- Problem 3Let three circles , which are non-overlapping and mutually external, be given in the plane. For each point in the plane, outside the three circles, construct six points as follows: for each , are distinct points on such that the lines and are both tangents to . Call exceptional if the three lines are concurrent. Show that every exceptional point of the plane, if any exists, lies on the same circle.Solutions: 1
- Problem 4Prove that for any positive integer , there exists an arithmetic sequence of rational numbers, where are relatively prime positive integers for each , such that the positive integers are all distinct.Solutions: 1
- 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 kilometer driving from the start; Rob makes a 90° right turn after every kilometer driving from the start, where and 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 is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?Solutions: 1