Western Australian Junior Mathematics Olympiad 2016: Individual Questions
Western Australian Junior Mathematics Olympiad 2016: Individual Questions
Western Australian Junior Mathematics Olympiad 2016: Individual Questions
General instructions: Except possibly for Question 12, each answer in this part is a
positive integer less than 1000. No working is needed for Questions 1 to 11. Calculators
are not permitted. In general, diagrams are provided to clarify wording only, and are not
to scale.
Write your answers for Questions 1–11, and solution for Question 12 on the front and
back, respectively, of the Answer Sheet provided.
x◦
128◦
[1 mark]
2. An icecream dessert is made up of a cone and a scoop of icecream such that the scoop
of icecream is a perfect hemisphere placed atop the cone.
If the wafer biscuit which makes up the cone is 100 mm along the outside (slant edge)
from the top of the wafer to its tip and the radius of the hemisphere is 28 mm, how
many millimetres tall is the icecream dessert from the top of the icecream scoop to the
tip at the base? [1 mark]
3. I am thinking of two numbers between 1 and 20. The first is one less than a perfect
square and is not prime. The second is one more than a perfect square and is prime.
The sum of the two numbers is divisible by 4 but not by 8.
What is the product of the two numbers? [1 mark]
5. A school bus has 45 bench seats. Each bench seat can take two children or one child
with their backpack.
If 23 of the children have backpacks, how many children can be seated on the bus?
[2 marks]
6. Mr Throttlebottom pays a bill using internet banking. The bill is for a two digit whole
number of dollars, say $ab. He accidentally inserts an extra digit after the b. Later he
is annoyed to discover that he has overpaid the bill by $647.
How many dollars should he have paid? [2 marks]
7. W XY Z is a square with P V ⊥ XY W X
and P W = P Z = P V = 10 cm.
How many cm2 is the area of W XY Z?
P V
Z Y
[2 marks]
8. How many positive integers less than 300 000 are there that have the digits 5, 6 and 7
next to each other and in that order? [2 marks]
10. In a 5 000 m race, the winner finishes 200 m ahead of second and 600 m ahead of third.
Assuming the runners run at a constant speed, to the nearest integer how many metres
ahead of third will second finish? [3 marks]
12. For full marks explain how you found your solution.
Wilberforce walks 1 metre east from his initial position, then 2 metres north, then 3
metres west, then 4 metres south, then 5 metres east, then 6 metres north, and so on,
(so that he walks one metre further each time before turning 90◦ to his left), until he
finally walks 41 metres east.
How many metres in a straight line path is Wilberforce’s final position from his initial
position? [4 marks]
Western Australian
Junior Mathematics Olympiad 2016
Team Question 45 minutes
G. Fill in the table on the back of the cover page listing all good triples and T (n) for
n = 1, 2, . . . , 14.
H. Let (a, b, c) be a good triple with perimeter n. Find the largest possible value for v
and smallest value for w such that
vn ≤ c < wn,
where v and w are fractions. Explain why this double inequality (with the values you
found for v and w) holds for all good triples.
triple: 7, 24, 25
= 4 · 24
= 96. 100
Hence the total height is 96 + 28 = 124 mm.
Alternatively, the square of the vertical height of the cone is
1002 − 282 = (100 − 28)(100 + 28)
= 72 · 128
= 23 · 32 · 27
= (25 · 3)2
√
∴ 1002 − 282 = 25 · 3
= 96.
Hence the total height is 96 + 28 = 124 mm.
3. Answer: 75. The first number must be 8 or 15. The second must be 2, 5 or 17. The
possible sums are 8 + 2 = 10, 8 + 5 = 13, 8 + 17 = 25, 15 + 2 = 17, 15 + 5 = 20 and
15 + 17 = 32; of these sums, only 20 is divisible by 4 but not by 8.
So the numbers are 15 and 5 and their product is 75.
4. Answer: 82. We have columns of 6 pieces vertically and rows of 8 pieces horizontally.
Counting vertical connections, we have 7 columns of 6 connections, giving 42 connec-
tions. Counting horizontal connections, we have 5 rows of 8 connections, giving 40
more connections. Hence the total number of connections is 40 + 42 = 82.
Generally, for an x × y jigsaw we’ll get (x − 1)y + (y − 1)x connections.
Alternatively, the four corner pieces contribute 4 × 2 = 8 connections.
The pieces on the four sides contribute (4 + 4 + 6 + 6) · 3 = 60 connections.
There are 4 × 6 = 24 other pieces and these will contribute 4 × 24 = 96 connections.
Adding these up gives a total of 8 + 60 + 96 = 164 connections. However, in this
calculation we’ve counted each connection twice so we need to divide by 2. So the
answer is 164/2 = 82.
5. Answer: 54. Let the number of children be x. Then 2x/3 have backpacks and x/3 are
without backpacks. These x children need 2x/3 + x/6 = 5x/6 bench seats. Since there
are 45 seats,
5x
= 45
6
x = 65 · 45
= 54.
6. Answer: 71. Let the extra digit be denoted by c. Then he’s paid $(100a + 10b + c)
instead of $(10a + b), so
647 − 8 639
10a + b = = = 71.
9 9
So he should only have paid $71.
7. Answer: 256. Let s be the side length of the square. Then we want s2 where
= 162 = 256.
8. Answer: 900. The numbers can be of the form x567yz, xy567z or xyz567, where in
each case, x is empty (i.e. 0), or 1 or 2, and each of y and z can be any digit, giving
3 × 10 × 10 choices for xyz. Hence there are 3 × 3 × 10 × 10 = 900 possibilities.
9. Answer: 17. Let x be the length of AM and y the B
y
length of BM . The three triangles ABC, BM A
M
and AM C are similar. So
x y+8 5
= = , x y+8
y x 3
and the length we are after is BC = 2y+8. Hence
5y 5x A C
x= and y + 8 =
3 3
25y
=
9
25y = 9y + 72
16y = 72
2y = 9
BC = 2y + 8 = 17.
10. Answer: 417. Let u, v and w be the speeds of the first, second and third places, and
let t1 be the time taken by first place. Then, since
distance
time =
speed
5000 5000 − 200 5000 − 600
(t1 =) = =
u v w
4800 24
∴ v= u= u
5000 25
4400 22
w= u= u
5000 25
Now let d be the distance between second and third at the time t2 when second place
crosses the finish line. Then
5000 5000 − d
(t2 =) =
v w
25 1 25 1
5000 · · = (5000 − d) · ·
24 u 22 u
22
5000 · = 5000 − d
24
22 2 1250
d = 5000 1 − = 5000 · = = 416 23 m,
24 24 3
which rounds to 417 m.
Alternatively, let t1 , u, v and w be as above. Then, as before
5000 4800 4400
t1 = = =
u v w
4800 4400
∴ v= , w= .
t1 t1
To run 200 m, the second runner needs time
200 t1 t1
= 200 · = .
v 4800 24
In that time, the third runner will run a distance of
so that in the time the second runner runs the last 200 m, the third runner runs 183 31 m.
Before running those respective final distances the second and third runners were 400 m
apart. So when the second runner crosses the finish line, the second and third runners
are
400 + 200 − 183 13 = 416 23 ≈ 417 m
apart.
x + y = 63 (1)
x − y = 47 (2)
xy = 392 (3)
x
=8 (4)
y
But then xy = 440 6= 392 and x/y = 55/8 6= 8, so that neither (3) nor (4) is satisfied.
So one of (1) and (2) is not satisfied, but both of (3) and (4) must be satisfied. Hence,
meaning neither (1) nor (2) is satisfied. Hence x = 56, and so by (4), y = 7 and (1) is
satisfied, but not (2).
12. Answer: 29. The net distance Wilberforce
walks eastwards is
1 − 3 + 5 − 7 + · · · + 41
N
= (1 − 3) + (5 − 7) + · · · + (37 − 39) + 41
= 10 × (−2) + 41
= 21 m S
The net distance Wilberforce walks north-
wards is
2 − 4 + 6 − 8 + · · · + 38 − 40 20 m
= (2 − 4) + (6 − 8) + · · · + (38 − 40)
= 10 × (−2)
21 m F
= −20 m
So he finishes 20 m south of his original po-
sition. His distance from his initial position
is therefore, using Pythagoras’ Theorem,
p √ √
212 + (−20)2 = 441 + 400 = 841 = 29.
Remark. Here we have an integer Pythagorean triple (a, b, c) with b = a + 1, so that
a2 + (a + 1)2 = c2
2a2 + 2a + 1 = c2
2a(a + 1) = c2 − 1
= (c − 1)(c + 1)
Since the left hand side of the last equation is even, so is the right hand side, and
hence at least one of the factors c − 1 and c + 1 is even. But c − 1 and c + 1 differ by
2, and so must be of the same parity, and hence are both even. Looking again at the
lefthand side, we see a and a + 1 are of opposite parity. So one is odd and the other
even. So the left hand side is in fact divisible by 4. Thus the last equation reduces to:
a(a + 1) c−1 c+1
= · ,
2 2 2
where the left hand side is a triangular number and the right hand side is the product
of consecutive integers. For the numbers in our problem, we have
20 · 21
T20 = = 14 · 15, and c = 29.
2
So a natural question to ask is:
How frequently does an integer Pythagorean triple of the form (a, a + 1, c)
happen?
The answer is that it’s rare. The following are the triples for c < 10 000:
(3, 4, 5), (20, 21, 29), (119, 120, 169), (696, 697, 985), (4059, 4060, 5741).
Team Question Solutions
Triangles with Integer Sides
A. To have integer sides that sum to 4, a triangle (a, b, c) would have to have sides of
lengths 1 or 2 and no such triangle has perimeter 4. That is, the only potential
triple satisfying a ≤ b ≤ c is (1, 1, 2) which violates the triangle inequality, since
1 + 1 = 2 6> 2.
So T (4) = 0.
C. In order to show that a triple with a ≤ b ≤ c is good, we need to show the triangle
inequality holds, i.e.
a < b + c (1)
b<a+c (2)
c<a+b (3)
Inequality (3) is assumed. However, the condition a ≤ b ≤ c with a, b, c positive
implies
b ≤ c < c + a,
so that (2) is automatically satisfied. Similarly,
a ≤ b < b + c,
so that (1) is automatically satisfied.
D. Suppose for a contradiction that a > n/3. Then since a is the smallest side, b > n/3
and c > n/3. Hence
a + b + c > n/3 + n/3 + n/3 = n,
i.e. the perimeter is larger than n, a contradiction.
∴ a ≤ n/3.
G.
n T (n) Triples
1 0 —
2 0 —
3 1 (1, 1, 1)
4 0 —
5 1 (1, 2, 2)
6 1 (2, 2, 2)
7 2 (1, 3, 3), (2, 2, 3)
8 1 (2, 3, 3)
9 3 (1, 4, 4), (2, 3, 4), (3, 3, 3)
10 2 (2, 4, 4), (3, 3, 4)
11 4 (1, 5, 5), (2, 4, 5), (3, 3, 5), (3, 4, 4)
12 3 (2, 5, 5), (3, 4, 5), (4, 4, 4)
13 5 (1, 6, 6), (2, 5, 6), (3, 4, 6), (3, 5, 5), (4, 4, 5)
14 4 (2, 6, 6), (3, 5, 6), (4, 4, 6), (4, 5, 5)
K. First we can check in table G. that the statement is true for n = 4, 6, 8, 10, 12, 14.
Since we only defined T (n) for positive integers n, we need n ≥ 4 in order that the
right hand side of T (n) = T (n − 3) be defined.
By I., if n is even, for every good triple (a, b, c) for perimeter n there is a good triple
(a − 1, b − 1, c − 1) of perimeter n − 3. Moreover, distinct triples (a, b, c) yield distinct
triples (a − 1, b − 1, c − 1). Thus we have T (n) ≤ T (n − 3).
If n is even, then n − 3 is odd, and so by J., for every good triple (a − 1, b − 1, c − 1)
of perimeter n − 3, there is a good triple (a, b, c) of perimeter n. Moreover, distinct
triples (a − 1, b − 1, c − 1) yield distinct triples (a, b, c). Thus we have T (n − 3) ≤ T (n).
Since we have both T (n) ≤ T (n − 3) and T (n − 3) ≤ T (n), we have
T (n) = T (n − 3), if n is even.