Canadian Open Mathematics Challenge: The Canadian Mathematical Society
Canadian Open Mathematics Challenge: The Canadian Mathematical Society
in collaboration with
The
Canadian Open
Mathematics Challenge
Wednesday, November 27, 2002
Solutions
Part A
1.
Q
2.
13
12
F 5 R
Solution 1
x 2 + 5 xy + y 2 = x 2 + 2 xy + y 2 + 3 xy
= ( x + y ) + 3 xy
2
= 4 2 + 3(12)
= 20
Solution 2
Examining the two given equations, we see that x = 6 and y = 2 is a solution.
Solution 3
We solve the first equation for x and substitute into the second equation.
From the first equation, x = 4 y .
R
P
60 102
90 108
E
O
1
5
(540 ) = 108 .
o
Therefore,
AER = 360o REN NEP PEA
4.
) (
Solution 1
The sum of the 3rd, 4th and 5th terms of the sequence is equal to the sum of the first five
terms of the sequence minus the sum of the first two terms of the sequence.
][
Solution 2
We determine the first 5 terms in the sequence and then add up the 3rd, 4th and 5th terms.
From the formula given, the sum of the first 1 terms is 11.
This tells us that the first term is 11.
From the formula given, the sum of the first 2 terms is 32. Since the first term is 11, then
the second term is 21.
Next, the sum of the first 3 terms is 63, and so the third term is 31, since the first two terms
are 11 and 21. (We could use the fact that the sum of the first two terms is 32, instead.)
Next, the sum of the first 4 terms is 104, and so the fourth term is 41.
Lastly, the sum of the first 5 terms is 155, and so the fifth term is 51.
Therefore, the sum of the 3rd, 4th and 5th terms is 31 + 41 + 51 = 123 .
Solution 3
Since the sum of the first n terms has a quadratic formula, then the terms in the sequence
have a common difference, i.e. The sequence is an arithmetic sequence.
Therefore, the sum of the 3rd, 4th and 5th terms is equal to three times the 4th term.
The 4th term is the sum of the first four terms minus the sum of the first three terms, i.e.
104 63 = 41.
Thus, the sum of the 3rd, 4th and 5th terms is 3( 41) = 123.
5.
Solution 1
Since the value of this expression is the same for every positive integer a, then we can find
the value by substituting in a = 1.
Thus,
[(2a 1)(2a + 1)] = [13] = 1 + 2 + 3 = 6 = 2
[(a 1)(a + 1)] [02] 0 + 1 + 2 3
Therefore, the value required is 2.
Solution 2
If a is a positive integer, the only integer between 2 a 1 and 2 a + 1 is 2a . Similarly, the
only integer between a 1 and a + 1 is a.
Thus,
[(2a 1)(2a + 1)] = (2a 1) + 2a + (2a + 1) = 6a = 2
3a
(a 1) + a + (a + 1)
[(a 1)(a + 1)]
Therefore, the value required is 2.
6.
2( SA + AB + BC ) = 2 1 +
1
3
1
2 3
2 3
)=2+
3
3
=2+ 3
7.
Solution 1
Since P is formed by adding a 1 at the end of N, then P = 10 N + 1.
Since Q is formed by adding a 1 in front of the 5 digits of N, then Q = 100000 + N .
Since P = 3Q ,
10 N + 1 = 3(100000 + N )
10 N + 1 = 300000 + 3N
7 N = 299999
N = 42857
Therefore, N is 42857.
Solution 2
Suppose N has digits abcde. Then since P = 3Q , we have abcde1 = 3(1abcde) .
Since the units digit on the left side is 1, then the units digit on the right is also 1, which
means that e = 7 .
Thus, abcd 71 = 3(1abcd 7) . Since the tens digit on the left side is 7 and we get a carry of
2 from multiplying the last digit on the right side by 3, then 3 d has a units digit of 5, i.e.
d = 5.
Thus, abc 571 = 3(1abc 57) . Since the hundreds digit on the left side is 5 and we get a carry
of 1 from multiplying the last two digits on the right side by 3, then the units digit of 3 c
must be a 4, i.e. c = 8 .
Thus, ab8571 = 3(1ab857) . In a similar fashion, we see that b = 2 and a = 4 .
Therefore, N = 42857 .
8.
We are not told that M must be a positive integer, but it makes sense to look for a positive
integer M that satisfies these conditions, since we want the maximum possible value of M.
Since there are 1000 numbers in the set {1, 2, 3,K, 999,1000} and the probability that an x
1
chosen randomly from this set is a divisor of M is 100
, then M must have 10 divisors
between 1 and 1000.
Since we are told that M 1000 , then M must have exactly 10 positive divisors.
Therefore, M must be of the form p 9 where p is a prime number, or p 4 q where p and q are
both primes.
(Recall that to find the number of positive divisors of M, we find the prime factorization of
M and then take each of the exponents, add 1, and find the product of these numbers. For
example, if M = 48 = 2 4 3, then the number of positive divisors is ( 4 + 1)(1 + 1) = 10 .)
Now, we want to determine the maximum M in each of these two forms.
Case 1 M = p 9
Since M 1000 , then we must have p = 2 , i.e. M = 512 .
(If p = 3 , then p 9 = 19683 is too large.)
Case 2 M = p 4 q
Since M 1000 and 5 4 = 625 , then we must have p = 2 or p = 3 .
If p = 2 , then the largest q can be so that q is prime and M 1000 is 61, i.e.
M = (16)(61) = 976 .
If p = 3 , then the largest q can be so that q is prime and M 1000 is 11, i.e.
M = (81)(11) = 891.
Therefore, the maximum possible value of M is 976.
Part B
1. (a)
(b)
(c)
1
,
2
y
C(8, 8)
B(0, 8)
P(0, 5)
Q(0, 3)
F(8, 1)
A(0, 0)
G(6, 0) D(8, 0)
reciprocal of
Since the desired line passes through H ( 4, 4 ) , it has equation y 4 = 2( x 4 ) or
y = 2 x + 12 .
(d)
y
C(8, 8)
B(0, 8)
P(0, 5)
H(4, 4)
Q(0, 3)
F(8, 1)
A(0, 0)
G(6, 0) D(8, 0)
We must find the shortest distance between the centre of the circle and the line, i.e. the
perpendicular distance. We already have the equation of a line through H that is
perpendicular to the line through F and G, the line y = 2 x + 12 . Where do these lines
intersect? Setting y-coordinates equal,
1
x 3 = 2 x + 12
2
5
2
x = 15
x=6
i.e. the lines intersect at the point G(6, 0) ! Therefore, the shortest distance from H
to the line through F and G is the distance from H to G, which is
(6 4) 2 + (4 0) 2 = 20
i.e. is greater than than 4 = 16 , the radius of the circle.
Therefore, the circle does not intersect the line.
2.
(a)
For a positive integer to be divisible by 9, the sum of its digits is divisible by 9, i.e.
2 + A + 5 = A + 7 is divisible by 9. Therefore, A = 2 .
Therefore, the four possible ordered pairs are ( A, B) = (2, 2), (8, 2), (5, 2), (2, 6) .
(b)
(i)
If 10 a + b = 7 m , then b = 7 m 10 a . Thus,
a 2b = a 2( 7 m 10 a) = 21a 14 m = 7( 3a 2 m)
Since 3a 2 m is an integer, then by definition, a 2b is divisible by 7.
(ii)
Solution 1
If 5c + 4 d is divisible by 7, then 5c + 4 d = 7 k for some integer k.
Therefore, d = 41 ( 7 k 5c ) .
7( 3c k )
So 4 c d = 4 c 41 ( 7 k 5c ) = 41 (21c 7 k ) =
.
4
Since 4c d is an integer, then 7( 3c k ) must be divisible by 4. But 4 has no
3c k
common factors with 7, so 4 must divide into 3c k , i.e.
is an integer.
4
3c k
Therefore, 4 c d = 7
, i.e. 4c d is divisible by 7.
4
Solution 2
We note that 4 c d = (14 c + 7 d ) 2(5c + 4 d ) .
Since both terms on the right side are divisible by 7, then 4c d is divisible by 7.
Solution 3
Multiplying the expression 4c d by 5 does not affect its divisibility by 7.
Thus, we can consider whether or not 20c 5 d is divisible by 7, and this will be
equivalent to considering 4c d .
Since we are told that 5c + 4 d = 7 t for some integer t, then we know that
4 (5c + 4 d ) = 20c + 16 d = 28 t or 20c = 28 t 16 d .
If we now consider 20c 5 d , we see
20c 5 d = (28 t 16 d ) 5 d
= 28 t 21d
= 7( 4 t 3d )
Since 20c 5 d is divisible by 7 by definition, then 4c d is divisible by 7.
3. (a)
(b)
We consider the possible cases. On his first turn, Alphonse can take either 1 marble or
2 marbles.
If Alphonse takes 1 marble, Beryl can take 2 marbles and then Colleen 1 marble, to
leave Alphonse with 1 marble left in the bowl. Therefore, Alphonse loses. (Note that
Beryl and Colleen can agree on their strategy before the game starts.)
If Alphonse takes 2 marbles, Beryl can take 1 marble and then Colleen 1 marble, to
leave Alphonse again with 1 marble left in the bowl. Therefore, Alphonse loses.
In either case, Beryl and Colleen can work together and force Alphonse to lose.
Solution 1
On their two consecutive turns, Beryl and Colleen remove in total 2, 3 or 4 marbles.
On his turn, Alphonse removes either 1 marble or 2 marbles. Therefore, by working
together, Beryl and Colleen can ensure that the total number of marbles removed on
any three consecutive turns beginning with Alphonses turn is 4 or 5. (Totals of 3 and 6
cannot be guaranteed because of Alphonses choice.)
Therefore, if N is a number of marbles in which Alphonse can be forced to lose, then so
are N + 4 and N + 5 , because Beryl and Colleen can force Alphonse to choose from N
marbles on his second turn.
From (a), we know that 5 is a losing position for Alphonse. Also, 1 is a losing position
for Alphonse. (Since 1 is a losing position, then 5 and 6 are both losing positions,
based on our earlier comment.)
Since 5 and 6 are losing positions, then we can determine that 9, 10 and 11 are also
losing positions, as are 13, 14, 15, and 16. If we add 4 to each of these repeatedly, we
see that N is a losing position for every N 13 .
What about the remaining possibilities, i.e. 2, 3, 4, 7, 8, and 12?
For N = 2 or N = 3, if Alphonse chooses 1 marble, then either Beryl or Colleen is
forced to take the last marble, so these are not losing positions for Alphonse, i.e. they
are winning positions.
For N = 4 , if Alphonse chooses 2 marbles, then either Beryl or Colleen is forced to
take the last marble, so this is also not a losing position for Alphonse.
Next, we notice that if Alphonse chooses 1 marble, then the total number of marbles
chosen by the three players will be 3, 4 or 5, and if Alphonse chooses 2 marbles, then
the total number chosen will be 4, 5 or 6.
So if N = 7 , then Alphonse can choose 1 marble and ensure that he receives 2, 3 or 4
marbles on his next turn. So 7 is a winning position for Alphonse.
10
11
And so we have obtained 4 consecutive losing positions, which guarantees us that any
N 13 will also be a losing position, since N 4 will be a losing position in both
groups of 3.
Therefore, the values of N for which Beryl and Colleen can force Alphonse to lose are
1, 5, 6, and all N for which N 9 .
But among the first eight possibilities, there are now no more sets of three consecutive
non-losing positions. This tells us that every position for N 9 is a losing position,
since we cannot find three consecutive non-losing positions as described above.
Therefore, the values of N for which Beryl and Colleen can force Alphonse to lose are
1, 5, 6, and all N for which N 9 .
4.
Solution 1
Join E to P, Y and R, and join F to Q, Z and S.
Let O be the point of intersection of EY and FZ.
Since EY and FZ are altitudes in DEF , then the
third altitude, DX say, passes through O.
If we look at altitude DX, we see that DXE = 90o .
Since circle C2 has DE as its diameter, then point X
must lie on circle C2 , since a right angle is subtended
by the diameter at point X.
D
R
S
P
E
12
SO OQ = DO OX (from circle C2 )
RO OP = DO OX (from circle C1 )
From this we can conclude that SO OQ = RO OP .
Why does this allow us to conclude that P, Q, R, and S lie on the same circle?
SO RO
=
, which tells us that SOP is similar to ROQ ,
From the equation, we obtain
OP OQ
and so PSQ = PSO = ORQ = PRQ .
Since the chord PQ subtends the equal angles PSQ and PRQ (in an undrawn circle),
then the points P, Q, R, and S are concyclic.
Solution 2
In order to show that the four points lie on a circle, we will show that the points are
equidistant from a fifth point, which will thus be the centre of the circle on which the four
points lie.
Consider first the points Q and S. Any point equidistant from Q and S lies on the
perpendicular bisector of the line joining these points. Since Q and S both lie on circle C2 ,
DE is a diameter of C2 , and QS is perpendicular to DE (since they lie on an altitude of the
triangle), then DE is the perpendicular bisector of QS.
Similarly, DF is the perpendicular bisector of PR.
Therefore, any point that is equidistant from all four of the given points must lie on both
DE and DF. Thus, the only possible candidate is point D. (And we already know that
DS = DQ and DP = DR from our discussion of perpendicular bisectors.)
Thus, if we can show that DS = DR , then we will have shown what we need to show.
Method 1
Let SZ = c , DZ = a and EZ = b .
Then DS 2 = DZ 2 + SZ 2 = c 2 + a 2 (Pythagoras).
Now if we extract DSE , we see that DSE = 90o ,
since DE is a diameter of circle C2 . Therefore,
DZ SZ
DSZ is similar to SEZ , or
or c 2 = ab .
=
SZ EZ
Thus, DS 2 = a 2 + ab = a( a + b) = DZ DE .
D
R
a
S
c
b
P
E
Q
F
13