SMO 2008 Open Solution

Singapore Mathematical Society Singapore Mathematical Olympiad (SMO) 2008 (Open Section, Round 1 Solutions) Answer: 93640 For i= 0,1,2, let Ai = {x | 1 < @ < 120 and x =i (oh 3) }. Then [Ail = 40. If {a,b,c} is a 3element subset of the given set, then 3 divides a +6 +c if and only if exactly one of the following conditions holds: (i) all a,b, are in Ap, oF in Ay or in Ay (ii) one of the a,4,¢ is in Ap, another in Aj, and the third one in Ay. The number of B-element subsets of A; is (“?). For each choice of a in Ap, bin A; and c in Ag, we get a Selement subset such that 3 divides a +6 -+¢. Thus the total number of 3-element subsets {a,b,c} such that 3 divides a +b +c is equal to 3(%) +40 = 93640. Answer: 5. Without loss of generality, we may assume that every problem is solved by some student. Let A be one of the students. By assumption each of the 9 other students solves at least cone common problem as A. By the pigeonhole principle, there are at least 3 students who solve a common problem which is also solved by A. Therefore the minimum number of students who solve a common problem which is solved by most students is at least 4. If ‘the minimum number is exactly 4, then each problem is solved by exactly 4 students. If there are n problems in the competition, then 4n = 30. But this is a contradiction since 4 does not divide 30. Hence the minimum number of students who solve a problem which is solved by most students is at feast 5. We shall show that 5 is in fact the minimum in the following example, where we write (123) to mean that a student solves problems 1,2 and 3: (123) (235) (145) (156) (162) (246) (346) (356) Answer: 66666, Note that [logo(1)| = 0, and [log (n)j = kif 2° 100. Consider the following set A A= {1+ 1li:i=0,1,2,--- 9} 4li. 12. Note that |A| = 10, A C Ny and ip,la-o=1 Hence the answer is not larger than 99. Now consider the case that n < 99. For i= 1,2,3, ={G-Y+j:1s5su)} Note that Nnc U P. 1size Now assume that A is any subset of N,, with |] > 10. By Pigeonhole Principle, |ANP;| > 2 for some i: 1 <4 <9. Let ei,e9 € ANP, Thus i,m, la - 6] < Jer ~ op] < (11(i - 1) + 11) ~ (I~ 1) +1) = 10. Answer: 2645. Let abed represent the integer a x 108 +b x 10? +¢ x 10 +d. Note that abed > 5000 iff @ > 5 and b,c,d are not all 0. a must be a number in {5,6,7,8,9}. Suppose that a is selected from {5,6,7,8, 9} IF 4 is not repeated, then the number of ways to choose b, c,d is 9 8 x 7; If 4 appears exactly twice, then the number of ways to choose b, c,d is (3) x 8; If 4 appears exactly three times, then the number of ways to choose 6, ¢, dis 1. Hence the answer is sxoxaxrs (2) sen) =2008 Answer: 3024, Let @ be the set of arrangements of these girls and boys under the condition that 4, must be separated by exactly 4 boys. Form a block P with A, B at the two ends and exactly 4 boys between them. The number of ways to form such a block P is Then we have w=a (2) ann ‘as we can consider such a block P as one item, and there are still 5 boys and one girl (ie, €). Note that in any arrangement in , C’ is outside the block between A and B. In exactly half of the arrangements of ¢, B is between A and C. Hence ‘9 =|61/2=(°) x atx 7 n= |b|/2 (:) Hence the answer is (3) x 4! = 3024. a13. Answer: 11901 For i = 0,1,2, let (F155 5205 Note that |Ao| = 6, [Ai] = 7 and |Ao| = 7. It can be shown that for a,b, c,d € {1,2,3,4,--- ,20}, a +6-+ 0+ dis divisible by 3 iff (8) [{a,b, c,d} Ay] = 2 for all i = 1,2; of (ii) |{a,b,¢,d} 0 Ag] = 1 and [{a,b,¢,d} Ail = 3 for some i: 1 0, ; > 0, and a,j, are positive integers. The number of positive divisors of ais (ma + 1)(ra + 1(m5 +1) TT (Ai +2). sien Since 30 = 2 x 3x 5, we have r= Dif (ng + 1)(ng + 1)(m5 +1) J] (+1) = 30. sien Hence 30|a and a has exactly 30 positive divisors iff a = 2"3"85"° and (nz + 1)(m3 + 1}(n5 +1) = 30, where ng, n3,n5 are all positive. Further, (n2 + 1)(n3+1)(n5-+1) = 30, where ng,%3,75 are all positive, iff {n2,na,n5} — {1,2,4} The maximum value of such a is a = 2 x 3? x 5* = 11250. 3SD 16. Answer: 500. Let m be the maximum integer such that 2" is a factor of 1 x 2x 3x4 x ++ x 2008, and n the maximum integer such that 5" is a factor of 1x 2x 3x4 x -++ x 2008. Then the number of O's at the end of 1 x 2x 3x 4x --- x 2008 is equal to i n {m,n} It is obvious that m > n. Observe that 2008 < 5°. For 1 < k < 4, the number, denoted by ag, of integers in {1,2,3,4,--- ,2008}, denoted by A, divisible by 5* is ax = [2008/5*| So a; = 401, ay = 80, ag = 16, ay ~ 3, Thus, there are exactly 3 numbers in A divisible by 54; exactly 16 ~ 3 = 13 numbers in A divisible by 5? but not by 54 exactly 80 — 16 = 64 numbers in A divisible by 5? but not by 5°; exactly 401 — 80 = 321 numbers in A divisible by 5 but not by 52. Hence, the maximum integer n such that 5” is a factor of 1 x 2% 3.x dx --- x 2008 is ns4x 3493x1342 x 6441 x 321 = 500. 17. Answer: 67 Let a be the coefficient of «in the expansion of (1 + 2x)!. Then Thus 2)/C2 Solving the inequality 2(100 ~ r) “7 oo r+ ives the solution r < 19/3. It implies that Aq < ay < +++ < 65 < G67 > Aas > +++ 2 ago. Hence the answer is 67. 18. Answer: 19. Note that mC) -(0)-C2) Thus Thus the answer is 19.

SMO 2008 Open Solution

Uploaded by

Copyright:

Available Formats

SMO 2008 Open Solution

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SMO 2008 Open Solution

Uploaded by

Copyright:

Available Formats

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.