2018 Australian Mathematics Competition AMC Senior Years 11 and 12 - Questions
2018 Australian Mathematics Competition AMC Senior Years 11 and 12 - Questions
2018 Australian Mathematics Competition AMC Senior Years 11 and 12 - Questions
Senior Questions
S R
Y
2. The Great North Walk is a 250 km long trail from Sydney to Newcastle. If you want to
complete it in 8 days, approximately how far do you need to walk each day?
(A) 15 km (B) 20 km (C) 30 km (D) 40 km (E) 80 km
6. What is 20 − 18 ?
(A) 0 (B) 1 (C) 2 (D) 3 (E) 10
8. The cost of feeding four dogs for three days is $60. Using the same food costs per dog per
day, what would be the cost of feeding seven dogs for seven days?
(A) $140 (B) $200 (C) $245 (D) $350 (E) $420
c Australian Mathematics Trust www.amt.edu.au 28
2018 AMC
Senior Questions
10. The sum of the numbers from 1 to 100 is 5050. What is the sum of the numbers from 101
to 200?
(A) 15 050 (B) 50 500 (C) 51 500 (D) 150 500 (E) 505 000
11. Leila has a number of identical equilateral triangle shaped tiles. How many of these must
she put together in a row (edge to edge) to create a shape which has a perimeter ten times
that of a single tile?
(A) 14 (B) 20 (C) 25 (D) 28 (E) 30
13. Instead of multiplying a number by 4 and then subtracting 330, I accidentally divided that
number by 4 and then added 330. Luckily, my final answer was correct. What was the
original number?
(A) 220 (B) 990 (C) 144 (D) 374 (E) 176
c Australian Mathematics Trust www.amt.edu.au 29
2018 AMC
Senior Questions
15. A netball coach is planning a train trip for players from her two netball clubs, Panthers
and Warriors.
The two clubs are in different towns, so the train fares per player are different. For the
same cost she can either take 6 Panthers and 7 Warriors or she can take 8 Panthers and 4
Warriors.
If she takes only members of the Warriors on the train journey, the number she could take
for the same cost is
(A) 11 (B) 13 (C) 16 (D) 20 (E) 25
k
∠SRP = β.
S α T
The ratio tan α : tan β equals
k
(A) 3 : 1 (B) 4 : 1 (C) 5 : 1 |
β
(D) 7 : 2 (E) 9 : 2 Q R
17. Three fair 6-sided dice are thrown. What is the probability that the three numbers rolled
are three consecutive numbers, in some order?
1 1 1 7 1
(A) (B) (C) (D) (E)
6 9 27 36 54
19. In this subtraction, the first number has 100 digits and the second number has 50 digits.
20. I have two regular polygons where the larger polygon has 5 sides more than the smaller
polygon. The interior angles of the two polygons differ by 1◦ . How many sides does the
larger polygon have?
(A) 30 (B) 40 (C) 45 (D) 50 (E) 60
c Australian Mathematics Trust www.amt.edu.au 30
2018 AMC
Senior Questions
√
21. How many solutions (m, n) exist for the equation n = 100 − m2 where both m and n are
integers?
(A) 4 (B) 6 (C) 7 (D) 8 (E) 10
rq
√ (8x )
24. In the equation . . . 256 = 2 the value of x is
| {z }
60
26. Let A be a 2018-digit number which is divisible by 9. Let B be the sum of all digits of A
and C be the sum of all digits of B. Find the sum of all possible values of C.
c Australian Mathematics Trust www.amt.edu.au 31
2018 AMC
Senior Questions
D C
28. Donald has a pair of blue shoes, a pair of red shoes, and a pair of white shoes. He wants to
put these six shoes side by side in a row. However, Donald wants the left shoe of each pair
to be somewhere to the left of the corresponding right shoe. How many ways are there to
do this?
30. Consider an n × n grid filled with the numbers 1, . . . , n2 in ascending order from left to
right, top to bottom. A shuffle consists of the following two steps:
• Shift every entry one position to the right. An entry at the end of a row moves to the
beginning of the next row and the bottom-right entry moves to the top-left position.
• Then shift every entry down one position. An entry at the bottom of a column moves
to the top of the next column and again the bottom-right entry moves to the top-left
position.
An example for the 3 × 3 grid is shown. Note that the two steps shown constitute one
shuffle.
1 2 3 9 1 2 8 6 7
shift shift
4 5 6 3 4 5 9 1 2
right down
7 8 9 6 7 8 3 4 5
What is the smallest value of n for which the n × n grid requires more than 20 000 shuffles
for the numbers to be returned to their original order?
c Australian Mathematics Trust www.amt.edu.au 32