olymmath

SMO 1999

Singapore Mathematical Olympiad 1999.

Other problems

Problem 1

Let nn be a positive integer. A square ABCDABCD is divided into n2n^2 identical small squares by drawing (n−1)(n-1) equally spaced lines parallel to the side ABAB and another (n−1)(n- 1) equally spaced lines parallel to BCBC , thus giving rise to (n+1)2(n+1)^2 intersection points. The points A,CA, C are coloured red and the points B,DB, D are coloured blue. The rest of the intersection points are coloured either red or blue. Prove that the number of small squares having exactly 33 vertices of the same colour is even.

Problem 2

Call a natural number nn a magic number if the number obtained by putting nn on the right of any natural number is divisible by nn . Find the number of magic numbers less than 500500 . Justify your answer

Problem 3

For each positive integer nn , let f(n)f(n) be a positive integer. Show that if f(n+1)>f(f(n))f(n + 1) > f(f(n)) for every positive integer n, then f(x)=xf(x) = x for all positive integers xx .

Problem 4

Let ABCDABCD be a quadrilateral with each interior angle less than 180o180^o . Show that if A,B,C,DA, B, C, D do not lie on a circle, then AB⋅CD+AD⋅BC>AC⋅BDAB \cdot CD + AD\cdot BC > AC \cdot BD