2016 AMC 12A Problems

2016 AMC 12A (Answer Key) Printable versions: Wiki • AoPS Resources • PDF
Instructions This is a 25-question, multiple choice test. Each question is followed by answers marked A, B, C, D and E. Only one of these is correct. You will receive 6 points for each correct answer, 2.5 points for each problem left unanswered if the year is before 2006, 1.5 points for each problem left unanswered if the year is after 2006, and 0 points for each incorrect answer. No aids are permitted other than scratch paper, graph paper, ruler, compass, protractor and erasers (and calculators that are accepted for use on the test if before 2006. No problems on the test will require the use of a calculator). Figures are not necessarily drawn to scale. You will have 75 minutes working time to complete the test.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25

Problem 1

What is the value of $\frac{11!-10!}{9!}$ ?

$\textbf{(A)}\ 99\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 110\qquad\textbf{(D)}\ 121\qquad\textbf{(E)}\ 132$

Solution

Problem 2

For what value of $x$ does $10^x\cdot100^{2x}=1000^5$ ?

$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

Solution

Problem 3

The remainder function can be defined for all real numbers $x$ and $y$ with $y\neq 0$ by

$rem(x,y)=x-y\bigg\lfloor \dfrac{x}{y} \bigg\rfloor$ ,

where $\Big\lfloor \tfrac{x}{y} \Big\rfloor$ denotes the greatest integer less than or equal to $\tfrac{x}{y}$ . What is the value of $rem(\tfrac{3}{8} , -\tfrac{2}{5})$ ?

$\textbf{(A)}\ -\dfrac{3}{8}\qquad\textbf{(B)}\ -\dfrac{1}{40}\qquad\textbf{(C)}\ 0\qquad\textbf{(D)}\ \dfrac{3}{8}\qquad\textbf{(E)}\ \dfrac{31}{40}$

Solution

Problem 4

The mean, median, and mode of the 7 data values $60, 100, x, 40, 50, 200, 90$ are all equal to $x$ . What is the value of $x$ ?

$\textbf{(A)}\ 50\qquad\textbf{(B)}\ 60\qquad\textbf{(C)}\ 75\qquad\textbf{(D)}\ 90\qquad\textbf{(E)}\ 100$

Solution

Problem 5

Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two prime numbers (for example, $2016=13+2003$ ). So far, no one has been able to prove that the conjecture is true, and no one has found a counterexample to show that the conjecture is false. What would a counterexample consist of?

$\textbf{(A)}\ \text{an odd integer greater than } 2 \text{ that can be written as the sum of two prime numbers}\\ \qquad\textbf{(B)}\ \text{an odd integer greater than } 2 \text{ that cannot be written as the sum of two prime numbers}\\ \qquad\textbf{(C)}\ \text{an even integer greater than } 2 \text{ that can be written as the sum of two numbers that are not prime}\\ \qquad\textbf{(D)}\ \text{an even integer greater than } 2 \text{ that can be written as the sum of two prime numbers}\\ \qquad\textbf{(E)}\ \text{an even integer greater than } 2 \text{ that cannot be written as the sum of two prime numbers}$

Solution

Problem 6

A triangular array of 2016 coins in the first row, 2 coins in the second row, 3 coins in the third row, and so on up to $N$ coins in the $N$ th row. What is the sum of the digits of $N$ ?

$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$