You are on page 1of 2

Your Exam Manager will receive a copy of the 2018

AIME Solution Pamphlet with the scores.


CONTACT US - Correspondence about the problems
and solutions for this AIME and orders for any of our
publications should be addressed in a private message.

2018 MOCK USA(J)MO - THE USA MATHEMAT-


ICAL OLYMPIAD (USAMO) and the USA MATHE-
MATICAL JUNIOR OLYMPIAD (USAJMO) are each
a 6-question, 9-hour, essay-type examination. The USA
(J)MO will released on FRIDAY, January 5th. All stu-
INSTRUCTIONS
dents are eligible to take this exam. The best way to
prepare for the USA(J)MO is to study previous years of 1. DO NOT OPEN THIS BOOKLET UNTIL YOUR PROCTOR
GIVES THE SIGNAL TO BEGIN.
these exams. Copies may be ordered from the web site
indicated below. 2. This is a 15-question, 3-hour examination. All answers are in-
tegers ranging from 000 to 999, inclusive. Your score will be the
number of correct answers; i.e., there is neither partial credit nor a
penalty for wrong answers.
PUBLICATIONS - For a complete listing of avail-
able publications please visit the MAA Bookstore or 3. No aids other than scratch paper, graph paper, ruler, compass,
Competitions site at maa.org. and protractor are permitted. In particular, calculators and com-
puters are not permitted.
The
4. All students will be eligible to take the Mock USAMO & US-
CMC American Mathematics Competitions
AJMO which will be released on FRIDAY, January 5th.
are supported by
atmchallenge 5. Record all of your answers, and certain other information, on the
AOPS12142015 AIME answer form. Only the answer form will be collected from
CantonMathGuy you.
eisirrational
FedeX333X After the contest period, permission to make copies of problems in paper for classroom
use only is granted without fee provided that copies are not made or distributed for
illogical 21 profit or commercial advantage and that copies bear the copyright notice. Electronic
Th3Numb3rThr33 copies of any type are strictly prohibited.
tree3
Mock 2018 AIME I 2 Mock 2018 AIME I 3

1. A positive integer n is defined as a stepstool number if n has one less positive 9. Angela, Bill, and Charles each independently and randomly choose a subset
divisor than n + 1. For example, 3 is a stepstool number, as 3 has 2 divisors and of {1, 2, 3, 4, 5, 6, 7, 8} that consists of consecutive integers (two people can select
4 has 2 + 1 = 3 divisors. Find the sum of all stepstool numbers less than 300. the same subset). The expected number of elements in the intersection of the
three chosen sets is m n , where m and n are relatively prime positive integers.
Find m + n.
2. An underground line has 26 stops, including the first and the final one, and all
the stops are numbered from 1 to 26 according to their order. Inside the train,
for each pair (x, y) with 1 ≤ x < y ≤ 26 there is exactly one passenger that 10. In circle Ω, let AB = 65 be the diameter and let points C and D lie on the
goes from the x-th stop to the y-th one. If every passenger wants to take a seat same side of arc AB
˜ such that CD = 16, with C closer to B and D closer to A.
during his journey, find the minimum number of seats that must be available Moreover, let AD, BC, AC, and BD all have integer lengths. Two other circles,
on the train. circles ω1 and ω2 , have AC and BD as their diameters, respectively. Let circle
ω1 intersect AB at a point E 6= A and let circle ω2 intersect AB at a point
3. Let a, b, c > 1 be positive real numbers such that alogb c = 27, logc a F 6= B. Then EF = m n , for relatively prime integers m and n. Find m + n.
√ b √ =√ 81,
and cloga b = 243. Then the value of log3 abc can be written as x + y + z
for positive integers x, y, and z. Find x + y + z. 11. Let N be the set {1, 2, . . . , 2018}. For each subset A of N with exactly 1009
elements, define X X
4. Triangle 4ABC has AB = 3, BC = 4, and AC = 5. Let M and N be the f (A) = i j.
midpoints of AC and BC, respectively. If line AN intersects the circumcircle of i∈A j∈N,j ∈A
/

triangle 4BM C at points X and Y , then XY 2 = m n for some relatively prime If E[f (A)] is the expected value of f (A) as A ranges over all the possible subsets
positive integers m, n. Find m + n. of N with exactly 1009 elements, find the remainder when the sum of the distinct
prime factors of E[f (A)] is divided by 1000.
5. Find the last three digits of the sum of all the real values of m such that
the ellipse x2 + xy + y 2 = m intersects the hyperbola xy = n only at its two 12. Define a permutation of the set {1, 2, 3, ..., n} to be sortable if upon cancelling
vertices, as n ranges over all non-zero integers −81 ≤ n ≤ 81. an appropriate term of such permutation, the remaining n − 1 terms are in
increasing order. If f (n) is the number of sortable permutations of {1, 2, 3, ..., n},
6. Let P be the set of all polynomials p(x) = x4 + 2x2 + mx + n, where m and find the remainder when
2018
n range over the positive reals. There exists a unique p(x) ∈ P such that p(x)
X
(−1)i · f (i)
has a real root, m is minimized, and p(1) = 99. Find n. i=1

is divided by 1000. Note that the empty set is considered sortable.


7. Let A, B, C, D be points, in order, on a straight line such that AB = BC =
CD. Let E be a point closer to B than D such that BE = EC = CD and let
13. Find the number of positive integers n < 2017 such that n2 + n0 + n1 + n7
F be the midpoint of DE. Let AF intersect EC √
at G and let BF intersect EC
is not divisible by the square of any prime.
at H. If [BHC] + [GHF ] = 1, then AD2 = a c b where a, b, and c are positive
integers, a and c are relatively prime, and b is not divisible by the square of any
prime. Find a + b + c. 14. Let 4ABC be a triangle with AB = 6, BC = 8, AC = 10, and let D be a
point such that if IA , IB , IC , ID are the incenters of the triangles BCD, ACD,
ABD, ABC, respectively, the lines √ AIA , BIB , CIC , DID are concurrent. If the
8. Mark has six boxes lined up in a straight line. Inside each of the first three
volume of tetrahedron ABCD is 15 2 39 , then the sum of the distances from D
boxes are a red ball, a blue ball, and a green ball. He randomly selects a
to A, B, C can be expressed in the form ab for some positive relatively prime
ball from each of the three boxes and puts them into a fourth box. Then, he
integers a, b. Find a + b.
randomly selects a ball from each of the four boxes and puts them into a fifth
box. Next, he randomly selects a ball from each of the five boxes and puts them
into a sixth box, arriving at three boxes with 1, 3, and 5 balls, respectively. The 15. A positive integer n is said to be m-free if n ≤ m! and gcd(i, n) = 1 for each
probability that the box with 3 balls has each type of color is m n , where m and
i = 1, 2, ..., m. Let Sk denote the sum of the squares of all the k-free integers.
n are relatively prime positive integers. Find m + n. Find the remainder when S7 − S6 is divided by 1000.

You might also like