2022 AMC Intermediate Solutions55

Intermediate Solutions
Solutions – Intermediate Division
1. (Also UP3)
2220 − 2022 = 198,
hence (C).

2. (Also UP6)
Alternative 1
Out of the 29 squares, there are 12 squares that have 3 edges on the perimeter, 4 squares
that have 2 opposite edges on the perimeter and 4 squares that have 2 adjacent edges on
the perimeter. This accounts for all 12 × 3 + 4 × 2 + 4 × 2 = 52 edges on the shape,
hence (A).
Alternative 2
Start with the central 3 × 3 square, with perimeter P = 12. Join the remaining 20 squares
one-by-one. Each join increases P by 2: an increase of 4 from the new square but then a
decrease of 2 from the join. After joining 20 squares, P = 12 + 20 × 2 = 52,
hence (A).

3. From 20:22 through to 21:00 is 38 minutes.

From 21:00 through to 00:00 is 180 minutes.
Then the total time is 218 minutes,
hence (B).

1+4 5 1
4. = = ,
9 + 16 25 5
hence (A).

5. (Also J9)
Since P QR is isosceles, ∠P QR = ∠P RQ. Also ∠P QR + ∠P RQ = 180◦ − 48◦ = 132◦ .
Consequently ∠P QR = ∠P RQ = 132 ÷ 2 = 66◦ ,
hence (B).

7(8 + 12)
6. The rectangle has area 7 × 12 = 84 and the shaded trapezium has area = 70 so
2
70 5
the fraction shaded is = ,
84 6
hence (C).

7. (0.4)2 + (0.1)2 = 0.16 + 0.01 = 0.17,

hence (C).

8. (Also J13)
Australia needs to buy enough petrol for another 30 days. This is 30 × 160 million = 4800
million litres,
hence (E).

www.amt.edu.au
56 2022 AMC Intermediate Solutions

9. Alternative 1
1011 − 674 = 337,
hence (A).
Alternative 2
2022( 12 − 13 ) = 2022( 16 ) = 2022 ÷ 6 = 337,
hence (A).

10. There are three s, so we divide the term on the right by three, giving 9x3 y 6 ,
hence (D).

11. (Also S5)

The diagonals of the rectangle meet at the midpoints of its two diagonals. One of these
diagonals
 hasendpoints (1, 8) and (7, 4). The midpoint is found by averaging coordinates
1+7 8+4
, = (4, 6),
2 2
hence (A).

12. Alternative 1
5 1 2 1 3 1
Let x be the number sought. Then = 1+ 1 so = 1 and = 1 + . Then
3 1+ x 3 1+ x 2 x
1 1
= so that x = 2,
2 x
hence (C).
Alternative 2
The expression has a number of add one and reciprocal operations chained together:
1 1
x +1 x +1 5
3

To solve, reverse each operation, from right to left:

1 1
x
1
+1 3 x
2
+1 5
2
2 2 3 3
1 −1 1 −1
x x

hence (C).

13. Alternative 1
The angles will be of the form 2x, 3x and 4x. Then
2x + 3x + 4x = 180
9x = 180
x = 20
4x = 80
hence (D).

www.amt.edu.au
2022 AMC Intermediate Solutions57

Alternative 2
The three angles have 2, 3 and 4 parts and add to 180◦ . So each part is 180◦ ÷ 9 = 20◦
and the largest angle is 20◦ × 4 = 80◦ ,
hence (D).

14. (Also UP25)

Alternative 1
The line through 7 and 2 has 7 + 15 + 2 = 24 so far, so the missing number is 40 − 24 = 16.
Similarly, the line through 8 and 9 has 8+16+9 = 33 and the missing number is 40−33 = 7.
There are three more lines to complete. In each,
we know two of the numbers, so we can determine 7
31
what the other two numbers add to, as shown.
Adding 31 + 17 + 24 = 72 counts each of the three 8 15 17
unknown numbers twice. Thus the three unknown
numbers add to 36. 16
This means that the three unknown numbers are 7 24
36 − 31 = 5, 36 − 17 = 19 and 36 − 24 = 12. Of
2 9
the ten numbers used, the largest is the 19 just
found,
hence (E).
Alternative 2
7
Completing 7 + 15 + x + 2 = 40 gives x = 16, as shown.
Completing 8 + 16 + y + 9 = 40 gives y = 7, as shown.
Each line adds to 40, so summing all 5 gives 5 × 40 = 200. This 8 15 a b
counts every number twice, so the 10 numbers add to 100.
16 c
The 7 known numbers add to 64 so a + b + c = 36. Since
a + b = 17, c = 36 − 17 = 19. The last two numbers can now 7
be found: a = 5 and b = 12. 2 9
The largest number used is c = 19,
hence (E).

15
15. Daniel cycles for 15 minutes, so travels 20 × = 5 km. Luke walks for 20 minutes, so
60
20
travels 6 × = 2 km. Combined they travel 5 + 2 = 7 km,
60
hence (D).

16. Each of the 7 adults gives gifts to all 11 other people, for a total of 7 × 11 = 77 gifts.
Each of the 5 children gives gifts to all 4 other children, for a total of 5 × 4 = 20 gifts.
Altogether, the number of gifts that will be given is 77 + 20 = 97,
hence (C).

www.amt.edu.au
58 2022 AMC Intermediate Solutions

17. There are 16 equally likely outcomes from the two spins. Second spin
The diagram shows the two-digit numbers for these outcomes. 1 2 3 4
The 10 shaded cells indicate when a multiple of 11 is obtained, 1 11 12 13 14
10 5

First spin
so the probability of this is = , 2 22 22 23 24
16 8
3 33 33 33 34
4 44 44 44 44

hence (D).

1
18. The 8 unit squares each have area 1 and the 8 overlapping triangles are each of a unit
4
1
square. So the total area is 8 − 8 × = 8 − 2 = 6,
4
hence (C).

19. Suppose Nic has been learning for N days and Rick for R days. Then (R−14) = 5(N −14) =
5N − 70 and (R − 2) = 2(N − 2) = 2N − 4. Thus

R = 5N − 56 = 2N − 2
3N = 54
N = 18 and R = 2 × 18 − 2 = 34

Then R + N = 18 + 34 = 52,
hence (D).

20. In the left diagram, suppose the screen is 16 units by 9 units. Then the unshaded part of
the screen must be 12 units by 9 units, since it has the same height and its ratio of width
to height is 4 : 3. The proportion of the screen’s area which is not blacked out by the bars
12 3 1
is = , so  = .
16 4 4

9 12 12 9

16 16

Similarly, in the right diagram we may assume the screen is 16 units by 12 units and the
9 3
unshaded part is 16 units by 9 units. Then the proportion not blacked out is = , so
12 4
1
r= .
4
Therefore  = r, so  : r = 1 : 1,
hence (C).

www.amt.edu.au
2022 AMC Intermediate Solutions59

21. (Also S20)

Label points as shown, where M is the midpoint
√ of BC. P
Due to Pythagoras’ theorem, P B = P C = 82 + 12 =
√ 1
65.
Since P BC is isosceles, P M C has a right angle at M , B A
√ 8
√ 4
and then M P = ( 65)2 − 42 = 49 = 7.
M 8
Then P BC has base BC = 8, altitude M P = 7 and 4
area 12 × 8 × 7 = 28, C
hence (B).

22. The expression turns out to have the same value for all n  1:

3 (1 × 2 × 4) + (2 × 4 × 8) + · · · + (n × 2n × 4n)
(1 × 3 × 9) + (2 × 6 × 18) + · · · + (n × 3n × 9n)
 
3
3 8(1 + 8 + · · · + n ) 3 8 2
= 3
= =
27(1 + 8 + · · · + n ) 27 3

hence (B).

23. Alternative 1
Let the drum hold 12x litres. Then originally there are 5x litres of water and 7x litres of
5
milk. When 9 L are spilt, this is also in the ratio 5 : 7 so 9 × = 3.75 L of water and
12
7
9× = 5.25 L of milk are spilt.
12
This leaves 5x − 3.75 L of water and 7x − 5.25 L of milk. After refilling, water goes up to
5x − 3.75 + 9 = 5x + 5.25 L. The new ratio tells us that:

7(5x + 5.25) = 9(7x − 5.25)

35x + 36.75 = 63x − 47.25
84 = 28x
x=3

So the initial amount of milk was 7x = 21 L,

hence (B).
Alternative 2
7 7 7 7
The amount of milk in the drum went from of a drum to of a drum. Then ÷ =
12 16 16 12
12 3
= , so three-quarters of the milk was kept and one-quarter was spilled.
16 4
7 21
The 9 litres of mixture spilled contained ×9 = litres of milk. Since this is one-quarter
12 4
of the milk, there was originally 21 litres of milk in the drum,
hence (B).

www.amt.edu.au
60 2022 AMC Intermediate Solutions

24. Let l be the lowest common multiple of p and q. We know that the product of any two
integers is equal to the lowest common multiple multiplied by the highest common factor,
pq prt
so pq = lt. So l = = = pr,
t t
hence (D).
25. Label the cells as shown, so that abde = bcef = degh = ef hi = 2 and
abc = def = ghi = adg = beh = cf i = 1. Then a b c

(abde)(bcef ) = (abc)(def )be d e f

4 = be g h i
Similarly eh = 4. Thus 16 = (be)(eh) = (beh)e = e,
hence (E).

26. Alternative 1
In the hundreds column, c + a is either 9 or 10. In the units column, b + c is either 2 or 12.
If b + c = 2 then b = c = 1 and then a = 1 in the tens column. However, this puts 1 + 1 = 2
in the hundreds column. So there is no solution with b + c = 2.
So b + c = 12 and then a + b = 11 in the tens column and c + a = 9 in the hundreds
column. Combining these, 11 + 9 − 12 = (a + b) + (a + c) − (b + c) = 2a so that 2a = 8
and a = 4. Then b = 7 and c = 5 and the three-digit number abc is 475,
hence (475).
Alternative 2
Writing the numbers with their place values,
2022 = (1000 + 100c + 10a + b) + (100a + 10b + c)
= 1000 + 110a + 11b + 101c
=⇒ 1022 = 110a + 11b + 101c
Then 110a, 11b, 99c and 1023 = 11 × 93 are multiples of 11, which can all be moved to the
left-hand side
1023 − 110a − 11b − 99c = 1 + 2c
Consequently 2c + 1 is a multiple of 11. Also 3  2c + 1  19 so that 2c + 1 = 11 and
c = 5. Then 11(93 − 10a − b − 9c) = 11 so that 10a + b = 92 − 9c = 92 − 45 = 47. Hence
a = 4 and b = 7 and the number abc is 475,
hence (475).

27. We get
6  111 
171 × 66 . . . 6
  = 171 × × 10 − 1
9
111 sixes
= 114 × (10111 − 1)
= 113 99 . . . 9 886.
 
108 nines
Thus, 1 + 8 + 1 + 8 + 3 + 6 + 9 × 108 = 9 × 111 = 999,
hence (999).

www.amt.edu.au
2022 AMC Intermediate Solutions61

28. (Also J30)

Alternative 1
Suppose the three numbers in the sum are x, y and z, in increasing order.
If x = 1, then y must be at least 2 to avoid repeats. On the other hand, y cannot be more
than 49, otherwise z will be smaller. So y is in the range 2–49, giving 48 possibilities.
If x = 2, then y must be at least 3 to avoid repeats. If y = 49, then it is equal to z, which
is not allowed. So y is in the range 3–48, giving 46 possibilities.
If x = 3, then y must be in the range 4–48, giving 45 possibilities. Continuing in this way,
we get the subtotals shown in the following table. Notice that when x is odd, y and z
are guaranteed to never be equal because one is odd and the other is even. But when x
is even, we need to be careful to avoid the possibility that y = z. This accounts for the
pattern of alternating decreases in the subtotals as we move down the table.

x y Subtotal
1 2–49 48
−2
2 3–48 46
−1
3 4–48 45
−2
4 5–47 43
.. .. .. −1
. . .
29 30–35 6
−2
30 31–34 4
−1
31 32–34 3
−2
32 33 1

So the total number of sums is

1 + 3 + 4 + 6 + 7 + 9 + · · · + 40 + 42 + 43 + 45 + 46 + 48,

or
1 + 4 + 7 + · · · + 40 + 43 + 46
+ 48 + 45 + 42 + · · · + 9 + 6 + 3
Since there are 32 rows in the table, the above sum has 16 pairs of numbers which add to
49, so the total is 49 × 16 = 784,
hence (784).
Alternative 2
Each sum like 100 = 61 + 34 + 5 can be visualised as a row of counters of three colours,
such as 61 red counters followed by 34 green counters then 5 blue counters.

61 34 5

We’ll first work out the number of these arrangements of counters where we allow equal
numbers of some colours, and different arrangements (colours) of the same numbers are
counted separately. In this case, each choice corresponds to choosing the positions of the
two arrows in the diagram above. These arrows are in different positions, and not on the
first counter, so there are 99 possible positions.

www.amt.edu.au
62 2022 AMC Intermediate Solutions

The number of ways of choosing 2 out of 99 is 99 × 98 ÷ 2, since there are 99 × 98 ways

of choosing one counter and then another, but this counts every pair twice. That is, there
are 99 × 49 = 4851 ways of making the row of red, green, then blue counters.
We need to exclude the arrangements of number a + b + c where two or more of a, b and
c are the same. We can’t have a = b = c, so we only need to exclude those where a = b,
a = c, or b = c.
For a = b, there are 49 possibilities, from 1 + 1 + 98, up to 49 + 49 + 2. Similarly there are
49 possibilities for a = c and 49 possibilities for b = c. So we have 99×49−3×49 = 96×49
arrangements where a, b and c are different.
However, every sum 100 = a + b + c with different a, b and c is counted 6 times here,
corresponding to a + b + c, a + c + b, b + a + c, b + c + a, c + a + b and c + b + a. So
the number of ways that 100 can be written as a sum of three positive integers where the
order of the three numbers does not matter is 96 × 49 ÷ 6 = 16 × 49 = 784,
hence (784).

29. Select numbers one at a time, at each point choosing the smallest number available that
can’t be used to form a triangle with two previously-chosen numbers. The first three chosen
are 1, 2 and 3.
The fourth choice can’t be 4, since there is a triangle with sides 2, 3 and 4, due to 2+3 > 4.
So we choose 5. This works, since if a and b are chosen from {1, 2, 3} then a + b ≤ 5, so
a, b, 5 don’t make a triangle.
The same principle tells us that the fifth choice is 8 — 3,5,6 and 3,5,7 both form triangles,
but 8 can’t form a triangle with two numbers from {1, 2, 3, 5}, since 8 is the sum of the
two largest numbers.
In general each choice from here on will be the sum of the two previous choices, giving
Fibonacci numbers.
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, . . .
The first 15 of these numbers (up to 987) gives us a choice of 15 elements with no triangles,
and it seems likely that no more than 15 is possible.
To see that no more than 15 elements are possible, suppose we have our set of chosen
numbers in order: 1  a < b < c < d < e < · · · . Then a  1, b  2, and c  3.
Since b, c and d don’t form a triangle d  b+ c  2 + 3 = 5. Similarly e  c+ d  3 + 5 = 8,
and so on: each number is greater or equal to a corresponding Fibonacci number.
So there can’t be a 16th element in the list — it would have to be p  1597. Consequently,
the largest number of elements that can be chosen is 15,
hence (15).

30. Alternative 1
For each column of 3 horizontal lines in the grid, the path must either occupy 1 of the lines
or 3 of the lines. Make a 7-digit code from these lines. For instance, we can read across
the diagram in the question to get the code 3313111.
Consider the initial block of ‘3’s (possibly no ‘3’s) followed by a 1. Then the path must
make an ‘S’ shape like one of the following:

etc

www.amt.edu.au
2022 AMC Intermediate Solutions63

Then the path goes one column over and for the next block of ‘3’s, it creates a ‘Z’ shape
like those above, but inverted. This continues across the grid, each time with the path
being uniquely determined by the code.
There are 27 = 128 possible 7-digit codes of ‘1’s and ‘3’s, but not all of them work. To
ensure the path ends up at Bryn (rather than lower right) there must be an even number
of ‘1’s in the code. However, this is exactly half of all 128 codes, since for every code with
an even number of ‘1’s, there is a unique corresponding code with an odd number of ‘1’s
that is found by swapping ‘1’s and ‘3’s. So the number of possible paths is 128 ÷ 2 = 64,
hence (64).
Alternative 2
For a grid of 3 rows and n columns, let An be the number of paths from bottom left to
top right and let Bn be the number of paths from bottom left to bottom right. We need
to find A8 .
By inspection, we can tabulate the first few values:

n 1 2 3 4 5 6 7 8
An 1 1 2
Bn 0 1 2

For n > 3, each path will either enter the top right vertically or horizontally. Let k  0 be
the number of horizontal segments the path ends with. Then to ensure the bottom right
is visited, there is only one possibility for the k + 1 rightmost columns, as shown.

···
∗ ∗ ∗ ∗

Then for k = 1, . . . , n − 1, the number of paths in each case will be equal to the number of
paths to the point marked ∗ which is be Bn−k−1 . In addition there is the case k = n − 1,
where there is only one possibility. Consequently An = Bn−1 + Bn−2 + · · · + B1 + 1. So for
instance A4 = B3 + B2 + B1 + 1 = 2 + 1 + 0 + 1 = 4.
For Bn , a similar analysis gives us that Bn = An−1 + An−2 + · · · + A1 , so that B4 =
A3 + A2 + A1 = 2 + 1 + 1 = 4. Using these formulas, the table can be completed:

n 1 2 3 4 5 6 7 8
An 1 1 2 4 8 16 32 64
Bn 0 1 2 4 8 16 32 64

Then there are A8 = 64 possible paths for Felix,

hence (64).

www.amt.edu.au