SMO(J) Mock Paper 1

Duration: Three hours May 31, 2012

1 x2 1. The sequence {xn } satises x1 = , xn+1 = xn + n . Prove that x2001 < 1001. 2 n2 2. Let n1 , n2 , , n1998 be positive integers such that n2 + n2 + + n2 = n2 . 1 2 1997 1998 Show that at least two of the numbers are even. 3. Consider a convex polygon having n vertices, n 4. We arbitrarily decompose the polygon into triangles having all the vertices among the vertices of the polygon, such that no two of the triangles have interior points in common. We paint in black the triangles that have two sides that are also sides of the polygon, in red if only one side of the triangle is also a side of the polygon and in white those triangles that have no sides that are sides of the polygon. Prove that there are two more black triangles that white ones. 4. Let AL and BK be angle bisectors in the non-isosceles triangle ABC (L lies on the side BC, K lies on the side AC). The perpendicular bisector of BK intersects the line AL at point M . Point N lies on the line BK such that LN is parallel to M K. Prove that LN = N A. 5. On a given 2012 2012 chessboard, every unit square is lled with one of the letters S, M, O, J. The resulting board is called harmonic if every 2 2 subsquare contains all four dierent letters. How many harmonic boards are there?

Solutions 1 x2 1. (CWMO 2001) The sequence {xn } satises x1 = , xn+1 = xn + n . Prove that 2 n2 x2001 < 1001. Solution. First we have x1 = 1 9 n and x2 = < 1. If xn < , then 2 16 2 x2 n 1 n2 n+1 n < + 2 < . n2 2 n 4 2 n . So x2001 < 1000.5 < 1001. 2

xn+1 = xn +

Hence by induction we must have xn <

2. (JBMO 1997) Let n1 , n2 , , n1998 be positive integers such that n2 + n2 + + n2 = n2 . 1 2 1997 1998 Show that at least two of the numbers are even. Solution. Firstly, if exactly one of n1 , n2 , , n1998 is even, then n1998 must not be even since it is a sum of 1997 odd numbers. If exactly one of x1 , x2 , x1997 is even, then x1998 must be even since it is a sum of one even number and 1996 odd numbers. Hence there cannot be exactly one even number. If all numbers are odd, we observe that the remainder when an odd square number is divided by 8 is always 1. As such, n2 + ... + n2 1997 5 n2 1 1997 1998 (mod 8)

which is a contradiction. Hence there must be at least two of the numbers which are even. 3. (JBMO 2004) Consider a convex polygon having n vertices, n 4. We arbitrarily decompose the polygon into triangles having all the vertices among the vertices of the polygon, such that no two of the triangles have interior points in common. We paint in black the triangles that have two sides that are also sides of the polygon, in red if only one side of the triangle is also a side of the polygon and in white those triangles that have no sides that are sides of the polygon. Prove that there are two more black triangles that white ones. Solution. Let b be the number of black triangles, r be the number of red triangles, w be the number of white triangles. The sum of interior angles of all the triangles is equal to the sum of interior angles of the polygon. Hence, we have b + r + w = n 2.

Moreover, since each black triangles share 2 common sides with the polygon while each red triangles share 1 common side with the polygon, we have 2b + r = n. Subtracting the two equations we obtain b = w + 2 and hence there are 2 more black triangles than white triangles. 4. (JBMO 2010) Let AL and BK be angle bisectors in the non-isosceles triangle ABC (L lies on the side BC, K lies on the side AC). The perpendicular bisector of BK intersects the line AL at point M . Point N lies on the line BK such that LN is parallel to M K. Prove that LN = N A. Solution. First, we construct the circumcircle of AKB and suppose it intersects with line AL at point M . We note that M is the midpoint of the minor arc BK. Hence, M lies above the perpendicular bisector of BK and hence M coincides with point M .

This shows that ABM K is a cyclic quadrilateral. From there we have LAB = BKM = BN L and hence ABN L is a cyclic quadrilateral too. Finally, since ABN = LBN , we have LN = N A. 5. (CGMO 2008) On a given 2012 2012 chessboard, every unit square is lled with one of the letters S, M, O, J. The resulting board is called harmonic if every 2 2 subsquare contains all four dierent letters. How many harmonic boards are there? Solution. We consider the problem in the following two cases: (a) If the rst row only contains two letters. Without loss of generality, let us assume that S, M are selected on the rst row. In this case, the rst row must be in the form of SM SM SM or M SM S M S. There are 2 possibilities for the next row, which is either OJOJ OJ or JOJO JO. Similarly, there will be 2 possibilities for each row on the chessboard. The total number 4 of possibilities in this case is 22012 = 6 22012 . 2 3

(b) If the rst row contains three or more letters, we note that the entire chessboard is determined just by the rst row of the chess board. In this case, we observe that the rst column of the chess board only contains 2 letters. Hence, this case is similar to the previous case, just that the chessboard is being rotated clockwise by 90 . We still need to deduct the number of cases where both the rst row and column only has 2 letters. The total number of 4 cases is 22012 4 3 2 = 6 22012 24. 2 Hence, the total number of cases is 12 22012 24.