GET READY FOR THE AMC 12 WITH AoPS
Learn with outstanding instructors and top-scoring students from around the world in our AMC 12 Problem Series online course.
CHECK SCHEDULE

2012 AMC 12A Problems

Revision as of 15:44, 11 February 2012 by Djmathman (talk | contribs)

Problem 1

A bug crawls along a number line, starting at -2. It crawls to -6, then turns around and crawls to 5. How many units does the bug crawl altogether?

$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15$

Solution

Problem 2

Cagney can frost a cupcake every 20 seconds and Lacey can frost a cupcake every 30 seconds. Working together, how many cupcakes can they frost in 5 minutes?

$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 30$

Solution

Problem 3

A box $2$ centimeters high, $3$ centimeters wide, and $5$ centimeters long can hold $40$ grams of clay. A second box with twice the height, three times the width, and the same length as the first box can hold $n$ grams of clay. What is $n$?

$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 160\qquad\textbf{(C)}\ 200\qquad\textbf{(D)}\ 240\qquad\textbf{(E)}\ 280$

Problem 4

Problem 5

Problem 6

The sums of three whole numbers taken in pairs are $12$, $17$, and $19$. What is the middle number?

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

Problem 7

Problem 8

Problem 9

Problem 10

Problem 11

Problem 12

Problem 13

Problem 14

Problem 15

Problem 16

Problem 17

Problem 18

Problem 19

Problem 20

Problem 21

Let $a$, $b$, and $c$ be positive integers with $a\ge$ $b\ge$ $c$ such that \[a^2-b^2-c^2+ab=2011\] and \[a^2+3b^2+3c^2-3ab-2ac-2bc=-1997.\]

What is $a$?

$\textbf{(A)}\ 249\qquad\textbf{(B)}\ 250\qquad\textbf{(C)}\ 251\qquad\textbf{(D)}\ 252\qquad\textbf{(E)}\ 253$

Solution

Problem 22

Problem 23

Let $S$ be the square one of whose diagonals has endpoints $(0.1,0.7)$ and $(-0.1,-0.7)$. A point $v=(x,y)$ is chosen uniformly at random over all pairs of real numbers $x$ and $y$ such that $0 \le x \le 2012$ and $0\le y\le 2012$. Let $T(v)$ be a translated copy of $S$ centered at $v$. What is the probability that the square region determined by $T(v)$ contains exactly two points with integer coefficients in its interior?

$\textbf{(A)}\ 0.125\qquad\textbf{(B)}\ 0.14\qquad\textbf{(C)}\ 0.16\qquad\textbf{(D)}\ 0.25 \qquad\textbf{(E)}\ 0.32$

Solution

Problem 24

Let $\{a_k\}_{k=1}^{2011}$ be the sequence of real numbers defined by $a_1=0.201,$ $a_2=(0.2011)^{a_1},$ $a_3=(0.20101)^{a_2},$ $a_4=(0.201011)^{a_3}$, and in general,

\[a_k=\left\{\array{c}(0.\underbrace{20101\cdots 0101}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if k is odd,}\\(0.\underbrace{20101\cdots 01011}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if k is even.}\] (Error compiling LaTeX. Unknown error_msg)

Rearranging the numbers in the sequence $\{a_k\}_{k=1}^{2011}$ in decreasing order produces a new sequence $\{b_k\}_{k=1}^{2011}$. What is the sum of all integers $k$, $1\le k \le 2011$, such that $a_k=b_k?$

$\textbf{(A)}\ 671\qquad\textbf{(B)}\ 1006\qquad\textbf{(C)}\ 1341\qquad\textbf{(D)}\ 2011\qquad\textbf{(E)}\2012$ (Error compiling LaTeX. Unknown error_msg)


Problem 25

Let $f(x)=|2\{x\}-1|$ where $\{x\}$ denotes the fractional part of $x$. The number $n$ is the smallest positive integer such that the equation \[nf(xf(x))\] has at least $2012$ real solutions. What is $n$? Note: the fractional part of $x$ is a real number $y=\{x\}$ such that $0\le y<1$ and $x-y$ is an integer.

$\textbf{(A)}\ 30\qquad\textbf{(B)}\ 31\qquad\textbf{(C)}\ 32\qquad\textbf{(D)}\ 62\qquad\textbf{(E)}\64$ (Error compiling LaTeX. Unknown error_msg)