2022 Chapter Competition Solutions

Are you wondering how we could have possibly thought that a Mathlete® would be
able to answer a particular Sprint Round problem without a calculator?

Are you wondering how we could have possibly thought that a Mathlete would be
able to answer a particular Target Round problem in less 3 minutes?

The following pages provide detailed solutions to the Sprint and Target Rounds of
the 2022 MATHCOUNTS Chapter Competition. These solutions show creative
and concise ways of solving the problems from the competition.

There are certainly numerous other solutions that also lead to the correct answer,
some even more creative and more concise!

We encourage you to find a variety of approaches to solving these fun and

challenging MATHCOUNTS problems.

Special thanks to solutions author

Howard Ludwig
for graciously and voluntarily sharing his solutions
with the MATHCOUNTS community.
2022 C HAPTER C OMPETITION Solutions

Sprint 1
34 − 2 × 42 = 81 − 2 × 16 [Exponentiation first.]
= 81 − 32 [Multiplication next.]
= 𝟒𝟒𝟒𝟒. [Subtraction last.]

Sprint 2
+4 326 052
−4 325 131
+ 921

Sprint 3
Reordering the set elements in increasing order yields {0, 3, 4, 7, 8, 11, 16}. Since we have an odd number of
elements, the median is the middle element of this ordered set. In the case of this set, the middle element is
the fourth element, which is 7.

Sprint 4
Parker got 11. Each friend got twice that: 2 × 11 = 22. There are 3 friends, so the total count is
11 + 3 × 22 = 11 + 66 = 77 pieces.

Sprint 5
The iterative steps 3 and 4 yield what is called the digits-sum of the original number. Summing the digits of a
number and taking the remainder upon dividing the sum of the digits by 9 gives the remainder upon dividing
the original number by 9. The only nonnegative integer that yields a digit-sum of 0 is 0; a positive integer
that is divisible by 9 has a digit-sum of 9, instead of the actual remainder value 0. The sum of the digits of 135
is 9, so its digit-sum is 9, indicating 135 to be divisible by 9. If we multiply a positive multiple of 9 by any
positive integer (it does not have to be two-digit), the result is also a multiple of 9, so the digit-sum is 9.

Sprint 6 S R S L L
Let’s trace through the rooms, starting with the arrow entering the room at the upper
L R R L R
left, shading each room that we enter, and drawing an arrow into the next room in
accordance with the L, R, or S in the room we just entered. Once we reach the spade L S S R S
room, we count the number of shaded rooms, which is 13 rooms. R R L R S
S S L S ♠
Sprint 7
𝑛𝑛 + 18 = 4 × 5 = 20, so 𝑛𝑛 = 20 − 18 = 𝟐𝟐.

Sprint 8
We need an integer that is divisible by both 2 and 3, thus by 6, and it must be greater than 100. Since
100 ÷ 6 = 16 R 4, the next multiple of 6 up from 100 is 17 × 6 = 102. So, the fewest number of students who
could have signed up is 102 students.

Sprint 9
Rectangular prisms have 6 faces. For any 1 face, there are 4 adjacent faces that must not be colored the same
as the first face, and only the 1 remaining face is non-adjacent and permitted to be the same color. Therefore,
at most 2 faces (opposite faces) are allowed to be the same color, so at least 6/2 = 3 colors are needed.
There are 3 pairs of opposite sides, so the minimum number of colors needed is 3 colors.

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Sprint 10
Let 𝑙𝑙 be the length of the rectangle. Then the width 𝑤𝑤 = 𝑙𝑙 + 1. We need the perimeter, which is 2(𝑙𝑙 + 𝑤𝑤) =
2(𝑙𝑙 + 𝑙𝑙 + 1) = 4𝑙𝑙 + 2. We are given that 72 ft 2 is the enclosed area 𝑙𝑙𝑙𝑙. Therefore, 72 = 𝑙𝑙𝑙𝑙 = 𝑙𝑙(𝑙𝑙 + 1) = 𝑙𝑙 2 + 1𝑙𝑙.
Rearranging yields: 0 = 𝑙𝑙 2 + 1𝑙𝑙 − 72 = (𝑙𝑙 + 9)(𝑙𝑙 − 8), so 𝑙𝑙 = −9 feet or 𝑙𝑙 = 8 feet. It makes no sense for the
length of a side to be negative, so we must have 𝑙𝑙 = 8 feet and perimeter 4 × 8 ft + 2 ft = 𝟑𝟑𝟑𝟑 feet.

Sprint 11
3 8
Because there are as many heads as there are legs, there are as many legs as heads, so the average
8 3
2 223 − 2 2/3 1
number of legs per head is 2 , which is = = of the way from 2 [# legs per chicken] to 4 [# legs
3 4−2 2 3
1 2
per goat]. Therefore, 3 of the animals are goats, and
3
are chickens, so the goat-to-chicken ratio is 1:2. Thus,
the minimum number of animals is 1 + 2 = 3 animals, meaning there is 1 goat and 2 chickens.

Sprint 12
The two highest scores are 8.5 and one of the two 8.0 scores, so these are discarded; the two lowest scores
are 7.0 and 7.0 (both of the two 7.0 scores), so these are discarded. The scores that are used are the one
remaining 8.0 and the two scores of 7.5. Therefore, the point total for the dive is 3.5(8.0 + 7.5 + 7.5) =
1
3.5(23) = 3(23) + (23) = 69 + 11.5 = 𝟖𝟖𝟖𝟖. 𝟓𝟓 points.
2

Sprint 13
3 7 18 7 3 7 21 𝟓𝟓
1 = cups are required for 24 cookies, so for 18 cookies: � � = � �= = 𝟏𝟏 cups.
4 4 24 4 4 4 16 𝟏𝟏𝟏𝟏

Sprint 14
With a rectangle, two vertices may be the endpoints of a short side, of a long side, or of a diagonal. Given two
such lengths, the shorter must be a side, while the longer may be a side or a diagonal. If the 5 meters is a
diagonal, then we have a 3-4-5 right triangle and the unknown length is the second side, which must be
4 meters. If the 5 meters is the longer side, the unknown length is the diagonal, even longer than the
5 meters. Thus, the minimum possible distance in question is 4 meters.

Sprint 15
64×12 1
Of the 64 × 144 calculators in the lot, 64 × 12 were tested. Therefore, the fraction tested is 64×144 = . If 12
12
times as many calculators are tested, we expect 12 times as many failures, thus 12 × 2 = 𝟐𝟐𝟐𝟐 calculators.

Sprint 16
3
This problem involves a weighted average with the $30 value weighted as 75% = and the $10 value
4
1 3 1 90+10 100
weighted as 25% = . So, (30) + (10) = = = $𝟐𝟐𝟐𝟐 or $25.00.
4 4 4 4 4

Sprint 17
1 5 5 1 1 5 55 5
�11 + � × �12 + � = �11 × 12 + 11 × + × 12 + × � = �132 + +6+ �=
2 12 12 2 2 12 12 24
2×55 + 5 115 19
�132 + 6 + � = �138 + � = 142 ft 2, which rounds to 143 ft 2 .
24 24 24

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Sprint 18
The length 𝑙𝑙 and width 𝑤𝑤 are related as 𝑤𝑤 = 𝑙𝑙 − 50. Therefore, the perimeter is given by 500 = 2(𝑙𝑙 + 𝑤𝑤) =
500 + 100
2(𝑙𝑙 + 𝑙𝑙 − 50) = 4𝑙𝑙 − 100, so 𝑙𝑙 = = 150 ft. The enclosed area is given by 𝑙𝑙𝑙𝑙 = 𝑙𝑙(𝑙𝑙 − 50) = 150 × 100 =
4
2
𝟏𝟏𝟏𝟏, 𝟎𝟎𝟎𝟎𝟎𝟎 ft .

Sprint 19
We need to determine the estimated arrival time down to the minute, so we need to determine the
60 mi 60 minutes 4
remaining travel time, distance divided by speed, in terms of minutes: mi × = × 60 minutes =
75 1 hour 5
hour
48 minutes, which is 12 minutes short of 1 hour. Therefore, starting at 10:32, add 1 hour to get 11:32, and
then subtract 12 minutes to result in 11:20 a.m.

Sprint 20
2 2 2
Based on the inforamtion given, we have 𝑥𝑥 5 = 𝑥𝑥 4 , so 𝑥𝑥 4 �𝑥𝑥 − � = 0. Therefore, 𝑥𝑥 = 0 or 𝑥𝑥 = , but it must
3 3 3
𝑥𝑥 10 2 2 𝟒𝟒
be the latter value because 0 does not satisfy the positivity requirement. Thus, = 𝑥𝑥 2 = � � = .
𝑥𝑥 8 3 𝟗𝟗

Sprint 21
If the two bread slices are selected to be the same, then there are 3 flavor choices. If they are selected to be
3!
different, then there are 3C2 = 2! 1! = 3 choices, totaling 6 choices for the bread. For each of these, there are
3 choices of filling (ham only, cheese only, both). So, James can make 6 × 3 = 𝟏𝟏𝟏𝟏 different sandwiches.

Sprint 22
Let N be the total number of students in Mr. Short’s homeroom. Then working backward, we see that 6 =
1 1 1 2 1
�1 − � 𝑁𝑁 = � � 𝑁𝑁 = 𝑁𝑁, so 𝑁𝑁 = 6 × 6 = 𝟑𝟑𝟑𝟑 students.
4 3 4 3 6

Sprint 23
We need meters per second, not centimeters per second, so convert the stride of 140 cm to meters:
1m
140 cm × = 1.4 meters. The number of pulses going above the dashed line for the 3 g threshold to
100 cm
count as strides is 19. Therefore, a total assumed distance of 19 × 1.4 meters [do not calculate that yet] is
19 × 1.4
covered in 20 seconds, making the average speed = 19 × 0.07 = 𝟏𝟏. 𝟑𝟑𝟑𝟑 m/s. [Notice that waiting so we
20
could do the very easy division first made for a simpler multiplication later, which can be important for the
Sprint Round as a speed round without support of electronic calculators.]

Sprint 24
The triangle inequality property tells us 3 = 5 − 2 < 𝑥𝑥 < 5 + 2 = 7, so 𝑥𝑥 as an integer must be 4, 5 or 6. The
median is the middle value, 5.

Sprint 25
$150/yr 6×$25
$150 each year averages to mo = 6×2 mo = $12.50/mo. So, $5.95𝑁𝑁 > $12.50/mo + $3.95𝑁𝑁, where N is the
12
yr
$12.50/mo
number of movies rented per month. Thus, $2𝑁𝑁 > $12.50/mo, making 𝑁𝑁 > = 6.25/mo. The least
$2
such integer is 7 movies per month.

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Sprint 26
Note that 345,600 = 3456 × (2 × 5)2 . The sum of the digits of 3456 is 18, which is divisible by 9, so 3456 is
likewise divisible by 9 = 32 , leaving a quotient of 384. The sum of the digits of 384 is divible by 3 but not by
9, so that is the case with 384 = 3 × 128 = 3 × 27 . Combining all this yields 345,600 = 29 × 33 × 52 =
26 × (23 × 33 ) × 52 = 46/2 × 63 × 52 = 63 × 52 × 43 . The product of the exponents is abc = 3 × 2 × 3 = 𝟏𝟏𝟏𝟏.

Sprint 27
Of 12 flowers, 6 are required to be orchids, leaving flexibility for the remaining 6 to be any mix of 4 kinds of
flowers, including possibly more orchids. Let’s use what I call the bars and blanks method. [A variety of
names are given to this method.] We have 12 blanks, each representing one flower, with O (for orchid) in the
last 6 since we require a minimum of 6 orchids; we have 3 bars to intersperse among the empty blanks to
separate the roses from the lilies, the lilies from the violets, and the violets from the extra orchids. For
example: | ____ ____ ____ ____ || ____ ____ _O_ _O_ _O_ _O_ _O_ _O_ would indicate 0 roses (because of 0 blanks
to the left of the first bar), 4 lilies (because of 4 blanks between the first and second bars), 0 violets (because
of 0 blanks between the second and third bars) and 2 extra orchids (because of two empty blanks to the right
of the last bar, for a total of 8 orchids). The number of possible distinct bouquets is the number of orderings
9! 9×8×7 72×7
of the 3 bars and the 6 empty blanks, which is 6+3C6 = 6! 3! = 3×2×1 = 6
= 12 × 7 = 84. So, that’s 𝟖𝟖𝟖𝟖
groups of a dozen flowers.

Sprint 28
Cross-multiplying yields (𝑥𝑥 + 2)(𝑦𝑦 + 3) = 6. The only ways to factor 6 into the product of two integers is
(1)(6), (2)(3), (−1)(−6) and (−2)(−3)—each of which can go in either order as to which factor is (𝑥𝑥 + 2)
and which is (𝑦𝑦 + 3). The 8 factors for (𝑥𝑥 + 2) occur in 4 pairs, each pair having one positive value and one
counterpart equal-magnitude negative value, with the sums canceling each other to 0, so the sum of all eight
(𝑥𝑥 + 2) factors is 0. To get the sum of all eight corresponding 𝑥𝑥 values, subtract 2 for each of the 8 factors to
end up with 0 − 8 × 2 = −𝟏𝟏𝟏𝟏.

Sprint 29
𝑎𝑎0 = 4;
𝑎𝑎1 = 𝑎𝑎1 ; [an as yet unknown value]
𝑎𝑎2 = 𝑎𝑎1 + 2𝑎𝑎0 = 𝑎𝑎1 + 8;
𝑎𝑎3 = 𝑎𝑎2 + 2𝑎𝑎1 = 𝑎𝑎1 + 8 + 2𝑎𝑎1 = 3𝑎𝑎1 + 8;
26−24 2 6 46
𝑎𝑎4 = 𝑎𝑎3 + 2𝑎𝑎2 = 3𝑎𝑎1 + 8 + 2(𝑎𝑎1 + 8) = 5𝑎𝑎1 + 24 = 26, so 𝑎𝑎1 = = and 𝑎𝑎3 = + 8 = ;
5 5 5 5
46 130+92 𝟐𝟐𝟐𝟐𝟐𝟐
𝑎𝑎5 = 𝑎𝑎4 + 2𝑎𝑎3 = 26 + 2 × = = .
5 5 𝟓𝟓

Sprint 30
1
Each of the 8 vertex blocks has 3 sides painted, thus probability coming up unpainted. The 12 edge blocks
2
2
except vertex blocks total 12 × 8 = 96 blocks, each having 2 sides painted, thus probability 3 coming up
unpainted. The 6 face blocks except the edge and vertex blocks total 6 × 8 × 8 = 384 blocks, each having 1
5
side painted, thus probability coming up unpainted. Each of the remaining blocks, the interior 8 × 8 × 8 =
6
512 blocks, has 0 sides painted, thus probability 1 coming up unpainted. Therefore, the overall probability of
1 8 2 96 5 384 512
all blocks rolling with the upward facing side being unpainted is given by � � � � � � 1 =
2 3 6
296 ×5384
28 ×396 ×2384 ×3384
= 2−296 × 3−480 × 5384, so the desired answer is the sum of the exponents, −296 − 480 +
384 = −𝟑𝟑𝟑𝟑𝟑𝟑.

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Target 1
The excluded value is the product of all 6 values divided by the given product of all included values:
1×4×6×9×15×17 55,080
= = 𝟏𝟏𝟏𝟏.
3240 3240

Target 2
1×8 + 1×11 + 2×12 + 4×14 + 6×15 + 7×16 + 2×17 + 3×18 + 4×20 8+11+24+56+90+112+34+54+80 469
= = = 15.63…, which
1+1+2+4+6+7+2+3+4 30 30
rounds to the nearest tenth as 15.6 points.

Target 3
notes
88 measure × 16 60 seconds 84,480
notes
measure
× = ≈ 196 seconds.
432 1 min 432
min

Target 4
Because the diameter of the circle is 8, radii OA, OB and OC have length 4. Given BC = 4√2, we have (OB)2 +
(OC)2 = 32 = (BC)2 , which, according to the Pythagorean theorem, means that △BCO is a right triangle with
angle BOC being the right angle and the two radii being the legs. Therefore, the area enclosed by triangle BOC
1
is × 4 × 4 = 8. Angles BOC and AOC are supplementary, so angle AOC is a right angle as well, and the sector
2
formed by minor arc AC and radii OA and OC is one quadrant of the circle. Therefore, the area enclosed by
1
the sector is π(42 ) = 4π. The total area of the shaded area is 8 + 4π. So, a = 8, b = 4, and ab = 8 × 4 = 𝟑𝟑𝟑𝟑.
4

Target 5
902 810,000
× 100% = % ≈ 18.6%.
43,560 43,560

Target 6
Both PQ and PR are the hypotenuse of 2 × 3-4-5 right triangles. By properties of 45-45-90 right triangles,
QR = 6√2. Thus, triangle PQR is an isosceles triangle with side lengths 10, 10 and 6√2. To find the enclosed
area, we can easily split the triangle into two congruent right triangles with hypotenuse 10 and one leg of
1 2
length × 6√2 = 3√2, so the other leg is �102 − �3√2� = √100 − 18 = √82 and the enclosed area is
2
1
2 × × 3√2 × √82 = 𝟔𝟔√𝟒𝟒𝟒𝟒 units2.
2

Target 7
8 × (22 × 16 + 14 × 4) × 54 = 8 × (352 + 56) × 54 = 408 × 432 = 176 256, which when rounded to the
nearest thousand is 176,000 books.

Target 8
To have the product of the 4 digits be divisible by 14, the digit 7 must be chosen at least once, and one or
more of the digits 2, 4, 6 and 8 must be chosen at least once. This is the complement of never choosing 7,
8 4 4096 5 4 625
which has probability � � = or never choosing an even digit, which has probability � � = .
9 6561 9 6561
4 4 256
However, these two cases overlap (choosing 1, 3, 5 or 9 every time), which has probability � � = . Thus,
9 6561
4096 625 256 𝟐𝟐𝟐𝟐𝟐𝟐𝟐𝟐
the answer is 1 − � + − � = .
6561 6561 6561 𝟔𝟔𝟔𝟔𝟔𝟔𝟔𝟔

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Team 1
3 2 2 3 1
75% = 0.75 = . Now, × 75% × 0.85𝑥𝑥 = × × 0.85𝑥𝑥 = × 0.85𝑥𝑥 = 0.425𝑥𝑥 = 100, so
4 3 3 4 2
4 4 7 3 21 0.425 0.420 420
× 70% × 0.75𝑥𝑥 = × × 𝑥𝑥 = 𝑥𝑥 = 0.42𝑥𝑥 = 0.42 × 𝑥𝑥 = × 0.425𝑥𝑥 = × 100 = 98.82… ,
5 5 10 4 50 0.425 0.425 425
which rounds to the nearest tenth as 98.8.

Team 2
The count in the category “Insects” is 3252; the count in all other categories combined, 1892, is less than for
the one “Insects” category. Whenever one category has a count that is more than half the total count (that is,
the one category has a greater count than all other categories combined), the median value is guaranteed to
occur in that one category. All members of that one category in this case have a value of 6, so the median
number of legs is 6 legs.

Team 3
The number being divisible by both 2 and 5 means the ones digit must be 0. To be divisible by 3, the sum of
the digits must be divisible by 3: 2 + 3 + 4 + ℎ + 6 + 0 = 15 + ℎ, so the hundreds digit must be divisible by
3, thus 0, 3, 6 or 9. The largest of these, 9, yields the greatest possible overall value for the original number,
234960.

Team 4
47.25 4
Ailey, and therefore Zander, earn , which is $15.75 per hour, so Liz earns × 15.75 = $12.60 𝑝𝑝𝑝𝑝𝑝𝑝 hour.
3 5
Ailey and Zander worked a combined 3 + 5 = 8 hours, while Liz worked 12 hours. Therefore, the combined
$15.75 $12.60 1
earnings are 8 hours × + 12 hours × = $126 + $151.20 = $277.20. Of that, 5% = went back
hour hour 20
277.20
into the business, thus 20 = $𝟏𝟏𝟏𝟏. 𝟖𝟖𝟖𝟖.

Team 5
Each side of the triangle is the sum of the two radii of the circles forming the side:
1 + 2 = 3 meters; 1 + 3 = 4 meters; 2 + 3 = 5 meters. Therefore, we have a 3-4-5 right triangle whose
1
enclosed area is half the product of the two shorter sides: × 3 × 4 = 𝟔𝟔 m2 .
2

Team 6
For a page number 100ℎ + 10𝑡𝑡 + 𝑢𝑢 ≤ 280, ℎ, 𝑡𝑡 and 𝑢𝑢 represent the hundreds, tens, and units or ones digits,
respectively, each at least 0 and at most 9, subject to further constraints, two of which are ℎ + 𝑡𝑡 + 𝑢𝑢 = 16
and ℎ ≤ 2. When ℎ = 0, 𝑡𝑡 + 𝑢𝑢 = 16, so 𝑡𝑡 can range from 7 up to 9, while 𝑢𝑢 ranges from 9 down to 7—making
3 options. When ℎ = 1, 𝑡𝑡 + 𝑢𝑢 = 15, so 𝑡𝑡 can range from 6 up to 9, while 𝑢𝑢 ranges from 9 down to 6—making 4
options. Careful now: When ℎ = 2, 𝑡𝑡 + 𝑢𝑢 = 14, so 𝑡𝑡 can range from 5 up to only 7 [due to a page number
being at most 280], while 𝑢𝑢 ranges from 9 down to 7—making 3 options. Therefore, the total number of
words written is 3 + 4 + 3 = 𝟏𝟏𝟏𝟏 words.

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.

2022 C HAPTER C OMPETITION Solutions

Team 7
1
There are 5! = 120 permutations of the five digits. Each digit value occurs of the time in each digit place.
5
Therefore, each of 1, 2, 3, 4 and 5 occurs 24 times in each digit place, so the sum of the digit values in any one
digit-place column is 24(1 + 2 + 3 + 4 + 5) = 24 × 15 = 360. To account for the 10,000s place, the 1000s
place, the 100s place, the 10s place and the 1s place, we need to multiply the 360 by 10,000 + 1000 + 100 +
10 + 1 = 11,111 to end up with the answer 11,111 × 360 = 𝟑𝟑, 𝟗𝟗𝟗𝟗𝟗𝟗, 𝟗𝟗𝟗𝟗𝟗𝟗.

Team 8
𝑛𝑛(𝑛𝑛−3)
For a regular 𝑛𝑛-gon, there are always diagonals, so for 𝑛𝑛 = 20, there are 170 diagonals. When 𝑛𝑛 is
2
even, the longest diagonals go straight across passing through the center to the opposite vertex, and there
are 10 such distinct pairings of vertices. The shortest diagonals are obtained by taking any vertex; that vertex
is adjacent to two other vertices, and the diagonal joining those two other vertices has the shortest possible
length—there are 20 such vertices and 20 such diagonals. Therefore, of the 170 diagonals, we are rejecting
140 𝟏𝟏𝟏𝟏
10 + 20 = 30 and thus keeping 140. The probability is, therefore, = .
170 𝟏𝟏𝟏𝟏

Team 9
Line 1: either ‘2’ or ‘3’ first, so 2 orderings; 4 choices for the ‘2’; 3 choices for the ‘3’;
thus, 2 × 4 × 3 = 24 distinct lines.
Line 2: ‘3’ in any of 3 positions, so 3 orderings; 3 × 2 choices for the ‘2’s; 2 choices for the ‘3’;
thus, 3 × 3 × 2 × 2 = 36 distinct lines.
Line 3: either ‘2’ or ‘3’ first, so 2 orderings; 1 choice left for the ‘2’; 1 choice left for the ‘3’;
thus, 2 × 1 × 1 = 2 distinct lines.
Putting the options together for all three lines: 24 × 36 × 2 = 𝟏𝟏𝟏𝟏𝟏𝟏𝟏𝟏 haiku.

Team 10
The square root causes major difficulties for having an integer result. It is necessary to have √𝑎𝑎𝑎𝑎 = √40𝑏𝑏 =
2√10𝑏𝑏 be an integer, so 10𝑏𝑏 must be a perfect square, so it must be that 𝑏𝑏 = 10𝑛𝑛2 for some integer 𝑛𝑛 > 2. If 𝑛𝑛
is divisible by 3, then the second and third terms in the numerator 40 + 20𝑛𝑛 + 10𝑛𝑛2 are divisible by 3 but
the first term is not, so the numerator cannot be divisible by 3. We can crank a few cases quickly, so let’s not
analyze more. Because 𝑛𝑛 > 3, first try 𝑛𝑛 = 4: 40 + 80 + 160 = 280—not divisible by 3. Next try 𝑛𝑛 = 5: 40 +
100 + 250 = 390—yes, divisible by 3. Therefore, the least 𝑏𝑏 > 2 is 𝑏𝑏 = 10 × 52 = 𝟐𝟐𝟐𝟐𝟐𝟐.

Copyright MATHCOUNTS, Inc. 2022. All rights reserved.