4 EOI 2022 MATH

2. Day 2: Sep 13, 1830 - 2000

(1) What is the size of the smallest set of coins of values from {0.01, 0.05, 0.10, 0.25},
such that any value in the range [0.01, 1.00] can be made using some of the coins.
Solution. The smallest set of coins, S can be built gradually. Costs in the
range [0.01, 0.04] are covered when S = {0.01, 0.01, 0.01, 0.01}. Adding a coin of
value 0.05 covers the subsequent 5 costs; adding a coin of value 0.10 covers the
next 10 costs. Thus, S = {0.01, 0.01, 0.01, 0.01, 0.05, 0.10} covers all costs in the
range [0.01, 0.19]. Continuing with this strategy, we are able to obtain a final set
of {0.01, 0.01, 0.01, 0.01, 0.05, 0.10, 0.10, 0.25, 0.25, 0.25}, and the size of S is equal to
10 .
(2) A√triangle has two sides which are also altitudes. The lengths of these two legs are
4 3 and 12. What is the length of the third altitude of the triangle?
Solution. If the two sides of a triangle are also its altitudes, the triangle must
have a 90◦ angle. Let l be the length of the third altitude and h be the length of the
hypotenuse. Using the Pythagorean theorem, we obtain:
√
h2 = (4 3)2 + 122
h2 = 192
√
h=8 2
To determine the value of l, we consider the area of the triangle in terms of l and h,
as follows.
1 1 √
lh = (4 3)(12)
2 2 √
48 3
l=
h√
48 3
l= √
8 3
l= 6
(3) How many integers in the range [1, 1000] are divisible by 3 or 5
Solution. In the range [1, 1000], let S1 be the set of all integers divisible by 3
and S2 be the set of all integers divisible by 5. We want to determine the value of
|S1 ∪ S2 | − |S1 ∩ S2 | (Principle of Inclusion-Exclusion).
|S1 ∪ S2 | − |S1 ∩ S2 | = (|S1 | + |S2 | − |S1 ∩ S2 |) − |S1 ∩ S2 |
= |S1 | + |S2 | − 2|S1 ∩ S2 |
1000 1000 1000
=⌊ ⌋+⌊ ⌋ − 2⌊ ⌋
3 5 3(5)
= 333 + 200 − 2(66)
= 401
(4) For various pairs of positive integers (a, b), there are two lines, given by the equations
y = ax − 5 and y = 3x − b, that intersect each other on the x-axis. What is the sum
of all possible x-coordinates of the intersection points?
 EOI 2022 MATH 5

Solution. Given the lines intersect the x-axis, it follows that 0 = ax − 5 =⇒ x =

5/a and 0 = 3x − b =⇒ x = b/3. Then:
5 b
=
a 3
ab = 15
Thus, (a, b) = (1, 15), (15, 1), (3, 5), (5, 3). Substituting all distinct values into x =
5/a or x = b/3 results in x = 5, 1/3, 5/3, 1. The sum of these values is 8 .
(5) Five integers, a, b, c, d, e, satisfy the following:

[1] a + b = −11
[2] b+c=7
[3] c+d=4
[4] d + e = −7
[5] e + a = −23

What is the value of a × b × c × d × e?

Solution. To solve this system of equations quickly, we can algebraically manip-
ulate the five equations to create a telescoping series. For instance, subtracting all
even-numbered equations from all odd-numbered equations results in the following:
(a + b) − (b + c) + (c + d) − (d + e) + (e + a) = −11 − 7 + 4 − (−7) + (−23)
a + (b − b) + (−c + c) + (d − d) + (−e + e) + a = −30
2a = −30
a = −15
Now:

[1] −15 + b = −11 =⇒ b = 4

[2] 4 + c = 7 =⇒ c = 3
[3] 3 + d = 4 =⇒ d = 1
[4] 1 + e = −7 =⇒ e = −8.

Thus, (a, b, c, d, e) = (−15, 4, 3, 1, −8), and a×b×c×d×e = −15×4×3×1×(−8) =

1440 .
(6) Two fair dice are rolled to obtain a and b, where 1 ≤ a, b ≤ 6. The probability that
|a − b| = 1 is xy , where x, y are in lowest terms. Output x and y, separated by a single
space.
Solution. In total, there are 36 combinations of rolls, or pairs (a, b). There are
exactly 10 combinations where |a − b| = 1: (1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (2, 1),
(3, 2), (4, 3), (5, 4), (6, 5). Thus, the probability is 10
36
5
= 18 . x = 5 and y = 18 .
(7) Find the 6-digit number U V W XY Z such that 4 · U V W XY Z = 3 · XY ZU V W .
Solution. Let a = U V W, b = XY Z. Then 4 · (1000a + b) = 3 · (1000b + a), so
3997a = 2996b. Dividing by 7 gives 571a = 428b, so a = 428, b = 571. The answer is
428571 .
(8) What is the probability that a list of five distinct, positive single-digit numbers sum-
ming to 31 contains exactly two primes numbers?
6 EOI 2022 MATH

Solution. We list all possible lists: they are

(9, 8, 7, 6, 1)
(9, 8, 7, 5, 2)
(9, 8, 7, 4, 3)
(9, 8, 6, 5, 3)
(9, 7, 6, 5, 4)

Three of these lists are valid: the answer is 3/5 =⇒ 305 .

(9) The three side lengths of a particular triangle are 2, 5 and x units, and the area of
the triangle is x square units. What is the value of x?
Solution. Let α be the angle between the√sides 2 and √x. Then the answer is
1
2
· 2x · sin α = x sin α. Hence α = 90◦ . So x = 52 − 22 = 1 21 =⇒ 121 .
(10) Calculate the number of distinct circular necklaces with 11 beads (each bead is either
blue or yellow) with no three beads of the same color in a row. Two necklaces are
said to be equivalent if they can be rotated to get each other.
Solution. Let us first do the case where the necklace is a line, and not a circle.
Assume it starts with blue by symmetry (remember to multiply the answer by 2 at
the end). In this case, it is the standard Fibonacci recurrence: ai+2 = ai+1 + ai where
a1 = 1 and a2 = 2.
Now let’s do the circular case. In this case, we are going to instead count the
number of necklaces that are a line where if you connected the endpoints to make a
circle, then there are no 3 consecutive of the same color. We can then divide by 11
at the end for symmetry (here, it is critical that 11 is prime, or else you can’t just
divide by 11). We only have to worry about the start and end being the same color.
Let bn denote the number of strings of length n with no three consecutive same
colors, and whose start and end is the same color, assuming it starts with say blue.
Then our desired answer is (a11 − b7 − 2b8 )/11. Let’s calculate b7 and b8 . bn satisfies
the recurrence bn = bn−2 + 2bn−3 + bn−4 . It is initialized as b0 = 1, b1 = 1, b2 = 1.
This gives b7 = 11, b8 = 17.
The final answer is 2(a11 − b7 − 2b8 )/11 = 2(99)/11 = 18 .