SMO(O) Mock Paper

Duration: Two and a half hours May 24, 2012

1. Given a triangle ABC with area 2012. Let BM be the perpendicular from B to the bisector of C. Determine the area of the triangle AM C. 2. What is the smallest integer larger than ( 3 + 2)6 ? 3. Six points A1 , A2 , A3 , A4 , A5 , A6 lie on a plane in such a way that no three points among them are collinear. Determine the maximum possible value that the minimum value for the angle Ai Aj Ak can take where i, j, k are distinct integers between 1 to 6. 4. Find the smallest integer k 3 with the property that it is possible to choose two of the numbers 1, 2, , k in such a way that their product is equal to the sum of the remaining k 2 numbers. 5. Given that 30! can be written as 26525285p8121910586363084q0000000 where p, q are missing digits, determine p + q 6. The equation x3 9x2 + 8x + 2 = 0 has three real roots p, q, r. Evaluate 1 1 1 + 2 + 2. 2 p q r 7. Given that P is a point in an acute angle triangle ABC such that BP C = AP BC BAC + 90 and AB P C = AC P B. Let k = . Evaluate k 4 . AC BP

8. Let k be the minimum value of | sin x + cos x + tan x + cot x + sec x + csc x|. k can be represented as p q r where p, q, r are positive integers and q is not divisible by the square of any prime. Find the value of p + q + r. 9. Let x be the number of 7-letter word formed by the 26 english alphabets which x contains consecutive letters which spells SMO. Find the value of . 100 1

2 10. Ten positive integers are arranged around a circle. Each number is one more than the greatest common divisor of its two neighbours. What is the sum of the ten numbers? 11. Let x be a real number such that x3 +4x = 8. Determine the value of x7 +64x2 . 12. In a non-isosceles triangle ABC, D, E are points on BC and AC respectively such that AD bisects BAC and BE bisects ABC. Given that AD BC = BE AC, nd the measure of ACB. 13. The average of the numbers 2 sin 2 , 4 sin 4 , 6 sin 6 , 180 sin 180 can be written as cot x . Find the smallest x. 14. Consider the function f (x) = x + 2x + 5 x + 3x + 4x . Find the number 3 of integer values of f (x) in the domain 0 x 100.

15. Let f (x) = x3 + x + 1. Suppose g is a cubic polynomial such that g(0) = 1 and the roots of g are the squares of the roots of f . Find g(9). 16. Given that x, y, z > 0, and the three unknowns satisfy the equations: x + y = 13 z + y yz = 25 z 2 + x2 + xz = 144
2 2

p q z can be written as , where p, q, r are integers and q is not divisibly by any r square of a prime. Find p + q + r. 17. Find the number of ways of paving a 5 2 wall using 1 1, 2 1 and 2 2 tiles. 18. Dene a string of 9-digit number composed of 1, 2, , 9 as troll if the number does not contain any three term increasing subsequence (the numbers need not be consecutive). For example, 198765432 and 879365412 are troll sequences but 123456789 and 879364512 are not troll sequences, the latter due to the presence of subsequence 345. Find the total number of troll sequences. 19. Find the number of ordered pairs of positive integers (m, n) such that is an integer. n3 + 1 mn 1

3 20. Given that positive real numbers x, y, z satisfy the condition xy + yz + xz = 1. Find the minimum value of 105x2 + 105y 2 + z 2 . 21. Let S denote the set of all ordered triples (i, j, k) of positive integers where i + j + k = 17. Compute ijk.
(i,j,k)S

22. Circle 1 has centre O, which is on circle O2 . The circles intersect at points A and C. Point B lies on 2 such that BA = 37, BO = 17, and BC = 7. Suppose the area of 1 is x. Compute x. 23. Eight celebrities meet at a party. It so happens that each celebrity shakes hands with exactly two others. A fan makes a list of all unordered pairs of celebrities who shook hands with each other. If order does not matter, how many dierent lists are possible? 24. Suppose m, n are positive integers such that there exists innitely many integers am + a 1 is itself an integer. Find m + n. a which such that n a + a2 1 25. Ten gangsters are standing on a at surface, and the distances between them are all distinct. At twelve oclock, when the church bells start chiming, each of them fatally shoots the one among the other nine gangsters who is the nearest. At least how many gangsters will be killed?

1 SOLUTIONS

Solutions
1. Given a triangle ABC with area 2012. Let BM be the perpendicular from B to the bisector of C. Determine the area of the triangle AM C. Solution (1006). Let S XY Z denote the area of triangle XY Z. Extend CA and BM to meet at D. Then, we have S BCD = 2012 CD and S CM D = CA 1006 CD . Hence, S AM C = 1006. CA

2. What is the smallest integer larger than ( 3 + 2)6 ? Solution (970). We have: ( 3 + 2)6 + ( 3 2)6 = 2[( 3)6 + 15 ( 3)4 ( 2)2 + 15 ( 3)2 ( 2)4 + ( 2)6 ] = 970 Since ( 3 2)6 is smaller than 1, the smallest integer larger than ( 3 + 2)6 is 970. 3. Six points A1 , A2 , A3 , A4 , A5 , A6 lie on a plane in such a way that no three points among them are collinear. Determine the maximum possible value that the minimum value for the angle Ai Aj Ak can take where i, j, k are distinct integers between 1 to 6. Solution (30). When the 6 points form a regular hexagon, the smallest angle formed is 30 . We will show that 30 is the maximum possible value for the smallest angle formed, that is, there must be an angle formed using 3 of the 6 points which measures less than 30 . The convex hull of the 6 points must

1 SOLUTIONS

be either a hexagon, a pentagon, a quadrilateral or a triangle. Hence, there must be an angle formed by points which forms the convex hull of the points which is less than 120 . Suppose this angle is A1 A2 A3 . The three other points, A4 , A5 , A6 must lie in the angular region dened by A1 A2 A3 due to the denition of convexity. As such, there must be an angle smaller than 1 120 = 30 formed by 3 out of the 6 points, which proves that 30 is indeed 4 the maximum value of the minimum angle. 4. Find the smallest integer k 3 with the property that it is possible to choose two of the numbers 1, 2, , k in such a way that their product is equal to the sum of the remaining k 2 numbers. Solution (10). Suppose the two numbers are p and q. We have pq = k(k + 1) 2

k(k + 1) k(k + 1) + 1. This suggests that + 1 has two p q (p + 1)(q + 1) = 2 2 distinct factors larger than 1 but no larger than k +1. We can try several values of k and conclude that k = 10 is the smallest such number which satises the condition.

5. Given that 30! can be written as 26525285p8121910586363084q0000000 where p, q are missing digits, determine p + q Solution (17). We can deduce that 30! ends with 7 0s and hence q is not zero. Then we can use the divisibility rule of 8 and 11 to show that p = 9 and q = 8. Hence p + q = 17. 6. The equation x3 9x2 + 8x + 2 = 0 has three real roots p, q, r. Evaluate 1 1 1 + 2 + 2. 2 p q r Solution (25). First, note that 0 is not a solution of the equation. Hence, we 2 8 9 have 3 + 2 + 1 = 0. Using Vietas theorem, we obtain the following x x x results: 1 1 1 + + = 4 p q r 1 1 1 9 + + = pq pr qr 2

1 SOLUTIONS On the other hand, we have: 1 1 qr 1 1 1 1 1 1 + + 2 + 2 = ( + + )2 2( + p2 q r p q r pq pr ) 9 = (4)2 2( ) 2 = 25. 7. Given that P is a point in an acute angle triangle

ABC such that BP C = AP BC BAC + 90 and AB P C = AC P B. Let k = . Evaluate k 4 . AC BP Solution (4). Construct P B such that P B C ABC. From similarity, we obtain P B AC = AB P C. From the condition of the problem, we have P B = P B and hence P BB is an isosceles right angle triangle. Also, note PC AC = . This suggests that ACP BCB that ACP = BCB and BC BC AP BB and hence = . Finally, we have: AC BC AP BC k= AC BP BB BC = BC BP BB = BP = 2. Hence k 4 = 4.

1 SOLUTIONS

8. Let k be the minimum value of | sin x + cos x + tan x + cot x + sec x + csc x|. k can be represented as p q r where p, q, r are positive integers and q is not divisible by the square of any prime. Find the value of p + q + r. Solution (5). Let a = sin x, b = cos x and P be the expression that we want to minimise. We have P = |a + b + 1 1 a b + + + | a b b a ab(a + b) + a2 + b2 + a + b =| | ab

Let c = a + b. We have c2 = 1 + 2ab and hence 2ab = c2 1. Hence, we have P =| 2ab(a + b) + 2a2 + 2b2 + 2a + 2b | 2ab c(c2 1) + 2(c + 1) =| | c2 1 2 + c| =| c1 2 =| + (c 1) + 1| c1

By R-formula, we know that the c [ 2, 2]. If c 1 > 0, then by AM-GM inequality P > 2 2 + 1. If c 1 < 0, then by AM-GM inequality 2 2 = (1 c) + 2 2 c1 1c with equality achieved when c = 1 2. It follow that the minimum value is 2 2 1 and hence p + q + r = 5. (c 1) + 9. Let x be the number of 7-letter word formed by the 26 english alphabets which x contains consecutive letters which spells SMO. Find the value of . 100 Solution (22848). Using the principle of inclusion and exclusion, we have: x = 5 264 3 26 = 2284802. Hence x = 22848. 100

1 SOLUTIONS

10. Ten positive integers are arranged around a circle. Each number is one more than the greatest common divisor of its two neighbours. What is the sum of the ten numbers? Solution (28). First note that all the integers must be at least 2, because the greatest common divisor of any two positive integers is at least 1. Let n be the largest integer in the circle. The greatest common divisor of its two neighbors is n?1. Therefore, each of the two neighbours is at least n?1 but less than n, and thus they must both be equal to n?1. Let m be one of the numbers on the other side of n?1 from n. Then (n, m) = n?2. Since n?2 0, n?2|n only for n = 3 or 4. If n = 3, each number must be 2 or 3, and it is easy to check that there is no solution. If n = 4, then it is again not hard to nd that there is a unique solution up to rotation, namely 4322343223. The only possible sum is therefore 28. 11. Let x be a real number such that x3 +4x = 8. Determine the value of x7 +64x2 . Solution (128). We have x7 = 4x5 + 8x4 = 8x4 + 16x3 32x2 = 16x3 64x2 + 64x = 64x2 + 128 Hence x7 + 64x2 = 128. 12. In a non-isosceles triangle ABC, D, E are points on BC and AC respectively such that AD bisects BAC and BE bisects ABC. Given that AD BC = BE AC, nd the measure of ACB. sin ACB AD sin ACB BE = and = . Solution. From sine rule we have BC sin BEC AC sin ADC From the condition of the question we have either BEC = ADC or BEC+ ADC = 180 . Since the triangle is non-isosceles, it must be the latter case and CDF E is a cyclic quadrilateral. Hence, ACB = 180 DF E = AF E = 1 DAB + EBA, which suggests that ACB = 180 = 60 . 3

1 SOLUTIONS

13. The average of the numbers 2 sin 2 , 4 sin 4 , 6 sin 6 , 180 sin 180 can be written as cot x . Find the smallest x. Solution (1). 14. Consider the function f (x) = x + 2x + 5 x + 3x + 4x . Find the number 3 of integer values of f (x) in the domain 0 x 100. 5 Solution. First, we note that f (x + 3) = x + 3 + 2x + 6 + x + 5 + 3 3x + 9 + 4x + 12 = f (x) + 35. Hence, for integer n, we have f (3n + z) = 35n + f (z). As such, we need to nd the number of dierent integers that f (x) can take in the range x [0, 3). We note that when x = 6 5 4 3 5 7 9 9 7 12 5 8 11 1 1 1 3 2 3 0, , , , , , , 1, , , , , , , , 2, , , , , , , it gives us 22 dier4 3 2 5 3 4 5 4 3 2 3 4 5 4 3 5 2 3 4 ent integer values of f (x). Hence when x [0, 99), there are 3322 = 726 dier1 1 1 3 2 3 ent values for f (x). For x [99, 100], when x = 99, 99 , 99 , 99 , 99 , 99 , 99 , 100, 4 3 2 5 3 4 it gives us 8 more distinct integer values of f (x). Hence the number of integer values is 726 + 8 = 734.

15. Let f (x) = x3 + x + 1. Suppose g is a cubic polynomial such that g(0) = 1 and the roots of g are the squares of the roots of f . Find g(9). Solution (899). Let the roots of f (x) be , , . We have: 2 + 2 + 2 = ( + + )2 2( + + ) = 2 2 2 2 2 2 2 + + = ( + + )2 2( + + ) =1 2 2 2 = 1 Also since g(0) = 1, we must have g(x) = x3 +2x2 +x1. Hence, g(9) = 899.

1 SOLUTIONS 16. Given that x, y, z > 0, and the three unknowns satisfy the equations: x + y = 13 z + y yz = 25 z 2 + x2 + xz = 144
2 2

10

p q , where p, q, r are integers and q is not divisibly by any z can be written as r square of a prime. Find p + q + r. Solution (56). 17. Find the number of ways of paving a 5 2 wall using 1 1, 2 1 and 2 2 tiles. Solution (306). Let an be the number of ways of paving a n 2 wall. Let bn be the number of ways of paving a n 2 wall with a 1 1 corner removed. We can construct the following recurrence relations: an = bn + an1 + bn1 + 2an2 bn = an1 + bn1 which simplies to give us an = 3an1 + 2an2 2an3 . From a1 = 2, a2 = 8, a3 = 26, we have a4 = 90 and a5 = 306. Hence the solution is 306. 18. Dene a string of 9-digit number composed of 1, 2, , 9 as troll if the number does not contain any three term increasing subsequence (the numbers need not be consecutive). For example, 198765432 and 879365412 are troll sequences but 123456789 and 879364512 are not troll sequences, the latter due to the presence of subsequence 345. Find the total number of troll sequences. Solution (4862). n3 + 1 19. Find the number of ordered pairs of positive integers (m, n) such that mn 1 is an integer. Solution. First, note that m3 and mn 1 are relatively prime. If mn 1 divides n3 1 prime, then mn 1 divides m3 (n3 1) = m3 n3 1 m3 + 1. n3 + 1 This suggests that mn 1 divides m3 1 too. As such, if is an integer mn 1

1 SOLUTIONS

11

then

m3 + 1 is an integer and so we can assume that m n without loss of mn 1 generality.

If m = n, we have the solution m = n = 2. If n = 1, we obtain the solun3 + 1 tions m = 2 or m = 3. Suppose m > n 2. We let a = where k is mn 1 some positive integer. We deduce that k + 1 = mnk n3 and hence k + 1 0 n3 + 1 = bn+1 for some positive integer b. On (mod n). Hence we must have mn 1 n3 + 1 1 the other hand, bn 1 < 2 = n+ 2n 1 suggests that b = 1 and n 1 n1 2 hence n3 + 1 = (mn 1)(n 1). This can be rearranged as m = n + 1 + n1 which gives us the solution m = 5 and n = 2 or n = 3. The solutions for the case when n > m can be obtained by symmetry. In total, we have 9 solutions, which are (1, 2), (1, 3), (2, 1), (3, 1), (2, 2), (2, 5), (3, 5), (5, 2), (5, 3) 20. Given that positive real numbers x, y, z satisfy the condition xy + yz + xz = 1. Find the minimum value of 105x2 + 105y 2 + z 2 . Solution (14). By AM-GM inequality, we have 7x2 + 7y 2 14xy 1 98x2 + z 2 14xz 2 1 2 98y + z 2 14yz 2 Taking sum of the three equations, we have 105x2 + 105y 2 + z 2 14(xy + yz + 14 xz) = 14. Equality occurs when x = y = 1 , z = 29 29 21. Let S denote the set of all ordered triples (i, j, k) of positive integers where i + j + k = 17. Compute ijk.
(i,j,k)S

Solution (11628). The above summation is equivalent to 19 . This can be 5 modelled by the act of choosing 5 objects from a row of 19 distinct objects in a row in the following manner: First we choose two objects from the 19 objects such that it partition it into three dierent groups of objects, each with i, j, k objects respectively. There are i ways to choose an object from the rst

1 SOLUTIONS

12

partition, j ways to choose an object from the second partition, and k ways to choose an object from the third partition. This gives us ijk number of ways after choosing the rst two objects. Hence, by taking the summation of the dierent cases when the rst two objects are selected, this quantity will be equivalent to 19 . 5 22. Circle 1 has centre O, which is on circle O2 . The circles intersect at points A and C. Point B lies on 2 such that BA = 37, BO = 17, and BC = 7. Suppose the area of 1 is x. Compute x. Solution (548). Firstly, by triangle inequality on ABO, we note that the radius of 1 is at least 20. Since BO = 17, B must be within 1 . Let point D be a point on 2 in 1 such that AD = OB and DO = BC. Using Ptolemys theorem, we have AD OB + OD AB = AO DB. We have AO DB = 37 7 + 172 = 548. Since AO, BD are equal to the radius of 1 , the area of 1 = 548. Hence x = 548.

23. Eight celebrities meet at a party. It so happens that each celebrity shakes hands with exactly two others. A fan makes a list of all unordered pairs of celebrities who shook hands with each other. If order does not matter, how many dierent lists are possible? Solution (3507). Dene a loop as a group of n people whereby the rst person shook hands with the second person, the second person shook hands with the

1 SOLUTIONS

13

third person and so on until the last person shook hands with the rst person. There can be no more than two loops in a group of 8 people since the minimum number of people in a loop is 3. Consider the following cases: (a) The group of 8 people forms one big loop. There will be double counting 8! = 2520 for cases when the arrangement is reversed. There are 82 possible arrangements. (b) There are 2 loops, each loop containing 4 people. There are 4! = 315 possible arrangements. 42 (c) There are 2 loops with 5 and 3 people respectively. There are 3! = 672 possible arrangements. 32
8 4

4! 42

8 5

5! 52

Hence, the total number of possible arrangements is 2520 + 315 + 672 = 3507. 24. Suppose m, n are positive integers such that there exists innitely many integers am + a 1 a which such that n is itself an integer. Find m + n. a + a2 1 Solution (8). First, we note that an + a2 1|am + a 1. Otherwise, suppose am + a 1 = (an + a2 1)Q(a) + R(a). The condition suggests that R(x) has an innite number of roots, but it is impossible for a polynomial to have an innite number of roots. Now, we note that the equation an + a2 1 = 0 has a root in between 0 and 1. Suppose the root is r. We also have rm + r 1 = 0 and hence: rm + r = rn + r2 r(1 r) = rn (1 rmn ) r(1 r) = (1 r2 )(1 rmn ) rmn+1 + rmn1 = 1 Since r < 1, we have m n + 1 n, otherwise rmn+1 + rmn1 < rn + am + a 1 = amn rn1 rn + r2 = 1. . By doing long division, we have n a + a2 1 amn+2 amn a + 1 . From the fact that m n + 2 n 1, we must an + a2 1

1 SOLUTIONS

14

either have amn+2 amn a + 1 = an + a2 1 or amn+2 amn a + 1 = (ak)(an +a2 1) for some constant k. Obviously, the former case is impossible. In the latter case, m = 2n1 and we have k = 1. By expanding and comparing terms, we obtain n = 3 and m = 5. Hence, m + n = 8. 25. Ten gangsters are standing on a at surface, and the distances between them are all distinct. At twelve oclock, when the church bells start chiming, each of them fatally shoots the one among the other nine gangsters who is the nearest. At least how many gangsters will be killed? Solution (3). We shall prove that it is impossible 2 gangsters to be killed only. Suppose that A, B are dead and A is to the left of B. First, A and B must kill each other and hence the length AB must be the minimum of all segments. Next, we note that including B, the maximum number of people who shot A must not exceed 5. If there are 6 people who aimed A, there must be an angle XAY which is less than or equals to 60 . In XAY , XY will be shorter than AX and AY and hence X and Y will not shoot A. As such, there must be exactly 5 people who shot A and B respectively. We denote those people who shot A as A1 , A2 , A3 , A4 and those people who shot B as B1 , B2 , B3 , B4 . Suppose we label them such that A1 , A2 , A3 , A4 are in clockwise order and B1 , B2 , B3 , B4 are in an anti clockwise order, and that A1 , B1 are on the same side of AB while A2 , B2 are on the other side of AB. Since all angles Ai AAj and Bi BBj are at least 60 , we must have the following inequality by Pigeonhole principle: A1 AB + BAA2 + B1 BA + ABB2 < 360. Without loss of generality, we assume that A1 AB + BAA2 < 180 . We note that quadrilateral A1 ABB1 is convex since A1 and B1 are on dierent sides of the perpendicular bisector of AB. From A1 B1 > A1 A and BB1 > AB we obtain A1 AB1 > A1 B1 A and BAB1 > AB1 B. Adding these relations yields A1 AB > A1 B1 B. Similarly, B1 BA > B1 A1 A. Adding these two inequalities, we get: 180 > A1 AB + B1 BA > A1 B1 B + B1 A1 A which implies that the sum of angles in quadrilateral A1 B1 BA is less than 360 , which is a contradiction. Hence, at least 3 people must be killed. The diagram below shows a possible conguration where 3 people were killed.

1 SOLUTIONS

15