International Mathematical Olympiad · 1996
Problems
- Problem 1We are given a positive integer and a rectangular board divided into unit squares. A move from one square to another is permitted only when the distance between their centers is . Find a sequence of moves leading between two adjacent corners of the board that lie on the long side. (a) Show that this is impossible if is divisible by or . (b) Prove that it is possible for . (c) Can it be done for ?Solutions: 1
- Problem 2Let be a point inside triangle such that . Let and be the incenters of triangles and , respectively. Show that , , and meet at a point.Solutions: 1
- Problem 3Let be the set of non-negative integers. Find all functions such that for all .Solutions: 1
- Problem 4The positive integers and are such that and are both squares of positive integers. What is the least possible value of the smaller of these two squares?Solutions: 1
- Problem 5Let be a convex hexagon such that , , and . Let be the circumradii of triangles , , , respectively, and let be the perimeter of the hexagon. Prove that .Solutions: 1
- Problem 6Let be positive integers with . Let be integers with , and for each let or . Show that there exist , with , such that .Solutions: 1