OMMC Solutions - OMC Team C

Garud Shah, Sophia Han, Manu Issacs, Ashvant Daniel

May 17th-23rd

1
 2

Problem 1
There are an infinite number of balls in a row. Their colors from left to
right are
Cycle 1: 1 Red, 1 Green, 1 Blue
Cycle 2: 2 Red, 2 Green, 2 Blue
Cycle i: i Red, i Green, i Blue
and balls in cycle 1 come first, 2 next, and so on, in the order they were
presented within the cycle. Find the sum of the first 2025 balls if Red= 3,
Green= 2, Blue= 1.

Solution 1.1 — The following is Garud’s solution to the above problem.

Remark 1.1.1 (Approach.). We find the number of complete cycles,

then work out any remainder from the incomplete cycles. Then sum
everyting up using Gauss Trick.
Cycle i uses 3i balls. So, after accounting for the first i cycles, by Gauss
trick, get:

3i(i + 1)
(1.1)
2
balls. So we need the largest i such that:

3i(i + 1)
< 2025 (1.2)
2
i(i + 1) ≤ 1350, (1.3)

and test i = 35:

35 · 36 = 1260, no (1.4)
36 · 37 = 1332, has to be it! (1.5)

So we have 35 cycles, and then 27 leftover.

Now find the sum for each cycle. That’s easy, i · 3 (Red), i · 2 (Green),
i · 1 (Blue) sum to 6i, so we have:

3i(i + 1) (1.6)

for i cycles, so plugging in, the answer is:

3 · 35 · 36 + 27 · 3 = 4077 (1.7)
 3

Problem 2
Three consecutive even numbers have a six-digit product whose first and
last digits are 4 and 8, respectively. Find the smallest among these three
numbers.

Solution 2.1 — The following is Garud’s solution to the above problem.

Remark 2.1.1 (Approach.). Use the fact that (p is the product)

4 · 105 < p < 5 · 105 to get a rough range, then use the last digit to
rule out other wrong possibilities.
Let the even numbers be 2a, 2a − 2, 2a + 2 (a ∈ Z). We want 2a − 2.
Then, plugging in,

p = 8a(a2 − 1). (2.1)

First, we extract the range. Then, find a (mod 5).

Remark 2.1.2 (Approach.). The order in which we extract the range

and find a (mod 5) doesn’t matter.
Note that:

4 · 105 < 8a(a2 − 1) < 5 · 105 (2.2)

3
50, 000 < a − a < 62, 500. (2.3)

Now
√ note that√a3 is the main determinant of size here. So we compute
3
50, 000 and 3 62, 500 and get approximately 36.8 and 39.6 respectively.
We are far enough from 37 and 40 with these that I think we can comfortably
say those values won’t be thrown off from our guesses. Thus, only 37, 38, 39
remain. by the −a.
Modular arithmatic time! Note that:

8a(a2 − 1) ≡ 8 (mod 1)0 (2.4)

2
a(a − 1) ≡ 1 (mod 5) (2.5)
3
a ≡1+a (mod 5), (2.6)

and testing:
Number (mod 5) Works?
0 ✗
1 ✗
2 ✓
3 ✗
4 ✗

So a ≡ 2 (mod 5).
Combining the two facts that a ≡ 2 (mod 5) and a = 37, 38, 39, the only
value of a that remains is 37. Using this, the product is 404, 928 (yay!) and
the answer is 2a − 2 = 72
 4

Problem 3
In rectangle ABCD, semicircles with diameters AB and CD meet at P and
Q. If P Q = 16 and AB = 20, find [ABCD].

Solution 3.1 — The following is Garud’s solution to the above problem.

Remark 3.1.1 (Approach.). Use your brain.

D O2 C

Q P
M

A O1 B

Draw the centers of the semicircles. Now consider triangle P M O1 . Im-

meidately deduce that M O2 = M O1 and [O1 O2 M ] = 0 (colinear) and
O1 O2 ∥ BC. Let BC = s, thus O1 M = s/2. Now note that ∠P M O1 is
right as M must be the center of the rectangle by symmetry, so as P M = 8,
O1 P = 10, s/2 = 6 by Pythagorean Theorem. Thus, s = 12, and the
answer is 12 · 20 = 240 .
 5

Problem 4
Let N ≥ 106 and N ∈ Z. Find the minimum P over all (P, N ) with the
prior conditions such that

N − P | 20N + 25. (4.1)

Solution 4.1 — The following is Garud’s solution to the above problem.

Remark 4.1.1 (Approach.). Use ”Euclidean Algorthim” then assume

equality.
Note that this is equivilant to having:

N − P | 20P + 25. (4.2)

Now let

kN − kP = 20P + 25 (4.3)
(k + 20)P = kN − 25 (4.4)
kN − 25 25 + 20N
P = =N− (4.5)
k + 20 k + 20
and the second part, which lowers P , is monotonically decreasing with k so
we want the smallest k possible, which is 1. So, we need:

21 | N − 25 (4.6)
N ≡4 (mod 21), (4.7)

and 106 is 1 mod 21, so use 106 + 3, and the answer is:

106 − 22
= 47618 . (4.8)
21
 6

Problem 18
Let p(x) be a degree 6 monic polynomial (with not necessarily real coeffi-
cients) satisfying that p(x) | p(xb ). Find the sum of all distinct values of
p(1).

Solution 18.1 — The following is Garud’s solution to the above prob-

lem.

Remark 18.1.1 (Approach.). Think about roots!

Let the roots of poolynomial p(x) be r1 , r2 , · · · rd (d = 6). Then note
√ √ √
that the roots of p(x2 ) are ± r1 , ± r2 , · · · ± rd . Now we know that:
√ √ √
{r1 , r2 , · · · rd } ⊂ {± r1 , ± r2 , · · · ± rd }. (18.1)

Now Immeidately assume none of ri are 1 as if any of them are 1 the sum
is 0. Also assume less than a − 1 are zero as if five are equal to 0 the sixth
must have r2 = r, r = 0, 1, yielding 0 and 1 as the only possibilities.
Now say r1 = reiθ . Then, WLOG:

r1 = reiθ (18.2)
1/2 iθ/2+2πi·(0.b1 )2
r2 = r e (18.3)
1−n 1−n
rn = r2 eiθ2 e2πi·(0.bn−1 ···b1 )2 (18.4)

(there may be multiple cycles!) Then, to complete the cycle, for some n,
−n −n
reiθ = r2 eiθ2 e2πi·(0.bn ···b1 )2 . (18.5)

Now as r is a posititve real it is clear r = 1. So:

iθ = iθ2−n + 2πi · (0.bn · · · b1 )2 (18.6)

(0.bn · · · b1 )2
θ = 2π · . (18.7)
1 − 2−n
So for each of these cycles, for a cycle of length n, we get an evaluation of:
n−1 2−k ·(0.bn ···b1 )b
2πi
Y
1−e 1−2−n e2πi·(0.bk ···b1 )2 (18.8)
k=0
n−1
Y
= 1 − e2πi·(0.bk ···b1 bn ···b1 )2 (18.9)
k=0
n−1
Y 2πi
= 1 − e 2n −1 ·(bk ···b1 bn ···bk+1 )2 (18.10)
k=0
 7

Now apply magnitude and direction analysis:

n−1
Y 2πi
1 − e 2n −1 ·(bk ···b1 bn ···bk+1 )2 (18.11)
k=0
n−1 n−1  
Y
− 22πi 1
n −1 ·(bk ···b1 bn ···bk+1 )2 · 2
Y π
= ie 2 sin · (bk · · · b1 bn · · · bk+1 )2
2n − 1
k=0 k=0
(18.12)
n−1 n−1  
n
Y
− 22πi 1
n −1 ·(bk ···b1 bn ···bk+1 )2 · 2
Y π
= (2i) e sin · (bk · · · b1 bn · · · bk+1 )2
2n − 1
k=0 k=0
(18.13)
n−1  
Y π
= (2i)n (−1)bk sin · (bk · · · b1 bn · · · bk+1 )2 , (18.14)
2n − 1
k=0

as:
n−1
Y 2πi 1
e− 2n −1 ·(bk ···b1 bn ···bk+1 )2 · 2 (18.15)
k=0
1
Pn−1
= e−πi· 2n −1 k=0 bk ···b1 bn ···bk+1
(18.16)
Pn−1
bk
= (−1) i=0 . (18.17)

Let bn+1 = b1 we just need:

n  
Y π
(2i)n (−1)bk+1 sin · (bk · · · b1 bn · · · bk+1 )2 (18.18)
2n − 1
k=1
n  
n
Y 2π
= (2i) sin · (bk+1 bk · · · b1 bn · · · bk )2 (18.19)
2n − 1
k=1
n  
n
Y 2π
= (2i) sin · (bk · · · b1 bn · · · bk+1 )2 (18.20)
2n − 1
k=1

We’ll just evaluate possibilities for sin and multiply the sum of distinct
values by −64 at the end.