CMC ARML Competition 2019

AOPS12142015
Blast S1
Cosmicgenius
djmathman
eisirrational
FedeX333X
illogical 21
jeffisepic
jj ca888
mfang92
novus677
pretzel
Th3Numb3rThr33
TheUltimate123
WannabeCharmander

May 13–31, 2019

1 Individual Problems

Problem 1. In triangle ABC, ∠A = 60◦ and BC = 12. Given that the perimeter of 4ABC is 30, compute the
area of 4ABC.

Problem 2. Consider the set of rectangles formed by the unit squares of an 8 × 8 checkerboard. Compute the
number of these rectangles contain exactly four black squares.

3log2/3 3
Problem 3. Compute .
2log2/3 2

Problem 4. The numbers a1 , a2 , a3 , . . . form an arithmetic sequence. Suppose that there exist unique positive
integers p < q < 63 such that ap = p2 , aq = q 2 , and a63 = 2019. Compute p + q.

Problem 5. Each second, two randomly chosen digits of 123 are swapped. Compute the expected number of
seconds until the number 321 is formed.

Problem 6. Let 4ABC be an isosceles triangle with AB = AC = 1, and let E and F be the feet of the altitudes
from B and C to sides AC and AB, respectively. If line EF is tangent to the incircle of 4ABC, compute the
perimeter of 4ABC.

Problem 7. In acute triangle ABC, AB = 2 and AC = 3. Let D be the foot of the angle bisector of ∠BAC. The
circle with diameter AD intersects AB and AC at E and F , respectively. Given that the area of 4DEF is one
sixth of the area of 4ABC, compute BC 2 .

Problem 8. There exist unique positive integers 1 < a < b satisfying

a2 + b2 = 220 + 1.

Compute a + b.

Problem 9. Let a and b be real numbers such that the polynomial

P (x) = x3 − ax2 + 11ax − b

has three distinct real roots forming a geometric progression. Compute b.

Problem 10. Isabel and Robert play a game in which Isabel chooses a list of 6 real numbers and Robert devises
6 questions, each of the form “What is the sum of the xth and y th number in your list?” where 1 ≤ x < y ≤ 6.
Without regard to order, compute the number of ways can Robert choose his questions so that he can determine
Isabel’s numbers.

1
2 Answers to Individual Problems
√
Answer 1. 15 3

Answer 2. 120
1
Answer 3. (or 0.16)
6
Answer 4. 37

Answer 5. 5
√ √
Answer 6. 1 + 5 (or 5 + 1)
√ √
Answer 7. 13 − 2 11 (or −2 11 + 13)

Answer 8. 1385

Answer 9. 1331

Answer 10. 2530

2
3 Solutions to Individual Problems

Problem 1. In triangle ABC, ∠A = 60◦ and BC = 12. Given that the perimeter of 4ABC is 30, compute the
area of 4ABC.

Solution 1. Set x = AB and y = AC. By the Law of Cosines on 4ABC, x2 + y 2 − xy = 144, and by the perimeter
condition, x + y = 30 − BC =√18. Hence,√x2 + y 2 + 2xy = 324, and subtracting gives 3xy = 180 =⇒ xy = 60.
Thus the answer is [ABC] = 43 xy = 15 3.

Problem 2. Consider the set of rectangles formed by the unit squares of an 8 × 8 checkerboard. Compute the
number of these rectangles contain exactly four black squares.

Solution 2. It is not hard to check that the area of these rectangles are either 7, 8, or 9. We take cases:

• Case 1: Area 7. The rectangle must have dimensions 1 × 7 and contain 4 black squares. Each row and
column has exactly one such rectangle, so there are 16 rectangles in this case.

• Case 2: Area 8. The rectangle has dimensions of either 1 × 8 or 2 × 4. Each row and column contains a
1 × 8 rectangle, for a total of 16. We can choose the top left corner of a 2 × 4 rectangle with long side
horizontal in 5 · 7 = 35 ways, and similarly a 4 × 2 rectangle in 35 ways, so there are 16 + 2 · 35 = 86
rectangles in this case.

• Case 3: Area 9. The rectangle has dimensions 3 × 3, and its corners must be white. The top-left corner
can be chosen in 3 · 6 = 18 ways, and thus it is the number of rectangles in this case.

The answer is 16 + 86 + 18 = 120.

3log2/3 3
Problem 3. Compute .
2log2/3 2
3q
Solution 3. Let p = log2/3 2 and q = log2/3 3, so that p − q = 1; we desire 2p . However, we are given that

2p p p 3q 3q 1 1
p
= 2 =⇒ 2 = 2 · 3 =⇒ p
= p
= q−p
= ,
3 2 2·3 2·3 6
the answer.

Problem 4. The numbers a1 , a2 , a3 , . . . form an arithmetic sequence. Suppose that there exist unique positive
integers p < q < 63 such that ap = p2 , aq = q 2 , and a63 = 2019. Compute p + q.

Solution 4. Let a0 be the term before a1 and d the common difference such that a0 + pd = p2 , a0 + qd = q 2 , and
a0 + 63d = 632 . Subtracting the first two equations yields (q − p)d = q 2 − p2 , whence d = p + q. It is now easy

3
 to check that a0 = −pq. The third equation yields

63(p + q) − pq = 2019 =⇒ (p − 63)(q − 63) = 632 − 2019 = 1950 = 2 · 3 · 52 · 13.

Now, −63 < p, q < 0, so {p − 63, q − 63} = {−50, −39}, whence p = 13, q = 24, and p + q = 37.

Problem 5. Each second, two randomly chosen digits of 123 are swapped. Compute the expected number of
seconds until the number 321 is formed.

Solution 5. Let E1 and E2 be the expected number of seconds when one and two flips away from 321, respectively.
From E1 , there is a 31 chance of reaching 321 and a 23 chance of reaching E2 . From E2 every step reaches E1 ,
whence (
E2 = E1 + 1,
E1 = 32 E2 + 1,
from which it follows that E1 = 5.

Problem 6. Let 4ABC be an isosceles triangle with AB = AC = 1, and let E and F be the feet of the altitudes
from B and C to sides AC and AB, respectively. If line EF is tangent to the incircle of 4ABC, compute the
perimeter of 4ABC.

Solution 6. Let x = sin A2 , and denote by hA and r the length of the A-altitude and the inradius, respectively.
Furthermore let I denote the incenter and 4DP Q the contact triangle of 4ABC.
A

F E
Q P

B D C

Notice that since 4AF E ∼ 4ABC with scale factor cos A : 1, we have that 1 − cos A = h2rA . Clearly BD =
DC = x, so the semiperimeter of 4ABC is 1 + x, and AP = AQ = 1 − x. Then, r = AP tan A2 = (1 − x) tan A2 .
Since AD = cos A2 ,
2(1 − x) tan A2 2x(1 − x) 2x(1 − x)
2x2 = 1 − cos A = A
= A
= .
cos 2 2
cos 2 1 − x2
√
1 5−1
Since x 6= 0, we can simplify this to x = 1+x , so x2 + x − 1 = 0. As −1 ≤ x ≤ 1, x = 2 , and the perimeter
√
of 4ABC is 2x + 2 = 1 + 5, the answer.

Problem 7. In acute triangle ABC, AB = 2 and AC = 3. Let D be the foot of the angle bisector of ∠BAC. The
circle with diameter AD intersects AB and AC at E and F , respectively. Given that the area of 4DEF is one
sixth of the area of 4ABC, compute BC 2 .

Solution 7. Note that ∠AED = ∠AF D and 4AED ∼

= 4AF D. Let DE = DF = x, so that
1 1
x2 sin A = 2[DEF ] = [ABC] = · 2 · 3 sin A = sin A =⇒ x = 1.
3 6
It is immediate that [ABC] = [ABD] + [ACD] = 25 , so
5 1 5
= [ABC] = · 2 · 3 sin A =⇒ sin A = ,
2 2 6

4
 √
11
whence cos A = and
6 √
BC 2 = 22 + 32 − 2 · 2 · 3 cos A = 13 − 2 11,
the answer.

Problem 8. There exist unique positive integers 1 < a < b satisfying

a2 + b2 = 220 + 1.
Compute a + b.

Solution 8. By the Brahmagupta–Fibonacci identity,

a2 + b2 c2 + d2 = (ac + bd)2 + (ad − bc)2 = (ac − bd)2 + (ad + bc)2 .

2
Check that 24 + 1 | 220 + 1 = 210 + 1, so we have that ac + bd = 210 , ad − bc = 1, and c2 + d2 = 17.
• Case 1: c = 1 and d = 4. We have that a + 4b = 210 and 4a − b = 1, whence 17a = 210 + 4, which is
absurd.
• Case 2: c = 4 and d = 1. We have that 4a + b = 210 and a − 4b = 1, whence 17b = 210 − 4, which yields
a = 241 and b = 60.
The answer is then (ac − bd) + (ad + bc) = (964 − 60) + (241 + 240) = 904 + 481 = 1385.

Problem 9. Let a and b be real numbers such that the polynomial

P (x) = x3 − ax2 + 11ax − b
has three distinct real roots forming a geometric progression. Compute b.

Solution 9. Let k be the middle root and r > 1 be the common ratio; we can see that the roots are kr, k, kr . Note
that by Vieta’s the sum of the roots is
 
k 1
kr + k + = k r + 1 + =a
r r
and the sum of the pairwise products of the roots is
 
k k 1
kr · k + kr · + k · = k2 r + 1 + = 11a,
r r r
from which
k 2 r + 1 + 1r


11a
= ⇒ k = 11.
k r + 1 + 1r


a
k
The answer is b = kr · k · 4 = k 3 = 113 = 1331.

Problem 10. Isabel and Robert play a game in which Isabel chooses a list of 6 real numbers and Robert devises
6 questions, each of the form “What is the sum of the xth and y th number in your list?” where 1 ≤ x < y ≤ 6.
Without regard to order, compute the number of ways can Robert choose his questions so that he can determine
Isabel’s numbers.

Solution 10. We can consider the the game as a graph with 6 vertices, representing Isabel’s numbers, and 6 edges,
representing Robert’s questions. Note that we can’t have a cycle with even length since then the corresponding
system of equations wouldn’t be linearly independent. For example, the system of equations x + y = c1 , y + z =
c2 , z + w = c3 , w + x = c4 is not linearly independent, since the sum of the 1st and 3rd equations is equal to
the sum of the 2nd and 4th ; hence one equation is wasted, yet 6 independent equations are required to find 6
variables. Since the largest tree in a graph with 6 vertices consists of 5 edges, a cycle must exist. We distinguish
three cases, depending on the length of the largest cycle:

5
 • Case 1: we have a 5-cycle. There are 6 ways to choose which number is left out of the 5-cycle, 12 ways to
order the elements of the 5-cycle, and 5 ways to connect the number left out to the cycle, for a total of
360 possibilities.
(6)
• Case 2: there are two 3-cycles. As the cycles are disjoint, there are 23 = 10 such possibilities.

• Case 3: there is only one 3-cycle. We choose the cycle C in 63 = 20 ways, and then choose the paths

to connect the other three vertices X, Y, Z to C, where each of these points must have exactly 1 path. If
X → C, Y → C and Z → C, there are 33 = 27 ways; if X → Y → C and Z → C (and permutations), there
are 6 · 32 = 54 ways; if X → Z, Y → Z and Z → C (and permutations), there are 3 · 3 = 9 ways; finally, if
X → Y → Z → C (and permutations), there are 6 · 3 = 18 ways, for a total of 20 · (27 + 54 + 9 + 18) = 2160
possibilites.

Thus, Robert has a total of 360 + 10 + 2160 = 2530 ways to ask Isabel his questions.

6
4 Relay Problems

Relay 1-1. Compute

1
1+1
1+2+1
1+2+2+1 .
1+2+3+2+1
1+2+2+1
1+2+1
1+1
1

Relay 1-2. Let T = TNYWR and K = T1 . Suppose {an } is a sequence of real numbers satisfying an an+2 +an+1 = 1
for all n ≥ 1. Given that a1 = 2 and a2 = 3, compute a1 + a2 + . . . + aK .

Relay 1-3. Let T = TNYWR. Rectangle ABCD has perimeter T and satisfies AB = 2BC. Suppose that the
circle centered at A passing through D intersects the circle centered at C passing through D at a point D and
P . Compute the length of BP .

Relay 2-1. Jack is standing at 0 on the number line. After every second, if he is at position n, he moves to either
n + 3, n + 1, n − 1, or n − 3, each with an equal probability. The probability that Jack is back at 0 after 4
seconds is pq , where p and q are relatively prime positive integers. Compute p.

Relay 2-2. Let T = TNYWR. Let f be the function defined by f (x) = x4 −x3 +x2 −x+1, and let g(x) = f (x+T ).
Compute the product of roots of g(x).

Relay 2-3. Let T = TNYWR and let S be the sum of the digits of T . Suppose f is a function satisfying f (2n ) = n2
and f (3n) = f (2n) + 1 for all nonnegative integers n. Compute f (3S ).

7
5 Relay Answers

1
Answer 1-1. (or 0.00694)
144
Answer 1-2. 126
√  
63 5 63
Answer 1-3. or √
5 5
Answer 2-1. 11

Answer 2-2. 13421

Answer 2-3. 132

8
6 Relay Solutions

Relay 1-1. Compute

1
1+1
1+2+1
1+2+2+1 .
1+2+3+2+1
1+2+2+1
1+2+1
1+1
1

Solution 1-1. Starting to simplify the fraction from the top, we see that the numerator is
1 1 1 1 1 1 1
· · = · · = ;
1+1 1+2+1 1+2+2+1 2 4 6 48
on the other hand, starting to simplify the denominator from the bottom,
1+1 1+2+1 1+2+2+1 1+2+3+2+1
= 2, = 2, = 3, = 3.
1 2 2 3
1 1 1
Thus the answer is 48 · 3 = 144 .

Relay 1-2. Let T = TNYWR and K = T1 . Suppose {an } is a sequence of real numbers satisfying an an+2 +an+1 = 1
for all n ≥ 1. Given that a1 = 2 and a2 = 3, compute a1 + a2 + . . . + aK .

Solution 1-2. Listing out the first terms of the sequence, we can see that {an } has a period of 5, since a3 =
−1, a4 = 23 , a5 = − 13 , a6 = 2 and a7 = 3. We are given that K = T1 = 144, thus
144 5
X X 13 1
an = 29 an − a5 = 29 · + = 126.
n=1 n=1
3 3

Relay 1-3. Let T = TNYWR. Rectangle ABCD has perimeter T and satisfies AB = 2BC. Suppose that the
circle centered at A passing through D intersects the circle centered at C passing through D at a point D and
P . Compute the length of BP .

Solution 1-3. Since P is the reflection of D across AC, it also lies on the semicircle with diameter AC. Since
AB + BC = T2 and AB = 2BC, we have that AB = T3 and BC = T6 . Applying Ptolemy’s Theorem to AP BC,
s 
2  2
T T T T T T T
· = · + BP · + =⇒ BP = √ .
3 3 6 6 3 6 2 5
63
Plugging in T = 126, we see that the answer is BP = √
5
.

Relay 2-1. Jack is standing at 0 on the number line. After every second, if he is at position n, he moves to either
n + 3, n + 1, n − 1, or n − 3, each with an equal probability. The probability that Jack is back at 0 after 4
seconds is pq , where p and q are relatively prime positive integers. Compute p.

Solution 2-1. Denote the possible moves by +3, +1, −1, −3. We distinguish three cases:
• Case 1: +3, +1, −1, −3. Since the moves are all distinct, there are 4! = 24 such possibilities.
• Case 2: x, x, −x, −x. We have 2 possible choices for x (either 1 or 3) and 42 = 6 possible orderings, for a

total of 2 · 6 = 12 possibilities.

9
 • Case 3: ±1, ±1, ±1, ∓3. We have 2 possible choices for the ± sign and 4 possible orderings, for a total of
2 · 4 = 8 possibilities.
44 11
Since the total number of possible moves without any restrictions is 44 = 256, the desired probability is 256 = 64 ,
and m = 11.

Relay 2-2. Let T = TNYWR. Let f be the function defined by f (x) = x4 −x3 +x2 −x+1, and let g(x) = f (x+T ).
Compute the product of roots of g(x).

Solution 2-2. Since f (x) is a polynomial with degree 4, g(x) = f (x + T ) is a polynomial with degree 4 too. Hence,
by Vieta’s, the product of the roots of g(x) is equal to the constant term g(0) = f (T ) = T 4 − T 3 + T 2 − T + 1.
Plugging in T = 11, we see that the answer is 13421.

Relay 2-3. Let T = TNYWR and let S be the sum of the digits of T . Suppose f is a function satisfying f (2n ) = n2
and f (3n) = f (2n) + 1 for all nonnegative integers n. Compute f (3S ).

Solution 2-3. We can prove by induction that f (3n 2S−n ) = S 2 +n. Indeed, if n = 0, then f (30 2S ) = f (2S ) = S 2 +0
by the first condition. Suppose now that our claim holds true for a certain value of n > 1. Then, using the
second condition,

f 3n+1 2S−n−1 = f 3 · [3n 2S−n−1 ] = f 2 · [3n 2S−n−1 ] + 1 = f 3n 2S−n + 1 = S 2 + n + 1,

proving our claim. Since f (3S ) = f (3S 2S−S ) = S 2 + S, plugging in S = 11 gives 112 + 11 = 132, the answer.

10
7 Tiebreaker Problem

Problem 1. Compute the smallest prime factor of 1(1 + 2(2 + 3(3 + · · · + 9(9 + 10 · 10) · · · ))).

11
8 Tiebreaker Answer

Answer 1. 13

12
9 Tiebreaker Solution

Problem 1. Compute the smallest prime factor of 1(1 + 2(2 + 3(3 + · · · + 9(9 + 10 · 10) · · · ))).

Solution 1. Check that the expression is equal to

1 · 1! + 2 · 2! + 3 · 3! + · · · + 10 · 10! = 11! − 1,

whence p > 11. If p = 13 then by Wilson’s theorem,

12! −1
11! ≡ ≡ ≡1 (mod 13),
12 −1
so the answer is 13.

13