problem_id
stringlengths 32
32
| link
stringlengths 75
84
| problem
stringlengths 14
5.33k
| solution
stringlengths 15
6.63k
| letter
stringclasses 5
values | answer
stringclasses 957
values |
|---|---|---|---|---|---|
d71a5d56bdc8365488c9d6bb701da5b5 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_16 | Circle $C_1$ has its center $O$ lying on circle $C_2$ . The two circles meet at $X$ and $Y$ . Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$ $OZ=11$ , and $YZ=7$ . What is the radius of circle $C_1$
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30}$ | Let $r$ denote the radius of circle $C_1$ . Note that quadrilateral $ZYOX$ is cyclic. By Ptolemy's Theorem, we have $11XY=13r+7r$ and $XY=20r/11$ . Let $t$ be the measure of angle $YOX$ . Since $YO=OX=r$ , the law of cosines on triangle $YOX$ gives us $\cos t =-79/121$ . Again since $ZYOX$ is cyclic, the measure of angle $YZX=180-t$ . We apply the law of cosines to triangle $ZYX$ so that $XY^2=7^2+13^2-2(7)(13)\cos(180-t)$ . Since $\cos(180-t)=-\cos t=79/121$ we obtain $XY^2=12000/121$ . But $XY^2=400r^2/121$ so that $r=\boxed{30}$ | E | 30 |
d71a5d56bdc8365488c9d6bb701da5b5 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_16 | Circle $C_1$ has its center $O$ lying on circle $C_2$ . The two circles meet at $X$ and $Y$ . Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$ $OZ=11$ , and $YZ=7$ . What is the radius of circle $C_1$
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30}$ | Use the diagram above. Notice that $\angle YZO=\angle XZO$ as they subtend arcs of the same length. Let $A$ be the point of intersection of $C_1$ and $XZ$ . We now have $AZ=YZ=7$ and $XA=6$ . Consider the power of point $Z$ with respect to Circle $O,$ we have $13\cdot 7 = (11 + r)(11 - r) = 11^2 - r^2,$ which gives $r=\boxed{30}.$ | null | 30 |
d71a5d56bdc8365488c9d6bb701da5b5 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_16 | Circle $C_1$ has its center $O$ lying on circle $C_2$ . The two circles meet at $X$ and $Y$ . Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$ $OZ=11$ , and $YZ=7$ . What is the radius of circle $C_1$
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30}$ | Note that $OX$ and $OY$ are the same length, which is also the radius $R$ we want. Using the law of cosines on $\triangle OYZ$ , we have $11^2=R^2+7^2-2\cdot 7 \cdot R \cdot \cos\theta$ , where $\theta$ is the angle formed by $\angle{OYZ}$ . Since $\angle{OYZ}$ and $\angle{OXZ}$ are supplementary, $\angle{OXZ}=\pi-\theta$ . Using the law of cosines on $\triangle OXZ$ $11^2=13^2+R^2-2 \cdot 13 \cdot R \cdot \cos(\pi-\theta)$ . As $\cos(\pi-\theta)=-\cos\theta$ $11^2=13^2+R^2+\cos\theta$ . Solving for theta on the first equation and substituting gives $\frac{72-R^2}{14R}=\frac{48+R^2}{26R}$ . Solving for R gives $R=\textbf{(E)}\ \boxed{30}$ | null | 30 |
d71a5d56bdc8365488c9d6bb701da5b5 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_16 | Circle $C_1$ has its center $O$ lying on circle $C_2$ . The two circles meet at $X$ and $Y$ . Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$ $OZ=11$ , and $YZ=7$ . What is the radius of circle $C_1$
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30}$ | We first note that $C_2$ is the circumcircle of both $\triangle XOZ$ and $\triangle OYZ$ . Thus the circumradius of both the triangles are equal. We set the radius of $C_1$ as $r$ , and noting that the circumradius of a triangle is $\frac{abc}{4A}$ and that the area of a triangle by Heron's formula is $\sqrt{(S)(S-a)(S-b)(S-c)}$ with $S$ as the semi-perimeter we have the following, \begin{align*}\dfrac{r \cdot 13 \cdot 11}{4\sqrt{(12 + \frac{r}{2})(12 - \frac{r}{2})(1 + \frac{r}{2})(\frac{r}{2} - 1)}} &= \dfrac{r \cdot 7 \cdot 11}{4\sqrt{(9 + \frac{r}{2})(9 - \frac{r}{2})(2 + \frac{r}{2})(\frac{r}{2} - 2)}} \\ \dfrac{13}{\sqrt{(144- \frac{r^2}{4})(\frac{r^2}{4} - 1)}} &= \dfrac{7}{\sqrt{(81- \frac{r^2}{4})(\frac{r^2}{4} - 4)}} \\ 169 \cdot (81 - \frac{r^2}{4})(\frac{r^2}{4} - 4) &= 49 \cdot (144 - \frac{r^2}{4})(\frac{r^2}{4} - 1) .\end{align*} Now substituting $a = \frac{r^2}{4}$ \begin{align*}169a^2 - (85) \cdot 169 a + 4 \cdot 81 \cdot 169 &= 49a^2 - (145) \cdot 49 a + 144 \cdot 49 \\ 120a^2 - 7260a + 47700 &= 0 \\ 2a^2 - 121a + 795 &= 0 \\ (2a-15)(a-53) &= 0 \\ a = \frac{15}{2}, 53.\end{align*} This gives us 2 values for $r$ namely $r = \sqrt{4 \cdot \frac{15}{2}} = \sqrt{30}$ and $r = \sqrt{4 \cdot 53} = 2\sqrt{53}$
Now notice that we can apply Ptolemy's theorem on $XOYZ$ to find $XY$ in terms of $r$ . We get \begin{align*}11 \cdot XY &= 13r + 7r \\ XY &= \frac{20r}{11}.\end{align*} Here we substitute our $2$ values of $r$ receiving $XY = \frac{20\sqrt{30}}{11}, \frac{40\sqrt{53}}{11}$ . Notice that the latter of the $2$ cases does not satisfy the triangle inequality for $\triangle XYZ$ as $\frac{40\sqrt{53}}{11} \approx 26.5 > 7 + 13 = 20$ . But the former does thus our answer is $\textbf{(E)}\ \boxed{30}$ | null | 30 |
d71a5d56bdc8365488c9d6bb701da5b5 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_16 | Circle $C_1$ has its center $O$ lying on circle $C_2$ . The two circles meet at $X$ and $Y$ . Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$ $OZ=11$ , and $YZ=7$ . What is the radius of circle $C_1$
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30}$ | We first apply Ptolemy's Theorem on cyclic quadrilateral $XZYO$ to get $13r+7r = 11 \cdot XY \Longrightarrow XY=\frac{20r}{11}$ . Since $\angle ZXY = \angle ZOY$ and $\angle XZO = \angle XYO$ . From this, we can see $\triangle ZPY \sim \triangle XPO$ and $\triangle ZPX \sim \triangle YPO$ . That means $ZP:PY = 13:r, \: ZP:PX = 7:r, \: XP:PO = 13:r$ . So, if you let $PY=x$ , you will get $ZP = \frac{13x}{r}$ . Continuing in this fashion, we can get $XP = \frac{13x}{r} \cdot \frac{r}{7} = \frac{13x}{7}$ and $PO = \frac{13x}{7} \cdot \frac{r}{13} = \frac{xr}{7}$ . Since $XY = \frac{20r}{11} = XP+PY$ , we have $x+\frac{13x}{7} = \frac{20r}{11}$ which gives us $x=\frac{7r}{11}$ . Plugging it into $ZO = 11 = ZP+PO$ gives
\[\frac{13x}{r} + \frac{xr}{7} = \frac{13 \cdot \frac{7r}{11}}{r} + \frac{r \cdot \frac{7r}{11}}{7} = \frac{91}{11} + \frac{r^2}{11} = 11.\]
Solving for $r$ yields $r=\boxed{30}$ | null | 30 |
130206ee5a8af28ab9a834f03a2293cd | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_17 | Let $S$ be a subset of $\{1,2,3,\dots,30\}$ with the property that no pair of distinct elements in $S$ has a sum divisible by $5$ . What is the largest possible size of $S$
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 13\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 18$ | Of the integers from $1$ to $30$ , there are six each of $0,1,2,3,4\ (\text{mod}\ 5)$ . We can create several rules to follow for the elements in subset $S$ . No element can be $1\ (\text{mod}\ 5)$ if there is an element that is $4\ (\text{mod}\ 5)$ . No element can be $2\ (\text{mod}\ 5)$ if there is an element that is $3\ (\text{mod}\ 5)$ . Thus we can pick 6 elements from either $1\ (\text{mod}\ 5)$ or $4\ (\text{mod}\ 5)$ and 6 elements from either $2\ (\text{mod}\ 5)$ or $3\ (\text{mod}\ 5)$ for a total of $6+6=12$ elements. Considering $0\ (\text{mod}\ 5)$ , there can be one element that is so because it will only be divisible by $5$ if paired with another element that is $0\ (\text{mod}\ 5)$ . The final answer is $\boxed{13}$ | B | 13 |
83e5e7d7790372ed49fcc85d08014961 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_18 | Triangle $ABC$ has $AB=27$ $AC=26$ , and $BC=25$ . Let $I$ be the intersection of the internal angle bisectors of $\triangle ABC$ . What is $BI$
$\textbf{(A)}\ 15\qquad\textbf{(B)}\ 5+\sqrt{26}+3\sqrt{3}\qquad\textbf{(C)}\ 3\sqrt{26}\qquad\textbf{(D)}\ \frac{2}{3}\sqrt{546}\qquad\textbf{(E)}\ 9\sqrt{3}$ | Inscribe circle $C$ of radius $r$ inside triangle $ABC$ so that it meets $AB$ at $Q$ $BC$ at $R$ , and $AC$ at $S$ . Note that angle bisectors of triangle $ABC$ are concurrent at the center $O$ (also $I$ ) of circle $C$ . Let $x=QB$ $y=RC$ and $z=AS$ . Note that $BR=x$ $SC=y$ and $AQ=z$ . Hence $x+z=27$ $x+y=25$ , and $z+y=26$ . Subtracting the last 2 equations we have $x-z=-1$ and adding this to the first equation we have $x=13$
By Heron's formula for the area of a triangle we have that the area of triangle $ABC$ is $\sqrt{39(14)(13)(12)}$ . On the other hand the area is given by $(1/2)25r+(1/2)26r+(1/2)27r$ . Then $39r=\sqrt{39(14)(13)(12)}$ so that $r^2=56$
Since the radius of circle $O$ is perpendicular to $BC$ at $R$ , we have by the pythagorean theorem $BO^2=BI^2=r^2+x^2=56+169=225$ so that $BI=\boxed{15}$ | A | 15 |
83e5e7d7790372ed49fcc85d08014961 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_18 | Triangle $ABC$ has $AB=27$ $AC=26$ , and $BC=25$ . Let $I$ be the intersection of the internal angle bisectors of $\triangle ABC$ . What is $BI$
$\textbf{(A)}\ 15\qquad\textbf{(B)}\ 5+\sqrt{26}+3\sqrt{3}\qquad\textbf{(C)}\ 3\sqrt{26}\qquad\textbf{(D)}\ \frac{2}{3}\sqrt{546}\qquad\textbf{(E)}\ 9\sqrt{3}$ | We can use mass points and Stewart's to solve this problem. Because we are looking at the Incenter we then label $A$ with a mass of $25$ $B$ with $26$ , and $C$ with $27$ . We also label where the angle bisectors intersect the opposite side $A'$ $B'$ , and $C'$ correspondingly. It follows then that point $B'$ has mass $52$ . Which means that $\overline{BB'}$ is split into a $2:1$ ratio. We can then use Stewart's to find $\overline{BB'}$ . So we have $25^2\frac{27}{2} + 27^2\frac{25}{2} = \frac{25 \cdot 26 \cdot 27}{4} + 26\overline{BB'}^2$ . Solving we get $\overline{BB'} = \frac{45}{2}$ . Plugging it in we get $\overline{BI} = 15$ . Therefore the answer is $\boxed{15}$ | A | 15 |
83e5e7d7790372ed49fcc85d08014961 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_18 | Triangle $ABC$ has $AB=27$ $AC=26$ , and $BC=25$ . Let $I$ be the intersection of the internal angle bisectors of $\triangle ABC$ . What is $BI$
$\textbf{(A)}\ 15\qquad\textbf{(B)}\ 5+\sqrt{26}+3\sqrt{3}\qquad\textbf{(C)}\ 3\sqrt{26}\qquad\textbf{(D)}\ \frac{2}{3}\sqrt{546}\qquad\textbf{(E)}\ 9\sqrt{3}$ | We can use POP(Power of a point) to solve this problem. First, notice that the area of $\triangle ABC$ is $\sqrt{39(39 - 27)(39 - 26)(39 - 25)} = 78\sqrt{14}$ . Therefore, using the formula that $sr = A$ , where $s$ is the semi-perimeter and $r$ is the length of the inradius, we find that $r = 2\sqrt{14}$
Draw radii to the three tangents, and let the tangent hitting $BC$ be $T_1$ , the tangent hitting $AB$ be $T_2$ , and the tangent hitting $AC$ be $T_3$ . Let $BI = x$ . By the pythagorean theorem, we know that $BT_1 = \sqrt{x^2 - 56}$ . By POP, we also know that $BT_2$ is also $\sqrt{x^2 - 56}$ . Because we know that $BC = 25$ , we find that $CT_1 = 25 - \sqrt{x^2 - 56}$ . We can rinse and repeat and find that $AT_2 = 26 - (25 - \sqrt{x^2 - 56}) = 1 + \sqrt{x^2 - 56}$ . We can find $AT_2$ by essentially coming in from the other way. Since $AB = 27$ , we also know that $AT_3 = 27 - \sqrt{x^2 - 56}$ . By POP, we know that $AT_2 = AT_3$ , so $1 + \sqrt{x^2 - 56} = 27 - \sqrt{x^2 - 56}$
Let $\sqrt{x^2 - 56} = A$ , for simplicity. We can change the equation into $1 + A = 27 - A$ , which we find $A$ to be $13$ . Therefore, $\sqrt{x^2 - 56} = 13$ , which further implies that $x^2 - 56 = 169$ . After simplifying, we find $x^2 = 225$ , so $x = \boxed{15}$ | A | 15 |
52357d11c8a60e19d7f9a6cd0cb733f6 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_19 | Adam, Benin, Chiang, Deshawn, Esther, and Fiona have internet accounts. Some, but not all, of them are internet friends with each other, and none of them has an internet friend outside this group. Each of them has the same number of internet friends. In how many different ways can this happen?
$\text{(A)}\ 60\qquad\text{(B)}\ 170\qquad\text{(C)}\ 290\qquad\text{(D)}\ 320\qquad\text{(E)}\ 660$ | Note that if $n$ is the number of friends each person has, then $n$ can be any integer from $1$ to $4$ , inclusive.
One person can have at most 4 friends since they cannot be all friends (stated in the problem).
Also note that the cases of $n=1$ and $n=4$ are the same, since a map showing a solution for $n=1$ can correspond one-to-one with a map of a solution for $n=4$ by simply making every pair of friends non-friends and vice versa. The same can be said of configurations with $n=2$ when compared to configurations of $n=3$ . Thus, we have two cases to examine, $n=1$ and $n=2$ , and we count each of these combinations twice.
(Note: If you aren’t familiar with one-to-one correspondences, think of it like this: the number of ways to choose 4 friends is equal to number of ways to exclude one friend from your friend group. Hence, since the number of ways to choose 1 friend is the same thing as choosing 1 to not be friends with, $n=1$ and $n=4$ have the same number of ways. Similarly, $n=2$ and $n=3$ have the same number of ways as well. ~peelybonehead)
For $n=1$ , if everyone has exactly one friend, that means there must be $3$ pairs of friends, with no other interconnections. The first person has $5$ choices for a friend. There are $4$ people left. The next person has $3$ choices for a friend. There are two people left, and these remaining two must be friends. Thus, there are $15$ configurations with $n=1$
For $n=2$ , there are two possibilities. The group of $6$ can be split into two groups of $3$ , with each group creating a friendship triangle. The first person has $\binom{5}{2} = 10$ ways to pick two friends from the other five, while the other three are forced together. Thus, there are $10$ triangular configurations.
However, the group can also form a friendship hexagon, with each person sitting on a vertex, and each side representing the two friends that person has. The first person may be seated anywhere on the hexagon without loss of generality . This person has $\binom{5}{2} = 10$ choices for the two friends on the adjoining vertices. Each of the three remaining people can be seated "across" from one of the original three people, forming a different configuration. Thus, there are $10 \cdot 3! = 60$ hexagonal configurations, and in total $70$ configurations for $n=2$
As stated before, $n=3$ has $70$ configurations, and $n=4$ has $15$ configurations. This gives a total of $(70 + 15)\cdot 2 = 170$ configurations, which is option $\boxed{170}$ | B | 170 |
a74e204bc6305c1a7646686375bf5d69 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/Problem_20 | Consider the polynomial
\[P(x)=\prod_{k=0}^{10}(x^{2^k}+2^k)=(x+1)(x^2+2)(x^4+4)\cdots (x^{1024}+1024)\]
The coefficient of $x^{2012}$ is equal to $2^a$ . What is $a$
\[\textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 7\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 24\] | The degree of $P(x)$ is $1024+512+256+\cdots+1=2047$ . We want to find the coefficient of $x^{2012}$ , so we need to omit the powers of $2$ that add up to $2047-2012=35$ . We find that $35=2^0+2^1+2^5$ . From here, we know that the answer is $2^0\cdot2^1\cdot2^5=2^6$ . Therefore, the answer is $\boxed{6.}$ | B | 6. |
7f7ffaeb5358384574e1d713e6c4f944 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/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$ | Add the two equations.
$2a^2 + 2b^2 + 2c^2 - 2ab - 2ac - 2bc = 14$
Now, this can be rearranged and factored.
$(a^2 - 2ab + b^2) + (a^2 - 2ac + c^2) + (b^2 - 2bc + c^2) = 14$
$(a - b)^2 + (a - c)^2 + (b - c)^2 = 14$
$a$ $b$ , and $c$ are all integers, so the three terms on the left side of the equation must all be perfect squares.
We see that the only is possibility is $14 = 9 + 4 + 1$
$(a-c)^2 = 9 \Rightarrow a-c = 3$ , since $a-c$ is the biggest difference. It is impossible to determine by inspection whether $a-b = 1$ or $2$ , or whether $b-c = 1$ or $2$
We want to solve for $a$ , so take the two cases and solve them each for an expression in terms of $a$ . Our two cases are $(a, b, c) = (a, a-1, a-3)$ or $(a, a-2, a-3)$ . Plug these values into one of the original equations to see if we can get an integer for $a$
$a^2 - (a-1)^2 - (a-3)^2 + a(a-1) = 2011$ , after some algebra, simplifies to $7a = 2021$ $2021$ is not divisible by $7$ , so $a$ is not an integer.
The other case gives $a^2 - (a-2)^2 - (a-3)^2 + a(a-2) = 2011$ , which simplifies to $8a = 2024$ . Thus, $a = 253$ and the answer is $\boxed{253}$ | E | 253 |
b791db27e9086ff77634a07bbb639c16 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/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=\begin{cases}(0.\underbrace{20101\cdots 0101}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is odd,}\\(0.\underbrace{20101\cdots 01011}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is even.}\end{cases}\]
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$ | First, we must understand two important functions: $f(x) = b^x$ for $0 < b < 1$ (decreasing exponential function), and $g(x) = x^k$ for $k > 0$ (increasing power function for positive $x$ ). $f(x)$ is used to establish inequalities when we change the exponent and keep the base constant. $g(x)$ is used to establish inequalities when we change the base and keep the exponent constant.
We will now examine the first few terms.
Comparing $a_1$ and $a_2$ $0 < a_1 = (0.201)^1 < (0.201)^{a_1} < (0.2011)^{a_1} = a_2 < 1 \Rightarrow 0 < a_1 < a_2 < 1$
Therefore, $0 < a_1 < a_2 < 1$
Comparing $a_2$ and $a_3$ $0 < a_3 = (0.20101)^{a_2} < (0.20101)^{a_1} < (0.2011)^{a_1} = a_2 < 1 \Rightarrow 0 < a_3 < a_2 < 1$
Comparing $a_1$ and $a_3$ $0 < a_1 = (0.201)^1 < (0.201)^{a_2} < (0.20101)^{a_2} = a_3 < 1 \Rightarrow 0 < a_1 < a_3 < 1$
Therefore, $0 < a_1 < a_3 < a_2 < 1$
Comparing $a_3$ and $a_4$ $0 < a_3 = (0.20101)^{a_2} < (0.20101)^{a_3} < (0.201011)^{a_3} = a_4 < 1 \Rightarrow 0 < a_3 < a_4 < 1$
Comparing $a_2$ and $a_4$ $0 < a_4 = (0.201011)^{a_3} < (0.201011)^{a_1} < (0.2011)^{a_1} = a_2 < 1 \Rightarrow 0 < a_4 < a_2 < 1$
Therefore, $0 < a_1 < a_3 < a_4 < a_2 < 1$
Continuing in this manner, it is easy to see a pattern(see Note 1).
Therefore, the only $k$ when $a_k = b_k$ is when $2(k-1006) = 2011 - k$ . Solving gives $\boxed{1341}$ | C | 1341 |
b791db27e9086ff77634a07bbb639c16 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12A_Problems/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=\begin{cases}(0.\underbrace{20101\cdots 0101}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is odd,}\\(0.\underbrace{20101\cdots 01011}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is even.}\end{cases}\]
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$ | Start by looking at the first few terms and comparing them to each other. We can see that $a_1 < a_2$ , and that $a_1 < a_3 < a_2$ , and that $a_3 < a_4 < a_2$ , and that $a_3 < a_5 < a_4$ ...
From this, we find the pattern that $a_{k-1} < a_{k+1} < a_k$
Examining this relationship, we see that every new number $a_k$ will be between the previous two terms, $a_{k-1}$ and $a_{k-2}$ . Therefore, we can see that $a_1$ is the smallest number, $a_2$ is the largest number, and that all odd terms are less than even terms. Furthermore, we can see that for every odd k, $a_k < a_{k+2}$ , and for every even k, $a_k > a_{k+2}$
This means that rearranging the terms in descending order will first have all the even terms from $a_2$ to $a_{2012}$ , in that order, and then all odd terms from $a_{2011}$ to $a_1$ , in that order (so $\{b_k\}_{k=1}^{2011} = {a_2, a_4, a_6, ... a_{2008}, a_{2010}, a_{2011}, a_{2009}, ... a_5, a_3, a_1}$ ).
We can clearly see that there will be no solution k where k is even, as the $k$ th term in $\{a_k\}_{k=1}^{2011}$ will appear in the same position in its sequence as the $2k$ th term does in $\{a_k\}_{k=1}^{2011}$ , where k is even. Therefore, we only have to look at the odd terms of $a_k$ , which occur in the latter part of $b_k$
Looking at the back of both sequences, we see that term k in $\{a_k\}_{k=1}^{2011}$ progresses backwards in the equation $2012 - k$ , and that term k in $\{a_k\}_{k=1}^{2011}$ progresses backwards in the equation $2k - 1$ . Setting these two expressions equal to each other, we get $671$
However, remember that we started counting from the back of both sequences. So, plugging $671$ back into either side of the equation from earlier, we get our answer of $\boxed{1341}$ | C | 1341 |
3fcfd56172ce8b18173fa3938631ee33 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_1 | Each third-grade classroom at Pearl Creek Elementary has $18$ students and $2$ pet rabbits. How many more students than rabbits are there in all $4$ of the third-grade classrooms?
$\textbf{(A)}\ 48\qquad\textbf{(B)}\ 56\qquad\textbf{(C)}\ 64\qquad\textbf{(D)}\ 72\qquad\textbf{(E)}\ 80$ | Multiplying $18$ and $2$ by $4$ we get $72$ students and $8$ rabbits. We then subtract: $72 - 8 = \boxed{64}.$ | C | 64 |
3fcfd56172ce8b18173fa3938631ee33 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_1 | Each third-grade classroom at Pearl Creek Elementary has $18$ students and $2$ pet rabbits. How many more students than rabbits are there in all $4$ of the third-grade classrooms?
$\textbf{(A)}\ 48\qquad\textbf{(B)}\ 56\qquad\textbf{(C)}\ 64\qquad\textbf{(D)}\ 72\qquad\textbf{(E)}\ 80$ | In each class, there are $18-2=16$ more students than rabbits. So for all classrooms, the difference between students and rabbits is $16 \times 4 = \boxed{64}$ | C | 64 |
baf7efec346c129e437395b877370bd6 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_2 | A circle of radius 5 is inscribed in a rectangle as shown. The ratio of the length of the rectangle to its width is 2:1. What is the area of the rectangle?
[asy] draw((0,0)--(0,10)--(20,10)--(20,0)--cycle); draw(circle((10,5),5)); [/asy]
$\textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200$ | If the radius is $5$ , then the width is $10$ , hence the length is $20$ $10\times20= \boxed{200}.$ | E | 200 |
00221e4849d84b8c4864993b05a7ff0a | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_3 | For a science project, Sammy observed a chipmunk and squirrel stashing acorns in holes. The chipmunk hid 3 acorns in each of the holes it dug. The squirrel hid 4 acorns in each of the holes it dug. They each hid the same number of acorns, although the squirrel needed 4 fewer holes. How many acorns did the chipmunk hide?
$\textbf{(A)}\ 30\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 54$ | If $x$ is the number of holes that the chipmunk dug, then $3x=4(x-4)$ , so $3x=4x-16$ , and $x=16$ . The number of acorns hidden by the chipmunk is equal to $3x = \boxed{48}$ | D | 48 |
00221e4849d84b8c4864993b05a7ff0a | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_3 | For a science project, Sammy observed a chipmunk and squirrel stashing acorns in holes. The chipmunk hid 3 acorns in each of the holes it dug. The squirrel hid 4 acorns in each of the holes it dug. They each hid the same number of acorns, although the squirrel needed 4 fewer holes. How many acorns did the chipmunk hide?
$\textbf{(A)}\ 30\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 54$ | Trying answer choices, we see that $\boxed{48}$ works. ~Extremelysupercooldude | D | 48 |
0fc840c4c1f05fc706197feba21998b7 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_4 | Suppose that the euro is worth 1.3 dollars. If Diana has 500 dollars and Etienne has 400 euros, by what percent is the value of Etienne's money greater that the value of Diana's money?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6.5\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 13$ | The ratio $\frac{400 \text{ euros}}{500 \text{ dollars}}$ can be simplified using conversion factors: \[\frac{400 \text{ euros}}{500 \text{ dollars}} \cdot \frac{1.3 \text{ dollars}}{1 \text{ euro}} = \frac{520}{500} = 1.04\] which means the money is greater by $\boxed{4}$ percent. | B | 4 |
0fc840c4c1f05fc706197feba21998b7 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_4 | Suppose that the euro is worth 1.3 dollars. If Diana has 500 dollars and Etienne has 400 euros, by what percent is the value of Etienne's money greater that the value of Diana's money?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6.5\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 13$ | If we divide each of Etienne's and Diana's values by $100$ , the problem stays the same. Then, Etienne has $1.3$ times the amount of money Diana has, so Etienne has $5.2$ dollars. Since $\dfrac{5.2}{5} = 1.04$ , Etienne has $\boxed{4}$ percent more money than Diana. ~Extremelysupercooldude | B | 4 |
cf0138790e2587c3c8f53e5c627e5083 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_5 | Two integers have a sum of $26$ . when two more integers are added to the first two, the sum is $41$ . Finally, when two more integers are added to the sum of the previous $4$ integers, the sum is $57$ . What is the minimum number of even integers among the $6$ integers?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$ | Since, $x + y = 26$ $x$ can equal $15$ , and $y$ can equal $11$ , so no even integers are required to make 26. To get to $41$ , we have to add $41 - 26 = 15$ . If $a+b=15$ , at least one of $a$ and $b$ must be even because two odd numbers sum to an even number. Therefore, one even integer is required when transitioning from $26$ to $41$ . Finally, we have the last transition is $57-41=16$ . If $m+n=16$ $m$ and $n$ can both be odd because two odd numbers sum to an even number, meaning only $1$ even integer is required. The answer is $\boxed{1}$ . ~Extremelysupercooldude (Latex, grammar, and solution edits) | A | 1 |
cf0138790e2587c3c8f53e5c627e5083 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_5 | Two integers have a sum of $26$ . when two more integers are added to the first two, the sum is $41$ . Finally, when two more integers are added to the sum of the previous $4$ integers, the sum is $57$ . What is the minimum number of even integers among the $6$ integers?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$ | Just worded and formatted a little differently than above.
The first two integers sum up to $26$ . Since $26$ is even, in order to minimize the number of even integers, we make both of the first two odd.
The second two integers sum up to $41-26=15$ . Since $15$ is odd, we must have at least one even integer in these next two.
Finally, $57-41=16$ , and once again, $16$ is an even number so both of these integers can be odd.
Therefore, we have a total of one even integer and our answer is $\boxed{1}$ | A | 1 |
c5dda01b87db98a0a7b8bbf46fa76e77 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_7 | Small lights are hung on a string $6$ inches apart in the order red, red, green, green, green, red, red, green, green, green, and so on continuing this pattern of $2$ red lights followed by $3$ green lights. How many feet separate the 3rd red light and the 21st red light?
Note: $1$ foot is equal to $12$ inches.
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 18.5\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 20.5\qquad\textbf{(E)}\ 22.5$ | We know the repeating section is made of $2$ red lights and $3$ green lights. The 3rd red light would appear in the 2nd section of this pattern, and the 21st red light would appear in the 11th section. There would then be a total of $44$ lights in between the 3rd and 21st red light, translating to $45$ $6$ -inch gaps. Since the question asks for the answer in feet, the answer is $\frac{45*6}{12} \rightarrow \boxed{22.5}$ | E | 22.5 |
022e1bfff54372746669e1cf0757e3ce | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_8 | A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$ | We can count the number of possible foods for each day and then multiply to enumerate the number of combinations.
On Friday, we have one possibility: cake.
On Saturday, we have three possibilities: pie, ice cream, or pudding. This is the end of the week.
On Thursday, we have three possibilities: pie, ice cream, or pudding. We can't have cake because we have to have cake the following day, which is the Friday with the birthday party.
On Wednesday, we have three possibilities: cake, plus the two things that were not eaten on Thursday.
Similarly, on Tuesday, we have three possibilities: the three things that were not eaten on Wednesday.
Likewise on Monday: three possibilities, the three things that were not eaten on Tuesday.
On Sunday, it is tempting to think there are four possibilities, but remember that cake must be served on Friday. This serves to limit the number of foods we can eat on Sunday, with the result being that there are three possibilities: The three things that were not eaten on Monday.
So the number of menus is $3 \cdot 3 \cdot 3 \cdot 3 \cdot 3 \cdot 1 \cdot 3 = 729.$ The answer is $\boxed{729}$ | A | 729 |
022e1bfff54372746669e1cf0757e3ce | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_8 | A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$ | We can perform casework as an understandable means of getting the answer. We can organize our counting based on the food that was served on Wednesday, because whether cake is or is not served on Wednesday seems to significantly affect the number of ways the chef can make said foods for that week.
Case 1: Cake is served on Wednesday. Here, we have three choices for food on Thursday and Saturday since cake must be served on Friday, and none of these choices are cake, which was served Wednesday. Likewise, we have three choices (pie, ice cream, and pudding) for the food served on Tuesday and thus three choices for those served on Monday and Sunday, with these three choices being whatever was not served on Tuesday and Monday, respectively. Hence, for this case, there are $3 \cdot 3 \cdot 3 \cdot 3 \cdot 3 = 243$ possibilities.
Case 2: Cake is not served on Wednesday. Obviously, this means that pie, ice cream, and pudding are our only choices for Wednesday's food. Since cake must be served on Friday, only ice cream, pudding, and cake can be served on Thursday. However, since one of those foods was chosen for Wednesday, we only have two possibilities for Thursday's food. Like our first case, we have three possibilities for the food served on Tuesday, Monday, and Sunday: whatever was not served on Wednesday, Tuesday, and Monday, respectively. $3 \cdot 3 \cdot 3 \cdot 3 \cdot 2 \cdot 3 = 486$ possibilities thus exist for this case.
Adding the number of possibilities together yields that $243 + 486 = 729$ is the total number of menus, making our answer $\boxed{729}$ | A | 729 |
022e1bfff54372746669e1cf0757e3ce | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_8 | A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$ | Note that the choice of a food item on a given day is symmetric, i.e. the number of ways to create the meal plan with a cake on Friday is the same as the number of ways to create the meal plan with pudding on Friday, and the same reasoning holds for the other desserts. Since every meal plan is counted by the summation of the $4$ aforementioned plans (note that Friday's dessert has to be one of the $4$ given desserts) and that these cases are mutually exclusive (i.e. you cannot make both a cake and pudding on Friday), each case results in a quarter of the total meal plans (Since there are $4$ desserts, we multiply by $\tfrac{1}{4}$ ). The total number of plans with no restrictions can be counted with constructive counting, as follows:
We note that there are $4$ ways to choose the first dessert. Then, each dessert thereafter must be distinct from the prior one. Since there are $4$ options, and $1$ of them has been taken by the prior, each following dessert can be chosen in $(4 - 1) = 3$ ways. Thus, since there are $6$ desserts other than the first, the total number (without restrictions) is $4 \cdot 3^6$
Thus, by our symmetry argument derived prior, we know that the number of desired meal plans is $\frac{\text{\# plans w/o restrictions}}{4} = \frac{4 \cdot 3^6}{4} = 3^6 = 729$ , choice $\boxed{729}$ | A | 729 |
fa70033f30e92e2144e922a75b2119cc | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_9 | It takes Clea 60 seconds to walk down an escalator when it is not moving, and 24 seconds when it is moving. How many seconds would it take Clea to ride the escalator down when she is not walking?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$ | She walks at a rate of $x$ units per second to travel a distance $y$ . As $vt=d$ , we find $60x=y$ and $24*(x+k)=y$ , where $k$ is the speed of the escalator. Setting the two equations equal to each other, $60x=24x+24k$ , which means that $k=1.5x$ . Now we divide $60$ by $1.5$ because you add the speed of the escalator but remove the walking, leaving the final answer that it takes to ride the escalator alone as $\boxed{40}$ | B | 40 |
fa70033f30e92e2144e922a75b2119cc | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_9 | It takes Clea 60 seconds to walk down an escalator when it is not moving, and 24 seconds when it is moving. How many seconds would it take Clea to ride the escalator down when she is not walking?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$ | We write two equations using distance = rate * time. Let $r$ be the rate she is walking, and $e$ be the speed the escalator moves. WLOG, let the distance of the escalator be $120$ , as the distance is constant. Thus, our $2$ equations are $120 = 60r$ and $120 = 24(r+e)$ . Solving for $e$ , we get $e = 3$ . Thus, it will take Clea $\dfrac{120}{3} = \boxed{40}$ seconds. | B | 40 |
fa70033f30e92e2144e922a75b2119cc | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_9 | It takes Clea 60 seconds to walk down an escalator when it is not moving, and 24 seconds when it is moving. How many seconds would it take Clea to ride the escalator down when she is not walking?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$ | Clea covers $\dfrac{1}{60}$ of the escalator every second. Say the escalator covers $\dfrac{1}{r}$ of the escalator every second. Since Clea and the escalator cover the entire escalator in $24$ seconds, we can use distance $=$ rate $\cdot$ time to get $24\left(\dfrac{1}{60} + \dfrac{1}{r}\right) = 1$ . Solving gives us $r = 40$ , so if Clea were to just stand on the escalator, it would take her $\boxed{40}$ seconds to get down. ~Extremelysupercooldude | B | 40 |
a4fee1d0c87473968d0a2645df33fcf0 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_11 | In the equation below, $A$ and $B$ are consecutive positive integers, and $A$ $B$ , and $A+B$ represent number bases: \[132_A+43_B=69_{A+B}.\] What is $A+B$
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 17$ | Change the equation to base 10: \[A^2 + 3A +2 + 4B +3= 6A + 6B + 9\] \[A^2 - 3A - 2B - 4=0\]
Either $B = A + 1$ or $B = A - 1$ , so either $A^2 - 5A - 6, B = A + 1$ or $A^2 - 5A - 2, B = A - 1$ . The second case has no integer roots, and the first can be re-expressed as $(A-6)(A+1) = 0, B = A + 1$ . Since A must be positive, $A = 6, B = 7$ and $A+B = \boxed{13}$ | C | 13 |
a4fee1d0c87473968d0a2645df33fcf0 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_11 | In the equation below, $A$ and $B$ are consecutive positive integers, and $A$ $B$ , and $A+B$ represent number bases: \[132_A+43_B=69_{A+B}.\] What is $A+B$
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 17$ | We can eliminate answer choice $\textbf{(A)}$ because you can't have a $9$ in base $9$ . Now we know that A and B are consecutive, so we can just test answers. You will only have to test at most $8$ cases. Eventually, after testing a few cases, you will find that $A=6$ and $B=7$ . The solution is $\boxed{13}$ | C | 13 |
9958192892d058ab3cbc1ba71c827ac6 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_12 | How many sequences of zeros and ones of length 20 have all the zeros consecutive, or all the ones consecutive, or both?
$\textbf{(A)}\ 190\qquad\textbf{(B)}\ 192\qquad\textbf{(C)}\ 211\qquad\textbf{(D)}\ 380\qquad\textbf{(E)}\ 382$ | There are $\binom{20}{2}$ selections; however, we count these twice, therefore
$2\cdot\binom{20}{2} = \boxed{380}$ . The wording of the question implies D, not E. | D | 380 |
9958192892d058ab3cbc1ba71c827ac6 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_12 | How many sequences of zeros and ones of length 20 have all the zeros consecutive, or all the ones consecutive, or both?
$\textbf{(A)}\ 190\qquad\textbf{(B)}\ 192\qquad\textbf{(C)}\ 211\qquad\textbf{(D)}\ 380\qquad\textbf{(E)}\ 382$ | Consider the 20 term sequence of $0$ 's and $1$ 's. Keeping all other terms 1, a sequence of $k>0$ consecutive 0's can be placed in $21-k$ locations. That is, there are 20 strings with 1 zero, 19 strings with 2 consecutive zeros, 18 strings with 3 consecutive zeros, ..., 1 string with 20 consecutive zeros. Hence there are $20+19+\cdots+1=\binom{21}{2}$ strings with consecutive zeros. The same argument shows there are $\binom{21}{2}$ strings with consecutive 1's. This yields $2\binom{21}{2}$ strings in all. However, we have counted twice those strings in which all the 1's and all the 0's are consecutive. These are the cases $01111...$ $00111...$ $000111...$ , ..., $000...0001$ (of which there are 19) as well as the cases $10000...$ $11000...$ $111000...$ , ..., $111...110$ (of which there are 19 as well). This yields $2\binom{21}{2}-2\cdot19=\boxed{382}$ | E | 382 |
9958192892d058ab3cbc1ba71c827ac6 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_12 | How many sequences of zeros and ones of length 20 have all the zeros consecutive, or all the ones consecutive, or both?
$\textbf{(A)}\ 190\qquad\textbf{(B)}\ 192\qquad\textbf{(C)}\ 211\qquad\textbf{(D)}\ 380\qquad\textbf{(E)}\ 382$ | First, we think of ways to make all the $1$ 's consecutive. If there are no consecutive $1$ 's, there are $\binom{20}{0}$ ways to order them. If there is one consecutive $1$ , there are $\binom{20}{1}$ ways to order them. If there are two consecutive $1$ 's, then there are $\binom{19}{1}$ ways to order them (We treat the two $1$ 's like a block, and then order that block with 18 other $0$ 's). Continuing in this fashion, there are $\binom{20}{0} + \binom{20}{1} + \binom{19}{1} + \cdots + \binom{1}{1} = 1 + 20 + 19 + \cdots + 2 + 1 = 210 + 1 = 211$ ways to order consecutive $1$ 's. From symmetry, there are also $211$ ways to order the $0$ 's. Now, from PIE, we subtract out the cases where both the $1$ 's and the $0$ 's are consecutive. We do this because when counting the ways to order the $1$ 's, we counted all of these cases once. Then, we did so again when ordering the $0$ 's. So, to only have all of these cases once, we must subtract them. If $1$ is the leftmost digit, then there are $20$ cases where all the $1$ 's and $0$ 's are consecutive (we basically are choosing how many $1$ 's are consecutive, and there are $20$ possibilities. All other digits become $0$ , which are automatically consecutive since the $1$ 's are consecutive. There are also $20$ cases when $0$ is the left-most digit. Thus, there are a total of $211 + 211 - 20 - 20 = \boxed{382}$ as acceptable answers. | E | 382 |
c32aee3eeec4e2f29eecdcb2eec1549a | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_14 | Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$ | The last number that Bernardo says has to be between 950 and 999. Note that $1\rightarrow 2\rightarrow 52\rightarrow 104\rightarrow 154\rightarrow 308\rightarrow 358\rightarrow 716\rightarrow 766$ contains 4 doubling actions. Thus, we have $x \rightarrow 2x \rightarrow 2x+50 \rightarrow 4x+100 \rightarrow 4x+150 \rightarrow 8x+300 \rightarrow 8x+350 \rightarrow 16x+700$
Thus, $950<16x+700<1000$ . Then, $16x>250 \implies x \geq 16$
Because we are looking for the smallest integer $x$ $x=16$ . Our answer is $1+6=\boxed{7}$ , which is A. | null | 7 |
c32aee3eeec4e2f29eecdcb2eec1549a | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_14 | Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$ | Work backwards. The last number Bernardo produces must be in the range $[950,999]$ . That means that before this, Silvia must produce a number in the range $[475,499]$ . Before this, Bernardo must produce a number in the range $[425,449]$ . Before this, Silvia must produce a number in the range $[213,224]$ . Before this, Bernardo must produce a number in the range $[163,174]$ . Before this, Silvia must produce a number in the range $[82,87]$ . Before this, Bernardo must produce a number in the range $[32,37]$ . Before this, Silvia must produce a number in the range $[16,18]$ . Silvia could not have added 50 to any number before this to obtain a number in the range $[16,18]$ , hence the minimum $N$ is 16 with the sum of digits being $\boxed{7}$ | A | 7 |
c32aee3eeec4e2f29eecdcb2eec1549a | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_14 | Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$ | If our first number is $N,$ then the sequence of numbers will be \[2N,~2N+50,~4N+100,~4N+150,~8N+300,~8N+350,~16N+700,~16N+750\] Note that we cannot go any further because doubling gives an extra $1500$ at the end, which is already greater than $1000.$ The smallest $N$ will be given if $16N+750>1000>16N+700 \implies 15<N<19.$ Since the problem asks for the smallest possible value of $N,$ we get $16,$ and the sum of its digits is $1+6=\boxed{7}$ | A | 7 |
e75074ad4e52a7433b02b479607f620f | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_16 | Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$ | Let the ordered triple $(a,b,c)$ denote that $a$ songs are liked by Amy and Beth, $b$ songs by Beth and Jo, and $c$ songs by Jo and Amy. The only possible triples are $(1,1,1), (2,1,1), (1,2,1)(1,1,2)$
To show this, observe these are all valid conditions. Second, note that none of $a,b,c$ can be bigger than 3. Suppose otherwise, that $a = 3$ . Without loss of generality, say that Amy and Beth like songs 1, 2, and 3. Then because there is at least one song liked by each pair of girls, we require either $b$ or $c$ to be at least 1. In fact, we require either $b$ or $c$ to equal 1, otherwise there will be a song liked by all three. Suppose $b = 1$ . Then we must have $c=0$ since no song is liked by all three girls, a contradiction.
Case 1 : How many ways are there for $(a,b,c)$ to equal $(1,1,1)$ ? There are 4 choices for which song is liked by Amy and Beth, 3 choices for which song is liked by Beth and Jo, and 2 choices for which song is liked by Jo and Amy. The fourth song can be liked by only one of the girls, or none of the girls, for a total of 4 choices. So $(a,b,c)=(1,1,1)$ in $4\cdot3\cdot2\cdot4 = 96$ ways.
Case 2 : To find the number of ways for $(a,b,c) = (2,1,1)$ , observe there are $\binom{4}{2} = 6$ choices of songs for the first pair of girls. There remain 2 choices of songs for the next pair (who only like one song). The last song is given to the last pair of girls. But observe that we let any three pairs of the girls like two songs, so we multiply by 3. In this case there are $6\cdot2\cdot3=36$ ways for the girls to like the songs.
That gives a total of $96 + 36 = 132$ ways for the girls to like the songs, so the answer is $\boxed{132}$ | B | 132 |
e75074ad4e52a7433b02b479607f620f | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_16 | Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$ | Let $AB, BJ$ , and $AJ$ denote a song that is liked by Amy and Beth (but not Jo), Beth and Jo (but not Amy), and Amy and Jo (but not Beth), respectively. Similarly, let $A, B, J,$ and $N$ denote a song that is liked by only Amy, only Beth, only Jo, and none of them, respectively. Since we know that there is at least $1\: AB, BJ$ , and $AJ$ , they must be $3$ songs out of the $4$ that Amy, Beth, and Jo listened to. The fourth song can be of any type $N, A, B, J, AB, BJ$ , and $AJ$ (there is no $ABJ$ because no song is liked by all three, as stated in the problem.) Therefore, we must find the number of ways to rearrange $AB, BJ, AJ$ , and a song from the set $\{N, A, B, J, AB, BJ, AJ\}$
Case 1: Fourth song = $N, A, B, J$
Note that in Case 1, all four of the choices for the fourth song are different from the first three songs.
Number of ways to rearrange = $(4!)$ rearrangements for each choice $*\: 4$ choices = $96$
Case 2: Fourth song = $AB, BJ, AJ$
Note that in Case $2$ , all three of the choices for the fourth song repeat somewhere in the first three songs.
Number of ways to rearrange = $(4!/2!)$ rearrangements for each choice $*\: 3$ choices = $36$
$96 + 36 = \boxed{132}$ | B | 132 |
e75074ad4e52a7433b02b479607f620f | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_16 | Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$ | There are $\binom{4}{3}$ ways to choose the three songs that are liked by the three pairs of girls.
There are $3!$ ways to determine how the three songs are liked, or which song is liked by which pair of girls.
In total, there are $\binom{4}{3}\cdot3!$ possibilities for the first $3$ songs.
There are $3$ cases for the 4th song, call it song D.
Case $1$ : D is disliked by all $3$ girls $\implies$ there is only $1$ possibility.
Case $2$ : D is liked by exactly $1$ girl $\implies$ there are $3$ possibility.
Case $3$ : D is liked by exactly $2$ girls $\implies$ there are $3$ pairs of girls to choose from. However, there's overlap when the other song liked by the same pair of girl is counted as the 4th song at some point, in which case D would be counted as one of the first $3$ songs liked by the same girls.
Counting the overlaps, there are $3$ ways to choose the pair with overlaps and $4\cdot3=12$ ways to choose what the other $2$ pairs like independently. In total, there are $3\cdot12=36$ overlapped possibilities.
Finally, there are $\binom{4}{3}\cdot3!\cdot(3+1+3)-36=132$ ways for the songs to be likely by the girls. $\boxed{132}$ | B | 132 |
cbde0b1c6d709b543ffd0abc281b35b0 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_18 | Let $(a_1,a_2, \dots ,a_{10})$ be a list of the first 10 positive integers such that for each $2 \le i \le 10$ either $a_i+1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880$ | This problem is worded awkwardly. More simply, it asks: “How many ways can you order numbers 1-10 so that each number is one above or below some previous term?”
Then, the method becomes clear. For some initial number, WLOG examine the numbers greater than it. They always must appear in ascending order later in the list, though not necessarily as adjacent terms. Then, for some initial number, the number of possible lists is just the number of combination where this number of terms can be placed in 9 slots. For 9, that’s 1 number in 9 potential slots. For 8, that’s 2 numbers in 9 potential slots.
\[\binom{9}{0} + \binom{9}{1} + \cdots + \binom{9}{9} =512 \implies \boxed{512}\] | B | 512 |
cbde0b1c6d709b543ffd0abc281b35b0 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_18 | Let $(a_1,a_2, \dots ,a_{10})$ be a list of the first 10 positive integers such that for each $2 \le i \le 10$ either $a_i+1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880$ | For a list ${a_1, a_2, \dots, a_k}$ with $k$ terms, $2$ valid lists with $k+1$ terms can be created by $2$ ways:
1. Add $a_{k+1}$ to the end of the list, making a new list ${a_1, a_2, \dots, a_k, a_{k+1} }$
2. Increase the value of all existing terms by one, making a new list ${a_2, a_3, \dots, a_{k+1}}$ . Then add $a_1$ to the end of the list, making a new list ${a_2, a_3, \dots, a_{k+1}, a_1}$
Let $F(n)$ be the number of lists with $n$ elements, $F(n) = 2 \cdot F(n-1)$ . As $F(2) = 2$ $F(n) = 2^{n-1}$ $F(10) = 2^9 = \boxed{512}$ | B | 512 |
ce4f3f3d018f7f535616e7c011c76022 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_20 | A trapezoid has side lengths 3, 5, 7, and 11. The sum of all the possible areas of the trapezoid can be written in the form of $r_1\sqrt{n_1}+r_2\sqrt{n_2}+r_3$ , where $r_1$ $r_2$ , and $r_3$ are rational numbers and $n_1$ and $n_2$ are positive integers not divisible by the square of any prime. What is the greatest integer less than or equal to $r_1+r_2+r_3+n_1+n_2$
$\textbf{(A)}\ 57\qquad\textbf{(B)}\ 59\qquad\textbf{(C)}\ 61\qquad\textbf{(D)}\ 63\qquad\textbf{(E)}\ 65$ | Name the trapezoid $ABCD$ , where $AB$ is parallel to $CD$ $AB<CD$ , and $AD<BC$ . Draw a line through $B$ parallel to $AD$ , crossing the side $CD$ at $E$ . Then $BE=AD$ $EC=DC-DE=DC-AB$ . One needs to guarantee that $BE+EC>BC$ , so there are only three possible trapezoids:
\[AB=3, BC=7, CD=11, DA=5, CE=8\] \[AB=5, BC=7, CD=11, DA=3, CE=6\] \[AB=7, BC=5, CD=11, DA=3, CE=4\]
In the first case, by Law of Cosines, $\cos(\angle BCD) = (8^2+7^2-5^2)/(2\cdot 7\cdot 8) = 11/14$ , so $\sin (\angle BCD) = \sqrt{1-121/196} = 5\sqrt{3}/14$ . Therefore the area of this trapezoid is $\frac{1}{2} (3+11) \cdot 7 \cdot 5\sqrt{3}/14 = \frac{35}{2}\sqrt{3}$
In the second case, $\cos(\angle BCD) = (6^2+7^2-3^2)/(2\cdot 6\cdot 7) = 19/21$ , so $\sin (\angle BCD) = \sqrt{1-361/441} = 4\sqrt{5}/21$ . Therefore the area of this trapezoid is $\frac{1}{2} (5+11) \cdot 7 \cdot 4\sqrt{5}/21 =\frac{32}{3}\sqrt{5}$
In the third case, $\angle BCD = 90^{\circ}$ , therefore the area of this trapezoid is $\frac{1}{2} (7+11) \cdot 3 = 27$
So $r_1 + r_2 + r_3 + n_1 + n_2 = 17.5 + 10.666... + 27 + 3 + 5$ , which rounds down to $\boxed{63}$ | D | 63 |
ce4f3f3d018f7f535616e7c011c76022 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_20 | A trapezoid has side lengths 3, 5, 7, and 11. The sum of all the possible areas of the trapezoid can be written in the form of $r_1\sqrt{n_1}+r_2\sqrt{n_2}+r_3$ , where $r_1$ $r_2$ , and $r_3$ are rational numbers and $n_1$ and $n_2$ are positive integers not divisible by the square of any prime. What is the greatest integer less than or equal to $r_1+r_2+r_3+n_1+n_2$
$\textbf{(A)}\ 57\qquad\textbf{(B)}\ 59\qquad\textbf{(C)}\ 61\qquad\textbf{(D)}\ 63\qquad\textbf{(E)}\ 65$ | Let the area of the trapezoid be $S$ , the area of the triangle be $S_1$ , the area of the parallelogram be $S_2$
By Heron's Formula $S_1 = \sqrt{\frac{b+c+d-a}{2} \cdot \frac{c+d-a-b}{2} \cdot \frac{a+b+d-c}{2} \cdot \frac{b+c-a-d}{2}}$
$S_2 = \frac{S_1 \cdot 2}{c-a} \cdot a = \frac{2aS_1}{c-a}$
$S = S_1 + S_2 = S_1(1+\frac{2a}{c-a}) = S_1 \cdot \frac{c+a}{c-a} = \frac14 \cdot \frac{c+a}{c-a} \cdot \sqrt{(b+c+d-a)(c+d-a-b)(a+b+d-c)(b+c-a-d)}$
If $a = 3$ $b = 7$ $c = 11$ $d = 5$
$S = \frac14 \cdot \frac{14}{8} \cdot \sqrt{(7+11+5-3)(11+5-3-7)(3+7+5-11)(7+11-3-5)} = \frac{35\sqrt{3}}{2}$
If $a = 3$ $b = 11$ $c = 5$ $d = 7$
$S = \frac14 \cdot \frac{8}{2} \cdot \sqrt{(11+5+7-3)(5+7-3-11)(3+5+7-11)(11+5-3-7)}$ , which is impossible as $5+7-3-11 = -2$
If $a = 3$ $b = 5$ $c = 7$ $d = 11$
$S = \frac14 \cdot \frac{10}{4} \cdot \sqrt{(5+7+11-3)(7+11-3-5)(3+5+11-7)(5+7-11-3)}$ , which is impossible as $5+7-11-3 = -2$
If $a = 5$ $b = 11$ $c = 7$ $d = 3$
$S = \frac14 \cdot \frac{12}{2} \cdot \sqrt{(11+7+3-5)(7+3-5-11)(5+11+3-7)(11+7-5-3)}$ , which is impossible as $7+3-5-11 = -6$
If $a = 5$ $b = 3$ $c = 11$ $d = 7$
$S = \frac14 \cdot \frac{16}{6} \cdot \sqrt{(3+11+7-5)(11+7-5-3)(5+3+7-11)(3+11-5-7)} = \frac{32\sqrt{5}}{3}$
If $a = 7$ $b = 3$ $c = 11$ $d = 5$
$S = \frac14 \cdot \frac{18}{4} \cdot \sqrt{(3+11+5-7)(11+5-7-)(7+5+5-11)(3+11-7-5)} = 27$
Thus the answer is $\frac{35}{2} + \frac{32}{3} + 27 + 3 + 5$ , which rounds down to $\boxed{63}$ | D | 63 |
8f431a3a666299e78ee82b767845d6c7 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_22 | A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$ | [asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,red); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,blue); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,blue); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,green); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,blue); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,green); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,green); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,orange); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,green); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,orange); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,red); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,blue); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
There is $1$ way to get to any of the red arrows. From the first (top) red arrow, there are $2$ ways to get to each of the first and the second (top 2) blue arrows; from the second (bottom) red arrow, there are $3$ ways to get to each of the first and the second blue arrows. So there are in total $5$ ways to get to each of the blue arrows.
From each of the first and second blue arrows, there are respectively $4$ ways to get to each of the first and the second green arrows; from each of the third and the fourth blue arrows, there are respectively $8$ ways to get to each of the first and the second green arrows. Therefore there are in total $5 \cdot (4+4+8+8) = 120$ ways to get to each of the green arrows.
Finally, from each of the first and second green arrows, there are respectively $2$ ways to get to the first orange arrow; from each of the third and the fourth green arrows, there are $3$ ways to get to the first orange arrow. Therefore there are $120 \cdot (2+2+3+3) = 1200$ ways to get to each of the orange arrows, hence $2400$ ways to get to the point $B$ $\boxed{2400}$ | E | 2400 |
8f431a3a666299e78ee82b767845d6c7 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_22 | A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$ | [asy] size(6cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)); draw((0.0,0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)); draw((4.0, 0.0)--(6.0,0.0)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(3.0,-1.7320508075688772), red); draw((7.0,1.7320508075688772)--(6.0,-0.0)--(7.0,-1.7320508075688772), blue); dot((0,0)); label("$A$",(0,0),WNW); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,red); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,blue); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,blue); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,blue); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,red); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,blue); [/asy]
For every blue arrow, there are $2\cdot 2=4$ ways to reach it without using the reverse arrow since the bug can choose any of $2$ red arrows to pass through and $2$ black arrows to pass through. If the bug passes through the white arrow, the red arrow that the bug travels through must be the closest to the first black arrow. Otherwise, the bug will have to travel through both red segments, which is impossible because now there is no path to take after the bug emerges from the reverse arrow. Similarly, with the blue segments, the second black arrow taken must be the one that is closest to the blue arrow that was taken. Also, it is trivial that the two black arrows taken must be different. Therefore, if the reverse arrow is taken, the blue arrow taken determines the entire path and there is $1$ path for every arrow. Since the bug cannot return once it takes a blue arrow, the answer must be divisible by $5$ $\boxed{2400}$ is the only answer that is. | E | 2400 |
8f431a3a666299e78ee82b767845d6c7 | https://artofproblemsolving.com/wiki/index.php/2012_AMC_12B_Problems/Problem_22 | A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$ | We use casework.
The main thing to notice is that, if the bug does not go backwards, then every vertical set of arrows can be used, as the bug could travel straight downwards and then use any arrow to continue right.
Note: The motivation is quite weird so follow my numbers as they start from the left (point A) and go right (point B).
Case 1: Bug does not go backwards.
The number of cases for this is just each vertical set of arrows multiplied to each other (if you don't understand where I'm coming from, try to understand where these numbers come from!)
And so we have $2*2*4*4*4*2*2 = 2^{10}$ cases.
Case 2: The bug goes backwards once, either at the first arrow or third arrow.
Here, we have to count the fact that there is a horizontal midline that the bug could not cross, or otherwise it would be stepping on the same edge twice.
Back on first arrow: $2*1*2*4*4*2*2 = 2^{8}$ cases.
Back on third arrow: $2*2*4*4*4*1 = 2^{8}$ cases.
Case 3: The bug goes backwards once, at the second arrow.
Same thing as above, except since there are 4 arrows in the vertical set (plus one for the backwards arrow), then the calculations are a bit different.
We have $2*2*4*1*2*4*2*2 = 2^{9}$ cases.
Notice that the first and third back arrows decrease the number of cases by a factor of $2^2$ and the second back arrow decreases the number of cases by $2^1$ . Hence,
1st + 2nd = $2^7$
2nd + 3rd = $2^7$
1st + 3rd = $2^6$
1st + 2nd + 3rd = $2^5$
And so the number of cases in total is $2^{10} + 2^9 + 2^8 + 2^8 + 2^7 + 2^7 + 2^6 + 2^5 \Rightarrow 1024 + 512 + 256 + 256 + 128 + 128 + 64 + 32 = \boxed{2400}$ | null | 2400 |
0a4249e47a98a87337d5e55e97421574 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_1 | A cell phone plan costs $20$ dollars each month, plus $5$ cents per text message sent, plus $10$ cents for each minute used over $30$ hours. In January Michelle sent $100$ text messages and talked for $30.5$ hours. How much did she have to pay?
$\textbf{(A)}\ 24.00 \qquad \textbf{(B)}\ 24.50 \qquad \textbf{(C)}\ 25.50 \qquad \textbf{(D)}\ 28.00 \qquad \textbf{(E)}\ 30.00$ | The base price of Michelle's cell phone plan is $20$ dollars.
If she sent $100$ text messages and it costs $5$ cents per text, then she must have spent $500$ cents for texting, or $5$ dollars. She talked for $30.5$ hours, but $30.5-30$ will give us the amount of time exceeded past 30 hours. $30.5-30=.5$ hours $=30$ minutes.
Since the price for phone calls is $10$ cents per minute, the additional amount Michelle has to pay for phone calls is $30*10=300$ cents, or $3$ dollars.
Adding $20+5+3$ dollars $\boxed{28}$ | D | 28 |
e6eca2a5303a898d12baf574b0b27f85 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_3 | A small bottle of shampoo can hold $35$ milliliters of shampoo, whereas a large bottle can hold $500$ milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy?
$\textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$ | To find how many small bottles we need, we can simply divide $500$ by $35$ . This simplifies to $\frac{100}{7}=14 \frac{2}{7}.$ Since the answer must be an integer greater than $14$ , we have to round up to $15$ bottles, or $\boxed{15}$ | E | 15 |
e6eca2a5303a898d12baf574b0b27f85 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_3 | A small bottle of shampoo can hold $35$ milliliters of shampoo, whereas a large bottle can hold $500$ milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy?
$\textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$ | We double $35$ to get $70.$ We see that $70\cdot7=490,$ which is very close to $500.$ Thus, $2\cdot7+1=\boxed{15}$ bottles are enough.
~Technodoggo | E | 15 |
bfdb3cdf6ed620113d9e4cb373721f2b | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_5 | Last summer $30\%$ of the birds living on Town Lake were geese, $25\%$ were swans, $10\%$ were herons, and $35\%$ were ducks. What percent of the birds that were not swans were geese?
$\textbf{(A)}\ 20 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ 60$ | To simplify the problem, WLOG, let us say that there were a total of $100$ birds. The number of birds that are not swans is $75$ . The number of geese is $30$ . Therefore the percentage is just $\frac{30}{75} \times 100 = 40 \Rightarrow \boxed{40}$ | C | 40 |
435b20e4f88609c611aa8c2f8d071007 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_6 | The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$ | For the points made from two-point shots and from three-point shots to be equal, the numbers of made shots are in a $3:2$ ratio. Therefore, assume they made $3x$ and $2x$ two- and three- point shots, respectively, and thus $3x+1$ free throws. The total number of points is \[2 \times (3x) + 3 \times (2x) + 1 \times (3x+1) = 15x+1\]
Set that equal to $61$ , we get $x = 4$ , and therefore the number of free throws they made $3 \times 4 + 1 = 13 \Rightarrow \boxed{13}$ | A | 13 |
435b20e4f88609c611aa8c2f8d071007 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_6 | The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$ | Let $x$ be the number of free throws. Then the number of points scored by two-pointers is $2(x-1)$ and the same goes for three-pointers because they scored the same number of points with twos and threes. Thus, our equation is $x+4(x-1) = 61 \Rightarrow x=13$ , giving us $\boxed{13}$ for an answer. | A | 13 |
435b20e4f88609c611aa8c2f8d071007 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_6 | The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$ | We let $a$ be the number of $2$ -point shots, $b$ be the number of $3$ -point shots, and $x$ be the number of free throws. We are looking for $x.$ We know that $2a=3b$ , and that $x=a+1$ . Also, $2a+3b+1x=61$ . We can see
\begin{align*} a&=x-1 \\ 2a &= 2x-2 \\ 3a &= 2x-2. \\ \end{align*}
Plugging this into $2a+3b+1x=61$ , we see
\begin{align*} 2x-2+2x-2+x &= 61 \\ 5x-4 &= 61 \\ 5x &= 65 \\ x &= \boxed{13} | A | 13 |
d1730fe7b09e9798011f01658d910776 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_7 | A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$ | The total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Since $1771$ is the product of three sets of values, we can begin with prime factorization, since it gives some insight into the values: $7, 11, 23$ . Since neither $(C)$ nor $(E)$ are any of these factors, they can be eliminated immediately, leaving $(A)$ $(B)$ , and $(D)$
Beginning with $(A) 7$ , we see that the number of pencils purchased by each student must be either $11$ or $23$ . However, the problem states that the price of each pencil must exceed the number of pencils purchased, so we can eliminate this.
Continuing with $(B) 11$ , we can conclude that the only case that fulfils the restrictions are that there are $23$ students who each purchased $7$ such pencils, so the answer is $\boxed{11}$ . We can apply the same logic to $(E)$ as we applied to $(A)$ if one wants to make doubly sure. | B | 11 |
d1730fe7b09e9798011f01658d910776 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_7 | A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$ | We know the total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Using prime factorization like in the solution above, we see that there is only one combination of three whole numbers whose product is equal to $1771$ $7, 11, 23$ (without using $1$ ). So we know that $7, 11$ , and $23$ must be the number of students, the number of pencils purchased by each student and the price of each pencil in cents.
We know that $23$ must be the number of students, as it is the only number that makes up the majority of 30.
We pick the greater of the remaining numbers for the price of each pencil in cents, which is $11$
Therefore, our answer is $\boxed{11}$ | B | 11 |
d1730fe7b09e9798011f01658d910776 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_7 | A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$ | We let $s$ be the number of students that bought pencils at the bookstore, $c$ be the cost of each pencil in cents, and $n$ the number of pencils each student bought. Thus, we are looking for $c.$ Since a majority of the students in the class bought pencils at the bookstore, $s>\dfrac{30}2=15.$ (s>15) We also know that $n>1$ and $c>n>1.$ Finally, $s\cdot c\cdot n=1771.$ We can factor $1771$ as $7\cdot11\cdot23.$ Since $n>15$ and $c>n>1,$ none of them can be $1,$ and therefore $c,n,$ and $s$ are $7,11,$ and $23$ in some order. We know that $n>15,$ so $n$ must be $23.$ $c>n,$ so $c=11$ and $n=7.$ Thus, $c=\boxed{11}$ cents.
~Technodoggo | B | 11 |
aee3d3b69245b0fd1ab4eac5ea6c961c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_8 | In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$ | Let $A=x$ . Then from $A+B+C=30$ , we find that $B=25-x$ . From $B+C+D=30$ , we then get that $D=x$ . Continuing this pattern, we find $E=25-x$ $F=5$ $G=x$ , and finally $H=25-x$ . So $A+H=x+25-x=25 \rightarrow \boxed{25}$ | C | 25 |
aee3d3b69245b0fd1ab4eac5ea6c961c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_8 | In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$ | Given that the sum of 3 consecutive terms is 30, we have $(A+B+C)+(C+D+E)+(F+G+H)=90$ and $(B+C+D)+(E+F+G)=60$
It follows that $A+B+C+D+E+F+G+H=85$ because $C=5$
Subtracting, we have that $A+H=25\rightarrow \boxed{25}$ | C | 25 |
aee3d3b69245b0fd1ab4eac5ea6c961c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_8 | In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$ | From the given information, we can deduce the following equations:
$A+B=25, B+D=25, D+E=25, D+E+F=30, E+F+G =30$ , and $F+G+H=30$
We can then cleverly manipulate the equations above by adding and subtracting them to be left with the answer.
$(A+B)-(B+D)=25-25 \implies (A-D)=0$
$(A-D)+(D+E)=0+25 \implies (A+E)=25$
$(A+E)-(E+F+G)=25-30 \implies (A-F-G)=-5$ (Notice how we don't use $D+E+F=30$
$(A-F-G)+(F+G+H)=-5+30 \implies (A+H)=25$
Therefore, we have $A+H=25 \rightarrow \boxed{25}$ | C | 25 |
aee3d3b69245b0fd1ab4eac5ea6c961c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_8 | In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$ | Since all of the answer choices are constants, it shouldn't matter what we pick $A$ and $B$ to be, so let $A = 20$ and $B = 5$ . Then $D = 30 - B -C = 20$ $E = 30 - D - C = 5$ $F = 30 - D - E =5$ , and so on until we get $H = 5$ . Thus $A + H = \boxed{25}$ | C | 25 |
aee3d3b69245b0fd1ab4eac5ea6c961c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_8 | In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$ | Assume the sequence is \[15,10,5,15,10,5,15,10\]
Thus, $15+10=\boxed{25}$ | C | 25 |
4be6e3e5ecd33bcd9aaff33160733430 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_9 | At a twins and triplets convention, there were $9$ sets of twins and $6$ sets of triplets, all from different families. Each twin shook hands with all the twins except his/her siblings and with half the triplets. Each triplet shook hands with all the triplets except his/her siblings and with half the twins. How many handshakes took place?
$\textbf{(A)}\ 324 \qquad \textbf{(B)}\ 441 \qquad \textbf{(C)}\ 630 \qquad \textbf{(D)}\ 648 \qquad \textbf{(E)}\ 882$ | There are $18$ total twins and $18$ total triplets. Each of the twins shakes hands with the $16$ twins not in their family and $9$ of the triplets, a total of $25$ people. Each of the triplets shakes hands with the $15$ triplets not in their family and $9$ of the twins, for a total of $24$ people. Dividing by two to accommodate the fact that each handshake was counted twice, we get a total of $\frac{1}{2}\times 18 \times (25+24) = 9 \times 49 = 441 \rightarrow \boxed{441}$ | B | 441 |
a5740f20267ad85c12be16e437a30cc0 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_12 | A power boat and a raft both left dock $A$ on a river and headed downstream. The raft drifted at the speed of the river current. The power boat maintained a constant speed with respect to the river. The power boat reached dock $B$ downriver, then immediately turned and traveled back upriver. It eventually met the raft on the river 9 hours after leaving dock $A.$ How many hours did it take the power boat to go from $A$ to $B$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 3.5 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 4.5 \qquad \textbf{(E)}\ 5$ | WLOG let the speed of the river be 0. This is allowed because the problem never states that the speed of the current has to have a magnitude greater than 0. In this case, when the powerboat travels from $A$ to $B$ , the raft remains at $A$ . Thus the trip from $A$ to $B$ takes the same time as the trip from $B$ to the raft. Since these times are equal and sum to $9$ hours, the trip from $A$ to $B$ must take half this time, or $4.5$ hours. The answer is thus $\boxed{4.5}$ | D | 4.5 |
a5740f20267ad85c12be16e437a30cc0 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_12 | A power boat and a raft both left dock $A$ on a river and headed downstream. The raft drifted at the speed of the river current. The power boat maintained a constant speed with respect to the river. The power boat reached dock $B$ downriver, then immediately turned and traveled back upriver. It eventually met the raft on the river 9 hours after leaving dock $A.$ How many hours did it take the power boat to go from $A$ to $B$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 3.5 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 4.5 \qquad \textbf{(E)}\ 5$ | What's important in this problem is to consider everything in terms of the power boat and the raft, since that is how the problem is given to us. Think of the blue arrow as the power boat and the red arrow as the raft in the following three diagrams, which represent different time intervals of the problem.
[asy] size(8cm,8cm); pair A, B; A=(-3,4); B=(3,4); draw(A--B); label("$A$",A,S); label("$B$",B,S); arrow((-2.5,6.4),dir(180),blue); arrow((-2.5,6.2),dir(180),red); pair A, B; A=(-3,5); B=(3,5); draw(A--B); label("$A$",A,S); label("$B$",B,S); arrow((2.6,5.4),dir(360),blue); arrow((-0.5,5.2),dir(180),red); pair A, B; A=(-3,6); B=(3,6); draw(A--B); label("$A$",A,S); label("$B$",B,S); arrow((.3,4.4),dir(360),blue); arrow((1.1,4.2),dir(180),red);[/asy]
Thinking about the distance covered as their distances with respect to each other, they are $0$ distance apart in the first diagram when they haven't started to move yet, some distance $d$ apart in the second diagram when the power boat reaches $B$ , and again $0$ distance apart in the third diagram when they meet. Therefore, with respect to each other, the boat and the raft cover a distance of $d$ on the way there, and again cover a distance of $d$ on when drawing closer. This makes sense, because from the 1st diagram to the second, the raft moves in the same direction as the boat, while from the 2nd to the 3rd, the boat and raft move in opposite directions.
Let $b$ denote the speed of the power boat (only the power boat, not factoring in current) and $r$ denote the speed of the raft, which, as given by the problem, is also equal to the speed of the current. Thus, from $A$ to $B$ , the boat travels at a velocity of $b+r$ , and on the way back, travels at a velocity of $-(b-r)=r-b$ , since the current aids the boat on the way there, and goes against the boat on the way back. With respect to the raft then, the boat's velocity from $A$ to $B$ becomes $(r+b)-r=b$ , and on the way back it becomes $(r-b)-r=-b$ . Since the boat's velocities with respect to the raft are exact opposites, $b$ and $-b$ , we therefore know that the boat and raft travel apart from each other at the same rate that they travel toward each other.
From this, we have that the boat travels a distance $d$ at rate $b$ with respect to the raft both on the way to $B$ and on the way back. Thus, using $\dfrac{distance}{speed}=time$ , we have $\dfrac{2d}{b}=9\text{ hours}$ , and to see how long it took to travel half the distance, we have $\dfrac{d}{b}=4.5\text{ hours}\implies\boxed{4.5}$ | D | 4.5 |
a5740f20267ad85c12be16e437a30cc0 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_12 | A power boat and a raft both left dock $A$ on a river and headed downstream. The raft drifted at the speed of the river current. The power boat maintained a constant speed with respect to the river. The power boat reached dock $B$ downriver, then immediately turned and traveled back upriver. It eventually met the raft on the river 9 hours after leaving dock $A.$ How many hours did it take the power boat to go from $A$ to $B$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 3.5 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 4.5 \qquad \textbf{(E)}\ 5$ | Let $t$ be the time it takes the power boat to go from $A$ to $B$ in hours, $r$ be the speed of the river current (and thus also the raft), and $p$ to be the speed of the power boat with respect to the river.
Using $d = rt$ , the raft covers a distance of $9r$ , the distance from $A$ to $B$ is $(p + r)t$ , and the distance from $B$ to where the raft and power boat met up is $(9 - t)(p - r)$
Then, $9r + (9 - t)(p - r) = (p + r)t$ . Solving for $t$ , we get $t = 4.5$ , which is $\boxed{4.5}$ | D | 4.5 |
ff11349fcc61a3a1527f1221e717cb57 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_13 | Triangle $ABC$ has side-lengths $AB = 12, BC = 24,$ and $AC = 18.$ The line through the incenter of $\triangle ABC$ parallel to $\overline{BC}$ intersects $\overline{AB}$ at $M$ and $\overline{AC}$ at $N.$ What is the perimeter of $\triangle AMN?$
$\textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42$ | Let $O$ be the incenter of $\triangle{ABC}$ . Because $\overline{MO} \parallel \overline{BC}$ and $\overline{BO}$ is the angle bisector of $\angle{ABC}$ , we have
\[\angle{MBO} = \angle{CBO} = \angle{MOB} = \frac{1}{2}\angle{MBC}\]
It then follows due to alternate interior angles and base angles of isosceles triangles that $MO = MB$ . Similarly, $NO = NC$ . The perimeter of $\triangle{AMN}$ then becomes \begin{align*} AM + MN + NA &= AM + MO + NO + NA \\ &= AM + MB + NC + NA \\ &= AB + AC \\ &= 30 \rightarrow \boxed{30} | B | 30 |
ff11349fcc61a3a1527f1221e717cb57 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_13 | Triangle $ABC$ has side-lengths $AB = 12, BC = 24,$ and $AC = 18.$ The line through the incenter of $\triangle ABC$ parallel to $\overline{BC}$ intersects $\overline{AB}$ at $M$ and $\overline{AC}$ at $N.$ What is the perimeter of $\triangle AMN?$
$\textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42$ | Let $O$ be the incenter. $AO$ is the angle bisector of $\angle MAN$ . Let the angle bisector of $\angle BAC$ meets $BC$ at $P$ and the angle bisector of $\angle ABC$ meets $AC$ at $Q$ . By applying both angle bisector theorem and Menelaus' theorem,
$\frac{AO}{OP} \times \frac{BP}{BC} \times \frac{CQ}{QA} = 1$
$\frac{AO}{OP} \times \frac{12}{30} \times \frac{24}{12} = 1$
$\frac{AO}{OP}=\frac{5}{4}$
$\frac{AO}{AP}=\frac{5}{9}$
Perimeter of $\triangle AMN = \frac{12+24+18}{9} \times 5 = 30 \rightarrow \boxed{30}$ | B | 30 |
ff11349fcc61a3a1527f1221e717cb57 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_13 | Triangle $ABC$ has side-lengths $AB = 12, BC = 24,$ and $AC = 18.$ The line through the incenter of $\triangle ABC$ parallel to $\overline{BC}$ intersects $\overline{AB}$ at $M$ and $\overline{AC}$ at $N.$ What is the perimeter of $\triangle AMN?$
$\textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42$ | Like in other solutions, let $O$ be the incenter of $\triangle ABC$ . Let $AO$ intersect $BC$ at $D$ . By the angle bisector theorem, $\frac{BD}{DC} = \frac{AB}{AC} = \frac{12}{18} = \frac{2}{3}$ . Since $BD+DC = 24$ , we have $\frac{BD}{24-BD} = \frac{2}{3}$ , so $3BD = 48 - 2BD$ , so $BD = \frac{48}{5} = 9.6$ . By the angle bisector theorem on $\triangle ABD$ , we have $\frac{DO}{OA} = \frac{BD}{BA} = \frac{4}{5} = 0.8$ , so $\frac{DA}{OA} = 1 + \frac{DO}{OA} = \frac{9}{5} = 1.8$ , so $\frac{AO}{AD} = \frac{5}{9}$ . Because $\triangle AMN \sim \triangle ABC$ , the perimeter of $\triangle AMN$ must be $\frac{5}{9} (12 + 18 + 24) = 30$ , so our answer is $\boxed{30}$ | B | 30 |
ff11349fcc61a3a1527f1221e717cb57 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_13 | Triangle $ABC$ has side-lengths $AB = 12, BC = 24,$ and $AC = 18.$ The line through the incenter of $\triangle ABC$ parallel to $\overline{BC}$ intersects $\overline{AB}$ at $M$ and $\overline{AC}$ at $N.$ What is the perimeter of $\triangle AMN?$
$\textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42$ | We know that the ratio of the perimeter of $\triangle AMN$ and $\triangle ABC$ is the ratio of their heights, and finding the two heights is pretty easy. Note that the height from $A$ to $BC$ is $\frac{9\sqrt{15}}{4}$ from Herons and then $A=\frac{bh}{2}$ and also that the height from $A$ to $MN$ is simply the height from $A$ to $BC$ minus the inradius. We know the area and the semiperimeter so $r=\frac{A}{s}$ which gives us $r=\sqrt{15}$ . Now we know that the altitude from $A$ to $MN$ is $\frac{5\sqrt{15}}{4}$ so the ratios of the heights from $A$ for $\triangle AMN$ and $\triangle ABC$ is $\frac{5}{9}$ . Thus the perimeter of $\triangle AMN$ is $\frac{5}{9} \times 54 = 30$ so our answer is $\boxed{30}$ | B | 30 |
97b249f1a3d8dee31ff3520bb4ff8dad | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_16 | Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520 \qquad \textbf{(B)}\ 2880 \qquad \textbf{(C)}\ 3120 \qquad \textbf{(D)}\ 3250 \qquad \textbf{(E)}\ 3750$ | This solution essentially explains other ways of thinking about the cases stated in Solution 2.
Case 1:
${6\choose5} \cdot 5!$
5 colors need to be chosen from the group of 6. Those 5 colors have 5! distinct arrangements on the pentagon's vertices.
Case 2:
${6\choose4} \cdot4\cdot5\cdot3!$
4 colors need to be chosen from the group of 6. Out of those 4 colors, one needs to be chosen to form a pair of 2 identical colors. Then, for arranging this layout onto the pentagon, one of the five sides (same thing as pair of adjacent vertices) of the pentagon needs to be established for the pair. The remaining 3 unique colors can be arranged 3! different ways on the remaining 3 vertices.
Case 3:
${6\choose3} \cdot {3\choose2} \cdot5\cdot2$
3 colors need to be chosen from the group of 6. Out of those 3 colors, 2 need to be chosen to be the pairs. Then, for arranging this layout onto the pentagon, start out by thinking about the 1 color that is not part of a pair, as it makes things easier. It can be any one of the 5 vertices of the pentagon. The remaining 2 pairs of colors can only be arranged 2 ways on the remaining 4 vertices.
Solving each case and adding them up gets you 3120. $\boxed{3120}$ | C | 3120 |
2ac5084e30e90ed656bc65a6643fcb39 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_18 | Suppose that $\left|x+y\right|+\left|x-y\right|=2$ . What is the maximum possible value of $x^2-6x+y^2$
$\textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$ | Plugging in some values, we see that the graph of the equation $|x+y|+|x-y| = 2$ is a square bounded by $x= \pm 1$ and $y = \pm 1$
Notice that $x^2 - 6x + y^2 = (x-3)^2 + y^2 - 9$ means the square of the distance from a point $(x,y)$ to point $(3,0)$ minus 9. To maximize that value, we need to choose the point in the feasible region farthest from point $(3,0)$ , which is $(-1, \pm 1)$ . Either one, when substituting into the function, yields $\boxed{8}$ | D | 8 |
2ac5084e30e90ed656bc65a6643fcb39 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_18 | Suppose that $\left|x+y\right|+\left|x-y\right|=2$ . What is the maximum possible value of $x^2-6x+y^2$
$\textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$ | Since the equation $|x+y|+|x-y| = 2$ is dealing with absolute values, the following could be deduced: $(x+y)+(x-y)=2$ $(x+y)-(x-y)=2$ $-(x+y)+(x-y)=2$ , and $-(x+y)-(x-y)=2$ . Simplifying would give $x=1$ $y=1$ $y=-1$ , and $x=-1$ . In $x^2-6x+y^2$ , we care most about $-6x,$ since both $x^2$ and $y^2$ are non-negative. To maximize $-6x$ , though, $x$ would have to be -1. Therefore, when $x=-1$ and $y=-1$ or $y=1$ , the equation evaluates to $\boxed{8}$ | D | 8 |
5a440a85777c6401c2a4f0a12277e29e | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_19 | At a competition with $N$ players, the number of players given elite status is equal to $2^{1+\lfloor \log_{2} (N-1) \rfloor}-N$ . Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$
$\textbf{(A)}\ 38 \qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$ | We start with $2^{1+\lfloor\log_{2}(N-1)\rfloor}-N = 19$ . After rearranging, we get $\lfloor\log_{2}(N-1)\rfloor = \log_{2} \left(\frac{N+19}{2}\right)$
Since $\lfloor\log_{2}(N-1)\rfloor$ is a positive integer, $\frac{N+19}{2}$ must be in the form of $2^{m}$ for some positive integer $m$ . From this fact, we get $N=2^{m+1}-19$
If we now check integer values of N that satisfy this condition, starting from $N=19$ , we quickly see that the first values that work for $N$ are $45$ and $109$ , that is, $2^6-19$ and $2^7 -19$ , giving values of $5$ and $6$ for $m$ , respectively. Adding up these two values for $N$ , we get $45 + 109 = 154 \rightarrow \boxed{154}$ | C | 154 |
5a440a85777c6401c2a4f0a12277e29e | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_19 | At a competition with $N$ players, the number of players given elite status is equal to $2^{1+\lfloor \log_{2} (N-1) \rfloor}-N$ . Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$
$\textbf{(A)}\ 38 \qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$ | We examine the value that $2^{1+\lfloor\log_{2}(N-1)\rfloor}$ takes over various intervals. The $\lfloor\log_{2}(N-1)\rfloor$ means it changes on each multiple of 2, like so:
2 --> 1
3 - 4 --> 2
5 - 8 --> 3
9 - 16 --> 4
From this, we see that $2^{1+\lfloor\log_{2}(N-1)\rfloor} - N$ is the difference between the next power of 2 above $2^{\lfloor\log_{2}(N-1)\rfloor}$ and $N$ . We are looking for $N$ such that this difference is 19. The first two $N$ that satisfy this are $45 = 64-19$ and $109=128-19$ for a final answer of $45 + 109 = 154 \rightarrow \boxed{154}$ | C | 154 |
5a440a85777c6401c2a4f0a12277e29e | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_19 | At a competition with $N$ players, the number of players given elite status is equal to $2^{1+\lfloor \log_{2} (N-1) \rfloor}-N$ . Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$
$\textbf{(A)}\ 38 \qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$ | Note that each $N$ is $19$ less than a power of $2$ . So, the answer will be $38$ less than the sum of $2$ powers of $2$ . Adding $38$ to each answer, we get $76$ $128$ $192$ $444$ , and $1062$ . Obviously we can take out $76$ and $1062$ . Also, $128$ will not work because two powers of two will never sum to another power of $2$ (unless they are equal, which is a contradiction to the question). So, we have $192$ and $444$ . Note that $444 = 1 + 443 = 2 + 442 = 4 + 440 = 8 + 436 = 16 + 428 = 32 + 412$ , etc. We quickly see that $444$ will not work, leaving $192$ which corresponds to $\boxed{154}$ . We can also confirm that this works because $192 = 128 + 64 = 2^7 + 2^6$ | C | 154 |
5a440a85777c6401c2a4f0a12277e29e | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_19 | At a competition with $N$ players, the number of players given elite status is equal to $2^{1+\lfloor \log_{2} (N-1) \rfloor}-N$ . Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$
$\textbf{(A)}\ 38 \qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$ | In order to fix the exponent and get rid of the logarithm term, let $N = 2^m + k + 1$ , with $0 \leq k < 2^m$ . Doing so, we see that $\lfloor \log_2{N - 1} \rfloor = m$ , which turns our given relation into \[2^m = 20 + k,\] for which the solutions of the form $(m, k)$ $(5, 12)$ and $(6, 44)$ , follow trivially. Adding up the two values of $N$ gives us $32 + 12 + 1 + 64 + 44 + 1 = 154$ , so the answer is $\boxed{154}$ | C | 154 |
d4aa6fcf866f57db9abc1a04a62a252b | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_20 | Let $f(x)=ax^2+bx+c$ , where $a$ $b$ , and $c$ are integers. Suppose that $f(1)=0$ $50<f(7)<60$ $70<f(8)<80$ $5000k<f(100)<5000(k+1)$ for some integer $k$ . What is $k$
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$ | From $f(1) = 0$ , we know that $a+b+c = 0$
From the first inequality, we get $50 < 49a+7b+c < 60$ . Subtracting $a+b+c = 0$ from this gives us $50 < 48a+6b < 60$ , and thus $\frac{25}{3} < 8a+b < 10$ . Since $8a+b$ must be an integer, it follows that $8a+b = 9$
Similarly, from the second inequality, we get $70 < 64a+8b+c < 80$ . Again subtracting $a+b+c = 0$ from this gives us $70 < 63a+7b < 80$ , or $10 < 9a+b < \frac{80}{7}$ . It follows from this that $9a+b = 11$
We now have a system of three equations: $a+b+c = 0$ $8a+b = 9$ , and $9a+b = 11$ . Solving gives us $(a, b, c) = (2, -7, 5)$ and from this we find that $f(100) = 2(100)^2-7(100)+5 = 19305$
Since $15000 < 19305 < 20000 \to 5000(3) < 19305 < 5000(4)$ , we find that $k = 3 \rightarrow \boxed{3}$ | C | 3 |
d4aa6fcf866f57db9abc1a04a62a252b | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_20 | Let $f(x)=ax^2+bx+c$ , where $a$ $b$ , and $c$ are integers. Suppose that $f(1)=0$ $50<f(7)<60$ $70<f(8)<80$ $5000k<f(100)<5000(k+1)$ for some integer $k$ . What is $k$
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$ | $f(x)$ is some non-monic quadratic with a root at $x=1$ . Knowing this, we'll forget their silly $a$ $b$ , and $c$ and instead write it as $f(x)=p(x-1)(x-r)$
$f(7)=6p(7-r)$ , so $f(7)$ is a multiple of 6. They say $f(7)$ is between 50 and 60, exclusive. Notice that the only multiple of 6 in that range is 54. Thus, $f(7)=6p(7-r)=54$
$f(8)=7p(8-r)$ , so $f(8)$ is a multiple of 7. They say $f(8)$ is between 70 and 80, exclusive. Notice that the only multiple of 7 in that range is 77. Thus, $f(8)=7p(8-r)=77$
Now, we solve a system of equations in two variables.
\begin{align*} 6p(7-r)&=54 \\ 7p(8-r)&=77 \\ \\ p(7-r)&=9 \\ p(8-r)&=11 \\ \\ 7p-pr&=9 \\ 8p-pr&=11 \\ \\ (8p-pr)-(7p-pr)&=11-9 \\ \\ p&=2 \\ \\ 2(7-r)&=9 \\ \\ r&=2.5 \end{align*}
$f(100)=2(100-1)(100-2.5)=19305 \implies k=3 \implies \boxed{3}$ | C | 3 |
d4aa6fcf866f57db9abc1a04a62a252b | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_20 | Let $f(x)=ax^2+bx+c$ , where $a$ $b$ , and $c$ are integers. Suppose that $f(1)=0$ $50<f(7)<60$ $70<f(8)<80$ $5000k<f(100)<5000(k+1)$ for some integer $k$ . What is $k$
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$ | So we know that $a,b,c$ are integers so we can use this to our advantage
$\quad$
Using $f(1)=0$ , we get the equation $a+b+c=0$ and $f(7)=49a+7b+c=5X$ where $X$ is a decimal digit placeholder. (Ex. $X=2$ provides the value $52$
$\quad$
Solving for $b$ using the system of equations, we get $48a+6b=5X$ $\implies$ $b=-8a+ \frac{5X}{6}$
$\quad$
Since we know that $a$ and $b$ are both integers, we know that $\frac{5X}{6}$ $\in$ $\mathbb{Z}$ $\implies$ $X=4$ and by extension $b=-8a+9$
$\quad$
Attempting to solve for $b$ again using the system $f(8)=64a+8b+c=7Y$ $Y$ is another decimal digit placeholder), $f(1)=a+b+c=0$ gives us $b=-9a+ \frac{7Y}{7}$ $\implies$ $Y=7$ $\implies$ $b=-9a+11$
$\quad$
This leads to $-8a+9=-9a+11$ $\implies$ $a=2$ $\implies$ $b=-7$
$\quad$
Plugging in the values of $a$ and $b$ into $f(1)=a+b+c=0$ , we get $c=5$
$\quad$
Substituting the values of $a,b,c$ into $f(100)=10000a+100b+c$ , we get $f(100)=19305$ and $5000k<19305<5000(k+1)$ $\implies$ $k=3$ $\implies$ $\boxed{3}$ | C | 3 |
5dc378b0cb9f715bed8412a7ac64a349 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_21 | Let $f_{1}(x)=\sqrt{1-x}$ , and for integers $n \geq 2$ , let $f_{n}(x)=f_{n-1}(\sqrt{n^2 - x})$ . If $N$ is the largest value of $n$ for which the domain of $f_{n}$ is nonempty, the domain of $f_{N}$ is $[c]$ . What is $N+c$
$\textbf{(A)}\ -226 \qquad \textbf{(B)}\ -144 \qquad \textbf{(C)}\ -20 \qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ 144$ | The domain of $f_{1}(x)=\sqrt{1-x}$ is defined when $x\leq1$ \[f_{2}(x)=f_{1}\left(\sqrt{4-x}\right)=\sqrt{1-\sqrt{4-x}}\]
Applying the domain of $f_{1}(x)$ and the fact that square roots must be positive, we get $0\leq\sqrt{4-x}\leq1$ . Simplifying, the domain of $f_{2}(x)$ becomes $3\leq x\leq4$
Repeat this process for $f_{3}(x)=\sqrt{1-\sqrt{4-\sqrt{9-x}}}$ to get a domain of $-7\leq x\leq0$
For $f_{4}(x)$ , since square roots must be nonnegative, we can see that the negative values of the previous domain will not work, so $\sqrt{16-x}=0$ . Thus we now arrive at $16$ being the only number in the of domain of $f_4 x$ that defines $x$ . However, since we are looking for the largest value for $n$ for which the domain of $f_{n}$ is nonempty, we must continue checking until we arrive at a domain that is empty.
We continue with $f_{5}(x)$ to get a domain of $\sqrt{25-x}=16 \implies x=-231$ . Since square roots cannot be negative, this is the last nonempty domain. We add to get $5-231=\boxed{226}$ | A | 226 |
b9e960a874214fd203689f979aea4239 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_22 | Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$ | There must be four rays emanating from $X$ that intersect the four corners of the square region. Depending on the location of $X$ , the number of rays distributed among these four triangular sectors will vary. We start by finding the corner-most point that is $100$ -ray partitional (let this point be the bottom-left-most point).
We first draw the four rays that intersect the vertices. At this point, the triangular sectors with bases as the sides of the square that the point is closest to both do not have rays dividing their areas. Therefore, their heights are equivalent since their areas are equal. The remaining $96$ rays are divided among the other two triangular sectors, each sector with $48$ rays, thus dividing these two sectors into $49$ triangles of equal areas.
Let the distance from this corner point to the closest side be $a$ and the side of the square be $s$ . From this, we get the equation $\frac{a\times s}{2}=\frac{(s-a)\times s}{2}\times\frac1{49}$ . Solve for $a$ to get $a=\frac s{50}$ . Therefore, point $X$ is $\frac1{50}$ of the side length away from the two sides it is closest to. By moving $X$ $\frac s{50}$ to the right, we also move one ray from the right sector to the left sector, which determines another $100$ -ray partitional point. We can continue moving $X$ right and up to derive the set of points that are $100$ -ray partitional.
In the end, we get a square grid of points each $\frac s{50}$ apart from one another. Since this grid ranges from a distance of $\frac s{50}$ from one side to $\frac{49s}{50}$ from the same side, we have a $49\times49$ grid, a total of $2401$ $100$ -ray partitional points. To find the overlap from the $60$ -ray partitional, we must find the distance from the corner-most $60$ -ray partitional point to the sides closest to it. Since the $100$ -ray partitional points form a $49\times49$ grid, each point $\frac s{50}$ apart from each other, we can deduce that the $60$ -ray partitional points form a $29\times29$ grid, each point $\frac s{30}$ apart from each other. To find the overlap points, we must find the common divisors of $30$ and $50$ which are $1, 2, 5,$ and $10$ . Therefore, the overlapping points will form grids with points $s$ $\frac s{2}$ $\frac s{5}$ , and $\frac s{10}$ away from each other respectively. Since the grid with points $\frac s{10}$ away from each other includes the other points, we can disregard the other grids. The total overlapping set of points is a $9\times9$ grid, which has $81$ points. Subtract $81$ from $2401$ to get $2401-81=\boxed{2320}$ | C | 2320 |
b9e960a874214fd203689f979aea4239 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_22 | Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$ | Position the square region $R$ so that the bottom-left corner of the square is at the origin. Then define $s$ to be the sidelength of $R$ and $X$ to be the point $(rs, qs)$ , where $0<r,q<1$
There must be four rays emanating from $X$ that intersect the four corners of $R$ . The areas of the four triangles formed by these rays are then $A_1=\frac{qs\times s}{2}$ $A_2=\frac{(s-rs)\times s}{2}$ $A_3=\frac{(s-qs)\times s}{2}$ , and $A_4=\frac{rs\times s}{2}$
If a point is $n$ -ray partitional, then there exist positive integers $a, b, c, d$ such that $a+b+c+d=n$ and $\frac{A_1}{a}=\frac{A_2}{b}=\frac{A_3}{c}=\frac{A_4}{d}$ . Substituting in our formulas for $A_1$ $A_2$ $A_3$ , and $A_4$ and canceling equal terms, we get \[\frac{q}{a}=\frac{1-r}{b}=\frac{1-q}{c}=\frac{r}{d}.\]
Taking $\frac{q}{a}=\frac{1-q}{c}$ and solving for $q$ , we get $q=\frac{a}{a+c}$ , and taking $\frac{1-r}{b}=\frac{r}{d}$ and solving for $r$ , we get $r=\frac{d}{b+d}$ . Finally, from $\frac{q}{a}=\frac{r}{d}$ , we have $qd=ar$ $\Leftrightarrow$ $\frac{ad}{a+c}=\frac{ad}{b+d}$ $\Leftrightarrow$ $a+c=b+d$
So for a point $X$ to be $100$ -ray partitional, $a+b+c+d=100$ , so $a+c=b+d=50$ $X$ must then be of the form $\left(\frac{d}{50}s, \frac{a}{50}s\right)$ . Since $X$ is in the interior of $R$ $a$ and $d$ can be any positive integer from $1$ to $49$ (with $b$ and $c$ just equaling $50-d$ and $50-a$ , respectively). Thus, there are $49\times 49=2401$ points that are $100$ -ray partitional.
However, the problem asks for points that are not only $100$ -ray partitional but also not $60$ -ray partitional. Points that are $60$ -ray partitional are of the form $\left(\frac{m}{30}s, \frac{n}{30}s\right)$ , where $m$ and $n$ are also positive integers. We count the number of points $\left(\frac{d}{50}s, \frac{a}{50}s\right)$ that can also be written in this form. For a given $d$ $\frac{d}{50}=\frac{m}{30}$ if and only if $m=\frac{3}{5}d$ , and likewise with $a$ and $n$ . We can then see that a point is both $100$ -ray partitional and $60$ -ray partitional if and only if $a$ and $d$ are both divisible by $5$ . There are $9$ integers between $1$ and $49$ that are divisible by $5$ , so out of our $2401$ points that are $100$ -ray partitional, $9\times 9=81$ are also $60$ -ray partitional.
Our answer then is just $2401-81=\boxed{2320}$ | C | 2320 |
b9e960a874214fd203689f979aea4239 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_22 | Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$ | For the sake of simplicity, let $R$ be a $60 \times 60$ square and set the bottom-left point as the origin. Then, $R$ has vertices: \[(0,0), (60,0), (60,60), (0,60).\]
Now, let a point in the square have coordinates $(x, y).$
In order for the point to be $100-$ ray partitional, we must be able to make $100$ triangles with area $60^2/100 = 36.$ For it to not be $60$ -ray partitional, we cannot make $60$ triangles with area $60^2/60 = 60.$
When we draw such a triangle, it's base will always be on one of the sides of the square. If it is on the bottom side, then the height must be $y$ . So, the base of each triangle must be $\frac{72}{y}.$ So, there will be $\frac{60}{\frac{72}{y}} = \frac{60y}{72}$ total triangles on that side.
If the triangle is on the right side of the square, then the height has to be $60 - x.$ So, the base will be $\frac{72}{60-x}$ and there will be $\frac{60 (60-x)}{72}$ triangles.
If the triangle is on the top, the height will be $60-y$ , the base will be $\frac{72}{60-y}$ and there will be $\frac{60 (60-y)}{72}$ triangles along this side.
The triangles on the left will have height $x$ , base $\frac{72}{x}$ and $\frac{60x}{72}$ such triangles must exist.
Simplifying, we get $\frac{5y}{6}, \frac{5 (60-x)}{6}, \frac{5(60-y)}{6}, \frac{5x}{6}$ triangles on the respective sides of the square.
All of these numbers must be integers. Let $x = 60a$ and $y = 60b$ where $0 < a, b < 1.$
Then, the amounts become: \[50a, 50b, 50 - 50a, 50 - 50b.\]
As long as $50a$ and $50b$ are integers, $50 - 50a$ and $50 - 50b$ will also be integers.
For this to happen, $a$ and $b$ must be of the form $\frac{x}{50}$ where $1 \le x \le 49.$ So, we have a total of $49^2 = 2401$ points that are $100$ -ray partitional.
Now, we must calculate the number of $100$ - ray partitional points that are also $60$ -ray partitional.
Using a method similar to before, if a point is $60$ -ray partitional, then we must be able to make $30a, 30b, 30 - 30a, 30 -30b$ triangles on the different sides.
So, $30a$ and $30b$ must be integers. This means $a$ and $b$ have to be of the form $\frac{y}{30}$ where $0<y<30.$
If a point is both $100$ -ray partitional and $60$ -ray partitional, then it can be written as \[\frac{x}{50} = \frac{y}{30}\] . Note that whenever $x$ is divisible by $5$ , a $y$ will always exist to satisfy the above equation.
So, $x$ has to be in the range $(0, 50)$ and must be divisible by $5$ . There are $9$ possibilities, namely $5, 10, 15, 20, 25, 30, 35, 40, 45.$
The $x$ -coordinate of the point and the $y$ -coordinate of the point can each use any of these $9$ possibilities, giving $9^2 = 81$ numbers that are both $100$ -ray partitional and $60$ -ray partitional.
Overall, we are left with $2401 - 81 = \boxed{2320}$ solutions. | null | 2320 |
74891d1d62a10f333d8e8a81f5bbe4b5 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12A_Problems/Problem_25 | Triangle $ABC$ has $\angle BAC = 60^{\circ}$ $\angle CBA \leq 90^{\circ}$ $BC=1$ , and $AC \geq AB$ . Let $H$ $I$ , and $O$ be the orthocenter, incenter, and circumcenter of $\triangle ABC$ , respectively. Assume that the area of pentagon $BCOIH$ is the maximum possible. What is $\angle CBA$
$\textbf{(A)}\ 60^{\circ} \qquad \textbf{(B)}\ 72^{\circ} \qquad \textbf{(C)}\ 75^{\circ} \qquad \textbf{(D)}\ 80^{\circ} \qquad \textbf{(E)}\ 90^{\circ}$ | Let $\angle CAB=A$ $\angle ABC=B$ $\angle BCA=C$ for convenience.
It's well-known that $\angle BOC=2A$ $\angle BIC=90+\frac{A}{2}$ , and $\angle BHC=180-A$ (verifiable by angle chasing). Then, as $A=60$ , it follows that $\angle BOC=\angle BIC=\angle BHC=120$ and consequently pentagon $BCOIH$ is cyclic. Observe that $BC=1$ is fixed, hence the circumcircle of cyclic pentagon $BCOIH$ is also fixed. Similarly, as $OB=OC$ (both are radii), it follows that $O$ and also $[BCO]$ is fixed. Since $[BCOIH]=[BCO]+[BOIH]$ is maximal, it suffices to maximize $[BOIH]$
Verify that $\angle IBC=\frac{B}{2}$ $\angle HBC=90-C$ by angle chasing; it follows that $\angle IBH=\angle HBC-\angle IBC=90-C-\frac{B}{2}=\frac{A}{2}-\frac{C}{2}=30-\frac{C}{2}$ since $A+B+C=180\implies\frac{A}{2}+\frac{B}{2}+\frac{C}{2}=90$ by Triangle Angle Sum. Similarly, $\angle OBC=(180-120)/2=30$ (isosceles base angles are equal), hence \[\angle IBO=\angle IBC-\angle OBC=\frac{B}{2}-30=60-\frac{A}{2}-\frac{C}{2}=30-\frac{C}{2}\] Since $\angle IBH=\angle IBO$ $IH=IO$ by Inscribed Angles.
There are two ways to proceed.
Letting $O'$ and $R$ be the circumcenter and circumradius, respectively, of cyclic pentagon $BCOIH$ , the most straightforward is to write $[BOIH]=[OO'I]+[IO'H]+[HO'B]-[BO'O]$ , whence \[[BOIH]=\frac{1}{2}R^2(\sin(60-C)+\sin(60-C)+\sin(2C-60)-\sin(60))\] and, using the fact that $R$ is fixed, maximize $2\sin(60-C)+\sin(2C-60)$ with Jensen's Inequality.
A more elegant way is shown below.
Lemma: $[BOIH]$ is maximized only if $HB=HI$
Proof by contradiction: Suppose $[BOIH]$ is maximized when $HB\neq HI$ . Let $H'$ be the midpoint of minor arc $BI$ be and $I'$ the midpoint of minor arc $H'O$ . Then $[BOIH']=[IBO]+[IBH']>[IBO]+[IBH]=[BOIH]$ since the altitude from $H'$ to $BI$ is greater than that from $H$ to $BI$ ; similarly $[BH'I'O]>[BOIH']>[BOIH]$ . Taking $H'$ $I'$ to be the new orthocenter, incenter, respectively, this contradicts the maximality of $[BOIH]$ , so our claim follows. $\blacksquare$
With our lemma( $HB=HI$ ) and $IH=IO$ from above, along with the fact that inscribed angles that intersect the same length chords are equal, \[\angle ABC=2\angle IBC=2(\angle OBC+\angle OBI)=2(30+\frac{1}{3}\angle OCB)=80\implies\boxed{80}\] | D | 80 |
e4b1803693ee9c457ae08b7be36fbf6b | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_2 | Josanna's test scores to date are $90, 80, 70, 60,$ and $85.$ Her goal is to raise her test average at least $3$ points with her next test. What is the minimum test score she would need to accomplish this goal?
$\textbf{(A)}\ 80 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 85 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 95$ | Take the average of her current test scores, which is \[\frac{90+80+70+60+85}{5} = \frac{385}{5} = 77\]
This means that she wants her test average after the sixth test to be $80.$ Let $x$ be the score that Josanna receives on her sixth test. Thus, our equation is
\[\frac{90+80+70+60+85+x}{6} = 80\]
\[385+x = 480\]
\[x = \boxed{95}\] | E | 95 |
f999f8168fe7984d6323c7b9b9ba05e3 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_3 | LeRoy and Bernardo went on a week-long trip together and agreed to share the costs equally. Over the week, each of them paid for various joint expenses such as gasoline and car rental. At the end of the trip it turned out that LeRoy had paid A dollars and Bernardo had paid B dollars, where $A < B.$ How many dollars must LeRoy give to Bernardo so that they share the costs equally?
$\textbf{(A)}\ \frac{A+B}{2} \qquad \textbf{(B)}\ \frac{A-B}{2} \qquad \textbf{(C)}\ \frac{B-A}{2} \qquad \textbf{(D)}\ B-A \qquad \textbf{(E)}\ A+B$ | The total amount of money that was spent during the trip was \[A + B\] So each person should pay \[\frac{A+B}{2}\] if they were to share the costs equally. Because LeRoy has already paid $A$ dollars of his part, he still has to pay \[\frac{A+B}{2} - A =\] \[= \boxed{2}\] | C | 2 |
78bf99eddfc409ca580e67ec5e5e8d2c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_4 | In multiplying two positive integers $a$ and $b$ , Ron reversed the digits of the two-digit number $a$ . His erroneous product was $161.$ What is the correct value of the product of $a$ and $b$
$\textbf{(A)}\ 116 \qquad \textbf{(B)}\ 161 \qquad \textbf{(C)}\ 204 \qquad \textbf{(D)}\ 214 \qquad \textbf{(E)}\ 224$ | Taking the prime factorization of $161$ reveals that it is equal to $23*7.$ Therefore, the only ways to represent $161$ as a product of two positive integers is $161*1$ and $23*7.$ Because neither $161$ nor $1$ is a two-digit number, we know that $a$ and $b$ are $23$ and $7.$ Because $23$ is a two-digit number, we know that a, with its two digits reversed, gives $23.$ Therefore, $a = 32$ and $b = 7.$ Multiplying our two correct values of $a$ and $b$ yields
\[a*b = 32*7 =\]
\[= \boxed{224}\] | E | 224 |
2ed6fd5b18437c16abef93476a168a81 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_5 | Let $N$ be the second smallest positive integer that is divisible by every positive integer less than $7$ . What is the sum of the digits of $N$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 9$ | $N$ must be divisible by every positive integer less than $7$ , or $1, 2, 3, 4, 5,$ and $6$ . Each number that is divisible by each of these is a multiple of their least common multiple. $LCM(1,2,3,4,5,6)=60$ , so each number divisible by these is a multiple of $60$ . The smallest multiple of $60$ is $60$ , so the second smallest multiple of $60$ is $2\times60=120$ . Therefore, the sum of the digits of $N$ is $1+2+0=\boxed{3}$ | A | 3 |
57ea9cfabb35825b80717ef5177269d5 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_6 | Two tangents to a circle are drawn from a point $A$ . The points of contact $B$ and $C$ divide the circle into arcs with lengths in the ratio $2 : 3$ . What is the degree measure of $\angle{BAC}$
$\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ 60$ | In order to solve this problem, use of the tangent-tangent intersection theorem (Angle of intersection between two tangents dividing a circle into arc length A and arc length B = 1/2 (Arc A° - Arc B°).
In order to utilize this theorem, the degree measures of the arcs must be found. First, set A (Arc length A) equal to 3d, and B (Arc length B) equal to 2d.
Setting 3d+2d = 360° will find d = 72°, and so therefore Arc length A in degrees will equal 216° and arc length B will equal 144°.
Finally, simply plug the two arc lengths into the tangent-tangent intersection theorem, and the answer:
1/2 (216°-144°) = 1/2 (72°) $=\boxed{36}.$ | C | 36 |
57ea9cfabb35825b80717ef5177269d5 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_6 | Two tangents to a circle are drawn from a point $A$ . The points of contact $B$ and $C$ divide the circle into arcs with lengths in the ratio $2 : 3$ . What is the degree measure of $\angle{BAC}$
$\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ 60$ | Let arc A be 3x and arc B be 2x. Then the angle formed by the tangents is $\frac{3x-2x}2 = \frac {x} 2$ by the arc length formula. Also note that $3x + 2x = 360$ , which simplifies to $x= 72.$ Hence the angle formed by the tangents is equal to $\boxed{36}$ | C | 36 |
57ea9cfabb35825b80717ef5177269d5 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_6 | Two tangents to a circle are drawn from a point $A$ . The points of contact $B$ and $C$ divide the circle into arcs with lengths in the ratio $2 : 3$ . What is the degree measure of $\angle{BAC}$
$\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ 60$ | Let the center of the circle be $O$ . The radii extending from $O$ to the points of tangency $B$ and $C$ are both perpendicular to lines $AB$ and $AC$ . Thus $\angle ABO = \angle ACO = 90^{\circ}$ , and quadrilateral $ABOC$ is cyclic, since the opposite angles add to $180^{\circ}$
Since the ratio of the arc lengths is $2 : 3$ , the shorter arc (the arc cut off by $\angle BOC$ ) is $144^{\circ}$
$\angle BOC$ and $\angle BAC$ must add up to $180^{\circ}$ since quadrilateral $ABOC$ is cyclic, so $\angle BAC = 180 - 144 = \boxed{36}$ | C | 36 |
570dd09f58269b2d15763cd36be8c14f | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_8 | Keiko walks once around a track at the same constant speed every day. The sides of the track are straight, and the ends are semicircles. The track has a width of $6$ meters, and it takes her $36$ seconds longer to walk around the outside edge of the track than around the inside edge. What is Keiko's speed in meters per second?
$\textbf{(A)}\ \frac{\pi}{3} \qquad \textbf{(B)}\ \frac{2\pi}{3} \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}{3} \qquad \textbf{(E)}\ \frac{5\pi}{3}$ | To find Keiko's speed, all we need to find is the difference between the distance around the inside edge of the track and the distance around the outside edge of the track, and divide it by the difference in the time it takes her for each distance. We are given the difference in time, so all we need to find is the difference between the distances.
The track is divided into lengths and curves. The lengths of the track will exhibit no difference in distance between the inside and outside edges, so we only need to concern ourselves with the curves.
The curves of the track are semicircles, but since there are two of them, we can consider both of the at the same time by treating them as a single circle. We need to find the difference in the circumferences of the inside and outside edges of the circle.
The formula for the circumference of a circle is $C = 2 * \pi * r$ where $r$ is the radius of the circle.
Let's define the circumference of the inside circle as $C_1$ and the circumference of the outside circle as $C_2$
If the radius of the inside circle ( $r_1$ ) is $n$ , then given the thickness of the track is 6 meters, the radius of the outside circle ( $r_2$ ) is $n + 6$
Using this, the difference in the circumferences is:
$C_2 - C_1 = 2 * \pi * (r_2 - r_1) = 2 * \pi * (n + 6 - n) = 2 * \pi * 6 = 12\pi$
$12\pi$ is the difference between the inside and outside lengths of the track. Divided by the time differential, we get:
$12\pi \div 36 = \boxed{3}$ | A | 3 |
796c4910da1f4a28dc4597eee7ca6511 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_10 | Rectangle $ABCD$ has $AB=6$ and $BC=3$ . Point $M$ is chosen on side $AB$ so that $\angle AMD=\angle CMD$ . What is the degree measure of $\angle AMD$
$\textrm{(A)}\ 15 \qquad \textrm{(B)}\ 30 \qquad \textrm{(C)}\ 45 \qquad \textrm{(D)}\ 60 \qquad \textrm{(E)}\ 75$ | Since $AB \parallel CD$ $\angle AMD = \angle CDM$ , so $\angle AMD = \angle CMD = \angle CDM$ , so $\bigtriangleup CMD$ is isosceles, and hence $CM=CD=6$ . Therefore, $\angle BMC = 30^\circ$ . Therefore $\angle AMD=\boxed{75}$ | E | 75 |
49825731b4da9b1ac4896d0cb19abe5c | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_11 | A frog located at $(x,y)$ , with both $x$ and $y$ integers, makes successive jumps of length $5$ and always lands on points with integer coordinates. Suppose that the frog starts at $(0,0)$ and ends at $(1,0)$ . What is the smallest possible number of jumps the frog makes?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$ | Since the frog always jumps in length $5$ and lands on a lattice point, the sum of its coordinates must change either by $5$ (by jumping parallel to the x- or y-axis), or by $3$ or $4$ (3-4-5 right triangle).
Because either $1$ $5$ , or $7$ is always the change of the sum of the coordinates, the sum of the coordinates will always change from odd to even or vice versa. Thus, it can't go from $(0,0)$ to $(1,0)$ in an even number of moves. Therefore, the frog cannot reach $(1,0)$ in two moves.
However, a path is possible in 3 moves: from $(0,0)$ to $(3,4)$ to $(6,0)$ to $(1,0)$
Thus, the answer is $= \boxed{3}$ | null | 3 |
49adab1316f6b30f131672abd47326f9 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_13 | Brian writes down four integers $w > x > y > z$ whose sum is $44$ . The pairwise positive differences of these numbers are $1, 3, 4, 5, 6$ and $9$ . What is the sum of the possible values of $w$
$\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 62 \qquad \textbf{(E)}\ 93$ | Assume that $y-z=a, x-y=b, w-x=c.$ $w-z$ results in the greatest pairwise difference, and thus it is $9$ .
This means $a+b+c=9$ $a,b,c$ must be in the set ${1,3,4,5,6}$ .
The only way for 3 numbers in the set to add up to 9 is if they are $1,3,5$ $a+b$ , and $b+c$ then must be the remaining two numbers which are $4$ and $6$ .
The ordering of $(a,b,c)$ must be either $(3,1,5)$ or $(5,1,3)$
\begin{align*} z + (z + a) + (z + (a + b)) + (z + (a + b + c)) &= 4z + a + (a + b) + 9\\ 4z + a + (a + b) + 9 &= 44\\ \text{if} \hspace{1cm} a &= 3 \\ a + b &= 4\\ 4z &= 44 - 9 - 3 - 4\\ z &= 7\\ w &= 16\\ \end{align*}
\begin{align*} \text{if} \hspace{1cm} a &= 5\\ a + b &= 6\\ 4z &= 44 - 9 - 5 - 6\\ z &= 6\\ w &= 15\\ \end{align*}
The sum of the two w's is $15+16=31$ $\boxed{31}$ | B | 31 |
49adab1316f6b30f131672abd47326f9 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_13 | Brian writes down four integers $w > x > y > z$ whose sum is $44$ . The pairwise positive differences of these numbers are $1, 3, 4, 5, 6$ and $9$ . What is the sum of the possible values of $w$
$\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 62 \qquad \textbf{(E)}\ 93$ | Let the four numbers be $z$ $z+a$ $z+b$ , and $z+c$ . We know that $c$ must be $9$ because that's the greatest difference. So we have $z$ $z+a$ $z+b$ , and $z+9$ . The 6 possible differences are $a$ $b$ $9$ $b-a$ $9-a$ , and $9-b$ . We are given that the differences are 1, 3, 4, 5, 6, 9. $a$ and $9-a$ and $b$ and $9-b$ add to 9 which means they have to be 4, 5 and 3,6 or vice versa. Which leaves $1$ . That means $b-a$ has to equal $1$ . So an and b have to be 3,4, 4,5, or 5,6. For 3,4, we have $z$ $z+3$ $z+4$ , and $z+9$ $4z+16=44$ $4z=28$ $z=7$ $w=7+9=16$ . Now for 4,5, notice that it doesn't work. The differences are 4, 5, 9, 1, 4, 5. We are missing 6 and 3. For 5,6, it's $z$ $z+5$ $z+6$ , and $z+9$ . Check that the differences work; they do. We have $4z+20=44$ $4z=24$ $z=6$ $w=6+9=15$ . Therefore our answer is $15+16=\boxed{31}$ .
~MC413551 | null | 31 |
0598429729f5981161b2e465c2265c14 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_15 | How many positive two-digit integers are factors of $2^{24}-1$
$\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 14$
~ pi_is_3.14 | Repeating difference of squares
$2^{24}-1=(2^{12}+1)(2^{6}+1)(2^{3}+1)(2^{3}-1)$
$2^{24}-1=(2^{12}+1)\cdot65\cdot9\cdot7$
$2^{24}-1 = (2^{12} +1) * 5 * 13 * 3^2 * 7$
The sum of cubes formula gives us:
$2^{12}+1=(2^4+1)(2^8-2^4+1)$
$2^{12}+1 = 17\cdot241$
A quick check shows $241$ is prime. Thus, the only factors to be concerned about are $3^2\cdot5\cdot7\cdot13\cdot17$ , since multiplying by $241$ will make any factor too large.
Multiplying $17$ by $3$ or $5$ will give a two-digit factor; $17$ itself will also work. The next smallest factor, $7$ , gives a three-digit number. Thus, there are $3$ factors that are multiples of $17$
Multiplying $13$ by $3$ $5$ , or $7$ will also give a two-digit factor, as well as $13$ itself. Higher numbers will not work, giving $4$ additional factors.
Multiply $7$ by $3$ $5$ , or $3^2$ for a two-digit factor. There are no more factors to check, as all factors which include $13$ are already counted. Thus, there are an additional $3$ factors.
Multiply $5$ by $3$ or $3^2$ for a two-digit factor. All higher factors have been counted already, so there are $2$ more factors.
Thus, the total number of factors is $3+4+3+2=\boxed{12}$ | D | 12 |
c48431a644779b9d3cdd97f283ea46f8 | https://artofproblemsolving.com/wiki/index.php/2011_AMC_12B_Problems/Problem_17 | Let $f(x) = 10^{10x}, g(x) = \log_{10}\left(\frac{x}{10}\right), h_1(x) = g(f(x))$ , and $h_n(x) = h_1(h_{n-1}(x))$ for integers $n \geq 2$ . What is the sum of the digits of $h_{2011}(1)$
$\textbf{(A)}\ 16081 \qquad \textbf{(B)}\ 16089 \qquad \textbf{(C)}\ 18089 \qquad \textbf{(D)}\ 18098 \qquad \textbf{(E)}\ 18099$ | $g(x)=\log_{10}\left(\frac{x}{10}\right)=\log_{10}\left({x}\right) - 1$
$h_{1}(x)=g(f(x))\text{ = }g(10^{10x}=\log_{10}\left({10^{10x}}\right){ - 1 = 10x - 1}$
Proof by induction that $h_{n}(x)\text{ = }10^n x - (1 + 10 + 10^2 + ... + 10^{n-1})$
For $n=1$ $h_{1}(x)=10x - 1$
Assume $h_{n}(x)=10^n x - (1 + 10 + 10^2 + ... + 10^{n-1})$ is true for n:
\begin{align*} h_{n+1}(x)&= h_{1}(h_{n}(x))\\ &=10 h_{n}(x) - 1\\ &=10 (10^n x - (1 + 10 + 10^2 + ... + 10^{n-1})) - 1\\ &= 10^{n+1} x - (10 + 10^2 + ... + 10^{n}) - 1\\ &= 10^{n+1} x - (1 + 10 + 10^2 + ... + 10^{(n+1)-1}) \end{align*}
Therefore, if it is true for n, then it is true for n+1; since it is also true for n = 1, it is true for all positive integers n.
$h_{2011}(1) = 10^{2011}\times 1{ - }(1 + 10 + 10^2 + ... + 10^{2010})$ , which is the 2011-digit number 8888...8889
The sum of the digits is 8 times 2010 plus 9, or $\boxed{16089}$ | B | 16089 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.