UNSW 2018 Math Competition

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

Parabola Volume 54, Issue 2 (2018)

57th Annual UNSW School Mathematics Competition:


Competition Problems
Solutions by Denis Potapov1

A Junior Division – Problems


Problem A1:
Prove that a positive integer has an odd number of divisors if and only if it is the square
of another integer.

Problem A2:
Is it possible to draw five straight lines on the plane such that every line intersects
exactly three other lines?

Problem A3:
You are given six coins and you know that two of the coins are counterfeit. You also
know that the counterfeit coins are lighter but you do not know that the counterfeit
coins are of identical weight. Find the strategy which identifies the counterfeit coins
with a balance scale using at most three weighings.

Problem A4:
Find the positive integer A such that exactly two of the following statements are true:

(a) A + 82 is the square of an integer;

(b) the last digit of A is 5;

(c) A − 7 is the square of an integer.

1
Denis Potapov is a Senior Lecturer in the School of Mathematics and Statistics at UNSW Sydney.

1
Problem A5:
Two players are given a piece of paper which has two integers 25 and 36 written on it.
On every move, a player can add a positive integer to the paper subject to the following
conditions:
(a) the added number is not equal to any of the existing numbers on the paper;

(b) the added number is the difference of any two different numbers already present
on the paper.
The player who is unable to make a move loses.
Prove that the second player always wins and find the number of moves in the game.

Problem A6:
Two points A, and B are chosen in the plane.
Find the set of all points M such that the AM : BM = 2 : 1.

B Senior Division – Problems

Problem B1:
Let n be a positive integer. Prove that the product of all of the positive divisors of n is

equal to ns , where s is the number of divisors of the integer n.

Problem B2:
Is it possible to draw five straight lines on the plane such that every line intersects
exactly three other lines?

Problem B3:
A notebook has 40 statements. The first statement reads “This book has one and exactly
one false statement”; the second statement reads “this book has two and exactly two
false statements”; and so forth, with the last statement reading “this book has forty and
exactly forty false statements”.
Which of the statements above are true?

Problem B4:
You are given six coins and you know that two of them are counterfeit. You also know
that every counterfeit coin is 0.1g lighter than every genuine coin. You have a balance
scale but the scale is unable to register less than 0.2g difference in weight. Find the
strategy which identifies the counterfeit coins and which uses the balance scale at most
four times.

2
Problem B5:
Two players, Alice and Bob are given a piece of paper with the number 1023 written
on it. Each player makes a move by writing a smaller integer which is greater or equal
to half of the preceding number. The game ends when the number 1 is written. The
player who writes 1 is the winner. Find the winner and a winning strategy.

Problem B6:
Let 4ABC be a triangle and S be the corresponding circumscribed circle. Let Q be a
point on S. Prove that the bases of perpendiculars dropped from Q to the sides of the
triangle 4ABC lie on a straight line.

3
A Junior Division – Solutions
Solution A1.
√ √
Any divisor d < n of an integer n corresponds to the divisor n/d > n. Hence, an

integer has en even number of divisors unless n is an integer.

Solution A2.
Answer: No.
Assume that the answer is yes, and consider the ordered pairs (`1 , `2 ) of line segments
`1 and `2 that intersect. There are 3 × 5 = 15 such pairs since each of the five line
segments `1 intersect exactly three other line segments `2 . However, whenever (`1 , `2 )
is a pair of line segments `1 and `2 that intersect, then so is (`2 , `1 ), so the number of
these pairs must be even, a contradiction.

Solution A3.
Answer: A brief solution is explained by the following diagram:

Solution A4.
Answer: 2018. The last digit of a square of an integer is either

0, 1, 4, 5, 6 or 9 .

Hence, if the second statement is true, then the first statement is false (the last digit of
A + 82 is 7); and the last statement is false (the last digit of A − 7 is 8). Therefore, the
second statement is false and the other two are true.
Assume that
A + 82 = p2 and A − 7 = q 2 .

4
We then have
(p − q)(p + q) = p2 − q 2 = 82 + 7 = 89 .
Since 89 is prime,
p − q = 1 and p + q = 89
or
p = 45 and q = 44 .

Solution A5.
Only the numbers less than or equal to 36 of the following format can appear on the
paper
25m + 36n, m, n ∈ Z .
Hence, gcd(36, 25) will appear on the paper at some stage; hence, every positive multi-
ple of gcd(36, 25) which is less or equal to 36 will appear on the paper.
Since gcd(36, 25) = 1, every integer between 1 and 36 will appear on the paper
eventually. That is, the rule of the game allows 34 moves all together, and the second
player is the last to make the move.

Solution A6.
Answer: The set is a circle with centre on the line AB.

D
A C B O

The solution below works for AM : BM = a : 1. Let M C be the bisector of the an-
gle ∠AM B and C be the point on AB, and let M D be the bisector of the angle between
the extension of AM beyond M and M B. The angle ∠CM D is 90S .
Let us show that the intersection points C and D are independent of the point M .
By using the Law of Sines applied to the triangle 4AM C and using the fact that

AM
= a and ∠AM C = ∠BM C
BM

5
we see that
AC
= a.
BC
Similarly, by using the Law of Sines on the triangles 4BM D and 4AM D, and using the
fact that
∠AM D + ∠BM D = 180S ,
we see that
AD
= a.
BD

B Senior Division – Solutions

Solution B1.
If p1 , p2 , . . . , ps is the list of divisors in ascending order and q1 , q2 , . . . , qs is the list of the
same divisors in descending order, then

ns = (p1 q1 ) × (p2 q2 ) × . . . × (ps qs ) . 

Solution B2.
Answer: No.
Assume that the answer is yes, and consider the ordered pairs (`1 , `2 ) of line segments
`1 and `2 that intersect. There are 3 × 5 = 15 such pairs since each of the five line
segments `1 intersect exactly three other line segments `2 . However, whenever (`1 , `2 )
is a pair of line segments `1 and `2 that intersect, then so is (`2 , `1 ), so the number of
these pairs must be even, a contradiction.

Solution B3.
The only true statement is the one before the last one.

Solution B4.
Assume that the coins are indexed 1, 2, . . . , 6. The first two weighings are

1, 2, 3 [A] 4, 5, 6 and 1, 2, 4 [B] 3, 5, 6 ,

where each relation [A] and [B] is either [<], [>], [=]. Consider all possible outcomes.
In the case that [A] = [<] and [B] = [<], the counterfeit coins are 1, 2.
The other three cases in which both [A] and [B] register weight difference are similar.

6
In the case that [A] = [<] and [B] = [=], the counterfeit coins are either 1, 3 or 2, 3.
To find out which of the latter is the counterfeit pair, we use another two weighings:

1, 3 [C] 4, 5 and 2, 3 [D] [4, 5]

with the known genuine coins 4, 5. The other three cases when one of the weighings [A]
or [B] registers difference are similar.
In the case that [A] = [=] and [B] = [=], every possible pair which appeared on one
side in one of the weighings [A] or [B] is not a pair of two counterfeit coins. We cross
out every such pair in the table below.

1 2 3 4 5 6
1 × × × × · ·
2 × × × · ·
3 × · × ×
4 × × ×
5 × ×
6 ×

Hence, the possible counterfeit pairs are

(1, 5), (1, 6), (2, 5), (2, 6), (3, 4) .

Weigh the pairs


1, 5 [C] 2, 6 and 1, 6 [D] 2, 5 .
If [C] = [<], then 1, 5 is the counterfeit pair. The other three cases in which either [C] or
[D] register difference are similar.
Finally, if [C] = [=] and [D] = [=], then the counterfeit is (3, 4).

Solution B5.
Consider the sequence

a1 = 1 and ak = 2ak−1 + 1, k > 1.

That is,
ak = 2k − 1 .
Note that a10 = 1023.
Whoever first writes an integer from this sequence is the guaranteed winner. In-
deed, if an integer ak is written, then the next move allows the player to write an

7
integer from the range [ak−1 + 1, ak − 1] only. Hence, the following move allows the
number ak−1 to be written and so on, leading such player to the winning move a1 = 1.
If Alice plays first and the game starts with a10 = 1023, then Bob is the winner.

Solution B6.
Let M, N, P be the bases of the perpendiculars as shown on the diagram below.
Note first that the triangles 4P QA and 4QM A are right triangles and share their
hypotenuse. That is, the quadrangle QAP M is inscribed. The quadrangle N QP C is
inscribed for a similar reason.
N

B Q

P A

Let δB and δR be the corresponding circles (blue and red) on the diagram below,
and let us show that
∠QP M = ∠QP N .
Note that ∠QP M = ∠QAM since the both angles rest on the same arc of the circle δB .
Furthermore, ∠M AQ = ∠BAQ = ∠BCQ since the last two rest on the same arc of
the circle S. Finally, ∠N CQ = ∠N P Q since the latter two rest on the same arc of the
circle δR .

You might also like