The 2nd CIME II Solutions Pamphlet will be released after the contest.

CONTACT US – Correspondence about the problems and solutions for this

CIME should be sent by PM to:
AOPS12142015, eisirrational, FedeX333X, and TheUltimate123.
The problems and solutions for this AIME were prepared by the CMC’s Com-
mittee on the CIME under the direction of:

Kyle Lee Eric Shen

CMC Chair CJMO Chair
CIME Chair Solutions Director

2019 CJMO – THE CHRISTMAS MATHEMATICAL JUNIOR OLYMPIAD

(CJMO) is a 6-question, 9-hour, essay-type examination. The CJMO will be
held from Friday, January 4, 2019 to Friday, January 25, 2018. Your teacher INSTRUCTIONS
will not have more details on who qualifies for the CJMO in the CMC 10/12
1. DO NOT OPEN THIS BOOKLET BEFORE STARTING YOUR TIMER.
and CIME Teachers’ Manuals because we did not make Teachers’ Manuals and
all students are qualified for the CJMO. The best way to prepare for the CJMO 2. This is a 15-question, 3-hour examination. All answers are integers ranging
is to study previous years of these exams, which may be found on our website from 000 to 999, inclusive. Your score will be the number of correct answers;
as indicated below. i.e., there is neither partial credit nor a penalty for wrong answers.
3. No aids other than scratch paper, graph paper, ruler, compass, and pro-
PUBLICATIONS – For a complete listing of our previous competitions please
tractor are permitted. In particular, calculators and computers are not
visit our website at https://sites.google.com/view/annualcmc/.
permitted.
4. A combination of the CIME and the Christmas Mathematics Contest 12
The
are not used to determine eligibility for participation in the Christmas Ju-
MAC Christmas Mathematics Competitions
are supported by the following problem-writers and test-solvers: nior Mathematical Olympiad (CJMO). A combination of the CIME and the
David Altizio Christmas Mathematics Contest 10 are not used to determine eligibility for
Allen Baranov participation in the Christmas Junior Mathematical Olympiad (CJMO). All
Federico Clerici students are eligible to participate in the Christmas Junior Mathematical
Mason Fang Olympiad. The CJMO will be given from FRIDAY, January 4, 2019 to
Justin Lee FRIDAY, January 25, 2019.
Kyle Lee 5. You may obtain an AIME answer form from https://www.maa.org/math-
Kaiwen Li
competitions/aime-archive, and record all of your answers, and certain
Sean Li
other information, on the AIME answer form. The answer form will not
Eric Shen
be collected from you, only your submission on the AIME Submission Form
Nathan Xiong
found at https://artofproblemsolving.com/community/c594864h1747367.
Andrew Wen
Joseph Zhang c Committee on the Christmas Mathematics Competitions

2019 CIME II Problems 2 2019 CIME II Problems 3

1. Consider the sequence {Fn } defined by F1 = F2 = 1 and Fn = Fn−1 + Fn−2 for all n > 2. 8. A 5-digit positive integer abcde is defined to be wavy if a < b > c < d > e and anti-wavy if
Suppose that F = {F2 , F3 , . . . , F2019 }. Then, there are T non-congruent triangles with a > b < c > d < e. Find the remainder when the positive difference between the number
positive area whose side lengths are all (not necessarily distinct) elements of F. Find the of wavy integers and the number of anti-wavy integers is divided by 1000.
remainder when T is divided by 1000.
9. Let S be the set of all rectangles formed by the squares of a 19 × 19 checkerboard whose
2. Consider the set S = {−5, −4, −3, −2, −1, 0, 1, 2, 3, 4} . We partition this set into 5 pairs, corners are black. A rectangle’s darkness is the number of black squares within its interior.
and the product of the two numbers in each pair is computed. The probability that at The average darkness of a rectangle in S can be written as mn
, where m and n are relatively
least half of the products are negative can be written as m , where m and n are relatively prime integers. Find the remainder when m + n is divided by 1000.
n
prime positive integers. Find m + n.
10. Let N be the exponent of 3 in the prime factorization of

3. In triangle ABC, the median AM is perpendicular to the angle bisector BD. Suppose (11 + 1)(22 + 2)(33 + 3) · · · (20192019 + 2019).
that AM = 20 and BD = 19. Find the area of 4ABC. Find the remainder when N is divided by 1000.

4. Define a base-b Munchausen number as a positive integer n such that when expressed in 11. In triangle ABC with incenter I, AB = 4, BC = 5, and CA = 6. If lines AI and BI
base b, its digits d0 · · · dk are all nonzero and satisfy meet the circumcircle of 4ABC again at S and L, respectively, and LB and LS intersect
AC at D and E, respectively, then the square of the area of quadrilateral SIDE can be
k k
X X expressed as m
n
, where m and n are relatively prime positive integers. Find m + n.
n= di b i = ddi i .
i=0 i=0
12. Max is playing a video game with 99 levels, labeled 1, 2, . . . , 99. Whenever Max completes
3 4 3
For instance, 3435 is a base-10 Munchausen number, since 3 + 4 + 3 + 5 = 3435. Find, 5 a level, he begins the next one immediately. However, for all 1 ≤ n ≤ 99, Max fails the
in base 10, the sum of all base-4 Munchausen numbers. nth level with probability (n + 1)−2 . Whenever he fails a level, he quits for the day and
attempts the level again the next day. If Max first attempts the first level on Day 1 and
√
5. Let a = 5 + 2i and b = 18 + 13i, where i = −1. Suppose that z and ω are complex completes the 99th level on Day K, then the expected value of K can be expressed as pq ,
numbers such that where p and q are relatively prime positive integers. Find the remainder when p + q is
        divided by 1000.
1 1 1 1
z+ + ω+ = a+ × b+ , and
z ω a b 13. The n × n multiplication table is the n × n table of values where the entry in the ith
       
1 1 1 1 row and j th column corresponds to the value ij. Let N be the number of entries in the
z+ × ω+ = a2 + 2 + b 2 + 2 .
z ω a b
720 × 720 multiplication table that are divisible by 720. Find the remainder when N is
√ divided by 1000.
Then, the largest possible value of |z + ω| can be expressed as m n, where m and n are
positive integers and n is not divisible by the square of any prime. Find m + n.
14. Let α, β, γ > 0 be angles such that α + β + γ = 90◦ and
37
6. A frog is initially at the point (0, 0). Every second, the frog jumps from its current tan α tan β tan γ + sec α sec β sec γ =
.
20
position (x, y) to either (x + 1, y), (x, y + 1), or (x + 1, y + 1), each with equal probability. m
Then, the minimum possible value of cos α can be expressed as n
, where m and n are
The probability that the frog eventually reaches the point (3, 3) is m n
, where m and n are relatively prime positive integers. Find m + n.
relatively prime positive integers. Find m + n.
15. In triangle ABC, AB = 4, AC = 6 and ∠A = 60◦ . Define ω as the circumcircle of 4ABC,
7. In 4ABC, AB = 5, AC = 6, and BC = 7. Let point O be the circumcenter of 4ABC and D as the midpoint of BC, E as the foot of B onto CA and F as the foot of C onto AB.
let the circumcircles of 4AOB and 4AOC intersect BC again at D and E, respectively. Suppose AD intersects ω again at X and the circumcircle of 4XEF intersects ω again
Rays AD and AE meet the circumcircle of 4ABC again at P and Q, respectively. Then, at Y. Then, AY 2 can be expressed as mn
, where m and n are positive relatively prime
PQ = m , where m and n are relatively prime positive integers. Find m + n. integers. Find m + n.
n