2021 AMC

66 2021 AMC Senior Solutions

Senior Solutions

Senior Solutions
Solutions – Senior Division
6 3
1. Of the 16 small triangles, 6 are shaded. As a fraction, = ,
16 8
hence (E).

2. 2021 ÷ 7 = 288 remainder 5,

hence (D).

1 1 11
3. 12 − − 1 = 11 − = 10 ,
12 12 12
hence (C).

4. The angles in a quadrilateral sum to 360◦ , so that 3θ + 150 = 360. Then 3θ = 210 so
θ = 70,
hence (A).

(20 × 21) + 21 21 × 21
5. = = 21,
21 21
hence (B).

3 15 15 1 1
6. The time Henry took in minutes was 3 = . In hours, this is × = .
4 4 4 60 16
3 1 3 16
His average speed in kilometres per hour was ÷ = × = 24,
2 16 2 1
hence (C).

7.
83 × 36 (23 )3 × 36 2 9 × 36
= = = 29−5 × 36−5 = 24 × 3 = 48
65 (2 × 3)5 25 × 35
hence (B).

1 2 1 2 2
8. The product of = 0.3̇ and = 0.6̇ is × = . As a decimal this is 0.2̇,
3 3 3 3 9
hence (B).

9. The area of the parallelogram is the base times the height perpendicular to the base. From
the coordinates given, the base is parallel to the x-axis, of length (a − 1). The height is
then parallel to the y-axis, of length 8 − 2 = 6. Hence 6(a − 1) = 48, so a − 1 = 8 and
a = 9,
hence (C).

10. Let the four walls be north, south, east and west.
There are three choices for the ceiling colour.
Then the north wall must be a second colour, so there are two choices for the north wall.
Then there is no further choice: the east and west walls will be the third colour, and the
south wall the second colour.
In all there are 3 × 2 = 6 ways that the room can be painted,
hence (C).

www.amt.edu.au 66
 2021 AMC
2021 AMC Senior Solutions67
Senior Solutions

1 4 1 1 2 1 3 2 3
11. Fractions between and with denominator less than 6 are , , , , , and . In
5 5 2 3 3 4 4 5 5
ascending order, these are
1 1 1 2 1 3 2 3 4
, , , , , , , ,
5 4 3 5 2 5 3 4 5
1 1 3 5 + 10 + 12 27
Thus, the sum of the three missing fractions is + + = = ,
4 2 5 20 20
hence (D).

12. Alternative 1
Tabulate the number of each after each week.
End of week 0 1 2 3 4 5
Flowers 150000 75000 37500 18750 9375 4688
Fungi 20 60 180 540 1620 4860
At the end of 5 weeks the fungi just outnumber the flowers,
hence (B).
Alternative 2
The ratio of flowers to fungi is initially 7500 : 1. Each week the ratio reduces by a factor
of 6. We have 64 = 1296 and 65 = 7776. So after 5 weeks the ratio drops below 1 : 1,
hence (B).

13. Alternative 1
Rearranging,
qrB
V =
m
After the changes described, there is a new value of V :
(3q) rB 3qrB 2 6 qrB
Vnew = m = × =
1 m m
2
This is 6 times the initial value of V ,
hence (A).
Alternative 2
Rearranging,
qrB 1
V = =q× × rB
m m
1
Halving m doubles , so if q is trebled, m is halved and rB is constant, then V is multiplied
m
by 6,
hence (A).
Alternative 3
Use subscripts 1 and 2 to represent initial and final values of q, m and V . Then
m1 V1 m 2 V2
r= =
q1 B q2 B
V2 m 1 q2
=⇒ = =2×3=6
V1 m 2 q1
hence (A).

67
www.amt.edu.au
 2021 AMC
68 2021 AMC Senior Solutions
Senior Solutions

14. If CD = CE = x, then AC = BC = 12 − x and BE = 12 − 2x. The area of BDE is

1
2
BE × CD = 9, so
(6 − x)x = 9 =⇒ x2 − 6x + 9 = 0 =⇒ (x − 3)2 = 0 =⇒ x = 3
1
Then BC = 12 − x = 9 so that area of ABD is 2
× 12 × 9 = 54,
hence (C).

15. Write each as a tenth power: 140 = 110 , 230 = 810 , 320 = 910 and 410 = 410 . Then
110 < 410 < 810 < 910 so 140 < 410 < 230 < 320 ,
hence (A).

16. Alternative 1
From the areas of the triangles, xz = 24 and yz = 42. Eliminating z, it follows that
7x = 4y. As a triple, (x, y, z) = (4, 7, 6).
The only other integer solutions will occur when z = 1, 2 or 3. That is, (x, y, z) = (24, 42, 1)
or (12, 21, 2) or (8, 14, 3).
In all, there are 4 solutions,
hence (D).
Alternative 2
1
Since xz = 12, we have xz = 24. Similarly yz = 42. Then z is a common factor of 24 and
2
24
42, and hence a factor of gcd(24, 42) = 6. Moreover, if z is any factor of 6, then x =
z
42
and y = are integer lengths. The possible values for z are {1, 2, 3, 6},
z
hence (D).

17. Alternative 1
Let the square have side length 1. The angle at the apex of each isosceles triangle is 30◦
1 1 1
so, by the area formula ab sin C, the area of each triangle is × 1 × 1 × sin 30◦ = . Thus
2 2 4
3 1 1
the area of the pentagon is 1 − = , which is of the square’s area,
4 4 4
hence (B).
Alternative 2
A B
Choose a length unit equal to half the square’s side. 30◦
Label as shown. In ABY , ∠B = 60◦ and AB = BY = 2 so 30◦
ABY is equilateral. Then Y lies on the perpendicular bisector 30◦
2
of AB, which also bisects the square. X
Hence BCY has base BC = 2, height 1 and area 1. Then the
1
D Y C
shaded pentagon AXY CD has area 4 − 3 × 1 = 1, which is of
4 1 1
the square’s area,
hence (B).
Note: The figure in the question can be developed into this dissection of
a square into isosceles and equilateral triangles. The dissection demon-
strates that the regular dodecagon inscribed in the square occupies ex-
3
actly of its area. The same dissection can be used to answer this
4
question.

www.amt.edu.au 68
 2021 AMC
2021 AMC Senior Solutions69
Senior Solutions

2 3 5 8 13 21
18. The 36 equally likely possibilities from rolling the dice twice can be 2 •
represented in this 6 × 6 table. 3 • •
As shown, 8 of the 36 outcomes have two faces adding to one of the 5 • •
8 • •
8 2 •
other faces. So the probability is = , 13
36 9 21

hence (E).

19. Alternative 1
We calculate as follows, using the fact that a and b are positive numbers:
     
2 1 2 1 1 1
a + 2× b + 2 = a2 + 2 × b 2 + 2
b a b a

1
= a2 b 2 + 2 + 2 2
ab
 2
1
= ab +
ab
1
= ab +
ab
hence (E).
Alternative 2

a 2 b2 + 1 1√ 2 2
Since b > 0, the first surd is 2 = a b + 1. Similarly, the second surd is
 b b
1√ 2 2 1 1 1 1
a b + 1. Hence a2 + 2 × b2 + 2 = (a2 b2 + 1) = ab + ,
a b a ab ab
hence (E).

20. The trapezium has area 10, so each half has area 5. Further, some triangles have known
areas, so others can be deduced:

B 4 C

1 2 a
3
P Q
1 2 b
3
A 6 D

Consider QCP and DQP as having bases a and b on line DC, with a common altitude.
Then the ratio of their areas is a : b = 3 : 2,
hence (E).

69
www.amt.edu.au
 2021 AMC
70 2021 AMC Senior Solutions
Senior Solutions

21. Alternative 1
By completing the square twice, the equation becomes (x + y)2 + (y + 1)2 = 1989.
Since the right-hand side is divisible by 3, each square on the left-hand side must be
divisible by 3. Let x + y = 3k and y + 1 = 3, where k and  are positive integers and
k  . Then, k 2 + 2 = 221. Since k 2  2 ,we get 221/2  k 2  221. Hence, we consider
k 2 = 121, k 2 = 144, k 2 = 169 and k 2 = 196, i.e. k = 11, k = 12, k = 13 and k = 14. The
largest value of x + y is 42 for k = 14. We just need to check that a solution exists for
k = 14. Indeed, for k = 14 we get  = 5. Thus, y = 14 and x = 28,
hence (C).
Alternative 2
As in the first solution, (x + y)2 + (y + 1)2 = 1989. Write u = x + y and v = y + 1, where
u2 + v 2 = 1989 and u is as large as possible.
Since 442 = 1936 and 452 = 2025 we consider values of u from 44 down to check whether
1989 − u2 is a perfect square:

u 44 43 42 41
u2 1936 1849 1764
1989 − u2 53 140 225
v — — 15

Then u = 42, v = 15 so that y = 14 and x = 28, which gives the solution with the largest
value of x + y,
hence (C).

22. Alternative 1
Each of the two larger inscribed circles has radius half the 1
outer circle. So each has one-quarter of the area. To find
1
the area of the two smallest circles, choose a unit length as 1
shown, and let r be the radius of these smallest circles. Then r
r Y
using Pythagoras’ theorem X

r + (1 + r)2 − 12 = XY = 2
√
r2 + 2r = 2 − r
r2 + 2r = r2 − 4r + 4
6r = 4
2
r=
3
So each of the smallest circles has one-third the radius of the outer circle, hence one-ninth
1 1 1 1 13
the area. Then as a fraction of the largest circle, the unshaded area is + + + = .
4 4 9 9 18
5
So the shaded area is of the diagram,
18
hence (E).

www.amt.edu.au 70
 2021 AMC
2021 AMC Senior Solutions71
Senior Solutions

Alternative 2
Consider the quadrant shown, with radii x, y and 2x.
Then AC = 2x − y, so that by Pythagoras’ theorem x
x2 + (2x − y)2 = (x + y)2 B
x
2 2 2 2 2
x + 4x − 4xy + y = x + 2xy + y x
y
2x(2x − 3y) = 0
y 2 A C y
= (since x > 0) 2x
x 3
The shaded fraction of the diagram is

4πx2 − 2πx2 − 2πy 2 1 1  y 2 1 1  2 2 5

2
= 1 − − = − =
4πx 2 2 x 2 2 3 18
hence (E).
Alternative 3
1 1
Let the three distinct radii in the diagram be 1, and a. Put k = , then by Descartes’
2 a
circle theorem,
 
2 (−1)2 + (2)2 + (2)2 + k 2 = (−1 + 2 + 2 + k)2
18 + 2k 2 = (k + 3)2
k 2 − 6k + 9 = 0
(k − 3)2 = 0

1
Hence k = 3 and a = .
3
 1 2  1 2
13
So within the outermost circle of area π, the unshaded area is 2π + 2π = π.
2 3 18
13 5
Thus the unshaded area is of the circle, and the shaded area is of the circle,
18 18
hence (E).
√
23. In ABC, AB = AC = 24 and BC = 24 2. Make both folds C
along ZX and DY as shown. Known right angles are marked with
, and known 45◦ angles with . Further angles, marked , are α X
then easily deduced to be 45◦ . β α
Z β Y
Then α = 135◦ ÷ 2 = 67.5◦ and similarly β = 67.5◦ . So the
two congruent triangles DXZ and CXZ are isosceles. In
particular, DX = DZ = CX = CZ. A x D B
By the ASA rule, ADZ is congruent to Y DX, and so it is
also congruent to Y BD. In particular, x = AD = ZA = DY = XY = BY .
Adding
√ CX = CZ √ to XY = ZA, gives CY = CA = 24. Finally x = BY = BC − CY =
24 2 − 24 = 24( 2 − 1),
hence (E).

71
www.amt.edu.au
 2021 AMC
72 2021 AMC Senior Solutions
Senior Solutions

24. From the question, it is clear that n = 0, and

a+n 2a a−n 3a
= and =
b+n b b−n b
ab + bn = 2ab + 2an and ab − bn = 3ab − 3an
bn − 2an = ab and 3an − bn = 2ab
2bn − 4an = 2ab = 3an − bn
3bn = 7an
3b = 7a [ cancel nonzero n ]
a = 3 and b = 7 [ gcd(a, b) = 1 ]
n = 21 [ bn − 2an = ab above ]

3 + 21 24 6 3 3 − 21 −18 9 3
Checking, = = = 2 × and = = =3× ,
7 + 21 28 7 7 7 − 21 −14 7 7
hence (C).

25. The distances are paired up into three pairs each with the same sum, equal to the side of
the cube. Hence 3s = 1 + 2 + 3 + 4 + 5 + 6 = 21 and so s = 7.
Pick one face out of the six for distance 1 cm, and then the opposite face must be 6 cm. So
there are 6 choices here.
Pick one of the remaining 4 faces for distance 2 cm, and then the opposite face must be
5 cm. There are 4 choices here.
Pick one of the remaining 2 faces for distance 3 cm, and then the opposite face must be
4 cm. There are 2 choices here.
Each of these 6 × 4 × 2 = 48 possibilities gives a different way of having the six distances.
So other than the point P , there are 47 other points that have these distances,
hence (D).

26. Let x and y be the side lengths of the squares, and x y

A = x2 + y 2 the combined area, as shown.
The shape’s perimeter is the same as that of the bound-
ing rectangle. Thus 4x + 2y = 70 and so y = 35 − 2x. x A x
Then

A = x2 + (35 − 2x)2 x y
= x2 + 4x2 − 140x + 1225
= 5(x2 − 28x + 245)
 
= 5 (x − 14)2 + 49

So when x = 14, A = 5 × 49 = 245 is the smallest value of this quadratic. Checking, this
has y = 35 − 2x = 7, so x > y meaning that the minimum A = 245 occurs within the set
of possible values of x,
hence (245).

www.amt.edu.au 72
 2021 AMC
2021 AMC Senior Solutions73
Senior Solutions

27. We first solve the problem where m and n need not be distinct.
The prime factorisation of 2310 is 2 · 3 · 5 · 7 · 11. So if m is a divisor of 2310 and n is a
divisor of m, then n = 2a × 3b × 5c × 7d × 11e and m = 2p × 3q × 5r × 7s × 11t where a,
b, c, d, e, p, q, r, s, t are integers with 0  a  p  1, 0  b  q  1, 0  c  r  1,
0  d  s  1, and 0  e  t  1.
Moreover, if a, b, c, d, e, p, q, r, s, t are integers satisfying the above inequalities, then m
and n are both divisors of 2310 with n dividing m.
There are three ways to choose a and p: a = p = 0, a = p = 1 and a = 0, p = 1. Similarly
there are three ways to choose b and q, three ways to choose c and r, three ways to choose
d and s, and three ways to choose e and t. In all there are 35 = 243 ways to choose a, b,
c, d, e, p, q, r, s, t.
To exclude those where m = n, we count these. There are two ways to choose each of
p, q, r, s, t giving 25 = 32 choices. So there are 32 different values of m. Hence there are 32
cases where m = n.
Subtracting these, there are 243 − 32 = 211 pairs (m, n),
hence (211).

28. Alternative 1
Continue the pattern a bit more, using the observation that once we know two adjacent
squares A, B in the same row, the square C below B is gold if A and B are the same colour
and green if not.

1
2
3
4
A B
C
8

Let f (n) be the number of green tiles up to and including row n. Then f (1) = 1, f (2) = 3,
f (3) = 5 and f (4) = 9. Since the pattern for n = 8 has 3 copies of the pattern for n = 4,
we have that f (8) = 27.
Continuing down, the green squares at the ends of the 9th and 10th row will develop into
two copies of the n = 8 pattern, separated by a gold triangle. This continues up to row 16,
so that f (16) = 3 × 27 = 81. Also row 16 consists of a line of 16 green tiles in an otherwise
gold row.
Then row 17 will have two green squares at distance 16, with the rest of the row being
gold. Each of these two green squares will be the top square in two more copies of the
overall pattern. However, this only continues up to row 20, which is also when the green
squares reach the rightmost column. So the number of green squares up to and including
the 20th row is f (20) = f (16) + 2f (4) = 81 + 2 × 9 = 99,
hence (99).
Alternative 2
Number green squares ‘1’ and gold squares ‘0’, so the problem is to sum all the values in
the grid. As in the solution above, two adjacent values determine a value below:

0 0 1 0 0 1 1 1
0 1 1 0

73
www.amt.edu.au
 2021 AMC
74 2021 AMC Senior Solutions
Senior Solutions

These rules lead to repeating structures in the pattern. In particular:

(a) The pattern of ones lies within the right isosceles triangle whose tip is the single 1
in the first row. So in our 21 × 20 grid, the pattern of ones only reaches the right
side of the grid in the last row.
(b) When row n is 0111 . . . 100 . . ., with n ones, the next row is 0100 . . . 010 . . . with n−1
zeroes between two ones. From here the rules apply as they did in rows 1, 2, 3, . . ..
Consequently rows (n + 1) up to 2n consist of two copies of the pattern in rows 1
to n, as shown below. Here the left copy is shifted n rows down, and the right copy
is shifted n rows down and n columns right.
(c) Following (b), row 2n is 0111 . . . 1100 . . ., with 2n ones. Consequently, each of rows
n = 1, 2, 4, . . . , 2k , . . . has a line of n ones.
(d) Following (b), the sum of rows 1 to 2n is 3 times the sum of rows 1 to n.

0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0
row n 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 0 0 0 0 0 0 0 0 0 0
0
0
1
1
1
1
0 1
1
1 0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 1 1 1 0 1 0 0 0 0 0 0
0 1 1 1 0 1 0 0 0 0 0
0 1 1 1 1 0 0 0 0 0
row 2n 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0
0 1 1 0 0 0
0 1 1 0 0
0 1 1 0
0 1 1

For n = 1, 2, . . . let f (n) be the sum of all rows up to and including row n. Then f (1) = 1
and due to (d) above, f (2) = 3, f (22 ) = 32 , f (23 ) = 33 , . . . , f (2k ) = 3k .
When n is not a power of 2, say 2k < n < 2k+1 , put m = n − 2k so that n = 2k + m and
0 < m < 2k . The first 2k rows of the pattern sum to f (2k ) = 3k . Then rows 2k + 1 up
to 2k + m contain two copies of the pattern in rows 1 to m, so these rows sum to 2f (m).
Consequently, f (n) = f (2k + m) = f (2k ) + 2f (m) = 3k + 2f (m). This allows us to find
f (n) for any positive integer n (assuming no width constraint).
In particular, for n = 20, decompose 20 = 24 + 22 into powers of 2, then

f (4) = f (22 ) = 9
f (20) = f (24 + 22 ) = 34 + 2f (4) = 81 + 2 × 9 = 99

That is, there are 99 green squares up to and including the 20th row,
hence (99).
Note: Since the rules for zeroes and ones agree with modulo-2 addition, this version
contains the modulo-2 values of the numbers in Pascal’s triangle. Consequently it shows
the pattern of odd and even numbers in Pascal’s triangle.

www.amt.edu.au 74
 2021 AMC
2021 AMC Senior Solutions75
Senior Solutions

29. Alternative 1
Let the rectangle after n steps have long side an metres and short side bn metres, so that
the square removed has side bn . The perimeter will be P = 4(b0 + b1 + b2 + b3 + · · · ) metres.
We tabulate the first few cases keeping track of the ratio of the two sides, which we simplify
by rationalising denominators:

n √ an bn an√/bn
0 2 ≈ 1.414 1 2
√ 1 √
1 1 2 − 1 ≈ 0.414 √ = 2+1
2 − 1√
√ √ 2√− 2 √
2 2 − 2 ≈ 0.586 2 − 1 ≈ 0.414 = 2
√ 2−1
√ √ 2 −√1 √
3 2 − 1 ≈ 0.414 3 − 2 2 ≈ 0.172 = 2+1
3−2 2

Since the ratio of sides has repeated, the process continues in the same pattern, but scaled
down for each cycle:

√
The shaded rectangles here are those with even n, and are all in the ratio 2 to 1.√ From
one shaded rectangle to the next, the length of the sides is scaled down by a factor 2 − 1.
√
Consequently for even n = 2m, bn = ( 2 − 1)m , and for odd n, an = bn−1 .
Summing bn for even n, we have an infinite geometric series:
√ √ √
b0 + b2 + b4 + b6 + · · · = 1 + ( 2 − 1) + ( 2 − 1)2 + ( 2 − 1)3 + · · ·
1
= √
1 − ( 2 − 1)
√
1 2
= √ =1+
2− 2 2

The odd terms are the same, but without the first term, which is b0 = 1:
√
2
b 1 + b 3 + b5 + · · · =
2
So the total perimeter is then 4 times these two sums:
 √ √ 
2 2 √
P =4 1+ + =4 2+4
2 2
≈ 4 × 1.414 + 4 = 9.656
√
This suggests 966 as the answer. To confirm, we have 1.414 < 2 < 1.415 so that
9.656 < P < 9.66. Then P = 966 cm, to the nearest centimetre,
hence (966).

75
www.amt.edu.au
 2021 AMC
76 2021 AMC Senior Solutions
Senior Solutions

Alternative 2
a
Consider the more general problem of an a × b rectangle where is irrational. We will
b
first find the sum of the series where each term is the side of one of the squares.
We can assume that the cuts always leave the remaining rectangle in the lower-left corner.
Then each square either has one side on the bottom of the rectangle or on the left side of
the rectangle. No square has both.

Consequently, a is the sum of the widths of all the squares along the bottom and b is the
sum of the heights (hence the widths) of all the squares along the left side. Then a + b is
the sum of the widths of all the squares and 4(a + b) is the sum of the perimeters of all
the squares.
√ √
For a 1 × 2 metre rectangle, 4(a + b) = 4(1 + 2) = 9.66 m to the nearest 0.01 m,
hence (966).

30. Label the ends of the seven stripes by A, B, C, . . . , G and a, b, c, . . . , g, as in the example
shown below. On the top of the deck, the elastic band always joins A → a, B → b, C → c,
. . . , G → g.

A a a A
B b b B
C c c C
D d d D
E e e E
F f f F
G g g G
top underside

On the underside of the deck in the example above, the elastic band joins a → E, b → A,
c → D and so on. Combining the joins for the top and underside, we can describe the
pattern by the sequence

A→a→E→e→C→c→D→d→G→g→F →f →B→b→A

By ignoring the lowercase labels, since they always match the preceding uppercase labels,
we can simplify the sequence of the example shown:

A→E→C→D→G→F →B→A

www.amt.edu.au 76
 2021 AMC
2021 AMC Senior Solutions77
Senior Solutions

Since the elastic band forms a single continuous loop, every label occurs exactly once in
any such sequence, with the exception of A, which is repeated at the end to close the loop.
Thus every pattern corresponds to an ordering of the six labels B, C, . . . , G in a sequence
starting and ending with A. There are 6 × 5 × 4 × 3 × 2 × 1 = 720 such orderings, but we
now need to account for those sequences representing patterns that are rotations of each
other.
To this end, we determine the number of patterns which are equal to their own rotation,
that is, which are rotationally symmetrical. Consider first the stripe D → d. On the
underside, d can join to any of the six labels excluding D, but any such choice automatically
determines the join ending at D due to rotational symmetry; for example, if d → F then
b → D, as shown on the left below. Following the most recent stripe back to the left, there
are now four choices for the next join; for example, tracing F back to f , we cannot join to
B since this prematurely closes the loop, so the only options are A, C, E or G. As before,
this then determines another join due to symmetry; for example, if f → C, then e → B,
as shown in the middle diagram.

a A a A a A
b B b B b B
c C c C c C
d D d D d D
e E e E e E
f F f F f F
g G g G g G
d → F, b → D f → C, e → B c → A, g → E, a → G

Similarly, the most recent stripe back to the left gives a further 2 choices for the next join,
c → A say, and the remaining two joins are then determined. Hence the number of choices
at each stage is 6, then 4, then 2, giving a total of 6 × 4 × 2 = 48 patterns, which are
rotationally symmetrical.
Each of the 48 rotationally symmetrical patterns counts exactly once towards the total. The
remaining 720−48 = 672 sequences occur in pairs representing patterns which are rotations
of each other. Since only one pattern per pair should count, there are an additional
672 ÷ 2 = 336 patterns and therefore the total number is 336 + 48 = 384,
hence (384).

77
www.amt.edu.au
78 2021 AMC Answer Key

Answer Key

Middle Upper
Question Junior Intermediate Senior
Primary Primary
1 B E C D E
2 C E B C D
3 E E B A C
4 D A B D A
5 C A C B B
6 D D E B C
7 E A B E B
8 D E A B B
9 B D C B C
10 A D E D C
11 E E B C D
12 E D A D B
13 E D D C A
14 B A D A C
15 B B D C A
16 A C B E D
17 C C C A B
18 B C E C E
19 A C A E E
20 C A C E E
21 C E B E C
22 B B B C E
23 D A C D E
24 A B C B C
25 E D A E D
26 198 666 356 71 245
27 200 72 84 36 211
28 385 45 250 55 99
29 602 17 40 93 966
30 17 117 232 792 384

www.amt.edu.au
www.amt.edu.au
 AMC 2021 SOLUTIONS

Copyright © 2021 Australian Mathematics Trust