Canadian Open Mathematics Challenge: The Canadian Mathematical Society
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 29, 2000
Solutions
Part A
1.
An operation is defined by a b = 1
What is the value of (1 2)(3 4) ?
a
, b 0.
b
Solution
By the definition of
1 1
=
2 2
3 1
3 4 = 1 =
4 4
1 2 = 1
1
1
1
2
and so (1 2)(3 4) = = 1 = 1 2 = 1
1
2
4
4
ANSWER:
2.
The sequence 9, 18, 27, 36, 45, 54, consists of successive multiples of 9. This sequence is then altered by
multiplying every other term by 1, starting with the first term, to produce the new sequence
9, 18, 27, 36, 45, 54,... . If the sum of the first n terms of this new sequence is 180, determine n.
Solution
The terms in the sequence are paired, by combining each odd-numbered term with the next term
(that is, we combine terms 1 and 2, 3 and 4, 5 and 6, etc).
The sum of each of these pairs is 9.
So we need 20 of these pairs to reach a sum of 180.
Thus we need 2 20 or 40 terms.
ANSWER:
3.
( )( )( )( )
For example, 4!= 4(3)(2)(1) . Determine n such that n!= 215 36 53 72 (11)(13) .
Solution
Since n! has a prime factor of 13, n must be at least 13.
Since n! has no prime factor of 17, n must be less than 17.
These two facts are true because if m n , then m divides n!.
Since n! has 53 as a factor, then n 15 , since we need n! to have 3 factors which are multiples of 5.
We must thus determine if n = 15 or n = 16.
40
4.
16
The symbol x means the greatest integer less than or equal to x. For example,
5.7 = 5 , = 3 and 4 = 4 .
Calculate the value of the sum
1 + 2 + 3 + 4 + L +
48 + 49 + 50 .
Solution
We note that for k a positive integer and k 2 n < (k + 1)2 , then k n < k + 1 and so
Thus for 1 n 3, n = 1
n = k.
4 n 8, n = 2
9 n 15, n = 3
etc.
So the sum equals
(1 + 1 + 1) + (2 + 2 + 2 + 2 + 2) + (3 + L + 3) + L + (6 + L + 6) + (7 + 7)
= 3(1) + 5(2) + 7(3) + 9( 4) + 11(5) + 13(6) + 2(7)
= 3 + 10 + 21 + 36 + 55 + 78 + 14
= 217
ANSWER:
5.
217
How many five-digit positive integers have the property that the product of their digits is 2000?
Solution
Let a five-digit number have the form a b c d e where 0 a, b, c, d , e 9, a 0 .
Since the product of the digits is 2000, we must have the product abcde = 2000 = 2 4 53 .
Since the product of the digits is 2000, then 3 of the digits have to be 5. The remaining 2 digits must have a product of
16 or 2 4 .
Thus the two remaining digits must be 4 and 4, or 2 and 8.
Possibility 1
Case 1
5!
= 10 possible numbers.
3! 2!
Case 2
5!
= 20 possible numbers.
3!
(including order): 2, 8; 4, 4; 8, 2.
5
So there are 3 = 3 10 = 30 possible such 5 digit numbers.
3
ANSWER:
6.
)=2
6 sin x
30
, for 0 x 2 .
Solution
We write all factors as powers of 2. Thus
(
2 (2
4 16 sin
4 sin 2 x
2 4 sin
)=2
)=2
x +2
6 sin x
6 sin x
= 2 6 sin x
(*)
(2 sin x 1)(sin x 1) = 0
Therefore, sin x =
1
or sin x = 1.
2
Since 0 x 2 , x =
,
or .
6 6
2
ANSWER:
7.
5
,
,
6 6 2
Solution
Using the given general equation, we note that there are only two choices of n which yield equations containing a2 ,
n = 0 or 2.
i.e.
a0 a2 = 9
from n = 0
a2 3a0 = 25
from n = 2
8.
In the diagram, ABC is equilateral and the radius of its inscribed circle is 1. A
17
O
P
30
So BE is a diameter.
By Pythagoras,
BE 2 = EA 2 + AB2
( )
= 32 + 2 3
3
A
2 3
= 21
The diameter is
21 .
ANSWER:
21
Part B
1.
Triangle ABC has vertices A(0, 0) , B(9, 0) and C(0, 6) . The points P and Q lie on side AB such that AP = PQ = QB .
Similarly, the points R and S lie on side AC so that AR = RS = SC . The vertex C is joined to each of the points P and
Q. In the same way, B is joined to R and S.
(a)
Determine the equation of the line through the points R and B.
(b)
Determine the equation of the line through the points P and C.
(c)
The line segments PC and RB intersect at X, and the line segments QC and SB intersect at Y. Prove that the
points A, X and Y lie on the same straight line.
Solution
Since A(0, 0) , B(9, 0) and AP = PQ = QB , then P has coordinates (3, 0) and Q has coordinates (6, 0) .
Similarly, R is the point (0, 2) and S is the point (0, 4).
(a) Since R is (0, 2) and B is (9, 0), then the slope of RB is m =
20
2
= and so the equation of the line is
09
9
2
( x 0)
9
2
y= x+2
9
y2=
06
= 2 and so the equation of the line is
3 0
C(0, 6)
x + 2 = 2x + 6
16
x=4
9
9
x=
4
S(0, 4)
Y
R(0, 2)
X
A(0, 1) P(3, 0)
Q(6, 0)
3
9 3
9
and substituting into y = 2 x + 6 = 2 + 6 = , so X is the point , .
2
4 2
4
x + 6 = x + 4
5
x
9
18
x=
5
2=
and so y = x + 6 =
18
12
18 12
+6=
and thus Y is the point , .
5
5
5 5
B(9, 0)
3
0 2
9
3
2
= and so is y = x .
Now the line through A(0, 0) and X , has slope m = 29
3
4 2
3
0
4
12 2 18
The point Y lies on this line, as
=
. [This could be done with L.S./R.S. format using equation of line.]
5
3 5
2.
(b)
E
F
B
Solution
(a) Let AFE = BFD = x
BDF = CDE = y
CED = AEF = z
Thus FAE = 180 x z
A
z
F x
E
z
FBD = 180 x y
ECD = 180 y z
3.
(a)
Alphonse and Beryl are playing a game, starting with the geometric shape
shown in Figure 1. Alphonse begins the game by cutting the original shape
into two pieces along one of the lines. He then passes the piece containing
the black triangle to Beryl, and discards the other piece.
Figure 1
Beryl repeats these steps with the piece she receives; that is to say she cuts along the length of a line, passes the
piece containing the black triangle back to Alphonse, and discards the other piece. This process continues, with
the winner being the player who, at the beginning of his or her turn receives only the black triangle. Show, with
justification, that there is always a winning strategy for Beryl.
Solution
We first consider Alphonses possible moves to begin the game. We can assume, without loss of generality, that he cuts
on the left side of the black triangle.
Case 1
Alphonse removes two white triangles, leaving
In this case, Beryl removes only one white triangle, and passes the shape
Beryl removes both of the white triangles on the right, leaving Alphonse in the same position as in Case 1 for his
second turn.
Therefore Beryl can always win, regardless of Alphonses strategy.
(b)
Alphonse and Beryl now play a game with the same rules as in (a), except
this time they use the shape in Figure 2 and Beryl goes first. As in (a), cuts
may only be made along the whole length of a line in the figure. Is there a
strategy that Beryl can use to be guaranteed that she will win? (Provide
justification for your answer.)
Figure 2
Solution
We show that, again, Beryl always has a winning strategy.
The strategy is to reduce the shape in Figure 2 to the shape in Figure 1, and to have Alphonse make the first cut at this
stage. Beryl also knows that if she is forced into a position of being the first to cut when Figure 2 is reduced to Figure
1, then Alphonse can force her to lose.
9
(9)
(8)
(2)
(7)
(3)
(4)
(5)
(6)
We can assume without loss of generality (because of symmetry) that Beryl cuts along (1), (2) or (3) to begin.
If she cuts (2) or (3), then Alphonse cuts the other of these two and leaves Beryl with Figure 1, where she will lose.
Therefore Beryl cuts (1) to begin.
If Alphonse now cuts (2) or (3), Beryl cuts the other of these two and passes the shape in Figure 1 back to Alphonse, and
so he loses.
If Alphonse cuts (8) or (9), Beryl cuts the opposite and passes the shape in Figure 1 to Alphonse, and so he loses.
(Similarly, if he cuts (5) or (6)).
So assume that Alphonse cuts (4) or (7), say (4) by symmetry.
If Beryl now cuts any of (2), (3), (5), (6), (8), or (9), then Alphonse can force Beryl to lose, in the same way as she could
have forced him to lose, as above. So Beryl cuts (7).
Now Alphonse is forced to cut one of (2), (3), (5), (6), (8), or (9), and so Beryl makes the appropriate cut, passing the
shape in Figure 1 back to Alphonse, and so he must lose.
Therefore Beryl always can have a winning strategy.
4.
How many positive integers can be expressed as the sum of exactly two distinct elements of the set T ?
Solution
tk > 0 for all k, 1 k n.
Also tk < tk +1 for all k n 1 since tk +1 = tk + tk 1 .
Hence the sequence is monotone increasing.
n
The sum of any pair of terms is an integer and there are pairs.
2
Can any two pairs produce the same integer?
Consider ta + tb and tc + td . Clearly if tb = td then ta = tc and vice versa, implying the same pair.
Hence none of the four terms is equal, so we can assume one term, say td to be the largest.
Then td = td 1 + td 2 ta + tb , since the maximum values of ta and tb are td 1 and td 2 and they cannot be alike.
10
n
But since tc > 0 , tc + td > ta + td and there are no two pairs that add to the same integer, so there are exactly integers
2
possible.
(b)
How many positive integers can be expressed as the sum of exactly three distinct elements of the set T ?
Solution
Consider ta + tb + tc and td + te + t f . If any of the first three equals any of the second three we are left with pair
sums of the remaining ones being equal, which is impossible from part (a). Hence there are six unlike terms, and
again we can assume one, say t f , to be the greatest.
It is clearly possible for equality by setting ta and tb equal to t f 1 and t f 2 and then td and te equal to tc1 and
tc2 .
In how many ways can this be done for given f. Clearly, 6 f n , and since 2 < c < f 2 , for any given f there
n
n 4
are f 5 choices for c and the number of ways possible is
( f 5) = 1 + 2 + 3 + L + (n 5) =
.
2
f =6
n n 4
There are a maximum of
possible integers.
3 2
Of these, are any two of like sum?
In ta + tb + tc , the maximal values are t f +1 , t f 3 , and t f 4 , since if one is t f 1 and one t f 2 we revert to the
discussed state. Hence
t a + t b + t c t f 1 + t f 3 + t f 4
= t f 1 + t f 2
= tf .
But td + te + t f > t f .
Hence there are no other triples for which equality of sums exist, and the number of possible integers is
n n 4
.
3 2