Senior Secondary 2018

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

WMC 2018 Senior Secondary Solutions

Section A

1. D (2016 − 2017) + (2018 − 2019) + 2020 = −1 − 1 + 2020 = 2018

1 9
6a+18b a+3b 2+2
2. D 12a+6b = 2a+b = 1+ 32
= 10.

2 31
3. C 0< 7 <1<7< 4 < 8 so the only integers are 1, 2, 3, 4, 5, 6, 7.

4. C There are 2016 ÷ 4 = 504 groups of 1, 2, 3, 4 and an extra 1 and 2. Thus the total sum is
is 504(1 + 2 + 3 + 4) + 1 + 2 = 5043.

5. E P 2n Qm = (2m )2n (3n )m = 4mn × 3mn = 12mn

6. E Since y < 20 we have x ≤ 2 and since x and y are distinct, we have x = 2 and y = 8 and so y 2 = 64.

7. D Let k be the number of peanuts that John ate on the final night. Then k + (k − 6) + (k − 12) + (k − 18) =
120 =⇒ k = 39.

8. D The sum of the numbers from 1 to 11 is 11×12


2 = 66 and the sum of the remaining ten numbers must be
61 so the number that must be removed is 66 − 61 = 5

9. D Let x be the age of the youngest child. Then x + (x + 1) + (x + 2) = 42 =⇒ x = 13. The age of the
oldest child is 13 + 6 = 19.

40 10
10. C 100 ×P = 100 × Q =⇒ 4P = Q and so P is 25% of Q.

Section B

√ √
11. 6 Pythagorus on 4ABD and 4CBD gives AD = x2 + 16 and CD = x2 + 81. Then Pythagorus on
4ACD gives x2 + 16 + x2 + 81 = 132 =⇒ x = 6.

2x2
12. 5
Let s be the width of the rectangle and the length is 2s. Then the area of the rectangle is 2s2 . Now we
2 2
have that s2 + (2s)2 = x2 and so s2 = x5 =⇒ Area of rectangle = 2s2 = 2x5 .

13. 26 Bertha has 30 − 6 = 24 granddaughters and so 4 of her 6 daughters have 6 daughters. So 30 − 4 = 26 of


her daughters and granddaughters do not have daughters.

14. 196 Consider the sets {1, 2, 3} and {6, 7, 8}. We must choose at least element from both of these sets, which
we can do in 23 − 1 = 7 ways. Now for the set {4, 5} we can choose any (including the empty set) subset
so we have 22 = 4 choices. So the total number of such subsets is 7 × 7 × 4 = 196.

1
15. 5200 The polygon can be uniquely formed as shown in the diagram. The area is then equal to 80 × 100 − (10 ×
80 + 50 × 40) = 5200.

20
10
80
30

40

70

50

60

1
16. 10
Let |BD| = a =⇒ |AB| = 4a and |CD| = b =⇒ |AC| = 9a. Then |BC| = |BD − CD| = a − b. Also
|BC| b 1
AD = 5a = 10b =⇒ a = 2b =⇒ |BC| = 2b − b = b. So |AD| = 10b = 10 .

17. 50 Suppose without loss of generality that we have a 100 kg orange. Then 80 kg is water, and 20 kg is other
content. Now 75% of 80 is 60 so we have 80 − 60 = 20 kg of water left. Then the percentage of water in
the remaining orange is 20 ÷ (20 + 20) × 100 = 50%.

18. 222 Note that 2018 in base 3 is 2202202. So consider k = 1, 2, 3, 4, 5, 6. Then there are 2k trinary numbers
of length k that satisfy the condition since each of the digits can be 1 or 2. Then suppose the trinary
number has seven digits. Then if the first digit is 1 the rest of the numbers can be any of one and
two so we get 26 = 64 numbers, and if the first digit is 2, the next has to be 1 or it is too large, and so
the rest of the 5 can be filled in 25 = 32 ways. So in total we have 2+4+8+16+32+64+64+32 = numbers.

19. 13 It is clear that 60! and 65! end in more zeros than 55! so we must find how many zeros 55! ends in. This
can be done by counting how many factors of 5 are in the product 55 × 54 × · · · × 2 × 1 since to get a zero,
we need a factor of 10 made by a 2 and a 5 and there are more 20 s than 50 s. Now there are 11 numbers
in the product divisible by 5 and 2 are divisible by 25, so in total we have 11 + 2 = 13 factors of 5. Thus
there are 13 zeros at the end of the sum.

2p−1
20. 2p−1 −1
Since p > 1, the numerator and denominator converge. Let 1 + 21p + 31p + 41p + · · · = L. Now
1 − 21p + 31p − 41p + · · · = 1 + 21p + 31p + 41p + · · · − 2( 21p + 41p + . . . ) = 1 + 21p + 31p + 41p + · · · − 22p ( 21p + 21p + . . . )
1 L(2p−1 −1)
=L− 2p−1 (L) = 2p−1
1+ 21p + 31p + 41p +... p−1
2p−1
Then 1 1 1
1− 2p + 3p − 4p +...
= L × L(22p−1 −1) = 2p−1 −1 .

2
Section C

Question 21

No, it is not possible.


There are 210 different bulb configurations. Now there are also 36 5 × 5 sub-grids and 64 3 × 3 sub-grids. Now
suppose we choose some of these sub-grids: the number of ways is 264 × 236 = 2100 . Now label the 1 × 1 grids
by (i, j) where 1 ≤ i, j ≤ 10 with the top left square being (1, 1). Choose the 5 × 5 grids with top left squares
(1, 1) , (1, 4) , (4, 1) , (4, 4) and the 3 × 3 grids with top left corners (1, 1) , (1, 6) , (6, 1) , (6, 6).This leaves the
configuration unchanged. So there exists a configuration of the bulbs that can be reached by two different grid
choices, hence there must be one that cannot be reached.

Question 22
The only prime in the sequence is 101. Clearly 101 is prime. We then show that there are no other primes in
the sequence.
2 n+1 n+1 n+1
= (10 −1)(10
Pn
The nth term in the sequence is equal to k=0 102k = (10 99) 99
+1)
. Now 10n+1 − 1 is divisible
n+1 n+1
by 9 and let 10 9 −1 = Kn ∈ N. So the nth term in the sequence is Kn × 10 11 +1 which we know is a positive
integer, and since 11 is prime, it must divide either Kn or 10n+1 − 1. Now since n ≥ 2 both Kn and 10n+1 − 1
are greater than 11 and so if 11 divides one of them, it is in the form 11a for some positive integer a greater
than 1. Then the nth term is the product of two numbers greater that 1 and cannot be prime.

You might also like