2018 AMC12A Solutions
2018 AMC12A Solutions
69th Annual
AMC 12A
American Mathematics Competition 12A
Wednesday, February 7, 2018
This Pamphlet gives at least one solution for each problem on this year’s competition
and shows that all problems can be solved without the use of a calculator. When more
than one solution is provided, this is done to illustrate a significant contrast in methods,
e.g., algebraic versus geometric, computational versus conceptual, elementary versus
advanced. These solutions are by no means the only ones possible, nor are they superior
to others the reader may devise.
We hope that teachers will inform their students about these solutions, both as
illustrations of the kinds of ingenuity needed to solve nonroutine problems and as
examples of good mathematical exposition. However, the publication, reproduction, or
communication of the problems or solutions for this contest during the period when students
are eligible to participate seriously jeopardizes the integrity of the results. Dissemination
at any time via copier, telephone, email, internet, or media of any type is a violation of
the competition rules.
Correspondence about the problems/solutions for this AMC 12 and orders for any
publications should be addressed to:
MAA American Mathematics Competitions
Attn: Publications, PO Box 471, Annapolis Junction, MD 20701
Phone 800.527.3690 | Fax 240.396.5647 | [email protected]
The problems and solutions for this AMC 12 were prepared by
MAA’s Subcommittee on the AMC10/AMC12 Exams, under the direction of the
co-chairs Jerrold W. Grossman and Carl Yerger.
© 2018 Mathematical Association of America
2018 AMC 12A Solutions 2
1. Answer (D): There are currently 36 red balls in the urn. In order
for the 36 red balls to represent 72% of the balls in the urn after some
blue balls are removed, there must be 36 ÷ 0.72 = 50 balls left in the
urn. This requires that 100 − 50 = 50 blue balls be removed.
3. Answer (E): There are 4 choices for the periods in which the
mathematics courses can be taken: periods 1, 3, 5; periods 1, 3, 6;
periods 1, 4, 6; and periods 2, 4, 6. Each choice of periods allows
3! = 6 ways to order the 3 mathematics courses. Therefore there are
4 · 6 = 24 ways of arranging a schedule.
6. Answer (B): Note that the given conditions imply that the 6 values
are listed in increasing order. Because the median of the these 6 values
is n, the mean of the middle two values must be n, so
(m + 10) + (n + 1)
= n,
2
which implies m = n − 11. Because the mean of the set is also n,
(n − 11) + (n − 7) + (n − 1) + (n + 1) + (n + 2) + 2n
= n,
6
so 7n−16 = 6n and n = 16. Then m = 16−11 = 5, and the requested
sum is 5 + 16 = 21.
This product will be an integer if and only if both of the factors 25+n
and 53−n are integers, which happens if and only if both exponents
are nonnegative. Therefore the given expression is an integer if and
only if 5 + n ≥ 0 and 3 − n ≥ 0. The solutions are exactly the integers
satisfying −5 ≤ n ≤ 3. There are 3 − (−5) + 1 = 9 such values.
–4 –2 2 4
–2
–4
The graph of the first equation is a line with x-intercept (3, 0) and
y-intercept (0, 1). To draw the graph of the second equation, consider
the equation quadrant by quadrant. In the first quadrant x > 0 and
y > 0, and thus the second equation is equivalent to |x−y| = 1, which
in turn is equivalent to y = x ± 1. Its graph consists of the rays with
endpoints (0, 1) and (1, 0), as shown. In the second quadrant x < 0
and y > 0. The corresponding graph is the reflection of the first quad-
rant graph across the y-axis. The rest of the graph can be sketched by
further reflections of the first-quadrant graph across the coordinate
axes, resulting in the figure shown. There are 3 intersection points:
(−3, 2), (0, 1), and 32 , 12 , as shown.
OR
11. Answer (D): The paper’s long edge AB is the hypotenuse of right
triangle ACB, and the crease lies along the perpendicular bisector
of AB. Because AC > BC, the crease hits AC rather than BC. Let
D be the midpoint of AB, and let E be the intersection of AC and the
line through D perpendicular to AB. Then the crease in the paper
2018 AMC 12A Solutions 5
DE CB 3
is DE. Because 4ADE ∼ 4ACB, it follows that AD = AC = 4.
Thus
CB 5 3 15
DE = AD · = · = .
AC 2 4 8
5
D
3
A C
4 E
OR
At most one integer can be selected for S from each of the following
6 groups: {1, 2, 4, 8}, {3, 6, 12}, {5, 10}, {7}, {9}, and {11}. Because
S consists of 6 distinct integers, exactly one integer must be selected
from each of these 6 groups. Therefore 7, 9, and 11 must be in S.
Because 9 is in S, 3 must not be in S. This implies that either 6 or
12 must be selected from the second group, so neither 1 nor 2 can be
selected from the first group. If 4 is selected from the first group, the
collection of integers {4, 5, 6, 7, 9, 11} is one possibility for the set S.
Therefore 4 is the least possible element of S.
Note: The two collections given in the solutions are the only ones
with least element 4 that have the given property. This problem is
a special case of the following result of Paul Erdős from the 1930s:
Given n integers a1 , a2 , . . . , an , no one of them dividing any other,
with a1 < a2 < · · · < an ≤ 2n, let the integer k be determined by the
inequalities 3k < 2n < 3k+1 . Then a1 ≥ 2k , and this bound is sharp.
2018 AMC 12A Solutions 6
13. Answer (D): Let S be the set of integers, both negative and non-
negative, having the given form. Increasing the value of ai by 1 for
0 ≤ i ≤ 7 creates a one-to-one correspondence between S and the
ternary (base 3) representation of the integers from 0 through 38 − 1,
so S contains 38 = 6561 elements. One of those is 0, and by symmetry,
half of the others are positive, so S contains 1 + 12 · (6561 − 1) = 3281
elements.
OR
OR
OR
15. Answer (B): None of the squares that are marked with dots in
the sample scanning code shown below can be mapped to any other
marked square by reflections or non-identity rotations. Therefore
these 10 squares can be arbitrarily colored black or white in a symmet-
ric scanning code, with the exception of “all black” and “all white”.
On the other hand, reflections or rotations will map these squares to
all the other squares in the scanning code, so once these 10 colors
are specified, the symmetric scanning code is completely determined.
Thus there are 210 − 2 = 1022 symmetric scanning codes.
2018 AMC 12A Solutions 8
OR
The diagram below shows the orbits of each square under rotations
and reflections. Because the scanning code must look the same under
these transformations, all squares in the same orbit must get the same
color, but one is free to choose the color for each orbit, except for the
choice of “all black” and “all white”. Because there are 10 orbits,
there are 210 − 2 = 1022 symmetric scanning codes.
A B C D C B A
B E F G F E B
C F H I H F C
D G I J I G D
C F H I H F C
B E F G F E B
A B C D C B A
OR
Substituting the value for y from the second equation into the first
equation yields
2
x2 + x2 − a = a2 ,
which is equivalent to
x2 x2 − (2a − 1) = 0.
The first factor gives the solution x = 0, and the second factor gives
2 other solutions if a > 12 and no other solutions if a ≤ 12 . Thus there
are 3 solutions if and only if a > 12 .
17. Answer (D): Let the triangle’s vertices in the coordinate plane be
(4, 0), (0, 3), and (0, 0), with [0, s] × [0, s] representing the unplanted
portion of the field. The equation of the hypotenuse is 3x+4y−12 = 0,
so the distance from (s, s), the corner of S closest to the hypotenuse,
to this line is given by
|3s + 4s − 12|
√ .
32 + 42
Setting this equal to 2 and solving for s gives s = 22 2
7 and s = 7 , and
the former is rejected because the square must lie within the triangle.
2
The unplanted area is thus 72 = 49 4
, and the requested fraction is
4
49 145
1− 1 = .
2 ·4·3 147
OR
Let the given triangle be described as 4ABC with the right angle
at B and AB = 3. Let D be the vertex of the square that is in the
interior of the triangle, and let s be the edge length of the square.
Then two sides of the square along with line segments AD and CD
decompose 4ABC into four regions. These regions are a triangle
with base 5 and height 2, the unplanted square with side s, a right
triangle with legs s and 3 − s, and a right triangle with legs s and
4 − s. The sum of the areas of these four regions is
1 1 1 7
· 5 · 2 + s2 + s(3 − s) + s(4 − s) = 5 + s,
2 2 2 2
and the area of 4ABC is 6. Solving 5 + 72 s = 6 for s gives s = 2
7,
and the solution concludes as above.
2018 AMC 12A Solutions 10
D F E
G
B C
Note: The figure (not drawn to scale) shows the situation in which
∠ACB is acute. In this case BC ≈ 59.0 and ∠BAC ≈ 151◦ . It is also
possible for ∠ACB to be obtuse, with BC ≈ 41.5 and ∠BAC ≈ 29◦ .
These values can be calculated using the Law of Cosines and the sine
formula for area.
C
x
I
3–x
3–y y
A E B
OR
Place the figure in the coordinate plane with A at (0, 0), B at (3, 0),
and C at (0, 3). Then M is at 32 , 32 . Let s = AE and t = CI. Then
the coordinates of E are (s, 0), and the coordinates of I are (0, 3 − t).
Because AIM E is a cyclic quadrilateral and ∠EAI is a right angle,
∠IM E is a right angle. Therefore M I and M E are perpendicular,
so the product of their slopes is
3 3
2 t− 2
3 · 3 = −1;
2 −s 2
1
· (x1 y2 + x2 y3 + · · · + xn−1 yn + xn y1 )
2
− (y1 x2 + y2 x3 + · · · + yn−1 xn + yn x1 ) .
√ √ √ √
In this √
case x1 = √10, y1 = 6, x2 = 3, y2 = √1, x3 = √ − 10,
y3 = − 6, x4 = − 3, and y4 = −1. The area is 6 2 − 2 10, and
the requested sum of the four positive integers in this expression is
20.
OR
√
The solutions of z 2 = 4 + 4 15i = 16 cis√ 2θ1 are z1 = 4 cis θ1 and its
opposite, with 0 < θ1 < π4 and tan 2θ1 = 15. Then cos 2θ1 = 41 , and
√ √
by the half-angle identities, cos θ1 = 410 and sin θ1 = 46 . Similarly,
√
the solutions of z 2 = 2 + 2 3i = 4 cis θ√ 2 are z2 = 2 cis θ2 √ and its
opposite, with 0 < θ2 < π4 and tan 2θ2 = 3. Then cos θ2 = 23 and
sin θ2 = 12 .
The area of the parallelogram in the complex plane with vertices z1 ,
z2 , and their opposites is 4 times the area of the triangle with vertices
0, z1 , and z2 , and because the area of a triangle is one-half the product
of the lengths of two of its sides and the sine of their included angle,
it follows that the area of the parallelogram is
1
4 · 4 · 2 · sin (θ1 − θ2 ) = 16 (sin θ1 cos θ2 − cos θ1 sin θ2 )
2
√ √ √ !
6 3 10 1
= 16 · − ·
4 2 4 2
√ √
= 6 2 − 2 10.
Therefore, p + q + r + s = 6 + 2 + 2 + 10 = 20.
2018 AMC 12A Solutions 14
Q
N
U G
P A
M
OR
Place the figure in the coordinate plane with P = (−5, 0), M = (0, 0),
A = (5, 0), and T in the first quadrant. Then
U = (−5 + cos 36◦ , sin 36◦ ) and G = (5 − cos 56◦ , sin 56◦ ),
and the midpoint N of U G is
1 1
(cos 36◦ − cos 56◦ ), (sin 36◦ + sin 56◦ ) .
2 2
The tangent of ∠N M A is the slope of line M N , which is calculated
as follows using the sum-to-product trigonometric identites:
sin 36◦ + sin 56◦
tan(∠N M A) =
cos 36◦ − cos 56◦
◦ ◦ ◦ ◦
2 sin 36 +56
2 cos 36 −56
2
= ◦ ◦ ◦ ◦
−2 sin 36 +562 sin 36 −56
2
cos 10◦
= = cot 10◦ = tan 80◦ ,
sin 10◦
and it follows that ∠N M A = 80◦ .
2018 AMC 12A Solutions 15
24. Answer (B): Because Alice and Bob are choosing their numbers
uniformly at random, the cases in which two or three of the chosen
numbers are equal have probability 0 and can be ignored. Suppose
Carol chooses the number c. She will win if her number is greater than
Alice’s number and less than Bob’s, and she will win if her number
is less than Alice’s number and greater than Bob’s. There are three
cases.
• If c ≤ 21 , then Carol’s number is automatically less than Bob’s, so
her chance of winning is the probability that Alice’s number is less
than c, which is just c. The best that Carol can do in this case is to
choose c = 21 , in which case her chance of winning is 21 .
• If c ≥ 23 , then Carol’s number is automatically greater than Bob’s,
so her chance of winning is the probability that Alice’s number is
greater than c, which is just 1 − c. The best that Carol can do in this
case is to choose c = 32 , in which case her chance of winning is 13 .
• Finally suppose that 21 < c < 2
3. The probability that Carol’s
number is less than Bob’s is
2
3 −c
2 = 4 − 6c,
3 − 12
so the probability that her number is greater than Alice’s and less
than Bob’s is c(4 − 6c). Similarly, the probability that her number
is less than Alice’s and greater than Bob’s is (1 − c)(6c − 3). Carol’s
probability of winning in this case is therefore
Because the probability of winning in the third case exceeds the prob-
abilities obtained in the first two cases, Carol should choose 13
24 .
(9c − a2 ) · 10n = 9b − 9c − a2 .
As this must hold for two different values n1 and n2 , there are two
such equations, and subtracting them gives
9c − a2 (10n1 − 10n2 ) = 0.