2023 State 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?

Are you wondering how we could have possibly thought that a particular Team Round
problem would be solved by a team of only four Mathletes?

The following pages provide detailed solutions to the Sprint, Target and Team
Rounds of the 2023 MATHCOUNTS State 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.
Sprint 1
4.7/2 = 2.35 ≈ 2.
Sprint 2
103 1000 1000
34 −1
= = = 𝟏𝟏𝟏𝟏. 𝟓𝟓.
81−1 80

Sprint 3
2 2
3𝑡𝑡 < 260, so 𝑡𝑡 < 260/3. So, the greatest integer value for t is (260/3) – 1 = (86 ) – 1 = 85 ≈ 86.
3 3

Sprint 4
𝑚𝑚∠A + 𝑚𝑚∠B + 𝑚𝑚∠C = 180°, so 𝑚𝑚∠C = 180° − 40° − 85° = 𝟓𝟓𝟓𝟓°.
Sprint 5
4+8+6+9+𝑛𝑛
6= , so 𝑛𝑛 = 5 × 6 − (4 + 8 + 6 + 9) = 30 − 27 = 𝟑𝟑.
5

Sprint 6
2021 + 3 × 6 = 2021 + 18 = 2039.
Sprint 7
36 mm
For rectangles of fixed perimeter, the maximum area occurs for the square, so a side is =
4
9 mm, and the area is (9 mm)2 2
= 𝟖𝟖𝟖𝟖 mm .
Sprint 8
5 Tsp 1 c 200 25 25 𝟏𝟏
200 gj × × =   . So,  = = 𝟒𝟒 cups of flour are required to make 200 gulab
15 gj 16 Tsp 3×16 3×2 6 𝟔𝟔
jamun.
Sprint 9
(𝑎𝑎 + 𝑏𝑏)2 = (𝑎𝑎 − 𝑏𝑏)2 + 4𝑎𝑎𝑎𝑎 = 32 + 4 × 40 = 169, with 𝑎𝑎 > 𝑏𝑏 > 0, so 𝑎𝑎 + 𝑏𝑏 = √169 = 𝟏𝟏𝟏𝟏.
Sprint 10
12°−6° min 1
× 24 h × 60  = × 24 × 60 min  = 𝟐𝟐𝟐𝟐 minutes.
360° h 60

Sprint 11 H
Going from H to S requires passing through A, B, and C. There are 2
equidistant paths from H to A; there is only 1 minimum distance path, A B C
the direct one, from A to B and likewise from B to C; there are 2
equidistant paths from C to S. The choice of path from C to S is independent S
of the choice from H to A, so a total of 2 × 1 × 1 × 2 = 4 qualifying routes.
Sprint 12
At a minimum of 2 points per basket, 8 baskets is a minimum of 16 points, with 1 added point for
each three-point basket. Lisa has 21 − 16 = 5 added points, so she made 5 three-point baskets.
Sprint 13

Because the answer is to be in terms of whole hours, let’s see what happens in 1 hour = 60 minutes.
Now, 60 minutes = 15 × 4 minutes, so 15 snowballs are made, but 4 pairs of snowballs melt, so a
net of 15 – (4 × 2) = 7 snowballs are produced per hour. So, gaining 21 snowballs requires 3 hours.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Sprint 14
The sum of 7 consecutive odd integers being 217 means the middle value is 217/7 = 31. The least
term is 3 odd integers below 31, thus 31 − 3 × 2 = 25.
Sprint 15
2 ⊗ (3 ⊗ (−1)) = 2 ⊗ (3² + (−1) − 3(3)) = 2 ⊗ (−1) = 2² + (−1) − 3(2) = −3.
Sprint 16
The area of triangle PTQ is the area of rectangle PQRS minus the area of pentagon PTQRS, thus
(5 cm)(12 cm) − 36 cm² = 24 cm². That is the product of half the base PQ, or 6 cm, times the height
MT, where M is the midpoint of PQ����. Thus, MT is 4 cm. PM = PQ/2 = 6 cm. The hypotenuse is then
PT = √PM 2 + MT 2 = �(6 cm)2 + (4 cm)2 = √52 cm = 𝟐𝟐√𝟏𝟏𝟏𝟏 cm.

Sprint 17
During the 20 s run, L is running 0.4 m/s faster than A, which results in a 20 s × 0.4 m/s = 8 m
greater distance for L than A, so A must start 8 m ahead.
Sprint 18
The quadrilateral can be decomposed into two right triangles, one with legs 𝑥𝑥 and 𝑥𝑥 + 4 and the
other with legs 5 and 5, and sharing a common hypotenuse. Thus, 𝑥𝑥 2 + (𝑥𝑥 + 4)2 = 52 + 52 , so
2𝑥𝑥 2 + 8𝑥𝑥 + 16 = 50, reducing to 𝑥𝑥 2 + 4𝑥𝑥 − 17 = 0, which by the quadratic formula has one
−4+�16+4(17)
positive solution: 𝑥𝑥 = = −𝟐𝟐 + √𝟐𝟐𝟐𝟐 OR √𝟐𝟐𝟐𝟐 − 𝟐𝟐.
2

Sprint 19
We want the fraction of the board outside the circle halfway between the 1 in and the 5 in circles,
that is the 3 in circle, but inside the circle halfway between the 5 in and the 7 in circles, that is the
6 in circle. The area of all the relevant circles is proportional to the square of the radius of the
circles. Total area proportional to 7² = 49; region of interest is between 3 and 6, for area
𝟐𝟐𝟐𝟐
proportional to 6² − 3² = 27. Desired probability is the ratio of the latter to the former, 𝟒𝟒𝟒𝟒 .

Sprint 20
𝑥𝑥+𝑦𝑦
= 7 so 𝑥𝑥 + 𝑦𝑦 = 14; �𝑥𝑥𝑥𝑥 = 5 so 𝑥𝑥𝑥𝑥 = 25 and 𝑥𝑥² + 𝑦𝑦² = (𝑥𝑥 + 𝑦𝑦)² − 2𝑥𝑥𝑥𝑥 = 14² − 2(25) = 146.
2

Sprint 21
44 = 4 × 11, so the number must be divisible by both 4 and 11. The last two digits taken together as
the value 52 is divisible by 4, no matter the value of A, B, C. Divisibility by 11 means the alternating
difference-sum of the digits is divisible by 11, so 11 | (2 − 5 + 0 − C + B − A + 2 − 5 + 3), thus
11 | (−A + B − C − 3), or, equivalently, 11 | (A − B + C + 3). Because A, B, C are digits, each is in the
range 0 ... 9, and 0 − 9 + 0 + 3 = −6 ≤ A − B + C + 3 ≤ 9 − 0 + 9 + 3 = 21, the only such multiples
of 11 are 0 and 11. Thus, B = A + C + 3, in which case 0 ≤ A + C ≤ 6, or B = A + C − 8, in which case
8 ≤ A + C ≤ 17. The former case is the usual problem of the number of distinct sums [order
important] of two nonnegative integers, which sum is less than or equal to 𝑛𝑛, being
(𝑛𝑛 + 1)(𝑛𝑛 + 2)/2, thus 28 for 𝑛𝑛 = 6. The latter case is harder with constraints on each digit:
(A; 0; C) goes from (0; 0; 8) to (8; 0; 0) for 9 choices, (A; 1; C) goes from (0; 1; 9) to (9; 1; 0) for 10
choices, (A; 2; C) goes from (1; 2; 9) to (9; 2; 1) for 9 choices, (A; 3; C) goes from (2; 3; 9) to (9; 3; 2)
for 8 choices, and so on to (A; 9; C) goes from (8; 9; 9) to (9; 9; 8) for 2 choices, making a total of
9 + 10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 = 63 choices. All totaled is 28 + 63 = 91 distinct values.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Sprint 22
The A on the front must go with the 2 on back, of which there is probability 1/4 of happening. The A
on back must go with the 7 or 9, not the B, on front, of which there is probability 2/3 of happening.
1 2 𝟏𝟏
The two events are independent, so the overall probability is 4 × 3 = 𝟔𝟔 .

Sprint 23
The vertical dashed line and the 𝑥𝑥-axis combine with the blue line to form a rt △ A 𝑦𝑦 𝑦𝑦==𝑥𝑥√3
𝑥𝑥
scaled as 1-√3-2 and with the red line to form a rt △ scaled as 1-1-√2 . Thus, 𝐿𝐿
O B
𝑚𝑚∠AOC = 60° and 𝑚𝑚∠BOC = 45°. The purple line 𝐿𝐿 has a slope that is 31° off (up C
or down) from the 45° slope of the blue line; in order to maximize the slope
difference between the 60° of the red line and purple line 𝐿𝐿, the slope of 𝐿𝐿 must be below that of the
blue line, thus 45° − 31° = 14°. Thus, the slope difference between the red line and the purple line
is 60° − 14° = 46°.
Sprint 24
Since the sum of each row or column is different, at best, we can pick any one row or any one
column to have the “correct” sum and change no elements in that row or column. Each of the
remaining 5 rows and columns has a different and, thus, “incorrect” sum, which needs to be
adjusted with at least one element in each needing changed.
If we look at the 3 × 3 array independently of the given sums, we can determine that changing 1, 2
or 3 entries will not be sufficient. Changing 1 entry can at most affect two sums, changing 2 entries
can at most affect four sums. Changing 3 entries can affect five sums, but two of these five sums will
have to be adjusted by the same amount and since we know the values are different, this cannot
result in them becoming equal. However, we can change five sums by different amounts by
adjusting 4 entries.

△a △a △a △a

△b △b

△b △c △b + c △c △d △c + d

△b △c △a △b △a
+c +d

We can verify this by choosing a row or column as “correct”—I will pick column 2 so the “correct”
sum is 15. We can fix row 1 by changing only the 1 to 0 or the 8 to 7—let’s do the latter. We can fix
row 2 by changing only the 6 to 9 or the second 3 to 6—let’s do the former. Because all six sums are
different, the fixes to the first two rows have not fixed any columns, so we must change the 3 to 5
and the 9 to 5, fixing both columns and, in the process, also the third row. Thus, the array can be
fixed by adjusting 4 entries.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Sprint 25
For 76 ≤ 𝑝𝑝 ≤ 99, there are 3 factors of 𝑝𝑝 in 300!, 2 factors of 𝑝𝑝 in 200!, and 1 factor of 𝑝𝑝 in 100!, so 3
factors of 𝑝𝑝 in the denominator cancel all 3 factors of 𝑝𝑝 in the numerator. For 67 ≤ 𝑝𝑝 ≤ 75, there are
4 factors of 𝑝𝑝 in the numerator but still only 3 in the denominator, so there remains a factor of 𝑝𝑝 in
the quotient. The largest prime in that range is 73.
Sprint 26
How many distinct ordered pairs (𝑅𝑅 − 𝐿𝐿; 𝑈𝑈 − 𝐷𝐷) are there for nonnegative integers 𝑅𝑅, 𝐿𝐿, 𝑈𝑈, and 𝐷𝐷
satisfying 𝑅𝑅 + 𝐿𝐿 + 𝑈𝑈 + 𝐷𝐷 = 100? For 𝑈𝑈 = 𝐷𝐷 = 0, (𝑅𝑅; 𝐿𝐿) is (𝑅𝑅; 100 − 𝑅𝑅), which ranges from (0; 100)
to (100; 0), yielding 101 distinct locations for (2𝑅𝑅 − 100; 0). Increasing 𝑈𝑈 to 1 (keeping 𝐷𝐷 = 0) has
(𝑅𝑅; 𝐿𝐿) being (𝑅𝑅; 99 − 𝑅𝑅) , which ranges from (0; 99) to (99; 0), yielding 100 distinct locations for
(2𝑅𝑅 − 99; 1). Each time we increase 𝑈𝑈 by 1, we decrease the number of satisfying points by 1. This
continues until 𝑈𝑈 = 100, with only 1 satisfying point, namely (0; 100) with 𝑅𝑅 = 𝐿𝐿 = 𝐷𝐷 = 0. A like
pattern results keeping 𝑈𝑈 = 0 is successively incrementing 𝐷𝐷 by 1. Thus, the total location count is
1 + 2 + 3 + ⋯ + 99 + 100 + 101 + 100 + 99 + ⋯ + 3 + 2 + 1 = 2 × 100(101)/2 + 101 = 10 201.
Sprint 27
�RS
��� ≅ ���� ���� ≅ ����
RQ given; OS OQ as both are radii of the semicircle. Thus, OQRS is a kite whose area is 1/2
the product of the diagonal lengths: diagonal OR = 3 as a radius; diagonal ����
QS is a leg of rt △SPQ
[inscribed in a semicircle with hypotenuse being a diameter of a semicircle], whose length is
√62 − 22 = √32 = 4√2. Thus, the area of kite OQRS is 3 × 4√2/2 = 6√2. The area of △OPQ is
√32 − 12 × 2/2 = 2√2. The total shaded area is 6√2 + 2√2 = 𝟖𝟖√𝟐𝟐.
Sprint 28
① 2𝑥𝑥𝑥𝑥 + 16 = 𝑥𝑥² ② 2𝑥𝑥𝑥𝑥 + 9 = 4𝑦𝑦².
① + ②: 4𝑥𝑥𝑥𝑥 + 25 = 𝑥𝑥² + 4𝑦𝑦², so 25 = 𝑥𝑥² − 4𝑥𝑥𝑥𝑥 + 4𝑦𝑦² = (𝑥𝑥 − 2𝑦𝑦)², so 𝑥𝑥 − 2𝑦𝑦 = ±5.
① − ②: 7 = 𝑥𝑥² − 4𝑦𝑦² = (𝑥𝑥 + 2𝑦𝑦)(𝑥𝑥 − 2𝑦𝑦) = (𝑥𝑥 + 2𝑦𝑦)(±5)
Case 𝑥𝑥 − 2𝑦𝑦 = +5: 5(𝑥𝑥 + 2𝑦𝑦) = 7, so (𝑥𝑥 + 2𝑦𝑦) = 1.4 and 4𝑦𝑦 = −3.6, violating 𝑦𝑦 > 0. ⌧
Case 𝑥𝑥 − 2𝑦𝑦 = −5: −5(𝑥𝑥 + 2𝑦𝑦) = 7, so (𝑥𝑥 + 2𝑦𝑦) = −1.4 and 4𝑦𝑦 = 3.6, 𝑦𝑦 = 0.9, 𝑥𝑥 = −3.2. Thus,
𝑥𝑥 + 𝑦𝑦 = −2.3.
Sprint 29
4 4
Let 𝑎𝑎 = 3 + √12 and 𝑏𝑏 = √1728. We are seeking �√𝑎𝑎 + 𝑏𝑏 + √𝑎𝑎 − 𝑏𝑏� , which expands as:
[𝑎𝑎2 + 2𝑎𝑎𝑎𝑎 + 𝑏𝑏 2 ] + �4(𝑎𝑎 + 𝑏𝑏)√𝑎𝑎2 − 𝑏𝑏 2 � + [6(𝑎𝑎2 − 𝑏𝑏 2 )] + �4(𝑎𝑎 − 𝑏𝑏)√𝑎𝑎2 − 𝑏𝑏 2 � + [𝑎𝑎2 − 2𝑎𝑎𝑎𝑎 + 𝑏𝑏 2 ]
= 8𝑎𝑎2 − 4𝑏𝑏 2 + 8𝑎𝑎√𝑎𝑎2 − 𝑏𝑏 2 = 8�21 + 6√12� − 4√1728 + 8�3 + √12��21 − 6√12
= 168 + 48√12 − 48√12 + 8�3 + √12��√12 − 3� = 168 + 8(3) = 𝟏𝟏𝟏𝟏𝟏𝟏.

Sprint 30
15+5√5 10 15+7√5
𝑉𝑉i = 12
× 23 = 10 + √5 = 𝑉𝑉c + 𝑉𝑉d = 𝑏𝑏 + 𝑎𝑎. In order for 𝑎𝑎 and 𝑏𝑏 to be rational numbers,
3 4
10 7𝑎𝑎
the equations must work separately for the √5 terms and for the rational terms. Thus, 3
√5 =
4
√5
4×10 40 15 15 40 50 50 20
and 𝑎𝑎 = =  . Then 10 = 𝑏𝑏 + 𝑎𝑎 = 𝑏𝑏 + × = 𝑏𝑏 +  , so 𝑏𝑏 = 10 − =  . Thus, 𝑎𝑎 + 𝑏𝑏 =
3×7 21 4 4 21 7 7 7
40 20 40+60 𝟏𝟏𝟏𝟏𝟏𝟏
+ = =  .
21 7 21 𝟐𝟐𝟐𝟐

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Target 1
There are 4 operations, each of which can be put independently in the two blanks, so 4² = 16
distinct expressions. Here are the results:
4 + 3 + 3 = 10 4−3+3=4 4 × 3 + 3 = 15 4 ÷ 3 + 3 = 13/3
4+3−3=4 4 − 3 − 3 = −2 4 × 3 − 3 =9 4 ÷ 3 − 3 = −2/3
4 + 3 × 3 = 13 4 − 3 × 3 = −5 4 × 3 × 3 = 36 4÷3×3=4
4+3÷3=5 4−3÷3=3 4×3÷3=4 4 ÷ 3 ÷ 3 = 4/9

Duplicates are highlighted in red. As shown, there are 13 distinct result values.
Target 2
We start with the point P(𝑚𝑚, 𝑛𝑛). Reflecting P across the 𝑥𝑥-axis yields Q(𝑚𝑚, −𝑛𝑛). Reflecting Q across
the 𝑦𝑦-axis yields R(−𝑚𝑚, −𝑛𝑛). Thus, PQR is a right triangle with base QR = 2|𝑚𝑚| and height
PQ = 2|𝑛𝑛|, so the area is 2|𝑚𝑚𝑚𝑚| = 80. Thus, |𝑚𝑚𝑚𝑚| = 40. The usual rule to minimize a sum for a fixed
product of two values is to choose the two values to be as close to equal as possible while satisfying
constraints [like values being integers]; however, that rule applies to a straight sum of two positive
values, but here we have absolute value of a sum and potentially negative values. Here we need 𝑚𝑚
and 𝑛𝑛 to be as close to each other as possible in magnitude but opposite in sign. The closest integers
yielding a product of 40 are 5 and 8, whose sum is 13, but flipping the sign of the 5 yields a sum of 3.
Target 3
The year 2023 has 365 days, which is 52 weeks + 1 day. Thus, the first day of the year occurs a
53rd time in the year while all other days of the week occur 52 times. Because the first day of the
year is on Sunday, there are 53 Sundays.
Target 4 T
���� and circle O. The unshaded region of the
Let U be the intersection of PT U
square can be partitioned into sector ROU and congruent right △s OUP and 6
ORQ as shown. Because the corresponding sides UP ���� are
���� and OQ P
���� ���� ���� ���� S
perpendicular as are PO and QR, we have OR ⊥ OU. So, angle ROU is a right 2 O
angle, and sector ROU constitutes 1/4 of circle O. Since UP = 4 and OP = 2, if 4
R
follows that circle O has radius √42 + 22 = √20 cm. Thus, sector ROU has Q
2
π�√20 �
area 4
= 5π cm2. The combined area of the two triangles is
1
2× ×4× 2 = 8 cm2. Finally, the square has area 62 = 36 cm2. Therefore, the shaded region has
2
area 36 − 8 − 5π = (28 − 5π) cm² or (−5π + 28) cm².
Target 5
The mean is (24 + 𝑥𝑥)/5 . If 𝑥𝑥 ≤ 3, then the median is 3, so 4.8 + 𝑥𝑥/5 = 3, and 𝑥𝑥 = 5(3 − 4.8) = −9.
If 𝑥𝑥 ≥ 9, then the median is 9, so 4.8 + 𝑥𝑥/5 = 9, and 𝑥𝑥 = 5(9 − 4.8) = 21. Otherwise, the median is 𝑥𝑥,
so 4.8 + 𝑥𝑥/5 = 𝑥𝑥, and 𝑥𝑥 = (4.8)5/4 = 6. The sum of these values of 𝑥𝑥 is −9 + 21 + 6 = 18.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Target 6
The 3 × 3 = 9 possible two-digit numbers whose digits are drawn from the set {1, 4, 7} are shown
in ascending order along with the differences from one number to the next.

So, we have the following cases for “The number B is the arithmetic mean of A and C.”:
Case 1: A = B = C can occur in 9 ways.
Case 2: B − A = C – B = 3 is true for 3 sets of A, B, and C, each with 2 orders of A and C, for 3 × 2 = 6
ways.
Case 3: B − A = C – B = 27 is true for 1 set with 2 orders of A and C, for 1 × 2 = 2 ways.
Case 4: B − A = C – B = 30 is true for 3 sets, each with 2 orders of A and C, for 3 × 2 = 6 ways.
Case 5: B − A = C – B = 33 is true for 1 set with 2 orders of A and C, for 1 × 2 = 2 ways.
That’s a total of 9 + 6 + 2 + 6 + 2 = 25 ways.
Target 7
The given right triangle is an 8-15-17 Pythagorean triple with a scale factor of 5 meters. For all
sides to be an integer number of meters, the 2023 meters must be an integer multiple of one of the
sides, that is, 2023 must be divisible by at least one of 8, 15, or 17. We know that 2023 is not a
multiple of 8 since it is odd. We also know that 2023 is not a multiple of 15 because it does not have
a units digit of 5 or 0. So, 17 needs to work, and 2023 = 17 × 119. Thus, we have an 8-15-17 right
(8×119)(15×119)
triangle with a scale factor of 119 m, making the area 2
= 60 × (119)2 = 𝟖𝟖𝟖𝟖𝟖𝟖, 𝟔𝟔𝟔𝟔𝟔𝟔 m2 .

Target 8
1−𝑟𝑟 6
We are to maximize 𝑎𝑎(1 + 𝑟𝑟 + 𝑟𝑟² + 𝑟𝑟³ + 𝑟𝑟⁴ + 𝑟𝑟⁵) = 𝑎𝑎 1−𝑟𝑟
for positive integers 𝑎𝑎 < 2023 and
𝑎𝑎𝑟𝑟⁵ < 2023. It is easier to have the big end at 𝑎𝑎 to process the size constraint, so 0 < 𝑟𝑟 < 1. For all
terms to be integers, 𝑟𝑟 must be rational, so of the form of a common fraction 𝑝𝑝/𝑞𝑞. For 𝑎𝑎𝑟𝑟⁵ to be an
integer, 𝑎𝑎 must be a multiple of 𝑞𝑞⁵, and we want the largest such multiple. 0 < 𝑟𝑟 < 1 requires 𝑞𝑞 > 1.
𝑞𝑞−1 1 1−𝑟𝑟 6
The largest terms are achieved for 𝑝𝑝 = 𝑞𝑞 − 1, so 𝑟𝑟 = 𝑞𝑞
= 1 −  . The sum yields 𝑎𝑎
𝑞𝑞 1−𝑟𝑟
= 𝑎𝑎𝑎𝑎(1 −
𝑟𝑟 6 ). For 𝑞𝑞 = 2 the largest allowed multiple of 2⁵ = 32 is 2016, and 𝑟𝑟 = 1/2 to yield
1 6 63
(2016)(2) �1 − � � � = 4032 × = 3969. For 𝑞𝑞 = 3 the largest allowed multiple of 3⁵ = 243 is
2 64
2 6 665
1944, and 𝑟𝑟 = 2/3 to yield (1944)(3) �1 − �3� � = 5832 × 729 = 5320. For 𝑞𝑞 = 4 the largest
3 6 3367
allowed multiple of 4⁵ = 1024 is 1024, and 𝑟𝑟 = 3/4 to yield (1024)(4) �1 − � � � = 4096 × =
4 4096
3367. For 𝑞𝑞 = 5 we need a positive multiple of 5⁵ = 3125 that is less than 2023—no such value
exists, likewise for 𝑞𝑞 > 5, so we have all candidates. Thus, max(3969; 5320; 3367) = 5320.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Team 1
◖+ ◖+ ◖= 1.5, so ◖= 0.5; 13 = ◖+ ◖+ ■ = 1 + ■, so ■ = 12; 18 = ■ + ◆ = 12 + ◆, so ◆ = 6.
Team 2
The number of 7th graders with blue eyes is 97 − (38 + 28) = 31. The number of 7th graders with
green eyes is 59 − (20 + 15) = 24. Therefore, the number of 7th graders with brown eyes is
176 − (31 + 24) = 121.
Team 3
Since 22 = 11 × 2, and that 2 is already handled by checking divisibility by 4, we need only check for
divisibility by 4 and 11. For 4, 60 + B must be divisible by 4, so B must be 0, 4, or 8. For 11,
B − 6 + A − 9 + 3 − 8 = A + B − 20 must be divisible by 11, so A + B must be 9 and
|A − B| = |(A + B) − 2B| = |9 − 2B|. The greatest value achieved out of B being 0, 4, or 8 is for
B = 0, A = 9, and |A − B| = |9 − 0| = 9.
Team 4
Let 𝑅𝑅 be the radius of each ball. To be packed tightly, the box must have length and height 4𝑅𝑅 and
width 2𝑅𝑅. Thus, the box encloses volume (4𝑅𝑅)(4𝑅𝑅)(2𝑅𝑅) = 32𝑅𝑅³. The four balls take up volume
4 16 16 16𝜋𝜋
4 � π𝑅𝑅 3 � = π𝑅𝑅 3 . So, the fraction of the box occupied by the balls is � π𝑅𝑅 3 ��(32𝑅𝑅3 ) = =
3 3 3 3×32
𝜋𝜋 𝜋𝜋
= × 100 % = 52.35… %, which rounds to 52%.
6 6

Team 5
The area enclosed by the circle being π means the radius of the circle is 1. Thus, the center of the
circle is distance 1 from each straight segment of the quarter circle, so distance √2 from the corner
where those two segments intersect. The distance from that intersection through the center of the
circle to the quarter circle, which is the radius of curvature of the quarter circle, arc is √2 + 1. Thus,
the area enclosed by the quarter circle is π(√2 + 1)²/4 = (3 + 2√2)π/4, and the shaded area is that
minus π, or (2√2 − 1)π/4 = 1.436…, which rounds to the nearest 0.1 as 1.4.
Team 6
Combining the two sets of inequalities yields 𝑥𝑥/2 ≤ 𝑦𝑦 ≤ min(2𝑥𝑥, 10), with 1 ≤ 𝑥𝑥 ≤ 10. For 𝑥𝑥 = 1,
𝑦𝑦 must be 1 or 2 [2 pairs]. For 𝑥𝑥 = 2, 𝑦𝑦 must be 1, 2, 3, or 4 [4 pairs]. For 𝑥𝑥 = 3, 𝑦𝑦 must be 2, 3, 4, 5,
or 6 [5 pairs]. For 𝑥𝑥 = 4, 𝑦𝑦 must be 2 through 8 [7 pairs]. For 𝑥𝑥 being 5 or 6, 𝑦𝑦 must be 3 through 10
[2 × 8 = 16 pairs]. For 𝑥𝑥 being 7 or 8, 𝑦𝑦 must be 4 through 10 [2 × 7 = 14 pairs]. For 𝑥𝑥 being 9 or 10,
𝑦𝑦 must be 5 through 10 [2 × 6 = 12 pairs]. Thus, we have a total of 2 + 4 + 5 + 7 + 16 + 14 + 12
= 60 ordered pairs.
Team 7
There are 6 points of crossing, and at each one, independently of the others, one ring can cross over
or cross under the other ring participating in the crossing, thus 2 choices. For all 6 crossing points,
there are 2⁶ = 64 total configurations. For two rings to be separable, one ring must be over the
other at both points of crossing, and it could be either ring over the other, so 2 acceptable pairings.
The third ring must cross over both other rings at all crossing point, or must similarly cross under
both other rings, or can cross over one other ring at both points and cross under the remaining ring
2×3 𝟑𝟑
at both points, yielding 3 options. Thus, the overall probability is =  .
64 𝟑𝟑𝟑𝟑

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Team 8
Let’s examine the complementary cases—at least 3 consecutive lights off. There are 7 lights, each
with 2 states—on [+] or off [−]—independently of one another, totaling 2⁷ = 128 configurations.
There are basically two such cases:
Case 1: 1 light on, followed by 3 lights off, followed by 3 lights each independently in either state [×
for don’t care]: +−−−×××; the 3 ×’s each independently contribute 2 options, and the on
light that immediately precedes the at least 3 off lights can be any of the 7 lights [there
cannot be two such lights, as each would be followed by at least three off lights,
necessitating at least eight lights, but we have only seven, so no possibility of double
counting], thus, 7 × 1¹ × 1³ × 2³ = 56 configurations.
Case 2: All lights off, which is 1 configuration.
Thus, the count of acceptable configurations is 128 − (56 + 1) = 71.
Team 9
Let 𝑛𝑛 notate a candidate 4-digit triskaidekaphilic number, and indicate its digits as KHTU, with
1 ≤ K ≤ 9; indicate the digits of 𝑛𝑛/13 as htu. Being triskaidekaphilic requires KHTU to be 13 times
one of the following: htu, ktu, khu, or kht. Removing one digit from such a number KHTU yields a 3-
digit number unless K = 1 and is removed while H = 0; now we do have 𝑛𝑛/13 being a 2-digit
number when 1001 ≤ 𝑛𝑛 < 1300, but we must have H = 0, so 1001 ≤ 𝑛𝑛 < 1100, in which case we
have 𝑛𝑛/13 in 77 .. 84, so T is 7 or 8, but the only multiple of 13 satisfying those criteria is
1079 = 13 × 83, which fails being triskaidekaphilic. Thus, 1300 ≤ 𝑛𝑛 ≤ 9999 and 100 ≤ 𝑛𝑛/13 ≤ 769.
Multiplying htu by 13 will yield either K > h, or K = h and H > t. In either case, at least one of the
leftmost two digits of 𝑛𝑛 will mismatch the two leftmost digits of 𝑛𝑛/13 and will have to be dropped.
Because one, and only one digit is to be dropped from 𝑛𝑛, that means the rightmost two digits [TU]
must match the 2 rightmost digits [tu] of 𝑛𝑛/13. Now, 3u ends in u if and only if u is 0 or 5. Likewise,
u being 0 means that 13[t0] ends in [t0] if and only if t is 0 or 5. In a similar manner 13[t5] ends in
[t5] if and only if t is 2 or 7. Thus, a triskaidekaphilic number must end in 00, 25, 50, or 75—in other
words be a multiple of 25; by definition it must be a multiple of 13 as well—thus, a multiple of 325.
That cuts the possibilities down to 27, namely 4 × 325 = 1300 through 30 × 325 = 9750. We can
make a list of pairs starting with (100; 1300), successively adding (25; 325), and checking if one
digit can be dropped from the right component to equal the left component—blue for
triskaidekaphilic (with the dropped digit in bold), red for not:
(100; 1300) (200; 2600) (300; 3900) (400; 5200) (500; 6500) (600; 7800) (700; 9100)
(125; 1625) (225; 2925) (325; 4225) (425; 5525) (525; 6825) (625; 8125) (725; 9425)
(150; 1950) (250; 3250) (350; 4550) (450; 5850) (550; 7150) (650; 8450) (750; 9750)
(175; 2275) (275; 3575) (375; 4875) (475; 6175) (575; 7475) (675; 8775)

The sum of the blue values is 33,800.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.

Team 10
Let 𝑎𝑎, 𝑏𝑏, and 𝑐𝑐 be the length of the sides of the right triangle opposite the vertices A, B, and C,
respectively, as is customary; because A, not C, is the right angle, 𝑎𝑎, not 𝑐𝑐, is the hypotenuse. Choose
a coordinate system with AC ⃖���⃗ and AB
⃖����⃗ being the 𝑥𝑥- and 𝑦𝑦-axes, respectively. Then A is at (0; 0), B is at
√3 √3 1 √3
(0; 𝑐𝑐), C is at (𝑏𝑏; 0), D is2
𝑐𝑐 to the left of the midpoint of ����
AB so �− 2 𝑐𝑐;   𝑐𝑐�; E is 2 𝑏𝑏 below the
2
���� so �1 𝑏𝑏;   − √3 𝑏𝑏�; F is on the perpendicular bisector of BC
midpoint of AC ���� at a distance √3 𝑎𝑎 up and
2 2 2
𝑐𝑐 1 1 1 √3𝑎𝑎𝑎𝑎 1 √3𝑎𝑎𝑎𝑎
right along a slope from the midpoint � 𝑏𝑏;   𝑐𝑐�, thus � 𝑏𝑏 + ;   𝑐𝑐 + �=
𝑏𝑏 2 2 2 2√𝑏𝑏2 +𝑐𝑐 2 2 2√𝑏𝑏2 +𝑐𝑐 2
1 √3 1 √3
� 𝑏𝑏 + 𝑐𝑐;   𝑐𝑐 + 𝑏𝑏� since 𝑎𝑎 = √𝑏𝑏 2 + 𝑐𝑐 2 . Now having all the coordinates, we could use the
2 2 2 2
surveyor’s formula [often affectionately called the shoelace formula in MATHCOUNTS] to find the
area of △DEF, but we can reduce the criss-cross effort substantially by translating the figure to
1 √3 √3 1
move F to the origin by subtracting 𝑏𝑏 + 𝑐𝑐 from the 𝑥𝑥-components and 𝑐𝑐 +
𝑏𝑏 from the
2 2 2 2
1 √3 √3 1
𝑦𝑦-components of D, E, and F, resulting in D′ = �− 𝑏𝑏 − √3𝑐𝑐;   − 𝑏𝑏 �, E ′ = �− 𝑐𝑐;   − 𝑐𝑐 − √3𝑏𝑏�,
2 2 2 2
′ 1 ′ ′ ′ ′ √3 2 √3 2 5
F = (0; 0). Thus, Area(△DEF) = Area(△D′E′F′) = �D𝑥𝑥 E𝑦𝑦 − D𝑦𝑦 E𝑥𝑥 � = 4 𝑏𝑏 + 4 𝑐𝑐 + 𝑏𝑏𝑏𝑏. [As a
2 4
strange sidenote, this area is the sum of the areas of the two smallest equilateral △, which is the
same as the area of the largest equilateral △, plus 2.5 times the area of the right △, regardless of the
size or shape of the starting right △—seems weird to me.] Now, we are given that this area is
√3 2 5 1 5
23√3 cm² and that 𝑐𝑐 = 2 cm. Thus,
4
𝑏𝑏 + 𝑏𝑏 + √3 = 23√3, so that 𝑏𝑏 2 + 𝑏𝑏 − 44 = 0. Thus,
2 2 √3
5 25 5 17 12
𝑏𝑏 = − ±� + 88 = − ±  . The length 𝑏𝑏 must be positive, so 𝑏𝑏 =  cm = 4√3 cm. Finally,
√3 3 √3 √3 √3
𝑎𝑎 = √𝑏𝑏 2 + 𝑐𝑐 2 = √48 + 4 cm = √52 cm = 𝟐𝟐√𝟏𝟏𝟏𝟏 cm.

Copyright MATHCOUNTS, Inc. 2023. All rights reserved.