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 |
|---|---|---|---|---|---|
e35c2904bec5050a955781697503e0bd | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_12 | How many ordered pairs of real numbers $(x,y)$ satisfy the following system of equations? \begin{align*} x+3y&=3 \\ \big||x|-|y|\big|&=1 \end{align*} $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 8$ | Since the absolute value is the square root of the square, we get that the first equation is quartic(degree $4$ ) and the other is linear. Subtract to get $\boxed{3}$ | C | 3 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | We write \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}=\frac{3^{96}}{3^{96}+2^{96}}\cdot\frac{3^{100}}{3^{96}}+\frac{2^{96}}{3^{96}+2^{96}}\cdot\frac{2^{100}}{2^{96}}=\frac{3^{96}}{3^{96}+2^{96}}\cdot 81+\frac{2^{96}}{3^{96}+2^{96}}\cdot 16.\] Hence we see that our number is a weighted average of 81 and 16, extremely heavily weighted toward 81. Hence the number is ever so slightly less than 81, so the answer is $\boxed{80}$ | A | 80 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}=\frac{2^{96}\left(\frac{3^{100}}{2^{96}}\right)+2^{96}\left(2^{4}\right)}{2^{96}\left(\frac{3}{2}\right)^{96}+2^{96}(1)}=\frac{\frac{3^{100}}{2^{96}}+2^{4}}{\left(\frac{3}{2}\right)^{96}+1}=\frac{\frac{3^{100}}{2^{100}}\cdot2^{4}+2^{4}}{\left(\frac{3}{2}\right)^{96}+1}=\frac{2^{4}\left(\frac{3^{100}}{2^{100}}+1\right)}{\left(\frac{3}{2}\right)^{96}+1}.\]
We can ignore the 1's on the end because they won't really affect the fraction. So, the answer is very very very close but less than the new fraction.
\[\frac{2^{4}\left(\frac{3^{100}}{2^{100}}+1\right)}{\left(\frac{3}{2}\right)^{96}+1}<\frac{2^{4}\left(\frac{3^{100}}{2^{100}}\right)}{\left(\frac{3}{2}\right)^{96}},\]
\[\frac{2^{4}\left(\frac{3^{100}}{2^{100}}\right)}{\left(\frac{3}{2}\right)^{96}}=\frac{3^{4}}{2^{4}}*2^{4}=3^{4}=81.\]
So, our final answer is very close but not quite 81, and therefore the greatest integer less than the number is $\boxed{80}$ | A | 80 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | Let $x=3^{96}$ and $y=2^{96}$ . Then our fraction can be written as $\frac{81x+16y}{x+y}=\frac{16x+16y}{x+y}+\frac{65x}{x+y}=16+\frac{65x}{x+y}$ .
Notice that $\frac{65x}{x+y}<\frac{65x}{x}=65$ .
So , $16+\frac{65x}{x+y}<16+65=81$ .
And our only answer choice less than 81 is $\boxed{80}$ (RegularHexagon) | A | 80 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | Dividing by $2^{96}$ in both numerator and denominator, this fraction can be rewritten as \[\frac{81 \times (1.5)^{96} + 16}{(1.5)^{96} + 1}.\] Notice that the $+1$ and the $+16$ will be so insignificant compared to a number such as $(1.5)^{96},$ and that thereby the fraction will be ever so slightly less than $81$ . Thereby, we see that the answer is $\boxed{80}.$ | A | 80 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | If you multiply $(3^{96} + 2^{96})$ by $(3^{4} + 2^{4})$ (to get the exponent up to 100), you'll get $(3^{100} + 2^{100}) + 3^{96} \cdot 2^{4} + 2^{96} \cdot 3^{4}$ . Thus, in the numerator, if you add and subtract by $3^{96} \cdot 2^{4}$ and $2^{96} \cdot 3^{4}$ , you'll get $\frac{(3^{4} + 2^{4})(3^{100} + 2^{100}) - 3^{96} \cdot 2^{4} - 2^{96} \cdot 3^{4}}{3^{96}+2^{96}}$ . You can then take out out the first number to get $3^{4} + 2^{4} - \frac{3^{96} \cdot 2^{4} + 2^{96} \cdot 3^{4}}{3^{96}+2^{96}}$ . This can then be written as $87 - \frac{16 \cdot 3^{96} + 16 \cdot 2^{96} + 75 \cdot 2^{96}}{3^{96}+2^{96}}$ , factoring out the 16 and splitting the fraction will give you $87 - 16 - \frac{65 \cdot 2^{96}}{3^{96}+2^{96}}$ , giving you $81 - \frac{65 \cdot 2^{96}}{3^{96}+2^{96}}$ . While you can roughly say that $\frac{65 \cdot 2^{96}}{3^{96}+2^{96}} < 1$ you can also notice that the only answer choice less than 81 is 80, thus the answer is $\boxed{80}.$ | A | 80 |
2e85c85129376099cacdce0d2ba0f38f | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_14 | What is the greatest integer less than or equal to \[\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?\]
$\textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad$ | If you factor out $3^{100}$ from the numerator and $3^{96}$ from the denominator, you will get $\frac{3^{100}\left(1+(\frac{2}{3}\right)^{100})}{3^{96}\left(1+(\frac{2}{3}\right)^{96})}$ . Divide the numerator and denominator by $3^{96}$ to get $\frac{81\left(1+(\frac{2}{3}\right)^{100})}{\left(1+(\frac{2}{3}\right)^{96})}$ . We see that every time we multiply $\frac{2}{3}$ by itself, it slightly decreases, so $1+(\frac{2}{3})^{100}$ will be ever so slightly smaller than $1+(\frac{2}{3})^{96}$ . Thus, the decimal representation of $\frac{\left(1+(\frac{2}{3}\right)^{100})}{\left(1+(\frac{2}{3}\right)^{96})}$ will be extremely close to $1$ , so our solution will be the largest integer that is less than $81$ . Thus, the answer is $\boxed{80}.$ | A | 80 |
05938e24b159fae22c2f7bb068c8f0a5 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_15 | Two circles of radius $5$ are externally tangent to each other and are internally tangent to a circle of radius $13$ at points $A$ and $B$ , as shown in the diagram. The distance $AB$ can be written in the form $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
[asy] draw(circle((0,0),13)); draw(circle((5,-6.2),5)); draw(circle((-5,-6.2),5)); label("$B$", (9.5,-9.5), S); label("$A$", (-9.5,-9.5), S); [/asy]
$\textbf{(A) } 21 \qquad \textbf{(B) } 29 \qquad \textbf{(C) } 58 \qquad \textbf{(D) } 69 \qquad \textbf{(E) } 93$ | [asy] draw(circle((0,0),13)); draw(circle((5,-6.25),5)); draw(circle((-5,-6.25),5)); label("$A$", (-8.125,-10.15), S); label("$B$", (8.125,-10.15), S); draw((0,0)--(-8.125,-10.15)); draw((0,0)--(8.125,-10.15)); draw((-5,-6.25)--(5,-6.25)); draw((-8.125,-10.15)--(8.125,-10.15)); label("$X$", (0,0), N); label("$Y$", (-5,-6.25),NW); label("$Z$", (5,-6.25),NE); [/asy]
Let the center of the surrounding circle be $X$ . The circle that is tangent at point $A$ will have point $Y$ as the center. Similarly, the circle that is tangent at point $B$ will have point $Z$ as the center. Connect $AB$ $YZ$ $XA$ , and $XB$ . Now observe that $\triangle XYZ$ is similar to $\triangle XAB$ by SAS.
Writing out the ratios, we get \[\frac{XY}{XA}=\frac{YZ}{AB} \Rightarrow \frac{13-5}{13}=\frac{5+5}{AB} \Rightarrow \frac{8}{13}=\frac{10}{AB} \Rightarrow AB=\frac{65}{4}.\] Therefore, our answer is $65+4= \boxed{69}$ | D | 69 |
aae8b4257fb0354a6bea71b7d096f013 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_16 | Right triangle $ABC$ has leg lengths $AB=20$ and $BC=21$ . Including $\overline{AB}$ and $\overline{BC}$ , how many line segments with integer length can be drawn from vertex $B$ to a point on hypotenuse $\overline{AC}$
$\textbf{(A) }5 \qquad \textbf{(B) }8 \qquad \textbf{(C) }12 \qquad \textbf{(D) }13 \qquad \textbf{(E) }15 \qquad$ | [asy] unitsize(4); pair A, B, C, E, P; A=(-20, 0); B=origin; C=(0,21); E=(-21, 20); P=extension(B,E, A, C); draw(A--B--C--cycle); draw(B--P); dot("$A$", A, SW); dot("$B$", B, SE); dot("$C$", C, NE); dot("$P$", P, NW); [/asy]
As the problem has no diagram, we draw a diagram. The hypotenuse has length $29$ . Let $P$ be the foot of the altitude from $B$ to $AC$ . Note that $BP$ is the shortest possible length of any segment. Writing the area of the triangle in two ways, we can solve for $BP=\dfrac{20\cdot 21}{29}$ , which is between $14$ and $15$
Let the line segment be $BX$ , with $X$ on $AC$ . As you move $X$ along the hypotenuse from $A$ to $P$ , the length of $BX$ strictly decreases, hitting all the integer values from $20, 19, \dots 15$ (IVT). Similarly, moving $X$ from $P$ to $C$ hits all the integer values from $15, 16, \dots, 21$ . This is a total of $\boxed{13}$ distinct line segments.
(asymptote diagram added by elements2015) | D | 13 |
44fc3dfa0490bd9465fbd97761c30c96 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_17 | Let $S$ be a set of $6$ integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$ , then $b$ is not a multiple of $a$ . What is the least possible value of an element in $S$
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$ | We start with $2$ because $1$ is not an answer choice. We would have to include every odd number except $1$ to fill out the set, but then $3$ and $9$ would violate the rule, so that won't work.
Experimentation with $3$ shows it's likewise impossible. You can include $7,11,$ and either $5$ or $10$ (which are always safe). But after adding either $4$ or $8$ we have no more valid numbers.
Finally, starting with $4,$ we find that the sequence $4,5,6,7,9,11$ works, giving us $\boxed{4}.$ | C | 4 |
44fc3dfa0490bd9465fbd97761c30c96 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_17 | Let $S$ be a set of $6$ integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$ , then $b$ is not a multiple of $a$ . What is the least possible value of an element in $S$
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$ | We know that all odd numbers except $1,$ namely $3, 5, 7, 9, 11,$ can be used.
Now we have $7$ possibilities to choose from for the last number (out of $1, 2, 4, 6, 8, 10, 12$ ). We can eliminate $1, 2, 10,$ and $12,$ and we have $4, 6, 8$ to choose from. However, $9$ is a multiple of $3.$ Now we have to take out either $3$ or $9$ from the list. If we take out $9,$ none of the numbers would work, but if we take out $3,$ we get \[4, 5, 6, 7, 9, 11.\] The least number is $4,$ so the answer is $\boxed{4}.$ | C | 4 |
44fc3dfa0490bd9465fbd97761c30c96 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_17 | Let $S$ be a set of $6$ integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$ , then $b$ is not a multiple of $a$ . What is the least possible value of an element in $S$
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$ | We can get the multiples for the numbers in the original set with multiples in the same original set \begin{align*} 1&: \ \text{all elements of }\{1,2,\dots,12\} \\ 2&: \ 4,6,8,10,12 \\ 3&: \ 6,9,12 \\ 4&: \ 8,12 \\ 5&: \ 10 \\ 6&: \ 12 \end{align*} It will be safe to start with $5$ or $6$ since they have the smallest number of multiples as listed above, but since the question asks for the least, it will be better to try others.
Trying $4,$ we can get $4,5,6,7,9,11.$ So $4$ works.
Trying $3,$ it won't work, so the least is $4.$ This means the answer is $\boxed{4}.$ | C | 4 |
44fc3dfa0490bd9465fbd97761c30c96 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_17 | Let $S$ be a set of $6$ integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$ , then $b$ is not a multiple of $a$ . What is the least possible value of an element in $S$
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$ | We partition $\{1,2,\ldots,12\}$ into six nonempty subsets such that for every subset, each element is a multiple of all elements less than or equal to itself: \[\{1,2,4,8\}, \ \{3,6,12\}, \ \{5,10\}, \ \{7\}, \ \{9\}, \ \{11\}.\] Clearly, $S$ must contain exactly one element from each subset:
If $4\in S,$ then the possibilities of $S$ are $\{4,5,6,7,9,11\}$ or $\{4,6,7,9,10,11\}.$ So, the least possible value of an element in $S$ is $\boxed{4}.$ | C | 4 |
44fc3dfa0490bd9465fbd97761c30c96 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_17 | Let $S$ be a set of $6$ integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$ , then $b$ is not a multiple of $a$ . What is the least possible value of an element in $S$
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$ | We start with 2 as 1 is not an answer option. Our set would be $\{2,3,5,7,11\}$ . We realize we cannot add 12 to the set because 12 is a multiple of 3. Our set only has 5 elements, so starting with 2 won't work.
We try 3 next. Our set becomes $\{3,4,5,7,11\}$ . We run into the same issue as before so starting with 3 won't work.
We then try 4. Our set becomes $\{4,5,6,7,9,11\}$ . We see we have 6 elements with none being multiples of each other. Therefore our answer is $\boxed{4}.$ | C | 4 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | This looks like balanced ternary, in which all the integers with absolute values less than $\frac{3^n}{2}$ are represented in $n$ digits. There are 8 digits. Plugging in 8 into the formula for the balanced ternary gives a maximum bound of $|x|=3280.5$ , which means there are 3280 positive integers, 0, and 3280 negative integers. Since we want all nonnegative integers, there are $3280+1=\boxed{3281}$ | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | Note that all numbers formed from this sum are either positive, negative or zero. The number of positive numbers formed by this sum is equal to the number of negative numbers formed by this sum, because of symmetry. There is only one way to achieve a sum of zero, if all $a_i=0$ . The total number of ways to pick $a_i$ from $i=0, 1, 2, 3, ... 7$ is $3^8=6561$ $\frac{6561-1}{2}=3280$ gives the number of possible negative integers. The question asks for the number of non-negative integers, so subtracting from the total gives $6561-3280=\boxed{3281}$ . (RegularHexagon, KLBBC minor changes) | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | Note that the number of total possibilities (ignoring the conditions set by the problem) is $3^8=6561$ . So, E is clearly unrealistic.
Note that if $a_7$ is 1, then it's impossible for \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] to be negative. Therefore, if $a_7$ is 1, there are $3^7=2187$ possibilities. (We also must convince ourselves that these $2187$ different sets of coefficients must necessarily yield $2187$ different integer results.)
As A, B, and C are all less than 2187, the answer must be $\boxed{3281}$ | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | Note that we can do some simple casework:
If $a_7=1$ , then we can choose anything for the other 7 variables, so this give us $3^7$ .
If $a_7=0$ and $a_6=1$ , then we can choose anything for the other 6 variables, giving us $3^6$ .
If $a_7=0$ $a_6=0$ , and $a_5=1$ , then we have $3^5$ .
Continuing in this vein, we have $3^7+3^6+\cdots+3^1+3^0$ ways to choose the variables' values, except we have to add 1
because we haven't counted the case where all variables are 0. So our total sum is $\boxed{3281}$ .
Note that we have counted all possibilities, because the largest positive positive power of 3 must be greater than or equal to the largest negative positive power of 3, for the number to be nonnegative. | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | This solution has a similar idea to that of above.
We will start off with casework on $a_{7}$ :
If $a_7 = -1$ , we can show that there is no way to assign the values of $-1, 0, 1$ to the other $a_{i}$ 's for $0 \leq i \leq 6$ . This is because even if we make all of the other $a_{i}$ equal to $1$ , we will have that our number is $(-1)(3^{7}) + (3^{6}+3^{5}+...+3^{0}) = -3^{7} + \frac{3^{7}-1}{3-1}$ . However, note that since $\frac{3^{7}-1}{3-1} < 3^{7}$ $-3^{7} + \frac{3^{7}-1}{3-1} < 0$ .
If $a_{7}=0$ , we can ignore $a_{7}$ and pretend like it never even existed. This then simplifies the problem: the question remains the same, except that instead of having $a_{0}...a_{7}$ , we only have $a_{0}...a_{6}$ . Now, we introduce some notation: let the number of nonnegative integers that can be written in the form of $a_{n} \cdot 3^{n} + ... + a_{0} \cdot 3^{0}$ be denoted as $S_{n}$ . Then, the problem is asking us for $S_{7}$ , and the total number of nonnegative integers we get from this case is $S_{6}$ . Let's keep this in mind and revisit this idea later.
If $a_{7}=1$ , we can show that no matter what values we assign to the rest of the $a_{i}$ , we will always get a nonnegative integer (we can make this even stricter and say positive integer). This is because of something we figured out in the first case: $\frac{3^{7}-1}{3-1} < 3^{7}$ . So, even if we let $a_{i}=-1$ for $0 \leq i \leq 6$ , we will still have $3^{7} - (3^{6}+...+3^{0}) > 0$ . So, for this case, we have $3^7$ possible nonnegative integers.
Totalling up our values from the three cases, we see that $S_{7} = 0 + S_{6} + 3^{7}$ . In fact, using the reasoning from the three cases above, we can deduce that, for all positive integers $n$ $S_{n} = 3^{n} + S_{n-1}$ . We can now start building up our values for $S$ $S_{0} = 2$ $a_{0} = 0, 1$ ), $S_{1} = 3^{1}+S_{0} = 5, S_{2} = 14, ..., S_{6}=1094$ . So, we have $S_{7} = 2187 + 1094 = \boxed{3281}$ .
~advanture | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | The key is to realize that this question is basically taking place in $a\in\{0,1,2\}$ if each value of $a$ was increased by $1$ , essentially making it into base $3$ . Then the range would be from $0\cdot3^7+$ $0\cdot3^6+$ $0\cdot3^5+$ $0\cdot3^4+$ $0\cdot3^3+$ $0\cdot3^2+$ $0\cdot3^1+$ $0\cdot3^0=$ $0$ to $2\cdot3^7+$ $2\cdot3^6+$ $2\cdot3^5+$ $2\cdot3^4+$ $2\cdot3^3+$ $2\cdot3^2+$ $2\cdot3^1+$ $2\cdot3^0=$ $3^8-1=$ $6561-1=$ $6560$ , yielding $6561$ different values. Since the distribution for all $a_i\in \{-1,0,1\}$ the question originally gave is symmetrical, we retain the $3280$ positive integers and one $0$ but discard the $3280$ negative integers. Thus, we are left with the answer, $\boxed{3281}\qquad$ . --anna0kear | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | First, set $a_i=0$ for all $i\geq1$ . The range would be the integers for which $[-1,1]$ . If $a_i=0$ for all $i\geq2$ , our set expands to include all integers such that $-4\leq\mathbb{Z}\leq4$ . Similarly, when $i\geq3$ we get $-13\leq\mathbb{Z}\leq13$ , and when $i\geq4$ the range is $-40\leq\mathbb{Z}\leq40$ . The pattern continues until we reach $i=7$ , where $-3280\leq\mathbb{Z}\leq3280$ . Because we are only looking for positive integers, we filter out all $\mathbb{Z}<0$ , leaving us with all integers between $0\leq\mathbb{Z}\leq3280$ , inclusive. The answer becomes $\boxed{3281}$ . --anna0kear | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | To get the number of integers, we can get the highest positive integer that can be represented using \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
Note that the least nonnegative integer that can be represented is $0$ , when all $a_i=0$ . The highest number will be the number when all $a_i=1$ . That will be \[3^7+3^6+3^5+3^4+3^3+3^2+3^1+3^0=\frac{3^8-1}{3-1}\] \[=3280\]
Therefore, there are $3280$ positive integers and $(3280+1)$ nonnegative integers (while including $0$ ) that can be represented. Our answer is $\boxed{3281}$ | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | Notice that there are $3^8$ options for $a_7, a_6, \cdots a_0$ since each $a_i$ can take on the value $-1$ $0$ , or $1$ . Now we want to find how many of them are positive and then we can add one in the end to account for $0$ (they are asking for non-negative).
By symmetry (look out for these on the contest), we see that exactly half of them are positive. So $\lfloor{\tfrac{3^8}{2}}\rfloor = 3280.$ Now we will add $1$ because of the $0$ to account for the non-negative solutions.
So our final answer is $3280 + 1 = 3281$ which is $\boxed{3281}$ | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | Obviously, there are $3^8 = 6561$ possible, and one of them is 0, so other $6560$ are either positive or negative. By the symmetry, we can get the answer is $6560/2 + 1$ which is $\boxed{3281}$ | D | 3281 |
f1421585bf0eb09caab5750579f2913b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_18 | How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$
$\textbf{(A) } 512 \qquad \textbf{(B) } 729 \qquad \textbf{(C) } 1094 \qquad \textbf{(D) } 3281 \qquad \textbf{(E) } 59,048$ | The solution has to obviously be smaller than $3^{7-0+1}=3^8$ but larger than $3^{(7-0+1)-1} = 3^7.$ The only remaining answer is $\boxed{3281}.$ ~mathboy282 | D | 3281 |
8cbc897221b3b1b1abf2f32996aeaeb6 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_20 | A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called $\textit{symmetric}$ if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$ | [asy] size(100pt); draw((1,0)--(8,0),linewidth(0.5)); draw((1,2)--(6,2),linewidth(0.5)); draw((1,4)--(4,4),linewidth(0.5)); draw((1,6)--(2,6),linewidth(0.5)); draw((2,6)--(2,0),linewidth(0.5)); draw((4,4)--(4,0),linewidth(0.5)); draw((6,2)--(6,0),linewidth(0.5)); draw((1,0)--(1,7),dashed+linewidth(0.5)); draw((1,7)--(8,0),dashed+linewidth(0.5)); [/asy]
Imagine folding the scanning code along its lines of symmetry. There will be $10$ regions which you have control over coloring. Since we must subtract off $2$ cases for the all-black and all-white cases, the answer is $2^{10}-2=\boxed{1022.}$ | B | 1022. |
8cbc897221b3b1b1abf2f32996aeaeb6 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_20 | A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called $\textit{symmetric}$ if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$ | \[\begin{tabular}{|c|c|c|c|c|c|c|} \hline T & T & T & X & T & T & T \\ \hline T & T & T & Y& T & T & T \\ \hline T & T & T & Z & T & T & T \\ \hline X & Y & Z & W & Z & Y & X \\ \hline T & T & T & Z & T & T & T \\ \hline T & T & T & Y & T & T & T \\ \hline T & T & T & X & T & T & T \\ \hline \end{tabular}\]
There are $3 \times 3$ squares in the corners of this $7 \times 7$ square, and there is a horizontal and vertical stripe through the middle. Because we need to have symmetry when the diagonals and midpoints of the large square is connected, we can create a table like this: (Different letters represent different color choices between black and white)
\[\begin{tabular}{|c|c|c|} \hline A & B & C \\ \hline B & D & E \\ \hline C & E & F \\ \hline \end{tabular}\] (Note that coloring one $3 \times 3$ square will also determine the colorings of the other $3$ because the large $7 \times 7$ square must look the same when it is rotated by $90^\circ$
There are $6$ different letters and $2$ choices of color (black and white) for each letter, so there are $2^6=64$ colorings of a proper $3 \times 3$ square. Now, all that's left are the horizontal and vertical stripes. Using similar logic, we can see that there are $4$ different letters, so there are $2^4=16$ different colorings. Multiplying them together gives $16 \times 64 = 1024$ . Going back to the question, we see that "there must be at least one square of each color in this grid of $49$ squares." We must then eliminate $2$ options: an all-black grid and an all-white grid. $1024-2= \boxed{1022}$ -hansenhe | B | 1022 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | Substituting $y=x^2-a$ into $x^2+y^2=a^2$ , we get \[x^2+(x^2-a)^2=a^2 \implies x^2+x^4-2ax^2=0 \implies x^2(x^2-(2a-1))=0\] Since this is a quartic, there are $4$ total roots (counting multiplicity). We see that $x=0$ always has at least one intersection at $(0,-a)$ (and is in fact a double root).
The other two intersection points have $x$ coordinates $\pm\sqrt{2a-1}$ . We must have $2a-1> 0;$ otherwise we are in the case where the parabola lies entirely above the circle (tangent at the point $(0,a)$ ). This only results in a single intersection point in the real coordinate plane. Thus, we see that $\boxed{12}$ | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | Substituting $y = x^2 - a$ gives $x^2 + (x^2 - a)^2 = a^2$ , which simplifies to $x^2 + x^4 - 2x^2a + a^2 = a^2$ . This further simplifies to $x^2(1 + x^2 - 2a) = 0$ . Thus, either $x^2 = 0$ , or $x^2 - 2a + 1 = 0$
Since we care about $a$ , we consider the second case. We solve in terms of $a$ , giving $a = \frac{x^2}{2} + \frac{1}{2}$ . We see that in order to find the range in which $a$ lies, we must find the vertex of this equation, which turns out to be $\left(0, \frac{1}{2}\right)$ . Hence, we know that the minimum is $\frac{1}{2}$ , which further implies that $\boxed{12}$ | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | [asy] Label f; f.p=fontsize(6); xaxis(-2,2,Ticks(f, 0.2)); yaxis(-2,2,Ticks(f, 0.2)); real g(real x) { return x^2-1; } draw(graph(g, 1.7, -1.7)); real h(real x) { return sqrt(1-x^2); } draw(graph(h, 1, -1)); real j(real x) { return -sqrt(1-x^2); } draw(graph(j, 1, -1)); [/asy]
Looking at a graph, it is obvious that the two curves intersect at $(0, -a)$ . We also see that if the parabola goes "in" the circle, then by going out of it (as it will), it will intersect five times. This is impossible. Thus, we only look for cases where the parabola becomes externally tangent to the circle.
We have $x^2 - a = -\sqrt{a^2 - x^2}$ . Squaring both sides and solving yields $x^4 - (2a - 1)x^2 = 0$ . Since $x = 0$ is already accounted for, we only need to find one solution for $x^2 = 2a - 1$ , where the right hand side portion is obviously increasing. Since $a = \frac{1}{2}$ begets $x = 0$ (an overcount), we have $\boxed{12}$ as the right answer. | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | This describes a unit parabola, with a circle centered on the axis of symmetry and tangent to the vertex. As the curvature of the unit parabola at the vertex is $2$ , the radius of the circle that matches it has a radius of $\frac{1}{2}$ . This circle is tangent to an infinitesimally close pair of points, one on each side. Therefore, it is tangent to only $1$ point. When a larger circle is used, it is tangent to $3$ points because the points on either side are now separated from the vertex. Therefore, $\boxed{12}$ is correct. | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | Now, let's graph these two equations. We want the blue parabola to be inside this red circle. [asy] import graph; size(6cm); draw((0,0)--(0,10),EndArrow); draw((0,0)--(0,-10),EndArrow); draw((0,0)--(10,0),EndArrow); draw((0,0)--(-10,0),EndArrow); Label f; f.p=fontsize(6); xaxis(-10,10); yaxis(-10,10); real f(real x) { return x^2-5; } draw(graph(f,-4,4),blue+linewidth(1)); draw(circle((0,0),5),red); dot(scale(.7)*"$a$",(0,5),NE); dot(scale(.7)*"$-a$",(0,-5),N); dot(scale(.7)*"$a$",(5,0),NE); dot(scale(.7)*"$-a$",(-5,0),SE); [/asy] Then we substitute $y$ into the first equation to get $x^2+(x^2-a)^2=a^2$ . Expanding, we get $x^4-2ax^2+x^2=0$ . Factoring out the $x^2$ , we get $x^2(x^2-2a+1)=0$ . Then we find that $x=0$ or $x=\pm\sqrt{2a-1}$ . Therefore, $2a-1>0$ , which means $\boxed{12}$ | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | In order to solve for the values of $a$ , we need to just count multiplicities of the roots when the equations are set equal to each other: in other words, take the derivative. We know that $\sqrt{a^2 - x^2} = x^2 - a$ . Now, we take square of both sides, and rearrange to obtain $x^4 - (2a - 1)x^2 = 0$ . Now, we may take the second derivative of the equation to obtain $6x^2 - (2a - 1) = 0$ . Now, we must take discriminant. Since we need the roots of that equation to be real and not repetitive (otherwise they would not intersect each other at three points), the discriminant must be greater than zero. Thus,
\[b^2 - 4ac > 0 \rightarrow 0 - 4(6)(-(2a - 1)) > 0 \rightarrow a > \frac{1}{2}\] The answer is $\boxed{12}$ and we are done. | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | Notice, the equations are of that of a circle of radius a centered at the origin and a parabola translated down by a units. They always intersect at the point $(0, a)$ , and they have symmetry across the $y$ -axis, thus, for them to intersect at exactly $3$ points, it suffices to find the $y$ solution.
First, rewrite the second equation to $y=x^2-a\implies x^2=y+a$ And substitute into the first equation: $y+a+y^2=a^2$ Since we're only interested in seeing the interval in which a can exist, we find the discriminant: $1-4a+4a^2$ . This value must not be less than $0$ (It is the square root part of the quadratic formula). To find when it is $0$ , we find the roots: \[4a^2-4a+1=0 \implies a=\frac{4\pm\sqrt{16-16}}{8}=\frac{1}{2}\] Since $\lim_{a\to \infty}(4a^2-4a+1)=\infty$ , our range is $\boxed{12}$ | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | We can see that if $a = 1$ , we know that the points where the two curves intersect are $(0, -1), (1, 0)$ and $(-1, 0)$ .Because there are only $3$ intersections and $a > 1/2$ , as well as $a > 1/4$ we know that either $\textbf{(D)}$ or $\textbf{(E)}$ is the correct answer. Then we can test a number from $(1/2, 1/4)$ to eliminate the remaining answer. So $\boxed{12}$ is the correct answer. | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | Simply plug in $a = \frac{1}{2}, \frac{1}{4}, 1$ and solve the systems. (This shouldn't take too long.) And then realize that only $a=1$ yields three real solutions for $x$ , so we are done and the answer is $\boxed{12}$ | E | 12 |
d7d81ccee664a9a2c3f977e4bbb2ef0a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_21 | Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$ -plane intersect at exactly $3$ points?
$\textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad$ | An ideal solution come to mind is where they intersect at the $x$ -axis at the same time, which is $(a, 0)$ and $(-a, 0).$ Take the root of our $y=x^2-a$ we get $x=\sqrt{a}$ , set them equal we get $a=\sqrt{a}.$ The only answer is $1$ so it only left us with the answer choice $\boxed{12}$ | E | 12 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | The GCD information tells us that $24$ divides $a$ , both $24$ and $36$ divide $b$ , both $36$ and $54$ divide $c$ , and $54$ divides $d$ . Note that we have the prime factorizations: \begin{align*} 24 &= 2^3\cdot 3,\\ 36 &= 2^2\cdot 3^2,\\ 54 &= 2\cdot 3^3. \end{align*}
Hence we have \begin{align*} a &= 2^3\cdot 3\cdot w\\ b &= 2^3\cdot 3^2\cdot x\\ c &= 2^2\cdot 3^3\cdot y\\ d &= 2\cdot 3^3\cdot z \end{align*} for some positive integers $w,x,y,z$ . Now if $3$ divides $w$ , then $\gcd(a,b)$ would be at least $2^3\cdot 3^2$ which is too large, hence $3$ does not divide $w$ . Similarly, if $2$ divides $z$ , then $\gcd(c,d)$ would be at least $2^2\cdot 3^3$ which is too large, so $2$ does not divide $z$ . Therefore, \[\gcd(a,d)=2\cdot 3\cdot \gcd(w,z)\] where neither $2$ nor $3$ divide $\gcd(w,z)$ . In other words, $\gcd(w,z)$ is divisible only by primes that are at least $5$ . The only possible value of $\gcd(a,d)$ between $70$ and $100$ and which fits this criterion is $78=2\cdot3\cdot13$ , so the answer is $\boxed{13}$ | D | 13 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | We can say that $a$ and $b$ 'have' $2^3 \cdot 3$ , that $b$ and $c$ have $2^2 \cdot 3^2$ , and that $c$ and $d$ have $3^3 \cdot 2$ . Combining $1$ and $2$ yields $b$ has (at a minimum) $2^3 \cdot 3^2$ , and thus $a$ has $2^3 \cdot 3$ (and no more powers of $3$ because otherwise $\gcd(a,b)$ would be different). In addition, $c$ has $3^3 \cdot 2^2$ , and thus $d$ has $3^3 \cdot 2$ (similar to $a$ , we see that $d$ cannot have any other powers of $2$ ). We now assume the simplest scenario, where $a = 2^3 \cdot 3$ and $d = 3^3 \cdot 2$ . According to this base case, we have $\gcd(a, d) = 2 \cdot 3 = 6$ . We want an extra factor between the two such that this number is between $70$ and $100$ , and this new factor cannot be divisible by $2$ or $3$ . Checking through, we see that $6 \cdot 13$ is the only one that works. Therefore the answer is $\boxed{13}$ | D | 13 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | First off, note that $24$ $36$ , and $54$ are all of the form $2^x\times3^y$ . The prime factorizations are $2^3\times 3^1$ $2^2\times 3^2$ and $2^1\times 3^3$ , respectively. Now, let $a_2$ and $a_3$ be the number of times $2$ and $3$ go into $a$ , respectively. Define $b_2$ $b_3$ $c_2$ , and $c_3$ similarly. Now, translate the $lcm$ s into the following: \[1) \min(a_2,b_2)=3\] \[2) \min(a_3,b_3)=1\] \[3) \min(b_2,c_2)=2\] \[4) \min(b_3,c_3)=2\] \[5) \min(c_2,d_2)=1\] \[6) \min(c_3,d_3)=3\]
From $4)$ , we see that $b_3 \geq 2$ , thus from $2)$ $a_3 = 1$ . Similarly, from $3)$ $c_2 \geq 2$ , thus from $5)$ $d_2 = 1$
Note also that $d_3 \geq 3$ and $a_2 \geq 3$ . Therefore \[\min(a_2, d_2) = 1\] \[\min(a_3, d_3) = 1\] Thus, $\gcd(a, d) = 2 \times 3 \times k$ for some $k$ having no factors of $2$ or $3$
Since $70 < \gcd(a, d) < 100$ , the only values for k are $12, 13, 14, 15, 16$ , but all have either factors of $2$ or $3$ , except $\boxed{13}$ . And we're done. | D | 13 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | Notice that $\gcd (a,b,c,d)=\gcd(\gcd(a,b),\gcd(b,c),\gcd(c,d))=\gcd(24,36,54)=6$ , so $\gcd(d,a)$ must be a multiple of $6$ . The only answer choice that gives a value between $70$ and $100$ when multiplied by $6$ is $\boxed{13}$ . - mathleticguyyy + einstein | D | 13 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | [asy] //Variable Declarations defaultpen(0.45); size(200pt); fontsize(15pt); pair X, Y, Z, W; real R; path quad; //Variable Definitions R = 1; X = R*dir(45); Y = R*dir(135); Z = R*dir(-135); W = R*dir(-45); quad = X--Y--Z--W--cycle; //Diagram draw(quad); label("$b$",X,NE); label("$a=2^3 \cdot 3 \cdot p$",Y,NW); label("$d=2 \cdot 3^3 \cdot q$",Z,SW); label("$c$",W,SE); label("$2^3 \cdot 3$",X--Y); label("$2^2 \cdot 3^2$",X--W); label("$2 \cdot 3^3$",Z--W); label("$2 \cdot 3 \cdot k$",Z--Y); [/asy]
The relationship of $a$ $b$ $c$ , and $d$ is shown in the above diagram. $gcd(a,d)=2 \cdot 3 \cdot k$ $70 < 6k < 100$ $12 \le k \le 16$ $k=\boxed{13}$ | D | 13 |
d55dd24b8709b06e5be4522bbfd15715 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_22 | Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$ $\gcd(b, c)=36$ $\gcd(c, d)=54$ , and $70<\gcd(d, a)<100$ . Which of the following must be a divisor of $a$
$\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$ | Just as in solution $1$ , we prime factorize $a, b, c$ and $d$ to observe that
$a=2^3\cdot{3}\cdot{w}$
$b=2^3\cdot{3^2}\cdot{x}$
$c=2^2\cdot{3^3}\cdot{y}$
$d=2\cdot{3^3}\cdot{z}.$
Substituting these expressions for $a$ and $d$ into the final given,
$70<\text{gcd}(2\cdot{3^3}\cdot{z}, 2^3\cdot{3}\cdot{w})<100.$
The greatest common divisor of these two numbers is already $6$ . If $k$ is what we wish to multiply $6$ by to obtain the gcd of these two numbers, then
$70<6k<100$ . Testing the answer choices, only $13$ works for $k$ (in order for the compound inequality to hold). so our gcd is $78$ , which means that $\boxed{13}$ must divide $a$ | D | 13 |
1436c17f162684edae17701340d27906 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_24 | Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$ | Let $BC = a$ $BG = x$ $GC = y$ , and the length of the perpendicular from $BC$ through $A$ be $h$ . By angle bisector theorem, we have that \[\frac{50}{x} = \frac{10}{y},\] where $y = -x+a$ . Therefore substituting we have that $BG=\frac{5a}{6}$ . By similar triangles, we have that $DF=\frac{5a}{12}$ , and the height of this trapezoid is $\frac{h}{2}$ . Then, we have that $\frac{ah}{2}=120$ . We wish to compute $\frac{5a}{8}\cdot\frac{h}{2}$ , and we have that it is $\boxed{75}$ by substituting. | D | 75 |
1436c17f162684edae17701340d27906 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_24 | Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$ | For this problem, we have $\triangle{ADE}\sim\triangle{ABC}$ because of SAS and $DE = \frac{BC}{2}$ . Therefore, $\bigtriangleup ADE$ is a quarter of the area of $\bigtriangleup ABC$ , which is $30$ . Subsequently, we can compute the area of quadrilateral $BDEC$ to be $120 - 30 = 90$ . Using the angle bisector theorem in the same fashion as the previous problem, we get that $\overline{BG}$ is $5$ times the length of $\overline{GC}$ . We want the larger piece, as described by the problem. Because the heights are identical, one area is $5$ times the other, and $\frac{5}{6} \cdot 90 = \boxed{75}$ | D | 75 |
1436c17f162684edae17701340d27906 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_24 | Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$ | The ratio of the $\overline{BG}$ to $\overline{GC}$ is $5:1$ by the Angle Bisector Theorem, so area of $\bigtriangleup ABG$ to the area of $\bigtriangleup ACG$ is also $5:1$ (They have the same height). Therefore, the area of $\bigtriangleup ABG$ is $\frac{5}{5+1}\times120=100$ . Since $\overline{DE}$ is the midsegment of $\bigtriangleup ABC$ , so $\overline{DF}$ is the midsegment of $\bigtriangleup ABG$ . Thus, the ratio of the area of $\bigtriangleup ADF$ to the area of $\bigtriangleup ABG$ is $1:4$ , so the area of $\bigtriangleup ACG$ is $\frac{1}{4}\times100=25$ . Therefore, the area of quadrilateral $FDBG$ is $[ABG]-[ADF]=100-25=\boxed{75}$ | D | 75 |
1436c17f162684edae17701340d27906 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_24 | Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$ | The area of quadrilateral $FDBG$ is the area of $\bigtriangleup ABG$ minus the area of $\bigtriangleup ADF$ . Notice, $\overline{DE} || \overline{BC}$ , so $\bigtriangleup ABG \sim \bigtriangleup ADF$ , and since $\overline{AD}:\overline{AB}=1:2$ , the area of $\bigtriangleup ADF:\bigtriangleup ABG=(1:2)^2=1:4$ . Given that the area of $\bigtriangleup ABC$ is $120$ , using $\frac{bh}{2}$ on side $AB$ yields $\frac{50h}{2}=120\implies h=\frac{240}{50}=\frac{24}{5}$ . Using the Angle Bisector Theorem, $\overline{BG}:\overline{BC}=50:(10+50)=5:6$ , so the height of $\bigtriangleup ABG: \bigtriangleup ACB=5:6$ . Therefore our answer is $\big[ FDBG\big] = \big[ABG\big]-\big[ ADF\big] = \big[ ABG\big]\big(1-\frac{1}{4}\big)=\frac{3}{4}\cdot \frac{bh}{2}=\frac{3}{8}\cdot 50\cdot \frac{5}{6}\cdot \frac{24}{5}=\frac{3}{8}\cdot 200=\boxed{75}$ | D | 75 |
1436c17f162684edae17701340d27906 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_24 | Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$ | We try to find the area of quadrilateral $FDBG$ by subtracting the area outside the quadrilateral but inside triangle $ABC$ . Note that the area of $\triangle ADE$ is equal to $\frac{1}{2} \cdot 25 \cdot 5 \cdot \sin{A}$ and the area of triangle $ABC$ is equal to $\frac{1}{2} \cdot 50 \cdot 10 \cdot \sin A$ . The ratio $\frac{[ADE]}{[ABC]}$ is thus equal to $\frac{1}{4}$ and the area of triangle $ADE$ is $\frac{1}{4} \cdot 120 = 30$ . Let side $BC$ be equal to $6x$ , then $BG = 5x, GC = x$ by the angle bisector theorem. Similarly, we find the area of triangle $AGC$ to be $\frac{1}{2} \cdot 10 \cdot x \cdot \sin C$ and the area of triangle $ABC$ to be $\frac{1}{2} \cdot 6x \cdot 10 \cdot \sin C$ . A ratio between these two triangles yields $\frac{[ACG]}{[ABC]} = \frac{x}{6x} = \frac{1}{6}$ , so $[AGC] = 20$ . Now we just need to find the area of triangle $AFE$ and subtract it from the combined areas of $[ADE]$ and $[ACG]$ , since we count it twice. Note that the angle bisector theorem also applies for $\triangle ADE$ and $\frac{AE}{AD} = \frac{1}{5}$ , so thus $\frac{EF}{ED} = \frac{1}{6}$ and we find $[AFE] = \frac{1}{6} \cdot 30 = 5$ , and the area outside $FDBG$ must be $[ADE] + [AGC] - [AFE] = 30 + 20 - 5 = 45$ , and we finally find $[FDBG] = [ABC] - 45 = 120 -45 = \boxed{75}$ , and we are done. | D | 75 |
ec94c4681771b4e285dbe71637b2b8a4 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_25 | For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$ | By geometric series, we have \begin{alignat*}{8} A_n&=a\bigl(\phantom{ }\underbrace{111\cdots1}_{n\text{ digits}}\phantom{ }\bigr)&&=a\left(1+10+10^2+\cdots+10^{n-1}\right)&&=a\cdot\frac{10^n-1}{9}, \\ B_n&=b\bigl(\phantom{ }\underbrace{111\cdots1}_{n\text{ digits}}\phantom{ }\bigr)&&=b\left(1+10+10^2+\cdots+10^{n-1}\right)&&=b\cdot\frac{10^n-1}{9}, \\ C_n&=c\bigl(\phantom{ }\underbrace{111\cdots1}_{2n\text{ digits}}\phantom{ }\bigr)&&=c\left(1+10+10^2+\cdots+10^{2n-1}\right)&&=c\cdot\frac{10^{2n}-1}{9}. \end{alignat*} By substitution, we rewrite the given equation $C_n - B_n = A_n^2$ as \[c\cdot\frac{10^{2n}-1}{9} - b\cdot\frac{10^n-1}{9} = a^2\cdot\left(\frac{10^n-1}{9}\right)^2.\] Since $n > 0,$ it follows that $10^n > 1.$ We divide both sides by $\frac{10^n-1}{9}$ and then rearrange: \begin{align*} c\left(10^n+1\right) - b &= a^2\cdot\frac{10^n-1}{9} \\ 9c\left(10^n+1\right) - 9b &= a^2\left(10^n-1\right) \\ \left(9c-a^2\right)10^n &= 9b-9c-a^2. &&(\bigstar) \end{align*} Let $y=10^n.$ Note that $(\bigstar)$ is a linear equation with $y,$ and $y$ is a one-to-one function of $n.$ Since $(\bigstar)$ has at least two solutions of $n,$ it has at least two solutions of $y.$ We conclude that $(\bigstar)$ must be an identity, so we get the following system of equations: \begin{align*} 9c-a^2&=0, \\ 9b-9c-a^2&=0. \end{align*} The first equation implies that $c=\frac{a^2}{9}.$ Substituting this into the second equation gives $b=\frac{2a^2}{9}.$
To maximize $a + b + c = a + \frac{a^2}{3},$ we need to maximize $a.$ Clearly, $a$ must be divisible by $3.$ The possibilities for $(a,b,c)$ are $(9,18,9),(6,8,4),$ or $(3,2,1),$ but $(9,18,9)$ is invalid. Therefore, the greatest possible value of $a + b + c$ is $6+8+4=\boxed{18}.$ | D | 18 |
ec94c4681771b4e285dbe71637b2b8a4 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_25 | For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$ | Immediately start trying $n = 1$ and $n = 2$ . These give the system of equations $11c - b = a^2$ and $1111c - 11b = (11a)^2$ (which simplifies to $101c - b = 11a^2$ ). These imply that $a^2 = 9c$ , so the possible $(a, c)$ pairs are $(9, 9)$ $(6, 4)$ , and $(3, 1)$ . The first puts $b$ out of range but the second makes $b = 8$ . We now know the answer is at least $6 + 8 + 4 = 18$
We now only need to know whether $a + b + c = 20$ might work for any larger $n$ . We will always get equations like $100001c - b = 11111a^2$ where the $c$ coefficient is very close to being nine times the $a$ coefficient. Since the $b$ term will be quite insignificant, we know that once again $a^2$ must equal $9c$ , and thus $a = 9, c = 9$ is our only hope to reach $20$ . Substituting and dividing through by $9$ , we will have something like $100001 - \frac{b}{9} = 99999$ . No matter what $n$ really was, $b$ is out of range (and certainly isn't $2$ as we would have needed).
The answer then is $\boxed{18}$ | D | 18 |
ec94c4681771b4e285dbe71637b2b8a4 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_25 | For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$ | The given equation can be written as \[c \cdot (\phantom{ } \overbrace{1111 \ldots 1111}^{2n\text{ digits}}\phantom{ }) - b \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }) = a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ })^2.\] Divide by $\overbrace{11 \ldots 11}^{n\text{ digits}}$ on both sides: \[c \cdot (\phantom{ } \overbrace{1000 \ldots 0001}^{n+1\text{ digits}}\phantom{ }) - b = a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }).\] Next, split the first term to make it easier to deal with: \begin{align*} 2c + c \cdot (\phantom{ }\overbrace{99 \ldots 99}^{n\text{ digits}}\phantom{ }) - b &= a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }) \\ 2c - b &= (a^2 - 9c) \cdot (\phantom{ }\overbrace{11 \ldots 11}^{n\text{ digits}}\phantom{ }). \end{align*} Because $2c - b$ and $a^2 - 9c$ are constants and because there must be at least two distinct values of $n$ that satisfy, $2c - b = a^2 - 9c = 0.$ Thus, we have \begin{align*} 2c&=b, \\ a^2&=9c. \end{align*} Knowing that $a,b,$ and $c$ are single digit positive integers and that $9c$ must be a perfect square, the values of $(a,b,c)$ that satisfy both equations are $(3,2,1)$ and $(6,8,4).$ Finally, $6 + 8 + 4 = \boxed{18}.$ | D | 18 |
ec94c4681771b4e285dbe71637b2b8a4 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_25 | For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$ | By PaperMath’s sum , the answer is $6+8+4=\boxed{18}$ | D | 18 |
a92b77aa1de920dbf999e75985df338c | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_1 | Kate bakes a $20$ -inch by $18$ -inch pan of cornbread. The cornbread is cut into pieces that measure $2$ inches by $2$ inches. How many pieces of cornbread does the pan contain?
$\textbf{(A) } 90 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 180 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 360$ | The area of the pan is $20\cdot18=360$ . Since the area of each piece is $2\cdot2=4$ , there are $\frac{360}{4} = \boxed{90}$ pieces. | A | 90 |
a92b77aa1de920dbf999e75985df338c | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_1 | Kate bakes a $20$ -inch by $18$ -inch pan of cornbread. The cornbread is cut into pieces that measure $2$ inches by $2$ inches. How many pieces of cornbread does the pan contain?
$\textbf{(A) } 90 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 180 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 360$ | By dividing each of the dimensions by $2$ , we get a $10\times9$ grid that makes $\boxed{90}$ pieces. | A | 90 |
41b2b51666f0a144a144e86359a6da2e | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_2 | Sam drove $96$ miles in $90$ minutes. His average speed during the first $30$ minutes was $60$ mph (miles per hour), and his average speed during the second $30$ minutes was $65$ mph. What was his average speed, in mph, during the last $30$ minutes?
$\textbf{(A) } 64 \qquad \textbf{(B) } 65 \qquad \textbf{(C) } 66 \qquad \textbf{(D) } 67 \qquad \textbf{(E) } 68$ | Suppose that Sam's average speed during the last $30$ minutes was $x$ mph.
Recall that a half hour is equal to $30$ minutes. Therefore, Sam drove $60\cdot0.5=30$ miles during the first half hour, $65\cdot0.5=32.5$ miles during the second half hour, and $x\cdot0.5$ miles during the last half hour. We have \begin{align*} 30+32.5+x\cdot0.5&=96 \\ x\cdot0.5&=33.5 \\ x&=\boxed{67} ~Haha0201 ~MRENTHUSIASM | D | 67 |
41b2b51666f0a144a144e86359a6da2e | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_2 | Sam drove $96$ miles in $90$ minutes. His average speed during the first $30$ minutes was $60$ mph (miles per hour), and his average speed during the second $30$ minutes was $65$ mph. What was his average speed, in mph, during the last $30$ minutes?
$\textbf{(A) } 64 \qquad \textbf{(B) } 65 \qquad \textbf{(C) } 66 \qquad \textbf{(D) } 67 \qquad \textbf{(E) } 68$ | Suppose that Sam's average speed during the last $30$ minutes was $x$ mph.
Note that Sam's average speed during the entire trip was $\frac{96}{3/2}=64$ mph. Since Sam drove at $60$ mph, $65$ mph, and $x$ mph for the same duration ( $30$ minutes each), his average speed during the entire trip was the average of $60$ mph, $65$ mph, and $x$ mph. We have \begin{align*} \frac{60+65+x}{3}&=64 \\ 60+65+x&=192 \\ x&=\boxed{67} ~coolmath_2018 ~MRENTHUSIASM | D | 67 |
ca52f82b12ec59fc9116380183724d17 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_3 | In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$ | We have $\binom{4}{2}$ ways to choose the pairs, and we have $2!$ ways for the values to be rearranged, hence $\frac{6}{2}=\boxed{3}$ | B | 3 |
ca52f82b12ec59fc9116380183724d17 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_3 | In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$ | We have four available numbers $(1, 2, 3, 4)$ . Because different permutations do not matter because they are all addition and multiplication, if we put $1$ on the first space, it is obvious there are $\boxed{3}$ possible outcomes $(2, 3, 4)$ | B | 3 |
ca52f82b12ec59fc9116380183724d17 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_3 | In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$ | There are exactly $4!$ ways to arrange the numbers and $2!2!2!$ overcounts per way due to commutativity. Therefore, the answer is $\frac{4!}{2!2!2!}=\boxed{3}$ | B | 3 |
f0f5aa9e3f36cf8a5e68d84791258b51 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_5 | How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$ | Well, there are 4 composite numbers, and you can list them in a 1 number format, a 2 number, 3 number, and a 4 number format. Now, we can use combinations.
$\binom{4}{1} + \binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 15$ . Using the answer choices, the only multiple of 15 is $\boxed{240}$ | D | 240 |
f0f5aa9e3f36cf8a5e68d84791258b51 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_5 | How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$ | Subsets of $\{2,3,4,5,6,7,8,9\}$ include a single digit up to all eight numbers. Therefore, we must add the combinations of all possible subsets and subtract from each of the subsets formed by the composite numbers.
Hence:
$\binom{8}{1} - \binom{4}{1} + \binom{8}{2} - \binom{4}{2} + \binom{8}{3} - \binom{4}{3} + \binom{8}{4} - 1 + \binom{8}{5} + \binom{8}{6} + \binom{8}{7} + 1 = \boxed{240}$ | D | 240 |
f0f5aa9e3f36cf8a5e68d84791258b51 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_5 | How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$ | Total subsets is $(2^8) = 256$ Using complementary counting and finding the sets with composite numbers:
only 4,6,8 and 9 are composite. Each one can be either in the set or out: $2^4$ = 16 $256-16=240$ $\boxed{240}$ | D | 240 |
f0f5aa9e3f36cf8a5e68d84791258b51 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_5 | How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$ | We multiply the number of possibilities of the set having prime numbers and the set having composites.
The possibilities of primes are $2^4-1=15$ (As there is one solution not containing any primes)
The possibilities of the set containing composites are $2^4=16$ (There can be a set with no composites)
Multiplying this we get $15 \cdot 16 = \boxed{240}$ | D | 240 |
22e25a351a5c0e863d462afc5e01da3e | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_7 | In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$ | Use the answer choices and calculate them. The one that works is $\bold{\boxed{19}$ | D | 19 |
22e25a351a5c0e863d462afc5e01da3e | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_7 | In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$ | Let the number of semicircles be $n$ and let the radius of each semicircle be $r$ . To find the total area of all of the small semicircles, we have $n \cdot \frac{\pi \cdot r^2}{2}$
Next, we have to find the area of the larger semicircle. The radius of the large semicircle can be deduced to be $n \cdot r$ . So, the area of the larger semicircle is $\frac{\pi \cdot n^2 \cdot r^2}{2}$
Now that we have found the area of both A and B, we can find the ratio. $\frac{A}{B}=\frac{1}{18}$ , so part-to-whole ratio is $1:19$ . When we divide the area of the small semicircles combined by the area of the larger semicircles, we get $\frac{1}{n}$ . This is equal to $\frac{1}{19}$ . By setting them equal, we find that $n = 19$ . This is our answer, which corresponds to choice $\bold{\boxed{19}$ | D | 19 |
22e25a351a5c0e863d462afc5e01da3e | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_7 | In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$ | Each small semicircle is $\frac{1}{N^2}$ of the large semicircle. Since $N$ small semicircles make $\frac{1}{19}$ of the large one, $\frac{N}{N^2} = \frac1{19}$ . Solving this, we get $\boxed{19}$ . ... | null | 19 |
70c61487f76fbdcf78d5d0c4b7aa491d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_8 | Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$ | A staircase with $n$ steps contains $4 + 6 + 8 + ... + 2n + 2$ toothpicks. This can be rewritten as $(n+1)(n+2) -2$
So, $(n+1)(n+2) - 2 = 180$
So, $(n+1)(n+2) = 182.$
Inspection could tell us that $13 \cdot 14 = 182$ , so the answer is $13 - 1 = \boxed{12}$ | C | 12 |
70c61487f76fbdcf78d5d0c4b7aa491d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_8 | Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$ | Layer $1$ $4$ steps
Layer $1,2$ $10$ steps
Layer $1,2,3$ $18$ steps
Layer $1,2,3,4$ $28$ steps
From inspection, we can see that with each increase in layer the difference in toothpicks between the current layer and the previous increases by $2$ . Using this pattern:
$4, 10, 18, 28, 40, 54, 70, 88, 108, 130, 154, 180$
From this we see that the solution is $\boxed{12}$ | C | 12 |
70c61487f76fbdcf78d5d0c4b7aa491d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_8 | Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$ | We can find a function that gives us the number of toothpicks for every layer. Using finite difference, we know that the degree must be $2$ and the leading coefficient is $1$ . The function is $f(n)=n^2+3n$ where $n$ is the layer and $f(n)$ is the number of toothpicks.
We have to solve for $n$ when $n^2+3n=180\Rightarrow n^2+3n-180=0$ . Factor to get $(n-12)(n+15)$ . The roots are $12$ and $-15$ . Clearly $-15$ is impossible so the answer is $\boxed{12}$ | C | 12 |
70c61487f76fbdcf78d5d0c4b7aa491d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_8 | Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$ | Notice that the number of toothpicks can be found by adding all the horizontal and all the vertical toothpicks. We can see that for the case of 3 steps, there are $2(3+3+2+1)=18$ toothpicks. Thus, the equation is $2S + 2(1+2+3...+S)=180$ with $S$ being the number of steps. Solving, we get $S = 12$ , or $\boxed{12}$ .
-liu4505 | C | 12 |
70c61487f76fbdcf78d5d0c4b7aa491d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_8 | Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$ | There are $\frac{n(n+1)}{2}$ squares. Each has $4$ toothpick sides. To remove overlap, note that there are $4n$ perimeter toothpicks. $\frac{\frac{n(n+1)}{2}\cdot 4-4n}{2}$ is the number of overlapped toothpicks
Add $4n$ to get the perimeter (non-overlapping). Formula is $\text{number of toothpicks} = n^2+3n$ Then you can "guess" or factor (also guessing) to get the answer $\boxed{12}$ .
~bjc | C | 12 |
8451b2a53384396e263232d4521c1f4b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_9 | The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$ . Let $p$ be the probabilities that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$ . What other sum occurs with the same probability as $p$
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$ | It can be seen that the probability of rolling the smallest number possible is the same as the probability of rolling the largest number possible, the probability of rolling the second smallest number possible is the same as the probability of rolling the second largest number possible, and so on. This is because the number of ways to add a certain number of ones to an assortment of $7$ ones is the same as the number of ways to take away a certain number of ones from an assortment of $7$ $6$ s.
So, we can match up the values to find the sum with the same probability as $10$ . We can start by noticing that $7$ is the smallest possible roll and $42$ is the largest possible roll. The pairs with the same probability are as follows:
$(7, 42), (8, 41), (9, 40), (10, 39), (11, 38)...$
However, we need to find the number that matches up with $10$ . So, we can stop at $(10, 39)$ and deduce that the sum with equal probability as $10$ is $39$ . So, the correct answer is $\boxed{39}$ , and we are done. | D | 39 |
8451b2a53384396e263232d4521c1f4b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_9 | The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$ . Let $p$ be the probabilities that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$ . What other sum occurs with the same probability as $p$
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$ | Let's call the unknown value $x$ . By symmetry, we realize that the difference between 10 and the minimum value of the rolls is equal to the difference between the maximum and $x$ . So,
$10 - 7 = 42- x$
$x = 39$ and our answer is $\boxed{39}$ By: Soccer_JAMS | D | 39 |
8451b2a53384396e263232d4521c1f4b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_9 | The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$ . Let $p$ be the probabilities that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$ . What other sum occurs with the same probability as $p$
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$ | For the sums to have equal probability, the average sum of both sets of $7$ dies has to be $(6+1)\cdot 7 = 49$ . Since having $10$ is similar to not having $10$ , you just subtract 10 from the expected total sum. $49 - 10 = 39$ so the answer is $\boxed{39}$ | D | 39 |
8451b2a53384396e263232d4521c1f4b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_9 | The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$ . Let $p$ be the probabilities that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$ . What other sum occurs with the same probability as $p$
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$ | The expected value of the sums of the die rolls is $3.5\cdot7=24.5$ , and since the probabilities should be distributed symmetrically on both sides of $24.5$ , the answer is $24.5+(24.5-10)=39$ , which is $\boxed{39}$ | D | 39 |
8451b2a53384396e263232d4521c1f4b | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_9 | The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$ . Let $p$ be the probabilities that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$ . What other sum occurs with the same probability as $p$
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$ | Another faster and easier way of doing this, without using almost any math at all, is realizing that the possible sums are ${7,8,9,10,...,39,40,41,42}$ . By symmetry, (and doing a few similar problems in the past), you can realize that the probability of obtaining $7$ is the same as the probability of obtaining $42$ $P(8)=P(41)$ and on and on and on. This means that $P(10)=P(39)$ , and thus the correct answer is $\boxed{39}$ | D | 39 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | Consider the cross-sectional plane and label its area $b$ . Note that the volume of the triangular prism that encloses the pyramid is $\frac{bh}{2}=3$ , and we want the rectangular pyramid that shares the base and height with the triangular prism. The volume of the pyramid is $\frac{bh}{3}$ , so the answer is $\boxed{2}$ .uwu (AOPS12142015) | E | 2 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | If you look carefully, you will see that on the either side of the pyramid in question, there are two congruent tetrahedra. The volume of one is $\frac{1}{3}Bh$ , with its base being half of one of the rectangular prism's faces and its height being half of one of the edges, so its volume is $\frac{1}{3} (3 \times 2/2 \times \frac{1}{2})=\frac{1}{2}$ . We can obtain the answer by subtracting twice this value from the diagonal half prism, or $(\frac{1}{2} \times 3 \times 2 \times 1) - (2 \times \frac{1}{2})=$ $\boxed{2}$ | null | 2 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | You can calculate the volume of the rectangular pyramid by using the formula, $\frac{Ah}{3}$ $A$ is the area of the base, $BCHE$ , and is equal to $BC * BE$ . The height, $h$ , is equal to the height of triangle $FBE$ drawn from $F$ to $BE$
$BE=\sqrt{BF^2 + EF^2}=\sqrt{13}$ Area of $BCHE = BC * BE = \sqrt{13}$
$h = 2 *$ Area of $FBE / BE$ (since Area $= \frac{1}{2}bh$ ).
Area of $FBE = \frac{1}{2} * FB * FE = 3$
$h = 2 * 3 / \sqrt{13} = \frac{6}{\sqrt{13}}$
Volume of pyramid $=\frac{1}{3} * \sqrt{13} * \frac{6}{\sqrt{13}} = 2$
Answer is $\boxed{2}$ | E | 2 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | We can start by identifying the information we need. We need to find the area of rectangle $EHCB$ and the height of rectangular prism $EHCBM$
In order to find the area of $EHCB,$ we can use the Pythagorean Theorem. We find that $EB = \sqrt{13}$ , so the area of rectangle $EHCB = \sqrt{13}$ . We shall refer to this as $x$
In order to find the height of rectangular prism $EHCBM$ , we can examine triangle $EFB$ . We can use the Geometric Mean Theorem to find that when an altitude is dropped from point $F,$ $\overline{EB}$ is split into segments of length $\dfrac{4 \cdot \sqrt{13}}{13}$ and $\dfrac{9 \cdot \sqrt{13}}{13}$ . Taking the geometric mean of these numbers, we find that the altitude has length $\dfrac{6 \cdot \sqrt{13}}{13}$ . This is also the height of the rectangular prism, which we shall refer to as $y$
Plugging $x$ and $y$ into the formula $V = \dfrac{b \cdot h}{3},$ we find that the volume is $\boxed{2}$ | E | 2 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | We start by setting the formula for the volume of a rectangular pyramid: $\frac{1}{3}Bh$ . By the Pythagorean Theorem, we know that $BE = \sqrt{BF^2 + EF^2} = \sqrt{13}$ . Therefore, the area of the base is $1 \times \sqrt{13} = \sqrt{13}$ . Next, we would like to know the height of the pyramid. We can observe that the altitude from point $F$ in $\triangle EFB$ is parallel to the height of the pyramid and therefore congruent because those two altitudes are on the same plane of base $EBCH$ . From this, we only need to find the altitude from point $F$ in $\triangle EFB$ and plug it into our formula for the volume of a rectangular pyramid. This is easy because we already know the area of $\triangle EFB$ and the base from point $F$ , so all we need to do is divide: $\frac{2 \times 3}{\sqrt{13}} = \frac{6}{\sqrt{13}} = \frac{6\sqrt{13}}{13}$ . Now all we need to do is plug in all our known values into the volume formula: $\frac{1}{3}Bh = \frac{\sqrt{13} \times \frac{6\sqrt{13}}{13}}{3} = \boxed{2}$ | E | 2 |
dde422fbadb4f280cf5e468b4f04503a | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_10 | In the rectangular parallelepiped shown, $AB$ $3$ $BC$ $1$ , and $CG$ $2$ . Point $M$ is the midpoint of $\overline{FG}$ . What is the volume of the rectangular pyramid with base $BCHE$ and apex $M$
[asy] size(250); defaultpen(fontsize(10pt)); pair A =origin; pair B = (4.75,0); pair E1=(0,3); pair F = (4.75,3); pair G = (5.95,4.2); pair C = (5.95,1.2); pair D = (1.2,1.2); pair H= (1.2,4.2); pair M = ((4.75+5.95)/2,3.6); draw(E1--M--H--E1--A--B--E1--F--B--M--C--G--H); draw(B--C); draw(F--G); draw(A--D--H--C--D,dashed); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,W); label("$E$",E1,W); label("$F$",F,SW); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,N); dot(A); dot(B); dot(E1); dot(F); dot(G); dot(C); dot(D); dot(H); dot(M); label("3",A/2+B/2,S); label("2",C/2+G/2,E); label("1",C/2+B/2,SE); [/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{5}{3} \qquad \textbf{(E) } 2$ | AMC 10B 10 2018.jpg
Using the Pythagorean Theorem, we can easily find that $EB = \sqrt{2^2 + 3^2} = \sqrt{13}$ . Quickly computing, we find the area of the base, $BCHE = \sqrt{13} \cdot 1 = \sqrt{13}$ . Now we can make the following adjustments to our 3d shape as shown in the diagram. All we need now is to solve for the height, or $XM$ . We can set up to following equation due to our knowledge of altitudes(of the hypotenuse)in right triangles. We can set up the following equations: \begin{align*} b(a+b) &= (MH_1)^2 \\ a(a+b) &= (MH_2)^2 \\ b\sqrt{13} &= 3^2 \\ a\sqrt{13} &= 2^2 \\ b &= \dfrac{9}{\sqrt{13}} \\ a &= \dfrac{4}{\sqrt{13}} \\ (MX)^2 &= ab \\ (MX)^2 &= \dfrac{9 \cdot 4}{13} \\ MX &= \dfrac {3 \cdot 2}{\sqrt{13}} \\ \end{align*} Thus $\triangle V_{BCHEM} = \dfrac{\text{(height)}\cdot \text{(base)}}{3} = \dfrac{MX \cdot BCHE}{3} = \dfrac {\sqrt{13} \cdot \dfrac{3 \cdot 2}{\sqrt{13}}}{3}$ $= \boxed{2}$ | E | 2 |
8ac95b69d1ee275a10ed49a1b2f9e061 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_12 | Line segment $\overline{AB}$ is a diameter of a circle with $AB = 24$ . Point $C$ , not equal to $A$ or $B$ , lies on the circle. As point $C$ moves around the circle, the centroid (center of mass) of $\triangle ABC$ traces out a closed curve missing two points. To the nearest positive integer, what is the area of the region bounded by this curve?
$\textbf{(A) } 25 \qquad \textbf{(B) } 38 \qquad \textbf{(C) } 50 \qquad \textbf{(D) } 63 \qquad \textbf{(E) } 75$ | For each $\triangle ABC,$ note that the length of one median is $OC=12.$ Let $G$ be the centroid of $\triangle ABC.$ It follows that $OG=\frac13 OC=4.$
As shown below, $\triangle ABC_1$ and $\triangle ABC_2$ are two shapes of $\triangle ABC$ with centroids $G_1$ and $G_2,$ respectively: [asy] /* Made by MRENTHUSIASM */ size(200); pair O, A, B, C1, C2, G1, G2, M1, M2; O = (0,0); A = (-12,0); B = (12,0); C1 = (36/5,48/5); C2 = (-96/17,-180/17); G1 = O + 1/3 * C1; G2 = O + 1/3 * C2; M1 = (4,0); M2 = (-4,0); draw(Circle(O,12)); draw(Circle(O,4),red); dot("$O$", O, (3/5,-4/5), linewidth(4.5)); dot("$A$", A, W, linewidth(4.5)); dot("$B$", B, E, linewidth(4.5)); dot("$C_1$", C1, dir(C1), linewidth(4.5)); dot("$C_2$", C2, dir(C2), linewidth(4.5)); dot("$G_1$", G1, 1.5*E, linewidth(4.5)); dot("$G_2$", G2, 1.5*W, linewidth(4.5)); draw(A--B^^A--C1--B^^A--C2--B); draw(O--C1^^O--C2); dot(M1,red+linewidth(0.8),UnFill); dot(M2,red+linewidth(0.8),UnFill); [/asy] Therefore, point $G$ traces out a circle (missing two points) with the center $O$ and the radius $\overline{OG},$ as indicated in red. To the nearest positive integer, the area of the region bounded by the red curve is $\pi\cdot OG^2=16\pi\approx\boxed{50}.$ | C | 50 |
8ac95b69d1ee275a10ed49a1b2f9e061 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_12 | Line segment $\overline{AB}$ is a diameter of a circle with $AB = 24$ . Point $C$ , not equal to $A$ or $B$ , lies on the circle. As point $C$ moves around the circle, the centroid (center of mass) of $\triangle ABC$ traces out a closed curve missing two points. To the nearest positive integer, what is the area of the region bounded by this curve?
$\textbf{(A) } 25 \qquad \textbf{(B) } 38 \qquad \textbf{(C) } 50 \qquad \textbf{(D) } 63 \qquad \textbf{(E) } 75$ | We assign coordinates. Let $A = (-12,0)$ $B = (12,0)$ , and $C = (x,y)$ lie on the circle $x^2 +y^2 = 12^2$ . Then, the centroid of $\triangle ABC$ is $G = \left(\frac{-12 + 12 + x}{3}, \frac{0 + 0 + y}{3}\right) = \left(\frac x3,\frac y3\right)$ . Thus, $G$ traces out a circle with a radius $\frac13$ of the radius of the circle that point $C$ travels on. Thus, $G$ traces out a circle of radius $\frac{12}{3} = 4$ , which has area $16\pi\approx \boxed{50}$ | C | 50 |
8ac95b69d1ee275a10ed49a1b2f9e061 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_12 | Line segment $\overline{AB}$ is a diameter of a circle with $AB = 24$ . Point $C$ , not equal to $A$ or $B$ , lies on the circle. As point $C$ moves around the circle, the centroid (center of mass) of $\triangle ABC$ traces out a closed curve missing two points. To the nearest positive integer, what is the area of the region bounded by this curve?
$\textbf{(A) } 25 \qquad \textbf{(B) } 38 \qquad \textbf{(C) } 50 \qquad \textbf{(D) } 63 \qquad \textbf{(E) } 75$ | First we can draw a few conclusions from the given information. Firstly we can see clearly that the distance from the centroid to the center of the circle will remain the same no matter $C$ is on the circle. Also we can see that because the two legs of every triangles will always originate on the diameter, using inscribed angle rules, we know that $\angle C = \frac{180^\circ}{2} = 90^\circ$ . Now we know that all triangles $ABC$ will be a right triangle. We also know that the closed curve will simply be a circle with radius equal to the centroid of each triangle. We can now pick any arbitrary triangle, calculate its centroid, and the plug it in to the area formula. Using a $45^\circ$ $45^\circ$ $90^\circ$ triangle in conjunction with the properties of a centroid, we can quickly see that the length of the centroid is $4$ now we can plug it in to the area formula where we get $16\pi\approx\boxed{50}$ | C | 50 |
35b7f549d66e14089b1204258ba4c1df | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_13 | How many of the first $2018$ numbers in the sequence $101, 1001, 10001, 100001, \dots$ are divisible by $101$
$\textbf{(A) }253 \qquad \textbf{(B) }504 \qquad \textbf{(C) }505 \qquad \textbf{(D) }506 \qquad \textbf{(E) }1009 \qquad$ | The number $10^n+1$ is divisible by 101 if and only if $10^n\equiv -1\pmod{101}$ . We note that $(10,10^2,10^3,10^4)\equiv (10,-1,-10,1)\pmod{101}$ , so the powers of 10 are 4-periodic mod 101.
It follows that $10^n\equiv -1\pmod{101}$ if and only if $n\equiv 2\pmod 4$
In the given list, $10^2+1,10^3+1,10^4+1,\dots,10^{2019}+1$ , the desired exponents are $2,6,10,\dots,2018$ , and there are $\dfrac{2020}{4}=\boxed{505}$ numbers in that list. | C | 505 |
35b7f549d66e14089b1204258ba4c1df | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_13 | How many of the first $2018$ numbers in the sequence $101, 1001, 10001, 100001, \dots$ are divisible by $101$
$\textbf{(A) }253 \qquad \textbf{(B) }504 \qquad \textbf{(C) }505 \qquad \textbf{(D) }506 \qquad \textbf{(E) }1009 \qquad$ | Note that $10^{2k}+1$ for some odd $k$ will suffice $\mod {101}$ . Each $2k \in \{2,6,10,\dots,2018\}$ , so the answer is $\boxed{505}$ | C | 505 |
35b7f549d66e14089b1204258ba4c1df | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_13 | How many of the first $2018$ numbers in the sequence $101, 1001, 10001, 100001, \dots$ are divisible by $101$
$\textbf{(A) }253 \qquad \textbf{(B) }504 \qquad \textbf{(C) }505 \qquad \textbf{(D) }506 \qquad \textbf{(E) }1009 \qquad$ | If we divide each number by $101$ , we see a pattern occuring in every 4 numbers. $101, 1000001, 10000000001, \dots$ . We divide $2018$ by $4$ to get $504$ with $2$ left over. Looking at our pattern of four numbers from above, the first number is divisible by $101$ . This means that the first of the $2$ left over will be divisible by $101$ , so our answer is $\boxed{505}$ | C | 505 |
35b7f549d66e14089b1204258ba4c1df | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_13 | How many of the first $2018$ numbers in the sequence $101, 1001, 10001, 100001, \dots$ are divisible by $101$
$\textbf{(A) }253 \qquad \textbf{(B) }504 \qquad \textbf{(C) }505 \qquad \textbf{(D) }506 \qquad \textbf{(E) }1009 \qquad$ | Note that $909$ is divisible by $101$ , and thus $9999$ is too. We know that $101$ is divisible and $1001$ isn't so let us start from $10001$ . We subtract $9999$ to get 2. Likewise from $100001$ we subtract, but we instead subtract $9999$ times $10$ or $99990$ to get $11$ . We do it again and multiply the 9's by $10$ to get $101$ . Following the same knowledge, we can use mod $101$ to finish the problem. The sequence will just be subtracting 1, multiplying by 10, then adding 1. Thus the sequence is ${0,-9,-99 ( 2),11, 0, ...}$ . Thus it repeats every four. Consider the sequence after the 1st term and we have 2017 numbers. Divide $2017$ by four to get $504$ remainder $1$ . Thus the answer is $504$ plus the 1st term or $\boxed{505}$ | C | 505 |
35b7f549d66e14089b1204258ba4c1df | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_13 | How many of the first $2018$ numbers in the sequence $101, 1001, 10001, 100001, \dots$ are divisible by $101$
$\textbf{(A) }253 \qquad \textbf{(B) }504 \qquad \textbf{(C) }505 \qquad \textbf{(D) }506 \qquad \textbf{(E) }1009 \qquad$ | Note that $101=x^2+1$ and $100...0001=x^n+1$ , where $x=10$ . We have that $\frac{x^n+1}{x^2+1}$ must have a remainder of $0$ . By the remainder theorem, the roots of $x^2+1$ must also be roots of $x^n+1$ . Plugging in $i,-i$ to $x^n+1$ yields that $n\equiv2\mod{4}$ . Because the sequence starts with $10^2+1$ , the answer is $\lceil 2018/4 \rceil=\boxed{505}$ | C | 505 |
9845940206d05640c85207d7fe016fde | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_14 | A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$ | To minimize the number of distinct values, we want to maximize the number of times a number appears. So, we could have $223$ numbers appear $9$ times, $1$ number appear once, and the mode appear $10$ times, giving us a total of $223 + 1 + 1 = \boxed{225}.$ | D | 225 |
9845940206d05640c85207d7fe016fde | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_14 | A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$ | As in Solution 1, we want to maximize the number of time each number appears to do so. We can set up an equation $10 + 9( x - 1 )\geq2018,$ where $x$ is the number of values. Notice how we can then rearrange the equation into $1 + 9 ( 1 )+9 ( x - 1 )\geq2018,$ which becomes $9 x\geq2017,$ or $x\geq224\frac19.$ We cannot have a fraction of a value so we must round up to $\boxed{225}.$ | D | 225 |
474e57adc668159776c6a96e77e45947 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_16 | Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that \[a_1+a_2+\cdots+a_{2018}=2018^{2018}.\] What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$ | Verify that $a^3 \equiv a \pmod{6}$ manually for all $a\in \mathbb{Z}/6\mathbb{Z}$ . We check: $0^3 \equiv 0 \pmod{6}$ $1^3 \equiv 1 \pmod{6}$ $2^3 \equiv 8 \equiv 2 \pmod{6}$ $3^3 \equiv 27 \equiv 3 \pmod{6}$ $4^3 \equiv 64 \equiv 4 \pmod{6}$ , and $5^3 \equiv 125 \equiv 5 \pmod{6}$ . We conclude that $a^3 \equiv a \pmod{6}$
Therefore, \[a_1+a_2+\cdots+a_{2018} \equiv a_1^3+a_2^3+\cdots+a_{2018}^3 \pmod{6}.\]
Thus the answer is congruent to $2018^{2018}\equiv 2^{2018} \pmod{6} = \boxed{4}$ alternates with $2$ and $4$ when $n$ increases. | E | 4 |
474e57adc668159776c6a96e77e45947 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_16 | Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that \[a_1+a_2+\cdots+a_{2018}=2018^{2018}.\] What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$ | Note that $\left(a_1+a_2+\cdots+a_{2018}\right)^3=a_1^3+a_2^3+\cdots+a_{2018}^3+3a_1^2\left(a_1+a_2\\ +\cdots+a_{2018}-a_1\right)+3a_2^2\left(a_1+a_2+\cdots+a_{2018}-a_2\right)+\cdots+3a_{2018}^2\left(a_1+a_2+\cdots+a_{2018}-a_{2018}\right)+6\sum_{i\neq j\neq k}^{2018} a_ia_ja_k$
Note that $a_1^3+a_2^3+\cdots+a_{2018}^3+3a_1^2\left(a_1+a_2+\cdots+a_{2018}-a_1\right)+3a_2^2\left(a_1+a_2+\cdots+a_{2018}-a_2\right)+\cdots+3a_{2018}^2\left(a_1+a_2+\cdots+a_{2018}-a_{2018}\right)+6\sum_{i\neq j\neq k}^{2018} a_ia_ja_k\equiv a_1^3+a_2^3+\cdots+a_{2018}^3+3a_1^2({2018}^{2018}-a_1)+3a_2^2({2018}^{2018}-a_2)+\cdots+3a_{2018}^2({2018}^{2018}-a_{2018}) \equiv -2(a_1^3+a_2^3+\cdots+a_{2018}^3)\pmod 6$ Therefore, $-2(a_1^3+a_2^3+\cdots+a_{2018}^3)\equiv \left(2018^{2018}\right)^3\equiv\left( 2^{2018}\right)^3\equiv 4^3\equiv 4\pmod{6}$
Thus, $a_1^3+a_2^3+\cdots+a_{2018}^3\equiv 1\pmod 3$ . However, since cubing preserves parity, and the sum of the individual terms is even, the sum of the cubes is also even, and our answer is $\boxed{4}$ | E | 4 |
474e57adc668159776c6a96e77e45947 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_16 | Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that \[a_1+a_2+\cdots+a_{2018}=2018^{2018}.\] What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$ | First, we can assume that the problem will have a consistent answer for all possible values of $a_1$ . For the purpose of this solution, we will assume that $a_1 = 1$
We first note that $1^3+2^3+...+n^3 = (1+2+...+n)^2$ . So what we are trying to find is what $\left(2018^{2018}\right)^2=\left(2018^{4036}\right)$ mod $6$ . We start by noting that $2018$ is congruent to $2 \pmod{6}$ . So we are trying to find $\left(2^{4036}\right) \pmod{6}$ . Instead of trying to do this with some number theory skills, we could just look for a pattern. We start with small powers of $2$ and see that $2^1$ is $2$ mod $6$ $2^2$ is $4$ mod $6$ $2^3$ is $2$ mod $6$ $2^4$ is $4$ mod $6$ , and so on... So we see that since $\left(2^{4036}\right)$ has an even power, it must be congruent to $4 \pmod{6}$ , thus giving our answer $\boxed{4}$ . You can prove this pattern using mods. But I thought this was easier. | E | 4 |
474e57adc668159776c6a96e77e45947 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_16 | Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that \[a_1+a_2+\cdots+a_{2018}=2018^{2018}.\] What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$ | First, we can assume that the problem will have a consistent answer for all possible values of $a_1$ . For the purpose of this solution, assume $a_1, a_2, ... a_{2017}$ are multiples of 6 and find $2018^{2018} \pmod{6}$ (which happens to be $4$ ). Then ${a_1}^3 + ... + {a_{2018}}^3$ is congruent to $64 \pmod{6}$ or just $\boxed{4}$ | E | 4 |
474e57adc668159776c6a96e77e45947 | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_16 | Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that \[a_1+a_2+\cdots+a_{2018}=2018^{2018}.\] What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$ | Due to the large amounts of variables in the problem, and the fact that the test is only 75 minutes, you can assume that the answer is probably just $2018^{2018} \pmod{6}$ , which is $\boxed{4}$ | E | 4 |
f71a937f00c4ba287adc39caa511d37d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_17 | In rectangle $PQRS$ $PQ=8$ and $QR=6$ . Points $A$ and $B$ lie on $\overline{PQ}$ , points $C$ and $D$ lie on $\overline{QR}$ , points $E$ and $F$ lie on $\overline{RS}$ , and points $G$ and $H$ lie on $\overline{SP}$ so that $AP=BQ<4$ and the convex octagon $ABCDEFGH$ is equilateral. The length of a side of this octagon can be expressed in the form $k+m\sqrt{n}$ , where $k$ $m$ , and $n$ are integers and $n$ is not divisible by the square of any prime. What is $k+m+n$
$\textbf{(A) } 1 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 21 \qquad \textbf{(D) } 92 \qquad \textbf{(E) } 106$ | Let $AP=BQ=x$ . Then $AB=8-2x$
Now notice that since $CD=8-2x$ we have $QC=DR=x-1$
Thus by the Pythagorean Theorem we have $x^2+(x-1)^2=(8-2x)^2$ which becomes $2x^2-30x+63=0\implies x=\dfrac{15-3\sqrt{11}}{2}$
Our answer is $8-(15-3\sqrt{11})=3\sqrt{11}-7\implies \boxed{7}$ . (Mudkipswims42) | B | 7 |
f71a937f00c4ba287adc39caa511d37d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_17 | In rectangle $PQRS$ $PQ=8$ and $QR=6$ . Points $A$ and $B$ lie on $\overline{PQ}$ , points $C$ and $D$ lie on $\overline{QR}$ , points $E$ and $F$ lie on $\overline{RS}$ , and points $G$ and $H$ lie on $\overline{SP}$ so that $AP=BQ<4$ and the convex octagon $ABCDEFGH$ is equilateral. The length of a side of this octagon can be expressed in the form $k+m\sqrt{n}$ , where $k$ $m$ , and $n$ are integers and $n$ is not divisible by the square of any prime. What is $k+m+n$
$\textbf{(A) } 1 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 21 \qquad \textbf{(D) } 92 \qquad \textbf{(E) } 106$ | Denote the length of the equilateral octagon as $x$ . The length of $\overline{BQ}$ can be expressed as $\frac{8-x}{2}$ . By the Pythagorean Theorem, we find that: \[\left(\frac{8-x}{2}\right)^2+\overline{CQ}^2=x^2\implies \overline{CQ}=\sqrt{x^2-\left(\frac{8-x}{2}\right)^2}\] Since $\overline{CQ}=\overline{DR}$ , we can say that $x+2\sqrt{x^2-\left(\frac{8-x}{2}\right)^2}=6\implies x=-7\pm3\sqrt{11}$ . We can discard the negative solution, so $k+m+n=-7+3+11=\boxed{7}$ ~ blitzkrieg21 | B | 7 |
f71a937f00c4ba287adc39caa511d37d | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10B_Problems/Problem_17 | In rectangle $PQRS$ $PQ=8$ and $QR=6$ . Points $A$ and $B$ lie on $\overline{PQ}$ , points $C$ and $D$ lie on $\overline{QR}$ , points $E$ and $F$ lie on $\overline{RS}$ , and points $G$ and $H$ lie on $\overline{SP}$ so that $AP=BQ<4$ and the convex octagon $ABCDEFGH$ is equilateral. The length of a side of this octagon can be expressed in the form $k+m\sqrt{n}$ , where $k$ $m$ , and $n$ are integers and $n$ is not divisible by the square of any prime. What is $k+m+n$
$\textbf{(A) } 1 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 21 \qquad \textbf{(D) } 92 \qquad \textbf{(E) } 106$ | Let the octagon's side length be $x$ . Then $PH = \frac{6 - x}{2}$ and $PA = \frac{8 - x}{2}$ . By the Pythagorean theorem, $PH^2 + PA^2 = HA^2$ , so $\left(\frac{6 - x}{2} \right)^2 + \left(\frac{8 - x}{2} \right)^2 = x^2$ . By expanding the left side and combining the like terms, we get $\frac{x^2}{2} - 7x + 25 = x^2 \implies -\frac{x^2}{2} - 7x + 25 = 0$ . Solving this using the quadratic formula, $\frac{-b \pm \sqrt{b^2-4ac}}{2a}$ , we use $a = -\frac{1}{2}$ $b = -7$ , and $c = 25$ , to get one positive solution, $x=-7+3\sqrt{11}$ , so $k+m+n=-7+3+11=\boxed{7}$ | B | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.