The Canadian Mathematical Society

in collaboration with

The CENTRE for EDUCATION

in MATHEMATICS and COMPUTING

The

Canadian Open
Mathematics Challenge
Wednesday, November 28, 2001

Solutions

2001 Canadian Mathematical Society

2001 COMC Solutions

Part A
1. An operation is defined by a b = a 2 + 3b .
What is the value of (2 0)(0 1) ?
Solution
By the definition,
20 = 2 2 + 30 = 4 + 1 = 5

01 = 0 2 + 31 = 0 + 3 = 3
and so
(20)(01) = 53
= 52 + 33
= 25 + 27
= 52
D

2. In the given diagram, what is the value of x?

5x

E
2x

3x
6x

F
4x

B
Solution
From the diagram, ACB = 180o 7 x o and
FEG = 180o 8 x o . Therefore,
DCE = 180o 7 x o and
DEC = 180o 8 x o , so from CDE ,
5 x o + 180o 7 x o + 180o 8 x o = 180o (*)

D
180 7x

180 8x

G
2x

3x
6x

360o 10 x o = 180o
10 x o = 180o
x = 18

5x

4x

3. A regular hexagon is a six-sided figure which has all of its angles equal and all of its side
lengths equal. If P and Q are points on a regular hexagon which has a side length of 1, what
is the maximum possible length of the line segment PQ ?

2001 COMC Solutions

Solution 1
Let ABCDEF be a regular hexagon with a side length of 1. Each
angle is 120o . Thus, if we join FC, EB, DA, each of the interior
angles is bisected, and so each part is 60o . Thus the hexagon is
decomposed into 6 equilateral triangles, as shown.
The maximum distance between any two points on the hexagon is
the distance between two opposite vertices. Since each of the
triangles is equilateral with a side length of 1, the diagonal distance
is 2, ie. the maximum possible length of PQ is 2.

B
C

Brief version of Solution 1

A regular hexagon with side length 1 can be decomposed into 6 equilateral triangles with a
side length of 1, as shown. The maximum distance between any two points is between
opposite vertices, and this distance is 2.
Solution 2
The maximum distance is between two opposite vertices, say F and
C by symmetry.
Drop perpendiculars from A and B to meet FC at R and S
respectively. Since AB = 1 and AB is parallel to RS, then RS = 1.
By symmetry, FR = CS . But FR = AF cos60o = 1( 12 ) = 12 .

60

60

Therefore, CF = 2, and so the maximum possible distance is 2.

4. Solve for x:

( )

2 2 2 x = 4 x + 64 .
Solution
Solving the equation,
2 2 2 x = 4 x + 64

( )
2( 4 ) = 4
x

4 x = 64
x=3

+ 64

or

( )
2( 2 ) = 2

2 2 2 x = 4 x + 64
2x

2x

+ 64

2 2 x = 64
2x = 6
x=3

5. Triangle PQR is right-angled at Q and has side

lengths PQ = 14 and QR = 48. If M is the midpoint
of PR , determine the cosine of MQP .

P
M
Q

2001 COMC Solutions

Solution 1
Join M to Q.
Through M, draw a line parallel to QR meeting PQ at F.
Therefore, PF = FQ = 7 and MF = 24

P
M

F
Q

By Pythagoras, MQ = 25 , and so
cos( MQP ) = cos( MQF )

FQ
MQ
7
=
25
=

Solution 2
Join M to Q.
By Pythagoras, PR = 14 2 + 482 = 50 .
Since M is the midpoint of the hypotenuse, then
MQ = MP = MR . (This is because the circle
circumscribed around PQR has PR as diameter (since
PQR = 90o ) and so M is the centre and thus MP, MQ
and MR are radii.)
Therefore, MQP = MPQ and so
7
cos( MQP ) = cos( MPQ ) = 14
50 = 25 .

P
14

6. The sequence of numbers t1, t2 , t3 , ... is defined by t1 = 2 and tn +1 =

tn 1
, for every positive
tn + 1

integer n. Determine the numerical value of t999 .

Solution
We calculate the first few terms in the series
t1 = 2

t2 =

t1 1 2 1 1
=
=
t1 + 1 2 + 1 3

t3 =

t2 1
=
t2 + 1

t4 =

t3 1 12 1
=
= 3
t3 + 1 12 + 1

1
3
1
3

1
1
=
2
+1

t4 1 3 1
=
=2
t4 + 1 3 + 1
Since a term in the sequence depends only on the previous one, then the sequence will cycle
with a period of 4.
Thus, t1 = t5 = L = t997 = t1001 = 2 . Therefore, t998 = 13 and t999 = 12 .
t5 =

2001 COMC Solutions

7. If a can be any positive integer and

2x + a = y
a+y= x
x+y=z
determine the maximum possible value for x + y + z .

Solution
We treat a as a constant and solve for x, y, z in terms of a.
From the second equation, y = x a
(*)
Therefore, from the first equation,
2x + a = x a
x = 2 a
Substituting into (*), y = 3a .
Substituting into the 3rd equation, z = x + y = 5a .
So x + y + z = 10 a .
Since a is a positive integer, the maximum value for x + y + z is 10 (which occurs when
a = 1).
y

8. The graph of the function y = g( x ) is shown.

Determine the number of solutions of the
equation g( x ) 1 = 2 .
1

2
2

2001 COMC Solutions

Solution 1 (Graphical)
y

2
0

y = g( x )

y = g( x ) 1

2
1

y=2
4

y = g( x ) 1

so the number of solutions of g( x ) 1 =

1
2

is 8, from the third graph.

Solution 2 (Algebraic)
From the original equation g( x ) 1 = 12 , using the definition of absolute value we obtain,
g( x ) 1 = 12
or
g( x ) 1 = 12

g( x ) =

3
2

or

g( x ) =

g( x ) = 23

or

g( x ) = 12

1
2

From the original graph,

(a) g( x ) = 23 has 1 solution,
(b) g( x ) = 23 has 1 solution,
(c) g( x ) = 12 has 3 solutions,
(d) g( x ) = 12 has 3 solutions.
Therefore, g( x ) 1 = 12 has 8 solutions.

2001 COMC Solutions

Part B
1. The triangular region T has its vertices determined by the intersections of the three lines
x + 2 y = 12 , x = 2 and y = 1.
(a) Determine the coordinates of the vertices of T, and show this region on the grid
provided.
(b) The line x + y = 8 divides the triangular region T into a quadrilateral Q and a triangle R.
Determine the coordinates of the vertices of the quadrilateral Q.
(c) Determine the area of the quadrilateral Q.
Solution
(a) The lines x = 2 and y = 1 intersect at (2,1) .
The lines x = 2 and x + 2 y = 12 intersect at
(2, 5) , since x = 2 2 + 2 y = 12 y = 5 .
The lines y = 1 and x + 2 y = 12 intersect at
(10,1) , since y = 1 x + 2 = 12 x = 10 .

y
x=2

(2, 5)
x + 2y = 12
(10, 1)
(2, 1)

(b)

(c)

x + y = 8 intersects x = 2 at (2, 6) , which is

above the point of intersection of x = 2 and
x + 2 y = 12 .
x + y = 8 intersects y = 1 at (7,1).
To find the intersection point of x + y = 8
and x + 2 y = 12 , subtract the first equation
from the second to obtain y = 4 , so x = 4.
Therefore, the vertices of Q are (2,1) ,
(2, 5) , (4, 4) , (7,1).

y=1

y
x=2

(2, 5)

(4, 4)
x + 2y = 12

Q
(2, 1)

R
(7, 1)

(10, 1)

y=1

Area of Q = Area of T Area of R

= 12 ( 8)( 4 ) 12 ( 3)( 3)

= 16 29
=
2. (a)

23
2

Alphonse and Beryl are playing a game, starting with a pack of 7 cards. Alphonse
begins by discarding at least one but not more than half of the cards in the pack. He
then passes the remaining cards in the pack to Beryl. Beryl continues the game by
discarding at least one but not more than half of the remaining cards in the pack. The

2001 COMC Solutions

(b)

(a)

game continues in this way with the pack being passed back and forth between the two
players. The loser is the player who, at the beginning of his or her turn, receives only
one card. Show, with justification, that there is always a winning strategy for Beryl.
Alphonse and Beryl now play a game with the same rules as in (a), except this time
they start with a pack of 52 cards, and Alphonse goes first again. As in (a), a player on
his or her turn must discard at least one and not more than half of the remaining cards
from the pack. Is there a strategy that Alphonse can use to be guaranteed that he will
win? (Provide justification for your answer.)
Solution 1
We define a losing position to be a number of cards, such that if a player receives this
number of cards at the beginning of his or her turn, he or she is guaranteed to lose
assuming best play by both players. A winning position is defined similarly.
Clearly, by the rules of the game, 1 is a losing position.
For a player to receive 1 card at the beginning of a turn, the previous player must start
with 2 cards. (This is true since a player can never remove more than half of the deck,
so the number of cards at the beginning of the previous turn can never be more than
double that of the current turn.)
Therefore, 2 is a winning position, since a player starting with 2 cards can only remove
1, and so passes 1 card to the other player, who loses.
Is 3 a winning position or a losing position?
Given a pack of 3 cards, the rules of the game say that a player can only remove 1 card,
and so pass a pack of 2 cards (a winning position) to the other player.
Therefore, 3 is a losing position.
We can then see that 4, 5 and 6 are all winning positions, as given 4, 5 or 6 cards, a
player can remove 1, 2 or 3 cards respectively to pass the other player 3 cards, a losing
position.
Therefore, 7 is a losing position, since a player removing 7 cards must remove 1, 2 or 3
cards, thus giving the other player 6, 5 or 4 cards respectively, any of which is a
winning position.
So if Alphonse starts with 7 cards, Beryl can always win
Summary of Beryls Strategy
She will receive 4, 5 or 6 cards from Alphonse.
Remove 1, 2 or 3 cards in order to pass 3 cards back to Alphonse.
Alphonse is forced to remove 1 only, and pass back 2 to Beryl.
Beryl removes 1 and passes 1 back, so Alphonse loses.

2001 COMC Solutions

Solution 2 (Sufficient for full marks)

Alphonse starts with 7 cards, and so can remove 1, 2 or 3 cards, passing 6, 5 or 4 cards
to Beryl.
Beryl should remove 3, 2 or 1 cards respectively, leaving 3 cards only, and pass these 3
cards back to Alphonse.
Alphonse now is forced to remove 1 card only, and pass 2 back to Beryl.
Beryl removes 1 card (her only option) and passes 1 back to Alphonse, who thus loses.
Therefore, Beryl is guaranteed to win.
(b)

Solution 1
We must determine if 52 is a winning position or a losing position.
By a similar argument to above, since 7 is a losing position, 8 through 14 are all
winning positions, since they can all be reduced to 7 in one turn.
Therefore, 15 is a losing position, since given 15 cards, a player is forced to reduce to
some number between 8 and 14, since no more than 7 cards can be removed.
Similarly, 16 through 30 are winning positions, 31 is a losing position, and 32 through
62 are winning positions.
Therefore, 52 is a winning position, so Alphonse has a winning strategy.
Summary of Alphonses strategy
Alphonse removes 21 cards from original 52, and pass 31 cards to Beryl.
If Beryl removes b1 cards with 1 b1 15 , Alphonse removes 16 b1 cards to
reduce the pack to 15 cards. [Notice that this is always a legal move, since
2(16 b1 ) = 32 2b1 31 b1, so 16 b1 is never more than half of the pack.]
If Beryl removes b2 cards with 1 b2 7 , Alphonse removes 8 b2 to reduce the
pack to 7 cards. [This move is always legal by a similar argument.]
Beryl now has 7 cards, so Alphonse should adopt Beryls strategy from (a).
Solution 2
Alphonse removes 21 cards from original 52, and passes 31 cards to Beryl.
If Beryl removes b1 cards with 1 b1 15 , Alphonse removes 16 b1 cards to reduce the
pack to 15 cards.
[This is always a legal move, since 2(16 b1 ) = 32 2b1 31 b1, so 16 b1 is never
more than half of the pack.]
If Beryl removes b2 cards with 1 b2 7 , Alphonse removes 8 b2 to reduce the pack to
7 cards.
[This move is always legal by a similar argument.]

2001 COMC Solutions

10

Beryl now has 7 cards, so Alphonse should adopt Beryls strategy from (a), so Alphonse
has a winning strategy.
3. (a)
(b)

(a)

If f ( x ) = x 2 + 6 x + c , where c is an integer, prove that f (0) + f ( 1) is odd.

Let g( x ) = x 3 + px 2 + qx + r , where p, q and r are integers. Prove that if g(0) and
g( 1) are both odd, then the equation g( x ) = 0 cannot have three integer roots.
Solution
Calculating,
f (0) + f ( 1) = c + (1 6 + c)
= 2c 5
Now 2c is always even for c an integer, so 2c 5 is always odd.

(b)

Solution 1
Assume that g( x ) = 0 has three integer roots a, b, c, ie.
g( x ) = ( x a)( x b)( x c) = x 3 + px 2 + qx + r .
Now g(0) = abc from the above and is odd, so each of a, b and c must be odd for
their product to be odd.
Therefore, g( 1) = ( 1 a)( 1 b)( 1 c).
Since a is odd, 1 a is even, and so g( 1) is even, a contradiction. (In fact, g( 1) is
divisible by 8.)
Thus, g( x ) = 0 cannot have three integer roots.
Solution 2
Assume that g( x ) = 0 has three integer roots a, b, c, ie.
g( x ) = ( x a)( x b)( x c) = x 3 + px 2 + qx + r
or, expanding,
x 3 ( a + b + c) x 2 + ( ab + ac + bc) x abc = x 3 + px 2 + qx + r
Now g(0) = r so r is odd, and g( 1) = 1 + p q + r , which is odd.
Combining these, since r is odd, then p q is odd too.
Therefore, one of p and q is even (they cannot both be odd, since odd odd = even).
Since r is odd and r = abc , then each of a, b and c is odd. This implies that
p = ( a + b + c )

q = ab + ac + bc
are both odd, a contradiction (since we have shown above that one of p and q must be
even.)
Therefore, g( x ) = 0 cannot have three integer roots.

2001 COMC Solutions

11

4. Triangle ABC is isosceles with AB = AC = 5 and

BC = 6. Point D lies on AC and P is the point on BD so
that APC = 90 . If ABP = BCP , determine the
ratio AD : DC .

D
P
C

B
Solution 1 (Trigonometry)
Let BCP = ABP = and ACP = .
Then PBC = since ABC is isosceles.
Also, PAC = 90o (from APC),
ADP = 2 + (exterior angle), and
APB = 90o + + (exterior angle).
Let AP = x . Then from APC ,
x
x
sin =
= x = 5 sin (*)
AC 5
By the sine law in ABP ,
x
5
=
sin sin 90o + +

x
90 + +

90

+
2

5
cos( + )
5
=
cos( ABC )
5
= 3
=

25
x
(**)
=
sin 3
[Note that cos(ABC ) = 35 since drawing a perpendicular from A bisects BC. Also,
sin(ABC ) = 45 .]
Therefore combining (*) and (**)
5 sin 25
=
sin
3
3 sin = 5 sin
3 sin = 5 sin(ABC )
3 sin = 5 sin(ABC ) cos 5 cos(ABC ) sin
3 sin = 4 cos 3 sin
6 sin = 4 cos
tan =

2
3

2001 COMC Solutions

12

To determine the ratio of AD to DC, we use coordinates.

Let B have coordinates (0, 0) and C have coordinates (6, 0). Thus, A has coordinates (3, 4) ,
since the altitude from A to BC has length 4.
Since tan = 23 , the line from B to D has equation y = 23 x . Also, the line from A to C has
equation y = 43 ( x 6) . To find D, we find the intersection of these two lines:
2
4
3 x = 3 x +8
2x = 8
x=4
Therefore, D has coordinates ( 4, 83 ) . Since the x-coordinate of D is

1
3

of the way between

those of A and C, then AD : DC = 1 : 2 .

Solution 2 (Similar triangles)

Draw a perpendicular from A to meet BC at M. Then
since AB = AC , BM = MC = 3 and so AM = 4 .
Let BCP = ABP = and ACP = . Then
PBC = since ABC is isosceles.

P
3

Draw circle with AC has diameter. This circle passes through both P and M, since
APC = AMC = 90o .
Join P to M. Then PAM = since PAM = PCM (subtended by the same chord).
Also, AMP = for similar reasons. Therefore, MPA is similar to BPC.
Thus,
PA MA 4
PA 2
=
= tan =
=
PC BC 6
PC 3
So now we must compute the length of DC. Consider BDC . By the sine law,

2001 COMC Solutions

13

DC
BC
=
sin sin(BDC )
DC =

6 sin
sin 180 DCB

6 sin
sin( + DCB)

6 sin
sin cos(DCB) + cos sin(DCB)

6
cos(DCB) + cot sin(DCB)

6
3
5

()

3 4
2 5

10
3
which yields also that AD = 5 103 =
=

5
3

and so AD : DC = 1 : 2 .

Solution 3 (Geometry)
Draw a line from A perpendicular to BC at M.
Let O be the midpoint of AC. Draw circle with
centre O and radius OC. Then this circle passes
through A (since AO = OC ), P and M (since
APC = AMC = 90o ).
Join M to O and extend this line segment to meet the
circle at K.

A
D
X

P
B

Since CO =
and CM =
then MK is parallel to BA.
Extend BD to meet MK at K .
Then MK B = ABK because of parallel lines.
But ABK = ABP = BCP MK P = MCP.
Therefore, K lies on the circle; that is, K coincides with K.
1
2 CA

1
2 CB ,

Next, join A to K and K to C.

Then AKCM is a rectangle, since KM and AC are diameters of the circle, so the quadrilateral
has four right angles.
Therefore, AK = MC = BM .
Then AKMB is a parallelogram, which implies that AM and BK bisect each other (meeting at X).
Consider now AKM . Then KX and AO are medians, and so intersect in the ratio 2 : 1 , ie.
AD : DO = 2 : 1. Since AO : OC = 1 : 1, then AD : DC = 1 : 2 .