0% found this document useful (0 votes)
974 views9 pages

SMO 2005 Open Solution

SMO 2005 Open Solution

Uploaded by

wmdsg
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
974 views9 pages

SMO 2005 Open Solution

SMO 2005 Open Solution

Uploaded by

wmdsg
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9
Singapore Mathematical Society Singapore Mathematical Olympiad (SMO) 2005 (Open Section, Round 1 Solutions) 1. Ans: 000 gi 1 = (1-19) — 1000% TOO) 04, (100) 2, (100) 100 1 (P) ots (0 +( 100) 0 for some integer k. Thus, the last three digits are 000. 2. Ans: 4 P lies on the radical axis of C; and Cz and hence has equal power with respect to both circles. Now PQ = Power of P with respect to Cz = Power of P with respect to C, 5-3? = 16. 3. Ans: 409 If n! ends with exactly 100 zeros, then in the prime factorization of n!, the prime factor 5 occurs exactly 100 times (we need not worry about the prime factor 2 since it will occur more than 100 times). The number of times that 5 occurs in n! is given, by iel+lsl+13l+~- Also the factor 5 occurs 24 times in 100!. Thus the answer is about 400. Now 400| | 400}, | 400 aud = 3=99 || [3] [B+ 80 +16 +3 = 99. It follows that 400! ends with exactly 99 zeros. Thus the answer is 409. 4, Ans: 4 For the equation to have a solution, & must be nonnegative, for if k < 0, then Vr -k+2V2?-12 Ve —k >a. Rewrite the given equation as 2/72 —1 = 2 — Vz? —K. By squaring we obtain Qe? + k 4 = ~2ey/2? —k, Squaring again and solving for x, we obtain (kay 6. ‘Thus 0 < k < 2 and the only possible solution is x = Substitute this vara “ubstitute value of # into the given equation and multiplying throughout, by /8(2— k), we obtain VE 4)? BOB + 2, —k. Hence, [3k ~ 4] + 2) Bk-4 <0; ie. 3k —(3h — 4) which holds if and only if 4. Therefore, the maximum value of 3 is 4. Ans: 43 Note that 7#=1 (mod 100). Now 3005 = (1) — 1-3 (mod 4) Hence 3° = 4k +3 for some positive integer k. ‘Thus me paket =43 (mod 100). Ans: 1004 Take any set 1004 numbers. Write each number in the form 2%b,, where a; > 0 and b; is odd. Thus obtaining 1004 odd numbers bs,..., Boos Since there are 1003 odd numbers in the first 2005 natural numbers, at least two of the odd mumbers are the same, say bj = b;. ‘Then 2b, | 2%by if 2%), = 2b. The numbers 1003, 1004,...,2005 are 1003 numbers whiere there is no pair such that one of them is divisible by the other. So the answer is 1004. Ans: 5097 We use the fact that every positive integer can be expressed uniquely in any base a2, As £() = 24, we see that the coetticients of f(r) are nonnegative integers less than 25, Therefore #(25) = 78357, when written in base 25, allows ws to determine the coefficients. Since T+9% 2545 x 255 we obtain f(z) = 7+ 9x +528. Hence f(10) = 5097. Ans: 853 First observe that |x + 745] = Lr] or [z] +1 for 11 flm) + f(r). Putting m = n = 1 we obtain f(2) > 2f(1). Since f(2) = 0 and f(1) is non- negative, f(1) Next, since £8) =f2+1 = fQ+FY+ {0 or Y={0 or 4}, where (3) > 0, it follows that f(3) = 1. Now, it can be proved inductively that f(8n) > ne for all n. Also, if f(3n) > n for some n, then {(3m) > m for all m > n. So since f(3 x 3333) = (9999) = 3333, it follows that f(3n) = n for n < 3333. In particular f(3 x 2005) = 2005. Consequently, 2005 = f(3 x 2005) > f(2 x 2005) + f(2005) > 3f(2005) and so f(2005) < 2005/3 < 669. On the other hand, (2005) > f(2004) + f(1) = f(6 x 668) = 668. ‘Therefore f(2005) Ans: 15 Let ZC = 2ZA and CD the bisector of ZC. Let BC = 2-1, r AB = 2+1. Then AABC is similar to ACBD. Thus BD/BC = BC/AB so that BD = (x 1)?/(z+1). Also CD/AC = CB/AB so that AD = CD = (eI) /(x +1) 68. e A oI 5 As AB = AD + BD, we have w(x ~ 1)/(a-+1) + (e—1)?/(# + 1) = 2+ 1. Solving this, the only positive solution is « = 5. ‘Thus the perimeter of the triangle is 4454+6= 16. 34 AL. Ans: 1 AE = AB cos60°. ZAHE = ZACB. Hence AH = AB/sin ZAHB = AB cos60°/ sin ZACB = 2Rcos 60°, where R = 1 is the radius of the circle. Therefore, AH ~ 1. 12. Ans: 225 Since £(6 +n) = f(F(6) +n) = f(2 +n) for all n, the function f is periodic with period 4 starting from 3 onwards. Now f(6), f(3) = £(9),F(4) = F(12) and £(8) = f(15) are four distinct values. Thus in every group of 4 consecutive positive integers 2 3, there is exactly one that is mapped by f to f(2005). Since the collection of three-digit positive integers can be divided into exactly 225 groups of 4 consecutive integers each, there are 225 three-digit. positive integers 1 that satisfies f(m) = f(2005). 13. Ans: 5 Setting « 2, we see that {{x,x) = f(x.) —2f(x, 2) - 22 for all x. Hence f(x,) = ~z for all x. Setting y wx gives Ses) = f(x, 2) — 2f(«,z) — 22 for all 2 and z. Hence f(x, 2) = ~f(¢,) ~ 22 = 2 — 22 for all x and 2. Therefore, F(2005, 1000) = 5, 14. Ans: 2 15. Ans: 199 From 1000+ 10b+e=a+b-+re-+ab+be-+actabc, we get (99-b—c—be)a Note that LHS > 0 (since b+ c+ be = (1+6)(1 +e) —1< 99) and RHS we must have b Since a > 1, n = 199 is the answer 35 16. Ans: 1 Note that the value of 2? (mod 8) is completely determined by the value of (mod 4). Furthermore, @y = an-1+n-2 (mod 100) = @n1 + an-2 (mod 4) Thus the sequence (a, (mod 4)),ez+ equals (1,2,3,1,0,1,1,2,3.1,0,1,1,2...), which has a cycle of length 6. Also, the sum of the squares in one cycle is 0 (mod 8). Now 2005 = 6 x 334 +1. Thus the required answer is 1 17. Ans: 20 Let N = 10a +6. When 6 ¢ 0, 10% — N is a N-digit number whose first NV — 2 digits are 9 and the last, two digits are (9 —a) and (10 ~ b). ‘Thus the sum of digits of 10% — N equals 9(N — 2) + 19 — (a + b) = 89a + 86+ 1. Thus, we need a@=1 (mod 2); ~a+3b=—1 (mod 5); 4a +8b=—1 (mod 17) a= 1 has no solution, but @ = 3,b = 9 is a solution, When b = 0, the sum of digits is 9(V — 2) + (10 ~ a) = 89a —8. Thus a is even. a= 2is a solution. Thus the answer is 20 since it is < 39. 18. Ans: 11 It can easily be checked that if 1,2,9,10 are red and 3,4,5,6,7,8 are blue, then there do not exist 2, y, z,w of the Same colour such that x+y -+2=w. Son > IL Suppose there exists a colouring (for n = 11) such that there do not exist 2, y, 2, of the same colour such that x ++ 2 = w. Then 1,9 must be of a different colour from 3. Thus say 1 and 9 are red, and 3 is blue. Since 7-+1+1 = 9, 7 must then be blue. Now, 2+343 = 7, so that 2 is red, and hence 4 (= 1+1 +2) is blue. But ML =34+44+4=941+41, a contradiction. 19. Ans: 3 ‘The inequality can be transformed to 302y | 25ly 200 * "> 300 ‘We first need to the minimum positive integer y such that the interval (2#, 23) contains an integer. ‘This minimum value of y is 2. When y = 2, this interval contains only one integer, that is 3. Thus the answer is 3. 20. Ans: 30499 Let f = 160 x 170 x 180 x 190. Observe that f = (175? ~ 15%)(175? — 5%). Let a = 175-125. Then f = (~100)(c+100) = 2? -10000 < x?. Since « = 1757-125 36 23, and f —(x—1)? = x? — 1000 ~ (. the minimum positive integer n such that n? < f is 2-1 = 175? — 126 — 1)? = 2x —10001, we have f > (2 —1)?. Thus 30499. Ans: 16 Let m-+++-+2005n2 = f(n)(n—1)+a where f(n) is a polynomial of n. Ifn = 1, we have a = 1+2+---+ 2005 = 2005 x 1003. Observe that n+ --- + 20051709 js divisible by m ~ 1 if and only if a = 2005 x 1003 is divisible by n ~ 1. The prime factorization of a is a = 5 x 401 x 17 x 59, So @ has only 2* = 16 factors. Thus there are 16 possible positive integers n such that n +--+ + 2005n29 js divisible by n=1 Ans: 24068 Consider the sequence of ten 1's. There are eleven spaces between two 1's, or before the leftmost 1 or after the rightinost 1. For each of these spaces, we can put either two 0's (double 0's) or only one 0 (single 0). If there are exactly k doubles 0's, then there are only 10 ~ 2k single 0's, The number of ways for this to happen is (3) GRDA)- Thus the answer is s (“) Ga) = 24068, =o Ans: 12 Let BE = 2. By cosine rule, 1? + 282 _7 WAV) BB 14? + 28? i 14)(28) «16 cos B= and cos A= ‘Thus CD? = 14? + 7? — 204)(7) (4g 1 so that CD © 4 at a a Ae 1? 4 7 cos ZACD = =3 ‘Thus 2B = ZACD = ZBCE sw that tingle BEC is isosceles, Therefore, BC__ 28 _ =o 12 2eos B

You might also like