KMO Test 1

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

Suggested Solutions Page 1 January10th , 2019

KENYA MATHEMATICS OLYMPIAD-KMO


OLYMPIAD TEST #1
SUGGESTED SOLUTIONS
TIME: 2 HOURS
INSTRUCTIONS TO CONDIDATES
1. This paper has a total of 10 QUESTIONS and each question is WORTH 10 marks.

2. Full written solutions NOT just final answers are required with complete proof or justification of any assertions
you make.
3. Please read the INSTRUCTIONS for each individual problem carefully.One of the skills being tested on this
exam is your ability to interpret questions, so we do not answer questions about exam problems during the
exam.

4. SHOW an appropriate amount of work for each exercise so that we can see not only the answer but also how
you obtained it.Make sure your answers are well organized and easy to follow for full credit.You are advised to
work in rough first then draft your final version before writing out your best attempt.Rough work should be
handed in but clearly marked as rough work.

5. Attempt ALL Questions.You MUST use a pencil.


6. Rulers, pair of compasses, rough paper and erasers are ALLOWED.
7. Calculators,Formula tables and other Geometrical Instruments are NOT permitted.
8. Attempt ALL questions (Enjoy as many questions as possible!)

c vcnandwa@gmail.com/bentitokyalo@gmail.com/Geoffrey.Mboya@maths.ox.ac.uk Turn Over


Suggested Solutions Page 2 January10th , 2019

1. An integer is chosen from the set {1, 2, 3, ..., 499, 500}.The probability that this integer is
divisible by 7 or 11 is m
n
in its lowest terms.Find the value of m + n
Solution
Since      
500 500 500
= 71 , = 45, =6
7 11 77
There are 71 multiples of 7, 45 multiples of 11 and 6 multiples of 77 that are less than 500.
So there are 71+45-6 = 110 numbers in the set which are multiples of 7 or 11.
Hence the probability equals:
110 11
=
500 50
=⇒ m = 11, n = 50 =⇒ m + n = 11 + 50 = 60

2. The difference between the highest common factor and the lowest common multiple of x and
18 is 120. Find the value of x.
Solution
Let
k = gcd(x, 18)
x
a =
k
18
b =
k
Then we have gcd(a, b) = 1
Using the formula;
18x = gcd(x, 18) × lcm(x, 18)
We get lcm(x, 18) = kab
From information given,
kab − k = 120
Clearly gcd(ab − 1, b) = 1
So, k = gcd(kab − k, kb) = gcd(120, 18) = 6
Hence b = 3, a = 7 and x = 42

3. Let α and β be the roots of x2 − 4x + c = 0, where c is a real number.If −α is a root of


x2 + 4x − c = 0, find the value of αβ
Solution
We have:
α is a root of the equation x2 − 4x + C = 0
⇒ α2 − 4α + C = 0 ..................... eqn 1
α is a root of the equation x2 − 4x − C = 0
=⇒ −α2 − 4 − α + C = 0
=⇒ α2 − 4α − C = 0.....................eqn 2
Adding these two equations you get:
C=0
And αβ = C = 0
Therefore αβ = 0

c vcnandwa@gmail.com/bentitokyalo@gmail.com/Geoffrey.Mboya@maths.ox.ac.uk Turn Over


Suggested Solutions Page 3 January10th , 2019

4. Let m, n be integers such that 1 < m ≤ n. Define


1 1 1 1
f (m, n) = (1 − ) × (1 − ) × (1 − ) × ... × (1 − )
m m+1 m+2 n
If
S = f (2, 2008) + f (3, 2008) + f (4, 2008) + ... + f (2008, 2008)
Find the value of 2S
Solution

         
m−1 m m+1 n−1 m−1
f (m, n) = × × × ··· × =
m m+1 m+2 n n
⇒ f (2, n) + f (3, n) + f (4, n) + · · · + f (n, n)
1 + 2 + 3 + · · · + (n − 1) n−1
= =
n 2
2008 − 1
f (2, 2008) + f (3, 2008) + f (4, 2008) + · · · + f (2008, 2008) = =S
  2
2008 − 1
⇒ 2S = 2 = 2008 − 1 = 2007
2
=⇒ 2S = 2007

5. Let a and b be the roots of x2 +2000x+1 = 0 and let c and d be the roots of x2 −2008x+1 = 0.
Find the value of
(a + c)(b + c)(a − d)(b − d)
Solution
Using the formula for sum and product of roots we get the following three equations:
ab = cd = 1
a + b = −2000
c + d = 2008

Hence:
(a + c)(b + c)(a − d)(b − d) = [ab + (a + b)c + c2 ][ab − (a + b)d + d2 ]
= (1 − 2000c + c2 )(1 + 2000d + d2 )
= (1 − 2000c + 2008c − 1)(1 + 2000d + 2008d − 1)
= (8c)(4008d)
= 32064cd
but
cd = 1 =⇒ 32064cd = 32064 × 1 = 32064

c vcnandwa@gmail.com/bentitokyalo@gmail.com/Geoffrey.Mboya@maths.ox.ac.uk Turn Over


Suggested Solutions Page 4 January10th , 2019

6. 4 black balls and 2 red balls are arranged in a row.Find the total number of ways this can be
done if all the balls of the same colour do not appear in a consecutive block.
Solution
Using the Inclution - Exclusion Principle, the number of ways is:
10! 7! 7! 9! 6! 6! 4!
− − − + + + − 3!
4!4!2! 4!2! 4!2! 4!4! 4! 4! 2!
= 3150 − 105 − 105630 + 30 + 30 + 12 − 6
= 2376

7. Given that n is a ten-digit number in the form 2007x2008y where x and y can be any of the
digits 0,1,2,...,9. How many such numbers n are there that are divisible by 33?
Solution
Since 33 = 3 × 11 and gcd(3, 11) = 1, we have
2007x2008y ≡ 0(mod33)
⇒ 2007x2008y ≡ 0(mod3) and 2007x2008y ≡ 0(mod11)
⇒ 2 + 7 + x + 2 + 8 + y ≡ 0(mod3) and y − 8 + 2 − x + 7 − 2 ≡ 0(mod11)
⇒ 1 + x + y ≡ 0(mod3) and y − x ≡ 1(mod11)
The second congruence implies that (x, y) = (0, 1), (1, 2), (2, 3), · · · , (8, 9).
From the set it is easy to notice that only 3 of them satisfy the first congruence, namely:
(2, 3), (5, 6) and (8, 9)

Hence there are three such numbers n

8. In triangle ABC, AB = (b2 − 1)cm, BC= a2 cm and AC = 2acm, where a and b are positive
integers greater than 1. Find the value of a − b
Solution
Using triangle inequality, we have
a2 + 2a > b2 − 1 ⇒ a2 + 2a + 1 > b2
⇒ (a + 1)2 > b2
2 2
2a + b − 1 > a ⇒ b2 > a2 − 2a + 1
⇒ b2 > (a − 1)2
Hence we have:
(a − 1)2 < b2 < (a + 1)2
Since all the numbers are positive, we get a−1 < b < a+1, which is equivalent to −1 < a−b < 1.
Since a − b is an integer, we must have a − b = 0

c vcnandwa@gmail.com/bentitokyalo@gmail.com/Geoffrey.Mboya@maths.ox.ac.uk Turn Over


Suggested Solutions Page 5 January10th , 2019

9. How many positive integers n, where 10 ≤ n ≤ 100, are there such that
n2 − 9
n2 − 7
is a fraction in its lowest terms?
Solution
Note that:
gcd(n2 − 9, n2 − 7) = 1 if and only if gcd(n2 − 9, 2) = 1
2 −9
Hence the fraction nn2 −7 is in lowest terms if and only if n2 − 9 is an odd number.
This is equivalent to the condition that n is an even integer.
Since 10 ≤ n ≤ 100, there are
100 − 10
+ 1 = 45 + 1 = 46
2
possible positive integers n

10. Let n be a positive integer such that n2 + 19n + 48 is a perfect square.Find the value of n.
Solution
Note that n2 + 19n + 48 = (n + 3)(n + 16)
Let d = gcd(n + 3, n + 16), we now prove that d=1.
We have:
d = gcd(n + 3, n + 16) = gcd(n + 3, 13)
⇒ d = 13 or 1
If d = 13, the n + 3 = 13k for some integer k.
This implies that n + 16 = 13(k + 1)
However, (n + 3)(n + 16) = 169k(k + 1) cannot be a square, so we must have d = 1.
Since (n + 3)(n + 16) is a perfect square and gcd(n + 3, n + 16) = 1, both (n + 3) and (n + 16)
must be perfect squares.
Their difference is 13.
From the list of perfect squares, one finds easily that 62 and 72 are the only pair with a
difference of 13.
Thus
n + 16 = 72 ⇒ n + 16 = 49 ⇒ n = 49 − 16
=⇒ n = 33

c vcnandwa@gmail.com/bentitokyalo@gmail.com/Geoffrey.Mboya@maths.ox.ac.uk Turn Over

You might also like