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 |
|---|---|---|---|---|---|
bc958ce2333164b4e62bdad7adc0b369 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_8 | What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\]
$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$ | Another solution involves adding everything and subtracting out what is not needed. The first step involves solving $1+2+3+4+5+6+7+8+\cdots+197+198+199+200$ . To do this, we can simply multiply $200$ and $201$ and divide by $2$ to get us $20100$ . The next step involves subtracting out the numbers with minus signs. We actually have to do this twice, because we need to take out the numbers we weren’t supposed to add and then subtract them from the problem. Then, we can see that from $4$ to $200$ , incrementing by $4$ , there are $50$ numbers that we have to subtract. To do this we can do $50$ times $51$ divided by $2$ , and then we can multiply by $4$ , because we are counting by fours, not ones. Our answer will be $5100$ , but remember, we have to do this twice. Once we do that, we will get $10200$ . Finally, we just have to do $20100-10200$ , and our answer is $\boxed{9900}$ | B | 9900 |
bc958ce2333164b4e62bdad7adc0b369 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_8 | What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\]
$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$ | In this solution, we group every 4 terms. Our groups should be: $1 + 2 + 3 - 4 = 2$ $5 + 6 + 7 - 8 = 10$ $9 + 10 + 11 - 12 = 18$ , ... $197 + 198 + 199 - 200 = 394$ . We add them together to get this expression: $2 + 10 + 18 + ... + 394$ . This can be rewritten as $8 * (0 + 1 + 2 + ... + 49) + 100$ . We add this to get $\boxed{9900}$ . ~Baolan | B | 9900 |
bc958ce2333164b4e62bdad7adc0b369 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_8 | What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\]
$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$ | We can split up this long sum into groups of four integers. Finding the first few sums, we have that $1 + 2 + 3 - 4 = 2$ $5 + 6 + 7 - 8 = 10$ , and $9 + 10 + 11 - 12 = 18$ . Notice that this is an increasing arithmetic sequence, with a common difference of $8$ . We can find the sum of the arithmetic sequence by finding the average of the first and last terms, and then multiplying by the number of terms in the sequence. The first term is $1 + 2 + 3 - 4$ , or $2$ , the last term is $197 + 198 + 199 - 200$ , or $394$ , and there are $200\div 4$ or $50$ terms. So, we have that the sum of the sequence is $\frac{(394+2)\cdot 50}{2}$ , or $\boxed{9900}$ . ~Arctic_Bunny | B | 9900 |
bc958ce2333164b4e62bdad7adc0b369 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_8 | What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\]
$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$ | Note that the original expression is equal to \[(1+2+3+\dots+199+200)-2(4(1+2+3+\dots+49+50)).\] Since the sum of the first $n$ positive integers is $\frac{n(n+1)}{2}$ , this is equal to \[\frac{200(201)}{2}-2\left(4\left(\frac{50(51)}{2}\right)\right),\] which can be simplified as \[20100-4(50)(51)=20100-10200.\] Doing the subtraction yields $\boxed{9900}$ . -BorealBear | B | 9900 |
bc958ce2333164b4e62bdad7adc0b369 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_8 | What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\]
$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$ | We can split the sum into 4 groups so that the terms in these groups have the same common difference of 4 $(1+5+9+...+197)+(2+6+10+...+198)+(3+7+11+...+199)-(4+8+12+...+200)$ .
Then, we can use the sum formula. It's equal to $\frac{50\cdot(1+197)}{2} + \frac{50\cdot(2+198)}{2} + \frac{50\cdot(3+199)}{2} - \frac{50\cdot(4+200)}{2}$ .
This can also be expressed as $(25\cdot198) + (25\cdot200) + (25\cdot202) - (25\cdot204)$ .
And it is equal to $25\cdot(198+200+202-204) = 25\cdot396 = 9900$ .
Therefore, the answer is $\boxed{9900}$ . ~kurbanlik_21 | B | 9900 |
901e814bf5e2839553599c87b55e0355 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_9 | A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$
$\textbf{(A) } 9 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 27 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 77$ | The least common multiple of $7$ and $11$ is $77$ . Therefore, there must be $77$ adults and $77$ children. The total number of benches is $\frac{77}{7}+\frac{77}{11}=11+7=\boxed{18}$ .~taarunganesh | B | 18 |
901e814bf5e2839553599c87b55e0355 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_9 | A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$
$\textbf{(A) } 9 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 27 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 77$ | Let $x$ denote how many adults there are. Since the number of adults is equal to the number of children we can write $N$ as $\frac{x}{7}+\frac{x}{11}=N$ . Simplifying we get $\frac{18x}{77} = N$ Since both $n$ and $x$ have to be positive integers, $x$ has to equal $77$ . Therefore, $N=\boxed{18}$ is our final answer. | B | 18 |
a3d32eb2bc15888737359ebdb8d58c74 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_10 | Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$ | The volume of each cube follows the pattern of $n^3$ , for $n$ is between $1$ and $7$
We see that the total surface area can be comprised of three parts: the sides of the cubes, the tops of the cubes, and the bottom of the $7\times 7\times 7$ cube (which is just $7 \times 7 = 49$ ). The sides areas can be measured as the sum $4\sum_{n=1}^{7} n^2$ , giving us $560$ . Structurally, if we examine the tower from the top, we see that it really just forms a $7\times 7$ square of area $49$ . Therefore, we can say that the total surface area is $560 + 49 + 49 = \boxed{658}$ .
Alternatively, for the area of the tops, we could have found the sum $\sum_{n=2}^{7}((n)^{2}-(n-1)^{2})$ , giving us $49$ as well. | B | 658 |
a3d32eb2bc15888737359ebdb8d58c74 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_10 | Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$ | It can quickly be seen that the side lengths of the cubes are the integers from 1 to 7 inclusive.
First, we will calculate the total surface area of the cubes, ignoring overlap. This value is $6 ( 1^2 + 2^2 + \cdots + 7^2 ) = 6\sum_{n=1}^{7} n^2 = 6 \left( \frac{7(7 + 1)(2 \cdot 7 + 1)}{6} \right) = 7 \cdot 8 \cdot 15 = 840$ . Then, we need to subtract out the overlapped parts of the cubes. Between each consecutive pair of cubes, one of the smaller cube's faces is completely covered, along with an equal area of one of the larger cube's faces. The total area of the overlapped parts of the cubes is thus equal to $2\sum_{n=1}^{6} n^2 = 182$ . Subtracting the overlapped surface area from the total surface area, we get $840 - 182 = \boxed{658}$ . ~ emerald_block | B | 658 |
a3d32eb2bc15888737359ebdb8d58c74 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_10 | Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$ | It can be seen that the side lengths of the cubes using cube roots are all integers from $1$ to $7$ , inclusive.
Only the cubes with side length $1$ and $7$ have $5$ faces in the surface area and the rest have $4$ . Also, since the cubes are stacked, we have to find the difference between each $n^2$ and $(n-1)^2$ side length as $n$ ranges from $7$ to $2$
We then come up with this: $5(49)+13+4(36)+11+4(25)+9+4(16)+7+4(9)+5+4(4)+3+5(1)$
We then add all of this and get $\boxed{658}$ | B | 658 |
a3d32eb2bc15888737359ebdb8d58c74 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_10 | Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$ | Notice that the surface area of the top cube is $6s^2$ and the others are $4s^2$ . Then we can directly compute. The edge length for the first cube is $7$ and has a surface area of $294$ . The surface area of the next cube is $144$ . The surface area of the next cube $100$ . The surface area of the next cube is $64$ . The surface area of the next cube is $36$ . The surface area of the next cube is $16$ . The surface area of the next cube is $4$ . We then sum up $294+144+100+64+36+16+4$ to get $\boxed{658}$ .
~smartatmath | B | 658 |
a3d32eb2bc15888737359ebdb8d58c74 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_10 | Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$ | First of all, compute the area of the sides, excluding the top and bottoms, of the cubes. The side lengths (cube root the volumes) are 1, 2, 3, 4, 5, 6, 7.
Each cube's area of the sides can be calculated with $4($ area of one side $)$ $4(l^2)$ so in total that is $4(1+4+16+...+49)$ so $4(140)=560$ the area of all the sides of the cubes is $560$ .
Then, calculate the bottom face of the largest cube, $7*7=49$ .
Now, notice that if you stack the cubes up on top of each other, and look directly down on them, the tops of the cubes showing add up to the area of the bottom cube, the 7x7. Therefore, the sum of the area of the tops of the cubes is $7*7=49$
Now add them all up: $49+49+560=658.$ Therefore, the answer is $\boxed{658}$ | B | 658 |
9a4649a8a21fee3e34ab5239b319cb3c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_11 | What is the median of the following list of $4040$ numbers $?$ \[1, 2, 3, \ldots, 2020, 1^2, 2^2, 3^2, \ldots, 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$ | We can see that $44^2=1936$ which is less than 2020. Therefore, there are $2020-44=1976$ of the $4040$ numbers greater than $2020$ . Also, there are $2020+44=2064$ numbers that are less than or equal to $2020$
Since there are $44$ duplicates/extras, it will shift up our median's placement down $44$ . Had the list of numbers been $1,2,3, \dots, 4040$ , the median of the whole set would be $\dfrac{1+4040}{2}=2020.5$
Thus, our answer is $2020.5-44=\boxed{1976.5}$ | C | 1976.5 |
9a4649a8a21fee3e34ab5239b319cb3c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_11 | What is the median of the following list of $4040$ numbers $?$ \[1, 2, 3, \ldots, 2020, 1^2, 2^2, 3^2, \ldots, 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$ | As we are trying to find the median of a $4040$ -term set, we must find the average of the $2020$ th and $2021$ st terms.
Since $45^2 = 2025$ is slightly greater than $2020$ , we know that the $44$ perfect squares $1^2$ through $44^2$ are less than $2020$ , and the rest are greater. Thus, from the number $1$ to the number $2020$ , there are $2020 + 44 = 2064$ terms. Since $44^2$ is $44 + 45 = 89$ less than $45^2 = 2025$ and $84$ less than $2020$ , we will only need to consider the perfect square terms going down from the $2064$ th term, $2020$ , after going down $84$ terms. Since the $2020$ th and $2021$ st terms are only $44$ and $43$ terms away from the $2064$ th term, we can simply subtract $44$ from $2020$ and $43$ from $2020$ to get the two terms, which are $1976$ and $1977$ . Averaging the two, we get $\boxed{1976.5}.$ | C | 1976.5 |
9a4649a8a21fee3e34ab5239b319cb3c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_11 | What is the median of the following list of $4040$ numbers $?$ \[1, 2, 3, \ldots, 2020, 1^2, 2^2, 3^2, \ldots, 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$ | We want to know the $2020$ th term and the $2021$ st term to get the median.
We know that $44^2=1936$ . So, numbers $1^2, 2^2, \ldots,44^2$ are in between $1$ and $1936$
So, the sum of $44$ and $1936$ will result in $1980$ , which means that $1936$ is the $1980$ th number.
Also, notice that $45^2=2025$ , which is larger than $2021$
Then the $2020$ th term will be $1936+40 = 1976$ , and similarly the $2021$ th term will be $1977$
Solving for the median of the two numbers, we get $\boxed{1976.5}$ | C | 1976.5 |
9a4649a8a21fee3e34ab5239b319cb3c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_11 | What is the median of the following list of $4040$ numbers $?$ \[1, 2, 3, \ldots, 2020, 1^2, 2^2, 3^2, \ldots, 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$ | We note that $44^2 = 1936$ , which is the first square less than $2020$ , which means that there are $44$ additional terms before $2020$ . This makes $2020$ the $2064$ th term. To find the median, we need the $2020$ th and $2021$ st term. We note that every term before $2020$ is one less than the previous term (That is, we subtract $1$ to get the previous term.). If $2020$ is the $2064$ th term, than $2020 - 44$ is the $(2064 - 44)$ th term. So, the $2020$ th term is $1976$ , and the $2021$ st term is $1977$ , and the average of these two terms is the median, or $\boxed{1976.5}$ | C | 1976.5 |
9a4649a8a21fee3e34ab5239b319cb3c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_11 | What is the median of the following list of $4040$ numbers $?$ \[1, 2, 3, \ldots, 2020, 1^2, 2^2, 3^2, \ldots, 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$ | To find the median, we sort the $4040$ numbers in decreasing order, then average the $2020$ th and the $2021$ st numbers of the sorted list.
Since $45^2=2025$ and $44^2=1936,$ the first $2021$ numbers of the sorted list are \[\underbrace{2020^2,2019^2,2018^2,\ldots,46^2,45^2}_{1976\mathrm{ \ numbers}}\phantom{ },\phantom{ }\underbrace{2020,2019,2018,\ldots,1977,1976}_{45\mathrm{ \ numbers}}\phantom{ },\] from which the answer is $\frac{1977+1976}{2}=\boxed{1976.5}.$ | C | 1976.5 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | Since quadrilateral $UVCM$ has perpendicular diagonals, its area can be found as half of the product of the length of the diagonals. Also note that $\triangle AUV$ has $\frac 14$ the area of triangle $AMC$ by similarity, so $[UVCM]=\frac 34\cdot [AMC].$ Thus, \[\frac 12 \cdot 12\cdot 12=\frac 34 \cdot [AMC]\] \[72=\frac 34\cdot [AMC]\] \[[AMC]=96\rightarrow \boxed{96}.\] | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((-2,6)--(2,6)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
We know that $\triangle AUV \sim \triangle AMC$ , and since the ratios of its sides are $\frac{1}{2}$ , the ratio of of their areas is $\left(\frac{1}{2}\right)^2=\frac{1}{4}$
If $\triangle AUV$ is $\frac{1}{4}$ the area of $\triangle AMC$ , then trapezoid $MUVC$ is $\frac{3}{4}$ the area of $\triangle AMC$
Let's call the intersection of $\overline{UC}$ and $\overline{MV}$ $P$ . Let $\overline{UP}=x$ . Then $\overline{PC}=12-x$ . Since $\overline{UC} \perp \overline{MV}$ $\overline{UP}$ and $\overline{CP}$ are heights of triangles $\triangle MUV$ and $\triangle MCV$ , respectively. Both of these triangles have base $12$
Area of $\triangle MUV = \frac{x\cdot12}{2}=6x$
Area of $\triangle MCV = \frac{(12-x)\cdot12}{2}=72-6x$
Adding these two gives us the area of trapezoid $MUVC$ , which is $6x+(72-6x)=72$
This is $\frac{3}{4}$ of the triangle, so the area of the triangle is $\frac{4}{3}\cdot{72}=\boxed{96}$ ~quacker88, diagram by programjames1 | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | Draw median $\overline{AB}$ [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((0,12)--(0,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0.5, 4), E); label("B", (0, 0), S); [/asy]
Since we know that all medians of a triangle intersect at the centroid, we know that $\overline{AB}$ passes through point $P$ . We also know that medians of a triangle divide each other into segments of ratio $2:1$ . Knowing this, we can see that $\overline{PC}:\overline{UP}=2:1$ , and since the two segments sum to $12$ $\overline{PC}$ and $\overline{UP}$ are $8$ and $4$ , respectively.
Finally knowing that the medians divide the triangle into $6$ sections of equal area, finding the area of $\triangle PUM$ is enough. $\overline{PC} = \overline{MP} = 8$
The area of $\triangle PUM = \frac{4\cdot8}{2}=16$ . Multiplying this by $6$ gives us $6\cdot16=\boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((-2,6)--(2,6)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy] We know that $AU = UM$ $AV = VC$ , so $UV = \frac{1}{2} MC$
As $\angle UPM = \angle VPC = 90$ , we can see that $\triangle UPM \cong \triangle VPC$ and $\triangle UVP \sim \triangle MPC$ with a side ratio of $1 : 2$
So $UP = VP = 4$ $MP = PC = 8$
With that, we can see that $[\triangle UPM] = 16$ , and the area of trapezoid $MUVC$ is 72.
As said in solution 1, $[\triangle AMC] = 72 / \frac{3}{4} = \boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((0,12)--(0,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0.5, 4), E); label("B", (0, 0), S); [/asy]
Let $AB$ be the height. Since medians divide each other into a $2:1$ ratio, and the medians have length 12, we have $PC=MP=8$ and $UP=VP=4$ . From right triangle $\triangle{MUP}$ \[MU^2=MP^2+UP^2=8^2+4^2=80,\] so $MU=\sqrt{80}=4\sqrt{5}$ . Since $CU$ is a median, $AM=8\sqrt{5}$ . From right triangle $\triangle{MPC}$ \[MC^2=MP^2+PC^2=8^2+8^2=128,\] which implies $MC=\sqrt{128}=8\sqrt{2}$ . By symmetry $MB=\dfrac{8\sqrt{2}}{2}=4\sqrt{2}$
Applying the Pythagorean Theorem to right triangle $\triangle{MAB}$ gives $AB^2=AM^2-MB^2=8\sqrt{5}^2-4\sqrt{2}^2=288$ , so $AB=\sqrt{288}=12\sqrt{2}$ . Then the area of $\triangle{AMC}$ is \[\dfrac{AB \cdot MC}{2}=\dfrac{8\sqrt{2} \cdot 12\sqrt{2}}{2}=\dfrac{96 \cdot 2}{2}=\boxed{96}\] | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | By similarity, the area of $AUV$ is equal to $\frac{1}{4}$
The area of $UVCM$ is equal to 72.
Assuming the total area of the triangle is S, the equation will be : $\frac{3}{4}$ S = 72.
S = $\boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | Given a triangle with perpendicular medians with lengths $x$ and $y$ , the area will be $\frac{2xy}{3}=\boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | Connect the line segment $UV$ and it's easy to see quadrilateral $UVMC$ has an area of the product of its diagonals divided by $2$ which is $72$ . Now, solving for triangle $AUV$ could be an option, but the drawing shows the area of $AUV$ will be less than the quadrilateral meaning the the area of $AMC$ is less than $72*2$ but greater than $72$ , leaving only one possible answer choice, $\boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((0,12)--(0,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0.5, 4), E); label("B", (0, 0), S); [/asy]
Connect $AP$ , and let $B$ be the point where $AP$ intersects $MC$ $MB=CB$ because all medians of a triangle intersect at one point, which in this case is $P$ $MP:PV=2:1$ because the point at which all medians intersect divides the medians into segments of ratio $2:1$ , so $MP=8$ and similarly $CP=8$ . We apply the Pythagorean Theorem to triangle $MPC$ and get $MC=\sqrt{128}=8\sqrt{2}$ . The area of triangle $MPC$ is $\dfrac{MP\cdot CP}{2}=32$ , and that must equal to $\dfrac{MC\cdot BP}{2}$ , so $BP=\dfrac{8}{\sqrt{2}}=4\cdot\sqrt{2}$ $BP=\dfrac{1}{3}BA$ , so $BA=12\sqrt{2}$ . The area of triangle $AMC$ is equal to $\dfrac{MC\cdot BA}{2}=\dfrac{8 \cdot \sqrt{2} \cdot 12 \cdot \sqrt{2}}{2}=\boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | $[\square MUVC] = 72$ . Let intersection of line $AP$ and base $MC$ be $B$ \[[AUV]=[MUB]=[UVB]=[BVC] \implies \left[\frac{\triangle AMC}{4}\right] = \left[\frac{\square MUVC}{3}\right] \implies [AMC] = \boxed{96}\] | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | [asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((-2,6)--(2,6)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
Since $\overline{MV}$ and $\overline{CU}$ intersect at a right angle, this means $MUVC$ is a kite. Hence, the area of this kite is $\frac{12 \cdot 12}{2} = 72$
Also, notice that $\triangle AUV \sim \triangle AMC$ by AAA Similarity. Since the ratios of its sides is $\frac{1}{2}$ , the ratios of the area is $\left(\frac{1}{2}\right)^2=\frac{1}{4}$ . Therefore,
\[[AMC] = [MUVC] + \frac{1}{4} \cdot [AMC]\]
Simplifying gives us $\frac{3}{4} \cdot [AMC] = 72$ , so $[AMC] = 72 \cdot \frac{4}{3} = \boxed{96}$ | C | 96 |
050b0af1e6fe4ae15ae9cc10bf69618c | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_12 | Triangle $AMC$ is isosceles with $AM = AC$ . Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$ . What is the area of $\triangle AMC?$
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); label("M", (-4,0), W); label("C", (4,0), E); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); [/asy]
$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$ | Horizontally translate line $\overline{UC}$ until point $U$ is at point $V$ , with $C$ subsequently at $C'$ , and then connect up $C'$ and $C$ to create $\triangle MVC'$ , which is a right triangle.
[asy] draw((-4,0)--(4,0)--(0,12)--cycle); draw((-2,6)--(4,0)); draw((2,6)--(-4,0)); draw((-2,6)--(2,6)); draw((2,6)--(8,0)); draw((4,0)--(8,0)); label("M", (-4,0), W); label("C", (4,0), S); label("A", (0, 12), N); label("V", (2, 6), NE); label("U", (-2, 6), NW); label("P", (0, 3.6), S); label("C'", (8,0), E); [/asy]
Notice that $\triangle MVC'$ $12 \cdot 12 \cdot \frac{1}{2} = 72$ , and $\triangle MVC'$ $\triangle MVC + \triangle MUV$ (since the latter has the same base and height as the sub-triangle $\triangle CVC'$ inside $\triangle MVC'$ ).
From this, we can deduce that $\textbf{(B)}$ cannot be true, since an incomplete part of $\triangle AMC$ is equal to it. We can also deduce that $\textbf{(D)}$ also cannot be true, since the unknown triangle $\triangle AUV = \triangle MUV$ , and $\triangle MUV = \triangle CVC' < \triangle MVC'$ . Therefore, the answer must be between $72$ and $144$ , leaving $\boxed{96}$ as the only possible correct answer. | C | 96 |
ac275ec395b0170ff677d97a713b0cbf | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_13 | A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$ , and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$ . What is the probability that the sequence of jumps ends on a vertical side of the square?
$\textbf{(A)}\ \frac12\qquad\textbf{(B)}\ \frac 58\qquad\textbf{(C)}\ \frac 23\qquad\textbf{(D)}\ \frac34\qquad\textbf{(E)}\ \frac 78$ | Drawing out the square, it's easy to see that if the frog goes to the left, it will immediately hit a vertical end of the square. Therefore, the probability of this happening is $\frac{1}{4} \cdot 1 = \frac{1}{4}$ . If the frog goes to the right, it will be in the center of the square at $(2,2)$ , and by symmetry (since the frog is equidistant from all sides of the square), the chance it will hit a vertical side of a square is $\frac{1}{2}$ . The probability of this happening is $\frac{1}{4} \cdot \frac{1}{2} = \frac{1}{8}$
If the frog goes either up or down, it will hit a line of symmetry along the corner it is closest to and furthest to, and again, is equidistant relating to the two closer sides and also equidistant relating the two further sides. The probability for it to hit a vertical wall is $\frac{1}{2}$ . Because there's a $\frac{1}{2}$ chance of the frog going up or down, the total probability for this case is $\frac{1}{2} \cdot \frac{1}{2} = \frac{1}{4}$ and summing up all the cases, $\frac{1}{4} + \frac{1}{8} + \frac{1}{4} = \frac{5}{8} \implies \boxed{58}$ | B | 58 |
ac275ec395b0170ff677d97a713b0cbf | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_13 | A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$ , and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$ . What is the probability that the sequence of jumps ends on a vertical side of the square?
$\textbf{(A)}\ \frac12\qquad\textbf{(B)}\ \frac 58\qquad\textbf{(C)}\ \frac 23\qquad\textbf{(D)}\ \frac34\qquad\textbf{(E)}\ \frac 78$ | If the frog is on one of the 2 diagonals, the chance of landing on vertical or horizontal each becomes $\frac{1}{2}$ . Since it starts on $(1,2)$ , there is a $\frac{3}{4}$ chance (up, down, or right) it will reach a diagonal on the first jump and $\frac{1}{4}$ chance (left) it will reach the vertical side. The probablity of landing on a vertical is $\frac{1}{4}+\frac{3}{4} \cdot \frac{1}{2}=\boxed{58}$ .
- Lingjun | B | 58 |
ac275ec395b0170ff677d97a713b0cbf | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_13 | A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$ , and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$ . What is the probability that the sequence of jumps ends on a vertical side of the square?
$\textbf{(A)}\ \frac12\qquad\textbf{(B)}\ \frac 58\qquad\textbf{(C)}\ \frac 23\qquad\textbf{(D)}\ \frac34\qquad\textbf{(E)}\ \frac 78$ | Let $P_{(x,y)}$ denote the probability of the frog's sequence of jumps ends with it hitting a vertical edge when it is at $(x,y)$ . Note that $P_{(1,2)}=P_{(3,2)}$ by reflective symmetry over the line $x=2$ . Similarly, $P_{(1,1)}=P_{(1,3)}=P_{(3,1)}=P_{(3,3)}$ , and $P_{(2,1)}=P_{(2,3)}$ .
Now we create equations for the probabilities at each of these points/states by considering the probability of going either up, down, left, or right from that point: \[P_{(1,2)}=\frac{1}{4}+\frac{1}{2}P_{(1,1)}+\frac{1}{4}P_{(2,2)}\] \[P_{(2,2)}=\frac{1}{2}P_{(1,2)}+\frac{1}{2}P_{(2,1)}\] \[P_{(1,1)}=\frac{1}{4}+\frac{1}{4}P_{(1,2)}+\frac{1}{4}P_{(2,1)}\] \[P_{(2,1)}=\frac{1}{2}P_{(1,1)}+\frac{1}{4}P_{(2,2)}\] We have a system of $4$ equations in $4$ variables, so we can solve for each of these probabilities. Plugging the second equation into the fourth equation gives \[P_{(2,1)}=\frac{1}{2}P_{(1,1)}+\frac{1}{4}\left(\frac{1}{2}P_{(1,2)}+\frac{1}{2}P_{(2,1)}\right)\] \[P_{(2,1)}=\frac{8}{7}\left(\frac{1}{2}P_{(1,1)}+\frac{1}{8}P_{(1,2)}\right)=\frac{4}{7}P_{(1,1)}+\frac{1}{7}P_{(1,2)}\] Plugging in the third equation into this gives \[P_{(2,1)}=\frac{4}{7}\left(\frac{1}{4}+\frac{1}{4}P_{(1,2)}+\frac{1}{4}P_{(2,1)}\right)+\frac{1}{7}P_{(1,2)}\] \[P_{(2,1)}=\frac{7}{6}\left(\frac{1}{7}+\frac{2}{7}P_{(1,2)}\right)=\frac{1}{6}+\frac{1}{3}P_{(1,2)}\text{ (*)}\] Next, plugging in the second and third equation into the first equation yields \[P_{(1,2)}=\frac{1}{4}+\frac{1}{2}\left(\frac{1}{4}+\frac{1}{4}P_{(1,2)}+\frac{1}{4}P_{(2,1)}\right)+\frac{1}{4}\left(\frac{1}{2}P_{(1,2)}+\frac{1}{2}P_{(2,1)}\right)\] \[P_{(1,2)}=\frac{3}{8}+\frac{1}{4}P_{(1,2)}+\frac{1}{4}P_{(2,1)}\] Now plugging in (*) into this, we get \[P_{(1,2)}=\frac{3}{8}+\frac{1}{4}P_{(1,2)}+\frac{1}{4}\left(\frac{1}{6}+\frac{1}{3}P_{(1,2)}\right)\] \[P_{(1,2)}=\frac{3}{2}\cdot\frac{5}{12}=\boxed{58}\] -mathisawesome2169 | B | 58 |
ac275ec395b0170ff677d97a713b0cbf | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_13 | A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$ , and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$ . What is the probability that the sequence of jumps ends on a vertical side of the square?
$\textbf{(A)}\ \frac12\qquad\textbf{(B)}\ \frac 58\qquad\textbf{(C)}\ \frac 23\qquad\textbf{(D)}\ \frac34\qquad\textbf{(E)}\ \frac 78$ | this is basically another version of solution 4; shoutout to mathisawesome2169 :D
First, we note the different places the frog can go at certain locations in the square:
If the frog is at a border vertical point ( $(1,2),(3,2)$ ), it moves with probability $\frac{1}{4}$ to a vertical side of the square, probability $\frac{1}{4}$ to the center of the square, and probability $\frac{1}{2}$ to a corner square.
If the frog is at a border horizontal point ( $(2,1),(2,3)$ ), it moves with probability $\frac{1}{4}$ to a horizontal side of the square, probability $\frac{1}{4}$ to the center of the square, and probability $\frac{1}{2}$ to a corner square.
If the frog is at a center square ( $(2,2)$ ), it moves with probability $\frac{1}{2}$ to a border horizontal point and probability $\frac{1}{2}$ to a border vertical point.
If the frog is at a corner ( $(1,1),(1,3),(3,3),(3,1)$ ), it moves with probability $\frac{1}{4}$ to a vertical side of the square, probability $\frac{1}{4}$ to a horizontal side, probability $\frac{1}{4}$ to a border horizontal point, and probability $\frac{1}{4}$ to a border vertical point.
Now, let $x$ denote the probability of the frog reaching a vertical side when it is at a border vertical point. Similarly, let $y$ denote the probability of the frog reaching a vertical side when it is at a border horizontal point.
Now, the probability of the frog reaching a vertical side of the square at any location inside the square can be expressed in terms of $x$ and $y$
First, the two easier ones: $P_{center}=\frac{1}{2}x+\frac{1}{2}y$ , and $P_{corner}=\frac{1}{4}+\frac{1}{4}x+\frac{1}{4}y$ .
Now, we can write $x$ and $y$ in terms of $x$ and $y$ , allowing us to solve a system of two variables: \[x=\frac{1}{4}+\frac{1}{4}P_{center}+\frac{1}{2}P_{corner}=\frac{1}{4}+\frac{1}{4}\left(\frac{1}{2}x+\frac{1}{2}y\right)+\frac{1}{2}\left(\frac{1}{4}+\frac{1}{4}x+\frac{1}{4}y\right)\] and \[y=\frac{1}{4}P_{center}+\frac{1}{2}P_{corner}=\frac{1}{4}\left(\frac{1}{2}x+\frac{1}{2}y\right)+\frac{1}{2}\left(\frac{1}{4}+\frac{1}{4}x+\frac{1}{4}y\right).\] From these two equations, it is apparent that $y=x-\frac{1}{4}$ . We can then substitute this value for $y$ back into any of the two equations above to get \[x=\frac{1}{4}+\frac{1}{4}\left(\frac{1}{2}x+\frac{1}{2}\left(x-\frac{1}{4}\right)\right)+\frac{1}{2}\left(\frac{1}{4}+\frac{1}{4}x+\frac{1}{4}\left(x-\frac{1}{4}\right)\right).\] Although this certainly looks intimidating, we can expand the parentheses and multiply both sides by 16 to eliminate the fractions, which upon simplification yields the equation \[16x=5+8x,\] giving us the desired probability $x=\frac{5}{8}$ . The answer is then $\boxed{58}$ | B | 58 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | \[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y=x+\frac{x^3}{y^2}+y+\frac{y^3}{x^2}=\frac{x^3}{x^2}+\frac{y^3}{x^2}+\frac{y^3}{y^2}+\frac{x^3}{y^2}\]
Continuing to combine \[\frac{x^3+y^3}{x^2}+\frac{x^3+y^3}{y^2}=\frac{(x^2+y^2)(x^3+y^3)}{x^2y^2}=\frac{(x^2+y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}\] From the givens, it can be concluded that $x^2y^2=4$ . Also, \[(x+y)^2=x^2+2xy+y^2=16\] This means that $x^2+y^2=20$ . Substituting this information into $\frac{(x^2+y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}$ , we have $\frac{(20)(4)(22)}{4}=20\cdot 22=\boxed{440}$ . ~PCChess | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | As above, we need to calculate $\frac{(x^2+y^2)(x^3+y^3)}{x^2y^2}$ . Note that $x,y,$ are the roots of $x^2-4x-2$ and so $x^3=4x^2+2x$ and $y^3=4y^2+2y$ . Thus $x^3+y^3=4(x^2+y^2)+2(x+y)=4(20)+2(4)=88$ where $x^2+y^2=20$ and $x^2y^2=4$ as in the previous solution. Thus the answer is $\frac{(20)(88)}{4}=\boxed{440}$ . Note( $x^2+y^2=(x+y)^2-2xy=20$ , and $x^2y^2 = (xy)^2 = 4$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | Note that $( x^3 + y^3 ) ( \frac{1}{y^2} + \frac{1}{x^2} ) = x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y.$ Now, we only need to find the values of $x^3 + y^3$ and $\frac{1}{y^2} + \frac{1}{x^2}.$ Recall that $x^3 + y^3 = (x + y) (x^2 - xy + y^2),$ and that $x^2 - xy + y^2 = (x + y)^2 - 3xy.$ We are able to solve the second equation, and doing so gets us $4^2 - 3(-2) = 22.$ Plugging this into the first equation, we get $x^3 + y^3 = 4(22) = 88.$ In order to find the value of $\frac{1}{y^2} + \frac{1}{x^2},$ we find a common denominator so that we can add them together. This gets us $\frac{x^2}{x^2 y^2} + \frac{y^2}{x^2 y^2} = \frac{x^2 + y^2}{(xy)^2}.$ Recalling that $x^2 + y^2 = (x+y)^2 - 2xy$ and solving this equation, we get $4^2 - 2(-2) = 20.$ Plugging this into the first equation, we get $\frac{1}{y^2} + \frac{1}{x^2} = \frac{20}{(-2)^2} = 5.$ Solving the original equation, we get $x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y = (88)(5) = \boxed{440}.$ emerald_block | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | This is basically bashing using Vieta's formulas to find $x$ and $y$ (which I highly do not recommend, I only wrote this solution for fun).
We use Vieta's to find a quadratic relating $x$ and $y$ . We set $x$ and $y$ to be the roots of the quadratic $Q ( n ) = n^2 - 4n - 2$ (because $x + y = 4$ , and $xy = -2$ ). We can solve the quadratic to get the roots $2 + \sqrt{6}$ and $2 - \sqrt{6}$ $x$ and $y$ are "interchangeable", meaning that it doesn't matter which solution $x$ or $y$ is, because it'll return the same result when plugged in. So we plug in $2 + \sqrt{6}$ for $x$ and $2 - \sqrt{6}$ and get $\boxed{440}$ as our answer. | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | This usually wouldn't work for most problems like this, but we're lucky that we can quickly expand and factor this expression in this question.
We first change the original expression to $4 + \frac{x^5 + y^5}{x^2 y^2}$ , because $x + y = 4$ . This is equal to $4 + \frac{(x + y)(x^4 - x^3 y + x^2 y^2 - x y^3 + y^4)}{4} = x^4 + y^4 - x^3 y - x y^3 + 8$ . We can factor and reduce $x^4 + y^4$ to $(x^2 + y^2)^2 - 2 x^2 y^2 = ((x + y)^2 - 2xy)^2 - 8 = 400 - 8 = 392$ . Now our expression is just $400 - (x^3 y + x y^3)$ . We factor $x^3 y + x y^3$ to get $(xy)(x^2 + y^2) = -40$ . So the answer would be $400 - (-40) = \boxed{440}$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | We first simplify the expression to \[x + y + \frac{x^5 + y^5}{x^2y^2}.\] Then, we can solve for $x$ and $y$ given the system of equations in the problem.
Since $xy = -2,$ we can substitute $\frac{-2}{x}$ for $y$ .
Thus, this becomes the equation \[x - \frac{2}{x} = 4.\] Multiplying both sides by $x$ , we obtain $x^2 - 2 = 4x,$ or \[x^2 - 4x - 2 = 0.\] By the quadratic formula we obtain $x = 2 \pm \sqrt{6}$ .
We also easily find that given $x = 2 \pm \sqrt{6}$ $y$ equals the conjugate of $x$ .
Thus, plugging our values in for $x$ and $y$ , our expression equals \[4 + \frac{(2 - \sqrt{6})^5 + (2 + \sqrt{6})^5}{(2 - \sqrt{6})^2(2 + \sqrt{6})^2}\] By the binomial theorem, we observe that every second terms of the expansions $x^5$ and $y^5$ will cancel out (since a positive plus a negative of the same absolute value equals zero). We also observe that the other terms not canceling out are doubled when summing the expansions of $x^5 + y^5$ .
Thus, our expression equals \[4 + \frac{2(2^5 + \tbinom{5}{2}2^3 \times 6 + \tbinom{5}{4}2 \times 36)}{(2 - \sqrt{6})^2(2 + \sqrt{6})^2}.\] which equals \[4 + \frac{2(872)}{4}\] which equals $\boxed{440}$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | As before, simplify the expression to \[x + y + \frac{x^5 + y^5}{x^2y^2}.\] Since $x + y = 4$ and $x^2y^2 = 4$ , we substitute that in to obtain \[4 + \frac{x^5 + y^5}{4}.\] Now, we must solve for $x^5 + y^5$ . Start by squaring $x + y$ , to obtain \[x^2 + 2xy + y^2 = 16\] Simplifying, $x^2 + y^2 = 20$ . Squaring once more, we obtain \[x^4 + y^4 + 2x^2y^2 = 400\] Once again simplifying, $x^4 + y^4 = 392$ . Now, to obtain the fifth powers of $x$ and $y$ , we multiply both sides by $x + y$ .
We now have \[x^5 + x^4y + xy^4 + y^5 = 1568\] , or \[x^5 + y^5 + xy(x^3 + y^3) = 1568\] We now solve for $x^3 + y^3$ $(x + y)^3=x^3 + y^3 + 3xy(x + y) = 64$ , so $x^3 + y^3 = 88$ .
Plugging this back into $x^5 + x^4y + xy^4 + y^5 = 1568$ , we find that $x^5 + y^5 = 1744$ , so we have \[4 + \frac{1744}{4}.\] . This equals 440, so our answer is $\boxed{440}$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | We can use Newton Sums to solve this problem.
We start by noticing that we can rewrite the equation as $\frac{x^3}{y^2} + \frac{y^3}{x^2} + x + y.$ Then, we know that $x + y = 4,$ so we have $\frac{x^3}{y^2} + \frac{y^3}{x^2} + 4.$ We can use the equation $x \cdot y = -2$ to write $x = \frac{-2}{y}$ and $y = \frac{-2}{x}.$ Next, we can plug in these values of $x$ and $y$ to get $\frac{x^3}{y^2} + \frac{y^3}{x^2} = \frac{x^5}{4} + \frac{y^5}{4},$ which is the same as \[\frac{x^3}{y^2} + \frac{y^3}{x^2} = \frac{x^5 + y^5}{4}.\] Then, we use Newton sums where $S_n$ is the elementary symmetric sum of the sequence and $P_n$ is the power sum ( $x^n + y^n$ ). Using this, we can make the following Newton sums: \[P_1 = S_1\] \[P_2 = P_1 S_1 - 2S_2\] \[P_3 = P_2 S_1 - P_1 S_2\] \[P_4 = P_3 S_1 - P_2 S_2\] \[P_5 = P_4 S_1 - P_3 S_2.\] We also know that $S_1$ is 4 because $x + y$ is four, and we know that $S_2$ is $-2$ because $x \cdot y$ is $-2$ as well.
Then, we can plug in values! We have \[P_1 = S_1 = 4\] \[P_2 = P_1 S_1 - 2S_2 = 16 - (-4) = 20\] \[P_3 = P_2 S_1 - P_1 S_2 = 80 - (-8) = 88\] \[P_4 = P_3 S_1 - P_2 S_2 = 88 \cdot 4 - (-40) = 392\] \[P_5 = P_4 S_1 - P_3 S_2 = 392 \cdot 4 - (-2) \cdot 88 = 1744.\] We earlier noted that $\frac{x^3}{y^2} + \frac{y^3}{x^2} = \frac{x^5 + y^5}{4},$ so we have that this equals $\frac{1744}{4},$ or $436.$ Then, plugging this back into the original equation, this is $436 + 4$ or $440,$ so our answer is $\boxed{440}.$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | As in the first solution, we get the expression to be $\frac{x^3+y^3}{x^2} + \frac{x^3+y^3}{y^2}.$
Then, since the numerators are the same, we can put the two fractions as a common denominator and multiply the numerator by $x^2y^2.$ This gets us $\frac{(x^2 + y^2)(x^3 + y^3)}{x^2y^2}.$
Now, since we know $x+y=4$ and $xy=-2,$ instead of solving for $x$ and $y,$ we will try to manipulate the above expression them into a manner that we can substitute the sum and product that we know. Also, another form of $x^3+y^3$ is $(x+y)(x^2-xy+y^2).$
Thus, we can convert the current expression to $\frac{(x^2 + y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}.$
Doing some algebraic multiplications, we get $\frac{((x+y)^2 - 2xy)(x+y)((x+y)^2 - 3xy)}{(xy)^2}.$
Since we know $x+y=4$ and $xy=-2,$ we have $\frac{(16-(-4))(4)(16-(-6))}{4} = \frac{20 \cdot 4 \cdot 22}{4} = 20 \cdot 22 = 440.$
Therefore the answer is $\boxed{440}.$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | We give all of the terms in this expression a common denominator. $x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y = \frac{x^3y^2 + x^5 + y^5 + x^2y^3}{x^2y^2}$ . We can find $x^2y^2 = (xy)^2 = (-2)^2 = 4$ and we can find $x^3y^2 + x^2y^3 = x^2y^2(x + y) = 16$ . Our expression $\frac{xy^2 + x^5 + y^5 + x^2y}{x^2y^2}$ is now $\frac{16 + x^5 + y^5}{4}$ . Now all we need to find is $x^5 + y^5$ . Using the binomial theorem, $(x + y)^5 = x^5 + 5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 + y^5 = 4^5 = 1024$ . The extra terms that we don't need is $5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 = 5xy(x^3 + y^3) + 10x^2y^2(x + y) = -10(x^3 + y^3) + 160$ . What's $x^3 + y^3$ ? We use the same method. Using the binomial theorem, $(x + y)^3 = x^3 + 3x^2y + 3xy^2 + y^3 = x^3 + y^3 + 3xy(x + y) = x^3 + y^3 - 24 = 4^3 = 64$ . Now we know that $x^3 + y^3 = 64 + 24 = 88$ , and plugging that into $-10(x^3 + y^3) + 160$ gives $-10(88) + 160 = -880 + 160 = -720$ . Now we see that those extra terms have a sum of $-720$ . Thus $(x + y)^5 = x^5 + y^5 - 720 = 1024$ so $x^5 + y^5 = 1024 + 720 = 1744$ . Remember our goal: we want to find $\frac{-8 + x^5 + y^5}{4}$ . Using $x^5 + y^5 = 1744$ $\frac{16 + x^5 + y^5}{4} = \frac{16 + 1744}{4} = \frac{1760}{4} = \boxed{440}$ | D | 440 |
9c58194944614a69e1b03b5d44742486 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_14 | Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$ . What is the value of
\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]
$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$ | Since we know $x+y=4$ , we can simplify to $4 + \frac{x^3}{y^2} + \frac{y^3}{x^2}$ . Then, when you add the fractions, you get $\frac{x^5 + y^5}{x^2y^2} = \frac{x^5 + y^5}{4}$ . To find $x^5 + y^5$ , we expand $(x+y)^5 = 4^5$ and then simplify. $x^5+y^5+5x^4y+5xy^4+10x^3y^2+10x^2y^3 = 1024$ . We can use the fact that $xy = -2$ to simplify to $x^5 + y^5-10x^3 - 10y^3 + 40x + 40y = 1024$ . We can factor to get $x^5 + y^5 -10(x^3 + y^3) +40(x+y)$ . To find $x^3 + y^3$ , we simplify $(x+y)^3 = 4^3$ $x^3+y^3+3x^2y+3y^2x = 64$ . We can use the same process as we did before and get $x^3 + y^3 -6(x+y) = 64$ (using the fact that $xy = -2$ ). Therefore, $x^3 + y^3 = 88$ . Now, plugging it back in to our other expansion, we get $x^5 + y^5 + 160 - 880 = 1024$ $x^5 +y^5 = 1744$ . Now to get the final answer, all we need to do is to plug it back into the original equation and get $\frac{1744}{4} + 4 = \boxed{440}$ | D | 440 |
d273e6514ce8d34c104bb482ff9839b7 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_15 | A positive integer divisor of $12!$ is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
$\textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 23$ | The prime factorization of $12!$ is $2^{10} \cdot 3^5 \cdot 5^2 \cdot 7 \cdot 11$ .
This yields a total of $11 \cdot 6 \cdot 3 \cdot 2 \cdot 2$ divisors of $12!.$ In order to produce a perfect square divisor, there must be an even exponent for each number in the prime factorization. Note that the divisor can't have any factors of $7$ and $11$ in the prime factorization because there is only one of each in $12!.$ Thus, there are $6 \cdot 3 \cdot 2$ perfect squares. (For $2$ , you can have $0$ $2$ $4$ $6$ $8$ , or $10$ $2$ s, etc.)
The probability that the divisor chosen is a perfect square is \[\frac{6\cdot 3\cdot 2}{11\cdot 6\cdot 3\cdot 2\cdot 2}=\frac{1}{22} \implies \frac{m}{n}=\frac{1}{22} \implies m\ +\ n = 1\ +\ 22 = \boxed{23}\] | E | 23 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | [asy] size(10cm); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); filldraw((arc((0,0), 0.3989, 0, 90))--(0,0)--cycle, gray); draw(arc((1,0), 0.3989, 90, 180)); filldraw((arc((1,0), 0.3989, 90, 180))--(1,0)--cycle, gray); draw(arc((1,1), 0.3989, 180, 270)); filldraw((arc((1,1), 0.3989, 180, 270))--(1,1)--cycle, gray); draw(arc((0,1), 0.3989, 270, 360)); filldraw(arc((0,1), 0.3989, 270, 360)--(0,1)--cycle, gray); [/asy]
The diagram represents each unit square of the given $2020 \times 2020$ square.
We consider an individual one-by-one block.
If we draw a quarter of a circle from each corner (where the lattice points are located), each with radius $d$ , the area covered by the circles should be $0.5$ . Because of this, and the fact that there are four circles, we write
\[4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}\]
Solving for $d$ , we obtain $d = \frac{1}{\sqrt{2\pi}}$ , where with $\pi \approx 3$ , we get $d \approx \frac{1}{\sqrt{6}} \approx \dfrac{1}{2.5} = \dfrac{10}{25} = \dfrac{2}{5}$ , and from here, we see that $d \approx 0.4 \implies \boxed{0.4}.$ | B | 0.4 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | As in the previous solution, we obtain the equation $4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}$ , which simplifies to $\pi d^2 = \frac{1}{2} = 0.5$ . Since $\pi$ is slightly more than $3$ $d^2$ is slightly less than $\frac{0.5}{3} = 0.1\bar{6}$ . We notice that $0.1\bar{6}$ is slightly more than $0.4^2 = 0.16$ , so $d$ is roughly $\boxed{0.4}.$ emerald_block | B | 0.4 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | As above, we find that we need to estimate $d = \frac{1}{\sqrt{2\pi}}$
Note that we can approximate $2\pi \approx 6.28318 \approx 6.25$ and so $\frac{1}{\sqrt{2\pi}}$ $\approx \frac{1}{\sqrt{6.25}}=\frac{1}{2.5}=0.4$
And so our answer is $\boxed{0.4}$ | B | 0.4 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | We only need to figure out the probability for a unit square, as it will scale up to the $2020\times 2020$ square. Since we want to find the probability that a point inside a unit square that is $d$ units away from a lattice point (a corner of the square) is $\frac{1}{2}$ , we can find which answer will come the closest to covering $\frac{1}{2}$ of the area.
Since the closest is $0.4$ which turns out to be $(0.4)^2\times \pi = 0.16 \times \pi$ which is about $0.502$ , we find that the answer rounded to the nearest tenth is $0.4$ or $\boxed{0.4}$ | B | 0.4 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | As per the above diagram, realize that $\pi d^2 = \frac{1}{2}$ , so $d = \frac{1}{(\sqrt{2})(\sqrt{\pi})}$
$\sqrt{2} \approx 1.4 = \frac{7}{5}$
$\sqrt{\pi}$ is between $1.7$ and $1.8$ $((1.7)^2 = 2.89$ and $(1.8)^2 = 3.24)$ , so we can say $\sqrt{\pi} \approx 1.75 = \frac{7}{4}$
So $d \approx \frac{1}{(\frac{7}{5})(\frac{7}{4})} = \frac{1}{\frac{49}{20}} = \frac{20}{49}$ . This is slightly above $\boxed{0.4}$ | B | 0.4 |
73f84dfabf55a64acd3ebee02aa2f992 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_16 | A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$ | As above, we have the equation $\pi d^2 = \frac{1}{2}$ , and we want to find the most accurate value of $d$ . We resort to the answer choices and can plug those values of $d$ in and see which value of $d$ will lead to the most accurate value of $\pi$
Starting off in the middle, we try option C with $d=0.5$ . Plugging this in, we get $\pi \left(\frac{1}{2}\right)^2 = \frac{1}{2},$ and after simplifying we get $\pi = \frac{1}{2} \cdot 4 = 2.$ That's not very good. We know $\pi \approx 3.14.$
Let's see if we can do better. Trying option A with $d = 0.3,$ we get $\pi = \frac{1}{2} \cdot \frac{100}{9} = \frac{50}{9} = 5 \frac{5}{9}.$
Hm, let's try option B with $d = 0.4.$ We get $\pi = \frac{1}{2} \cdot \frac{25}{4} = \frac{25}{8} = 3 \frac{1}{8}$ . This is very close to $\pi$ and is the best estimate for $\pi$ of the 5 options.
Therefore, the answer is $\boxed{0.4}.$ ~ epiconan | B | 0.4 |
7a0196eb181f6b2aa442f8957ce5b3fc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_17 | Define \[P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).\] How many integers $n$ are there such that $P(n)\leq 0$
$\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$ | We perform casework on $P(n)\leq0:$
Together, the answer is $100+5000=\boxed{5100}.$ | E | 5100 |
7a0196eb181f6b2aa442f8957ce5b3fc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_17 | Define \[P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).\] How many integers $n$ are there such that $P(n)\leq 0$
$\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$ | Notice that $P(x)$ is nonpositive when $x$ is between $100^2$ and $99^2, 98^2$ and $97^2, \cdots$ $2^2$ and $1^2$ (inclusive), because there are an odd number of negatives, which means that the number of values equals \[((100+99)(100-99) + 1) + ((98+97)(98-97)+1) + \cdots + ((2+1)(2-1)+1).\] This reduces to \[200 + 196 + 192 + \cdots + 4 = 4(1+2+\cdots + 50) = 4 \cdot\frac{50 \cdot 51}{2} = \boxed{5100}.\] ~Zeric | E | 5100 |
7a0196eb181f6b2aa442f8957ce5b3fc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_17 | Define \[P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).\] How many integers $n$ are there such that $P(n)\leq 0$
$\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$ | We know that $P(x)$ is a $100$ -degree function with a positive leading coefficient. That is, $P(x)=x^{100}+ax^{99}+bx^{98}+...+\text{(constant)}$
Since the degree of $P(x)$ is even, its end behaviors match. And since the leading coefficient is positive, we know that both ends approach $\infty$ as $x$ goes in either direction, from which \[\lim_{x\to-\infty} P(x)=\lim_{x\to\infty} P(x)=\infty.\] So the first time $P(x)$ is going to be negative is when it intersects the $x$ -axis at an $x$ -intercept and it's going to dip below. This happens at $1^2$ , which is the smallest intercept.
However, when it hits the next intercept, it's going to go back up again into positive territory, we know this happens at $2^2$ . And when it hits $3^2$ , it's going to dip back into negative territory. Clearly, this is going to continue to snake around the intercepts until $100^2$
To get the amount of integers below and/or on the $x$ -axis, we simply need to count the integers. For example, the amount of integers in between the $[1^2,2^2]$ interval we got earlier, we subtract and add one. $(2^2-1^2+1)=4$ integers, so there are four integers in this interval that produce a negative result.
Doing this with all of the other intervals, we have \[(2^2-1^2+1)+(4^2-3^2+1)+\cdots+(100^2-99^2+1)=\boxed{5100}\] from Solution 2's result. | E | 5100 |
7a0196eb181f6b2aa442f8957ce5b3fc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_17 | Define \[P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).\] How many integers $n$ are there such that $P(n)\leq 0$
$\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$ | We know $P(x) \leq 0$ when an odd number of its factors are positive and negative. For example, to make the first factor positive, $x \in [1^2, 2^2]$ . then there will be a even number of positive factors. We would do $2^2 - 1^2 + 1 (inclusive)$ to find all integers that work. In short we can generalize too: \begin{align*} x^2 - (x-1)^2 + 1 &= 2x \\ x^2 - (x^2 - 2x + 1) + 1 &= 2x \\ x^2 - x^2 + 2x - 1 + 1 &= 2x. \\ \end{align*} But remember this only works when $x \in \{2, 4, 6, 8 \cdots 98, 100\}$ because only then will there be a odd amount of positive and negative factors. So we can set $x = 2k$ , for $k \in \{1, 2, 3, 4, \cdots 49, 50\}$ Now we only have to solve: \[\sum_{k=1}^{k=50}2(2k) = 2\sum_{k = 1}^{k = 50}2k = 4\sum_{k = 1}^{k = 50}k = 4 \cdot \dfrac{(50)(51)}{2} = 2 \cdot (50)(51) = \boxed{5100}.\] ~Wiselion | E | 5100 |
bd831687b2aee37746affab032315b95 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_18 | Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)
$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$ | In order for $a\cdot d-b\cdot c$ to be odd, consider parity. We must have (even)-(odd) or (odd)-(even). There are $2(2 + 4) = 12$ ways to pick numbers to obtain an even product. There are $2 \cdot 2 = 4$ ways to obtain an odd product. Therefore, the total amount of ways to make $a\cdot d-b\cdot c$ odd is $2 \cdot (12 \cdot 4) = \boxed{96}$ | C | 96 |
bd831687b2aee37746affab032315b95 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_18 | Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)
$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$ | Consider parity. We need exactly one term to be odd, one term to be even. Because of symmetry, we can set $ad$ to be odd and $bc$ to be even, then multiply by $2.$ If $ad$ is odd, both $a$ and $d$ must be odd, therefore there are $2\cdot2=4$ possibilities for $ad.$ Consider $bc.$ Let us say that $b$ is even. Then there are $2\cdot4=8$ possibilities for $bc.$ However, $b$ can be odd, in which case we have $2\cdot2=4$ more possibilities for $bc.$ Thus there are $12$ ways for us to choose $bc$ and $4$ ways for us to choose $ad.$ Therefore, also considering symmetry, we have $2 \cdot 4 \cdot 12= \boxed{96}$ total values of $ad-bc.$ | C | 96 |
bd831687b2aee37746affab032315b95 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_18 | Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)
$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$ | There are 4 ways to choose any number independently and 2 ways to choose any odd number independently.
To get an even products, we count: $\text{P(any number)} \cdot \text{P(any number)}-\text{P(odd)}\cdot\text{P(odd)}$ , which is $4 \cdot 4 - 2 \cdot 2=12$ .
The number of ways to get an odd product can be counted like so: $\text{P(odd)}\cdot\text{P(odd)}$ , which is $2 \cdot 2$ , or $4$ .
So, for one product to be odd the other to be even: $2 \cdot 4 \cdot 12=\boxed{96}$ (order matters).
~ Anonymous and Arctic_Bunny | C | 96 |
bd831687b2aee37746affab032315b95 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_18 | Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)
$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$ | For parity reasons, if $ad - bc$ is to be odd, we must have $ad$ odd and $bc$ even or $ad$ even and $bc$ odd. By symmetry, these cases are identical, so we consider the first one and multiply by two at the end. For $ad$ to be odd, we must have both $a$ and $d$ odd, and there are $2 \cdot 2$ ways to do so. To count the cases where $bc$ is odd, we use PIE. there are $2 \cdot 4 = 8$ ways for $b$ to be odd and $4 \cdot 2 = 8$ ways for $c$ to be odd, and there are $2 \cdot 2 = 4$ ways for both to be odd. Thus, there are $8 + 8 - 4 = 12$ ways for $bc$ to be even. Multiplying out, there are $2 \cdot 4 \cdot 12$ ways to have $ad - bc$ odd for a total of $\boxed{96}$ | C | 96 |
8655d580c2215b683eea607ff11e39ea | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_19 | As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? [asy] import graph; unitsize(5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy] $\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$ | Since we start at the top face and end at the bottom face without moving from the lower ring to the upper ring or revisiting a face, our journey must consist of the top face, a series of faces in the upper ring, a series of faces in the lower ring, and the bottom face, in that order.
We have $5$ choices for which face we visit first on the top ring. From there, we have $9$ choices for how far around the top ring we go before moving down: $1,2,3,$ or $4$ faces around clockwise, $1,2,3,$ or $4$ faces around counterclockwise, or immediately going down to the lower ring without visiting any other faces in the upper ring.
We then have $2$ choices for which lower ring face to visit first (since every upper-ring face is adjacent to exactly $2$ lower-ring faces) and then once again $9$ choices for how to travel around the lower ring. We then proceed to the bottom face, completing the trip.
Multiplying together all the numbers of choices we have, we get $5 \cdot 9 \cdot 2 \cdot 9 = \boxed{810}$ | E | 810 |
8655d580c2215b683eea607ff11e39ea | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_19 | As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? [asy] import graph; unitsize(5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy] $\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$ | From the top, we can go down in five different ways to the five faces underneath the first face. From here we can go down or go to the adjacent faces. From the face you went down from the top face, you can either go clockwise or counterclockwise $1$ $2$ $3$ ,or $4$ times, or you can go straight down. Then from there, you go down into the lower row, which you have two choices, left or right down. From here we have $5 \cdot 9 \cdot 2$ ways multiplied by the ways you can move from the bottom ring to the bottom face, but we don't need to know that since from here we can see that $\boxed{90}$ . ~Terribleteeth | E | 90 |
8655d580c2215b683eea607ff11e39ea | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_19 | As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? [asy] import graph; unitsize(5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy] $\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$ | Like Solution 3, we can use casework, but in a different way. We can split the caseworks into the amount of moves we spend on each row (top and bottom, where both rows have 5 faces).
Case 1: 1 move on the top row;
There are 5 ways to make 1 move on the top row from the starting point (just moving on each of the five faces). Now we want to look at how many ways we can move towards the bottom. Notice how we have two faces on the bottom row that are adjacent to each of the top faces. If we spend one move on the bottom, there are 2 ways. If we spend two moves on the bottom, there are 4 ways (since order matters, we can flip the direction of these moves). If we spend three moves on the bottom, there are also 4 ways (similar reasoning). If we spend four moves on the bottom, there are 4 ways. And if we spend five moves on the bottom, there are again, 4 ways. In total there are $2 + 4 + 4 + 4 + 4 = 18$ ways to move from the bottom after the top moves are chosen. And since there are 5 ways to make 1 move on the top row, there are $5 \cdot 18 = 90$ ways.
Case 2: 2 moves on the top row;
From just counting, we can see that there are five ways to move once on the top, and after that, two options for the second move (either left or right), so there are $5 \cdot 2 = 10$ ways. And from using what we obtained in Case 1, there are $10 \cdot 18 = 180$ ways for this case.
Case 3: three moves on the top row;
There are, again, 10 ways to do this. And so, there are $10 \cdot 18 = 180$ ways for this case to happen.
Now, we can see that there will be 10 ways for the remaining cases of the first move for the top row (because 5 ways to choose the first, and then you can go either left or right, so $5 \cdot 2 = 10$ ).
So for Case 4 and Case 5, there will both also be $10 \cdot 18 = 180$ ways.
Finally, adding all these cases up, we obtain $90 + 180 + 180 + 180 + 180 = 810$ , or $\boxed{810}$ ~Misclicked | E | 810 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | [asy] size(15cm,0); import olympiad; draw((0,0)--(0,2)--(6,4)--(4,0)--cycle); label("A", (0,2), NW); label("B", (0,0), SW); label("C", (4,0), SE); label("D", (6,4), NE); label("E", (1.714,1.143), N); label("F", (1,1.5), N); draw((0,2)--(4,0), dashed); draw((0,0)--(6,4), dashed); draw((0,0)--(1,1.5), dashed); label("20", (0,2)--(4,0), SW); label("30", (4,0)--(6,4), SE); label("$x$", (1,1.5)--(1.714,1.143), NE); label("5$-$$x$", (1,1.5)--(0,2), NE); draw(rightanglemark((0,2),(0,0),(4,0))); draw(rightanglemark((0,2),(4,0),(6,4))); draw(rightanglemark((0,0),(1,1.5),(0,2))); [/asy]
It's crucial to draw a good diagram for this one. Since $AC=20$ and $CD=30$ , we get $[ACD]=300$ . Now we need to find $[ABC]$ to get the area of the whole quadrilateral. Drop an altitude from $B$ to $AC$ and call the point of intersection $F$ . Let $FE=x$ . Since $AE=5$ , then $AF=5-x$
By dropping this altitude, we can also see two similar triangles, $\triangle BFE \sim \triangle DCE$ . Since $EC$ is $20-5=15$ , and $DC=30$ , we get that $BF=2x$
Now, if we redraw another diagram just of $ABC$ , we get that $(2x)^2=(5-x)(15+x)$ because of the altitude geometric mean theorem which states that in any right triangle, the altitude squared is equal to the product of the two lengths that it divides the base into.
Expanding, simplifying, and dividing by the GCF, we get $x^2+2x-15=0$ . This factors to $(x+5)(x-3)$ , which has roots of $x=-5, 3$ . Since lengths cannot be negative, $x=3$ . Since $x=3$ , that means the altitude $BF=2\cdot3=6$ , or $[ABC]=60$ . Thus $[ABCD]=[ACD]+[ABC]=300+60=\boxed{360}$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | [asy] size(10cm,0); draw((10,30)--(10,0)--(-8,-6)--(-10,0)--(10,30)); draw((-20,0)--(20,0)); draw((0,-15)--(0,35)); draw((10,30)--(-8,-6)); draw(circle((0,0),10)); label("E",(-4.05,-.25),S); label("D",(10,30),NE); label("C",(10,0),NE); label("B",(-8,-6),SW); label("A",(-10,0),NW); label("5",(-10,0)--(-5,0), NE); label("15",(-5,0)--(10,0), N); label("30",(10,0)--(10,30), E); dot((-5,0)); dot((-10,0)); dot((-8,-6)); dot((10,0)); dot((10,30)); [/asy] Let the points be $A(-10,0)$ $\:B(x,y)$ $\:C(10,0)$ $\:D(10,30)$ ,and $\:E(-5,0)$ , respectively. Since $B$ lies on line $DE$ , we know that $y=2x+10$ . Furthermore, since $\angle{ABC}=90^\circ$ $B$ lies on the circle with diameter $AC$ , so $x^2+y^2=100$ . Solving for $x$ and $y$ with these equations, we get the solutions $(0,10)$ and $(-8,-6)$ . We immediately discard the $(0,10)$ solution as $y$ should be negative. Thus, we conclude that $[ABCD]=[ACD]+[ABC]=\frac{20\cdot30}{2}+\frac{20\cdot6}{2}=\boxed{360}$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | Let $\angle C = \angle{ACB}$ and $\angle{B} = \angle{CBE}.$ Using Law of Sines on $\triangle{BCE}$ we get \[\dfrac{BE}{\sin{C}} = \dfrac{CE}{\sin{B}} = \dfrac{15}{\sin{B}}\] and LoS on $\triangle{ABE}$ yields \[\dfrac{BE}{\sin{(90 - C)}} = \dfrac{5}{\sin{(90 - B)}} = \dfrac{BE}{\cos{C}} = \dfrac{5}{\cos{B}}.\] Divide the two to get $\tan{B} = 3 \tan{C}.$ Now, \[\tan{\angle{CED}} = 2 = \tan{\angle{B} + \angle{C}} = \dfrac{4 \tan{C}}{1 - 3\tan^2{C}}\] and solve the quadratic, taking the positive solution (C is acute) to get $\tan{C} = \frac{1}{3}.$ So if $AB = a,$ then $BC = 3a$ and $[ABC] = \frac{3a^2}{2}.$ By Pythagorean Theorem, $10a^2 = 400 \iff \frac{3a^2}{2} = 60$ and the answer is $300 + 60 \iff \boxed{360}.$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | [asy] import olympiad; pair A = (0, 189), B = (0,0), C = (570,0), D = (798, 798); dot("$A$", A, W); dot("$B$", B, S); dot("$C$", C, E); dot("$D$", D, N);dot("$E$",(140, 140), N); draw(A--B--C--D--A); draw(A--C, dotted); draw(B--D, dotted); [/asy]
Denote $EB$ as $x$ . By the Law of Cosines: \[AB^2 = 25 + x^2 - 10x\cos(\angle DEC)\] \[BC^2 = 225 + x^2 + 30x\cos(\angle DEC)\]
Adding these up yields: \[400 = 250 + 2x^2 + 20x\cos(\angle DEC) \Longrightarrow x^2 + \frac{10x}{\sqrt{5}} - 75 = 0\] By the quadratic formula, $x = 3\sqrt5$
Observe: \[[AEB] + [BEC] = \frac{1}{2}(x)(5)\sin(\angle DEC) + \frac{1}{2}(x)(15)\sin(180-\angle DEC) = (3)(20) = 60\]
Thus the desired area is $\frac{1}{2}(30)(20) + 60 = \boxed{360}$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | Let $C = (0, 0)$ and $D = (0, 30)$ . Then $E = (-15, 0), A = (-20, 0),$ and $B$ lies on the line $y=2x+30.$ So the coordinates of $B$ are \[(x, 2x+30).\]
We can make this a vector problem. $\overrightarrow{\mathbf{B}} = \begin{pmatrix} x \\ 2x+30 \end{pmatrix}.$ We notice that point $B$ forms a right angle, meaning vectors $\overrightarrow{\mathbf{BC}}$ and $\overrightarrow{\mathbf{BA}}$ are orthogonal, and their dot-product is $0$
We determine $\overrightarrow{\mathbf{BC}}$ and $\overrightarrow{\mathbf{BA}}$ to be $\begin{pmatrix} -x \\ -2x-30 \end{pmatrix}$ and $\begin{pmatrix} -20-x \\ -2x-30 \end{pmatrix}$ , respectively. (To get this, we use the fact that $\overrightarrow{\mathbf{BC}} = \overrightarrow{\mathbf{C}}-\overrightarrow{\mathbf{B}}$ and similarly, $\overrightarrow{\mathbf{BA}} = \overrightarrow{\mathbf{A}} - \overrightarrow{\mathbf{B}}.$
Equating the cross-product to $0$ gets us the quadratic $-x(-20-x)+(-2x-30)(-2x-30)=0.$ The solutions are $x=-18, -10.$ Since $B$ clearly has a more negative x-coordinate than $E$ , we take $x=-18$ . So $B = (-18, -6).$
From here, there are multiple ways to get the area of $\Delta{ABC}$ to be $60$ , and since the area of $\Delta{ACD}$ is $300$ , we get our final answer to be \[60 + 300 = \boxed{360}.\] | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | [asy] import olympiad; pair A = (0, 189), B = (0,0), C = (570,0), D = (798, 798),F=(285,94.5),G=(361.2,361.2); dot("$A$", A, W); dot("$B$", B, S); dot("$C$", C, E); dot("$D$", D, N);dot("$E$",(140, 140), N);dot("$F$",F,N);dot("$G$",G,N); draw(A--B--C--D--A); draw(A--C, dotted); draw(B--D, dotted); draw(F--G, dotted); [/asy]
Let $F$ be the midpoint of $AC$ , and draw $FG // CD$ where $G$ is on $BD$ . We have $EF=5,FC=10$
$\Delta EFG \sim \Delta ECD \implies FG=10=FA=FC$ . Therefore $ABCG$ is a cyclic quadrilateral.
Notice that $\angle EFG=90^\circ, EG=\sqrt{5^2+10^2}=5\sqrt{5} \implies BE=\frac{AE\cdot EC}{EG}=\frac{5\cdot 15}{5\sqrt{5}}=3\sqrt{5}$ via Power of a Point.
The altitude from $B$ to $AC$ is then equal to $GF\cdot \frac{BE}{GE}=10\cdot \frac{3\sqrt 5}{5 \sqrt 5}=6$
Finally, the total area of $ABCD$ is equal to $\frac 12 \cdot 20 \left(30+6 \right) =\boxed{360}.$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | [asy] size(15cm,0); import olympiad; draw((0,0)--(0,2)--(6,4)--(4,0)--cycle); label("A", (0,2), NW); label("B", (0,0), SW); label("C", (4,0), SE); label("D", (6,4), NE); label("E", (1.714,1.143), N); label("F", (1.714,0), SE); draw((0,2)--(4,0), dashed); draw((0,0)--(6,4), dashed); draw((1.714,1.143)--(1.714,0), dashed); label("20", (0,2)--(4,0), SW); label("30", (4,0)--(6,4), SE); label("$x$", (-0.3,2)--(-0.3,0), N); label("$y$", (0,-0.3)--(4,-0.3), E); draw(rightanglemark((1.714,2),(1.714,0),(5.714,0))); draw(rightanglemark((0,2),(0,0),(4,0))); draw(rightanglemark((0,2),(4,0),(6,4))); [/asy]
Let $AB = x$ $BC = y$
Looking at the diagram we have $x^2 + y^2 = 20^2$ $DE = \sqrt{30^2+15^2} = 15\sqrt{5}$ $[ACD] = \frac{1}{2} \cdot 20 \cdot 30 = 300$
Because $\triangle CEF \sim \triangle CAB$ $EF = AB \cdot \frac{CE}{CA} = x \cdot \frac{15}{20} = \frac{3x}{4}$
$BF = BC - CF = BC - BC \cdot \frac{CE}{CA} = \frac{1}{4} \cdot BC = \frac{y}{4}$
$BE = \sqrt{ \left( \frac{3x}{4} \right) ^2 + \left( \frac{y}{4} \right) ^2 } = \frac{ \sqrt{9x^2 + y^2} }{4}$ , substituting $x^2 + y^2 = 400$ , we get $BE = \frac{ \sqrt{8x^2 + 400} }{4} = \frac{ \sqrt{2x^2 + 100} }{2}$
$[ABC] = \frac{1}{2} \cdot x \cdot y$
Because $\triangle ABC$ and $\triangle ACD$ share the same base, $\frac{[ABC]}{[ACD]} = \frac{BE}{DE}$
$[ABC] = [ACD] \cdot \frac{BE}{DE} = 300 \cdot \frac{ \frac{ \sqrt{2x^2 + 100} } {2} }{ 15 \sqrt{5} }$
$\frac{1}{2} \cdot x \cdot y = 20 \cdot \frac{ \frac{ \sqrt{2x^2 + 100} } {2} }{ \sqrt{5} }$
$xy = 4 \sqrt{10x^2 + 500}$
By $x^2 + y^2 = 400$ $y = \sqrt{400 - x^2}$ . So, $x \cdot \sqrt{400 - x^2} = 4 \sqrt{10x^2 + 500}$
$x^2 (400 - x^2) = 16 (10x^2 + 500)$
Let $x^2 = a$ $a (400 - a) = 16 (10a + 500)$ $400a - a^2 = 160a + 8000$ $a^2 - 240a + 8000 = 0$ $(a-200)(a-40) = 0$
Because $x < 20$ $a$ can only equal 40. $a = 40$ $x = 2 \sqrt{10}$ $y = 6 \sqrt{10}$
$[ABC] = \frac{1}{2} \cdot 2 \sqrt{10} \cdot 6 \sqrt{10} = 60$
$[ABCD] = [ABC] + [ACD] = 60 + 300 = \boxed{360}$ | D | 360 |
1745104b4d24b9d50c148fb40caa5d53 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_20 | Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$
$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$ | Drop perpendiculars $\overline{AF}$ and $\overline{CG}$ to $\overline{BD}.$ Notice that since $\angle AEF=\angle CEG$ (since they are vertical angles) and $\angle AFE=\angle CGE=90^\circ,$ triangles $AEF$ and $CEG$ are similar. Therefore, we have
\[x/EF=CE/AE=15/5=3,\]
where $EG=x.$ Therefore, $EF=x/3.$
Additionally, angle chasing shows that triangles $CEG$ and $DCG$ are also similar. This gives $CG/x=DC/CE=30/15=2,$ so $CG=2x.$ Thus, applying the Pythagorean Theorem to triangle $CEG$ gives
\[x^2+(2x)^2=15^2,\]
so $EG=x=3\sqrt 5.$ Our pairs of similar triangles then allow us to fill in the following lengths (in this order):
\[EF=x/3=\sqrt 5, CG=2x=6\sqrt 5, AF=CG/3=2\sqrt 5, DG=2\cdot CG=12\sqrt 5.\]
Now, let $BF=y.$ Angle chasing shows that triangle $ABF$ and $BCG$ are similar, so $BG/AF=CG/BF.$ Plugging in known lengths gives
\[\dfrac{y+4\sqrt 5}{2\sqrt 5}=\dfrac{6\sqrt 5}{y}.\]
This gives $y=2\sqrt 5.$ Now we know all the lengths that make up $BD,$ which allows us to find
\[BD=2\sqrt 5+\sqrt 5+3\sqrt 5+12\sqrt 5=18\sqrt 5.\]
Therefore,
\begin{align*} [ABCD] &= [ABD]+[CBD] \\ &= (BD)(AF)/2+(BD)(CG)/2 \\ &= (18\sqrt 5)(2\sqrt 5)/2+(18\sqrt 5)(6\sqrt 5)/2 \\ &= \boxed{360} | D | 360 |
9862d58d0aa9b9538945851e5a0608f7 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_21 | There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that \[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\] What is $k?$
$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$ | First, substitute $2^{17}$ with $x$ .
Then, the given equation becomes $\frac{x^{17}+1}{x+1}=x^{16}-x^{15}+x^{14}...-x^1+x^0$ by sum of powers factorization.
Now consider only $x^{16}-x^{15}$ . This equals $x^{15}(x-1)=x^{15} \cdot (2^{17}-1)$ .
Note that $2^{17}-1$ equals $2^{16}+2^{15}+...+1$ , by difference of powers factorization (or by considering the expansion of $2^{17}=2^{16}+2^{15}+...+2+2$ ).
Thus, we can see that $x^{16}-x^{15}$ forms the sum of 17 different powers of 2.
Applying the same method to each of $x^{14}-x^{13}$ $x^{12}-x^{11}$ , ... , $x^{2}-x^{1}$ , we can see that each of the pairs forms the sum of 17 different powers of 2. This gives us $17 \cdot 8=136$ .
But we must count also the $x^0$ term.
Thus, Our answer is $136+1=\boxed{137}$ | C | 137 |
9862d58d0aa9b9538945851e5a0608f7 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_21 | There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that \[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\] What is $k?$
$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$ | Multiply both sides by $2^{17}+1$ to get \[2^{289}+1=2^{a_1} + 2^{a_2} + … + 2^{a_k} + 2^{a_1+17} + 2^{a_2+17} + … + 2^{a_k+17}.\]
Notice that $a_1 = 0$ , since there is a $1$ on the LHS. However, now we have an extra term of $2^{18}$ on the right from $2^{a_1+17}$ . To cancel it, we let $a_2 = 18$ . The two $2^{18}$ 's now combine into a term of $2^{19}$ , so we let $a_3 = 19$ . And so on, until we get to $a_{18} = 34$ . Now everything we don't want telescopes into $2^{35}$ . We already have that term since we let $a_2 = 18 \implies a_2+17 = 35$ . Everything from now on will automatically telescope to $2^{52}$ . So we let $a_{19}$ be $52$
As you can see, we will have to add $17$ $a_n$ 's at a time, then "wait" for the sum to automatically telescope for the next $17$ numbers, etc, until we get to $2^{289}$ . We only need to add $a_n$ 's between odd multiples of $17$ and even multiples. The largest even multiple of $17$ below $289$ is $17\cdot16$ , so we will have to add a total of $17\cdot 8$ $a_n$ 's. However, we must not forget we let $a_1=0$ at the beginning, so our answer is $17\cdot8+1 = \boxed{137}$ | C | 137 |
9862d58d0aa9b9538945851e5a0608f7 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_21 | There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that \[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\] What is $k?$
$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$ | In order to shorten expressions, $\#$ will represent $16$ consecutive $0$ s when expressing numbers. Think of the problem in binary. We have $\frac{1\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#1_2}{1\#1_2}$ Note that $(2^{17} + 1) (2^0 + 2^{34} + 2^{68} + \cdots + 2^{272}) = 2^0(2^{17} + 1) + 2^{34}(2^{17} + 1) + 2^{68}(2^{17} + 1) + \cdots 2^{272}(2^{17} + 1)$ $= 1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1_2$ and $(2^{17} + 1) (2^{17} + 2^{51} + 2^{85} + \cdots + 2^{255}) = 2^{17}(2^{17} + 1) + 2^{51}(2^{17} + 1) + 2^{85}(2^{17} + 1) + \cdots 2^{255}(2^{17} + 1)$ $= 1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#0_2$ Since $\phantom{=\ } 1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1_2$ $-\ \phantom{1\#} 1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#1\#0_2$ $= 1\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#0\#1_2$ this means that $(2^{17} + 1) (2^0 + 2^{34} + 2^{68} + \cdots + 2^{272}) - (2^{17} + 1) (2^{17} + 2^{51} + 2^{85} + \cdots + 2^{255}) = 2^{289}$ so $\frac{2^{289}+1}{2^{17}+1} = (2^0 + 2^{34} + 2^{68} + \cdots + 2^{272}) - (2^{17} + 2^{51} + 2^{85} + \cdots + 2^{255})$ $= 2^0 + (2^{34} - 2^{17}) + (2^{68} - 2^{51}) + \cdots + (2^{272} - 2^{255})$ Expressing each of the pairs of the form $2^{n + 17} - 2^n$ in binary, we have $\phantom{=\ } 1000000000000000000 \cdots 0_2$ $-\ \phantom{10000000000000000} 10 \cdots 0_2$ $= \phantom{1} 111111111111111110 \cdots 0_2$ or $2^{n + 17} - 2^n = 2^{n + 16} + 2^{n + 15} + 2^{n + 14} + \cdots + 2^{n}$ This means that each pair has $17$ terms of the form $2^n$ Since there are $8$ of these pairs, there are a total of $8 \cdot 17 = 136$ terms. Accounting for the $2^0$ term, which was not in the pair, we have a total of $136 + 1 = \boxed{137}$ terms. ~ emerald_block | C | 137 |
9862d58d0aa9b9538945851e5a0608f7 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_21 | There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that \[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\] What is $k?$
$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$ | Notice that the only answer choices that are spaced one apart are $136$ and $137$ . It's likely that people will forget to include the final term so the answer is $\boxed{137}$ | null | 137 |
3b94b22399f1b63398e4c234fa5dc871 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_22 | For how many positive integers $n \le 1000$ is \[\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor\] not divisible by $3$ ? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$ .)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$ | Clearly, $n=1$ fails. Except for the special case of $n=1$ \[\left\lfloor \frac{1000}{n} \right\rfloor - \left\lfloor \frac{998}{n} \right\rfloor\] equals either $0$ or $1$ . If it equals $0$ , this implies that $\left\lfloor \frac{998}{n} \right\rfloor = \left\lfloor \frac{999}{n} \right\rfloor = \left\lfloor \frac{1000}{n} \right\rfloor$ , so their sum is clearly a multiple of $3$ , so this will always fail. If it equals $1$ , the sum of the three floor terms is $3 \left\lfloor \frac{999}{n} \right\rfloor \pm 1$ , so it is never a multiple of $3$ . Thus, we are looking for all $n \neq 1$ such that \[\left\lfloor \frac{1000}{n} \right\rfloor - \left\lfloor \frac{998}{n} \right\rfloor = 1.\] This implies that either \[\left\lfloor \frac{998}{n} \right\rfloor + 1 = \left\lfloor \frac{999}{n} \right\rfloor,\] or \[\left\lfloor \frac{999}{n} \right\rfloor + 1 = \left\lfloor \frac{1000}{n} \right\rfloor.\]
Let's analyze the first equation of these two. This equation is equivalent to the statement that there is a positive integer $a$ such that \[\frac{998}{n} < a \leq \frac{999}{n} \implies 998 < an \leq 999 \implies an = 999 \implies a = \frac{999}{n} \implies n | 999.*\] Analogously, the second equation implies that \[n | 1000.\] So our only $n$ that satisfy this condition are $n \neq 1$ that divide $999$ or $1000$ . Using the method to find the number of divisors of a number, we see that $999$ has $8$ divisors and $1000$ has $16$ divisors. Their only common factor is $1$ , so there are $8+16-1 = 23$ positive integers that divide either $999$ or $1000$ . Since the integer $1$ is a special case and does not count, we must subtract this from our $23$ , so our final answer is $23-1 = \boxed{22}.$ | A | 22 |
3b94b22399f1b63398e4c234fa5dc871 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_22 | For how many positive integers $n \le 1000$ is \[\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor\] not divisible by $3$ ? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$ .)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$ | Counting down $n$ from $1000$ $999$ $998$ ... we notice that $\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$ is only not divisible by $3$ when n is a divisor of only $1000$ or $999 (1000, 999, 500, 333$ ...). Notice how the factors of $998: 1, 2, 499$ , and $998$ , do not work.
The prime factorization of $999$ is $3^3\cdot37$ , so $4\cdot2=8$ factors in total.
The prime factorization of $1000$ is $2^3\cdot5^3$ , so $4\cdot4=16$ factors in total.
However, $1$ obviously does not work, so we have to subtract $2$ $1$ is counted twice) from the total. $8 + 16 - 2$ $\boxed{22}$ | A | 22 |
3b94b22399f1b63398e4c234fa5dc871 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_22 | For how many positive integers $n \le 1000$ is \[\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor\] not divisible by $3$ ? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$ .)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$ | First, we notice the following lemma:
$\textbf{Lemma}$ : For $N, n \in \mathbb{N}$ $\left\lfloor \frac{N}{n} \right\rfloor = \left\lfloor \frac{N-1}{n} \right\rfloor + 1$ if $n \mid N$ ; and $\left\lfloor \frac{N}{n} \right\rfloor = \left\lfloor \frac{N-1}{n} \right\rfloor$ if $n \nmid N.$
$\textbf{Proof}$ : Let $A = kn + r$ , with $0 \leq r < n$ . If $n \mid N$ , then $r = 0$ . Hence $\left\lfloor \frac{N}{n} \right\rfloor = k$ $\left\lfloor \frac{N-1}{n} \right\rfloor = \left\lfloor \frac{(k-1)n+n-1}{n} \right\rfloor = k-1 + \left\lfloor \frac{n-1}{n} \right\rfloor = k-1$ , and $\left\lfloor \frac{N}{n} \right\rfloor = \left\lfloor \frac{N-1}{n} \right\rfloor + 1.$
If $n \nmid N$ , then $1 \leq r < n$ . Hence $\left\lfloor \frac{N}{n} \right\rfloor = k$ $\left\lfloor \frac{N-1}{n} \right\rfloor = k + \left\lfloor \frac{r-1}{n} \right\rfloor = k$ , and $\left\lfloor \frac{N}{n} \right\rfloor = \left\lfloor \frac{N-1}{n} \right\rfloor.$
From the lemma and the given equation, we have four possible cases: \[\left\lfloor \frac{998}{n} \right\rfloor + 1 = \left\lfloor \frac{999}{n} \right\rfloor = \left\lfloor \frac{1000}{n} \right\rfloor - 1 \qquad (1)\] \[\left\lfloor \frac{998}{n} \right\rfloor + 1 = \left\lfloor \frac{999}{n} \right\rfloor + 1 = \left\lfloor \frac{1000}{n} \right\rfloor \qquad (2)\] \[\left\lfloor \frac{998}{n} \right\rfloor + 1 = \left\lfloor \frac{999}{n} \right\rfloor = \left\lfloor \frac{1000}{n} \right\rfloor \qquad (3)\] \[\left\lfloor \frac{998}{n} \right\rfloor = \left\lfloor \frac{999}{n} \right\rfloor = \left\lfloor \frac{1000}{n} \right\rfloor \qquad (4)\]
Note that cases (2) and (3) are the cases in which the term, $\left\lfloor \frac{998}{n} \right\rfloor + \left\lfloor \frac{999}{n} \right\rfloor + \left\lfloor \frac{1000}{n} \right\rfloor,$ is not divisible by $3$ . So we only need to count the number of $n$ 's for which cases (2) and (3) stand.
Case (2): By the lemma, we have $n \mid 1000$ and $n \nmid 999.$ Hence $n$ can be any factor of $1000$ except for $n = 1$ . Since $1000 = 2^3 * 5^3,$ there are $(3+1)(3+1) - 1 = 15$ possible values of $n$ for this case.
Case (3): By the lemma, we have $n \mid 999$ and $n \nmid 998.$ Hence $n$ can be any factor of $999$ except for $n = 1$ . Since $999 = 3^3 * 37^1,$ there are $(3+1)(1+1) - 1 = 7$ possible values of $n$ for this case.
So in total, we have total of $15+7=\boxed{22}$ possible $n$ 's. | A | 22 |
3b94b22399f1b63398e4c234fa5dc871 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_22 | For how many positive integers $n \le 1000$ is \[\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor\] not divisible by $3$ ? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$ .)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$ | Note that $\left\lfloor \frac{998}{n} \right\rfloor + \left\lfloor \frac{999}{n} \right\rfloor + \left\lfloor \frac{1000}{n} \right\rfloor$ is a multiple of $3$ if $\left\lfloor \frac{998}{n} \right\rfloor + \left\lfloor \frac{999}{n} \right\rfloor + \left\lfloor \frac{1000}{n} \right\rfloor$ lies between two consecutive multiples of $n$
$\textbf{Explanation:}$
Let's assume that the above expression does indeed lie betweent two consecutive multiples of $n$ . This implies that $n$ does not divide either $998, 999$ or $1000$ , meaning that when divided by $n$ , none of the quotients are whole. In turn, this also means that they will all have the same whole number part.
If $\frac{998}{n}, \frac{999}{n},$ and $\frac{1000}{n}$ were to have a different whole number part, then $n$ would have to lie within $998$ and $1000$ . If this is confusing, think of why $\frac{6}{5}, \frac{7}{5}$ and $\frac{8}{5}$ have the same whole number part ( $1$ in this case). Here, $n=5$ . What happens to the whole number part when $n=7$
Since $\frac{998}{n}, \frac{999}{n},$ and $\frac{1000}{n}$ have identical whole number parts, their floors are identical, since the floor of a number is equal to its whole number part, discarding its fractional component.
Let $k$ be the number we get when we floor $\frac{998}{n}, \frac{999}{n},$ or $\frac{1000}{n}$ if the three of those numbers lie between two consecutive multiples of $n$ . Adding them up, we get $3k$ (due to their floors being the same), which is a mulutiple of $3$ . So no matter what, we cannot have $\frac{998}{n}, \frac{999}{n},$ and $\frac{1000}{n}$ lie between two consecutive multiples of $n$
What does this mean? It means that there must be some multiple of $n$ within this expression (with some restrictions, as we'll see), in order to prevent the violation of the main restriction. We can proceed with casework now.
$\textbf{Case 1}$
Let's assume that the multiple of $n$ is located at $\frac{998}{n}$ . Luckily, the only prime factors of $998$ are $2$ and $499$
We can observe that $499$ doesn't work, since $\frac{998}{499}$ and $\frac{1000}{499}$ will both round down to $2$ when divided by it. However, $2$ does work, since it divides both $998$ and $1000$ . The floor of $\frac{999}{2}$ is $499$ , , meaning that when we evaluate the given expression for $n=2$ , we will get $2\cdot{499}+500$ which isn't a multiple of $3$
This case works because we have a multiple of $n$ at the end of the expression, as well as the beginning, so the whole number parts of $998, 999$ and $1000$ when divided by $n$ are not all the same, due to $n$ dividing two of these numbers.
The restriction of $n$ dividing more than one number within the expression is only valid when we're testing the first number in the given expression (otherwise, the other floors wouldn't round down to the same value as the first).
Case $1$ is complete, and we've found that only $2$ works.
$\textbf{Case 2}$
Now, let's assume that the multiple of $n$ is located at $\frac{999}{n}$ . In this case, if $n$ divides $999$ , it doesn't divide $998$ (since two multiples of a number greater than $1$ are never consecutive), nor does it divide $1000$ , for the same reason.
The prime factorization of $999$ is $3^3\cdot37$ , and thus has $(3+1)(1+1)=8$ divisors.
When testing a few values of $n$ initially, we observed that $n=1$ causes the expression to be divisible by $3$ . Subtracting $1$ , we see that there are $7$ values of $n$ that work for this case.
$\textbf{Case 3}$
Finally, let's assume that the multiple of $n$ is located at $\frac{1000}{n}.$
Our goal is to have the other multiple of $n$ below whatever $\frac{998}{n}$ is, so we won't have identical floors throughout the expression.
Once again, any factor of $1000$ , except for $2$ is relatively prime to both $998$ and $999$ , so when we floor those two numbers, we get an integer that isn't $500$
$1000$ factors as $2^3\cdot{5^3}$ , meaning that it has $(3+1)(3+1)=16$ divisors. $1$ and $2$ either don't work or have already been counted, so there are $14$ valid values of $n$ for this case.
$\textbf{Ending}$
Adding these three cases, we get $1+7+14= \boxed{22}$ values of $n$ | A | 22 |
946a4ede4e4682a4a4635ab9a1709fdc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_23 | Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}, 180^{\circ},$ and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$ -axis, and reflection across the $y$ -axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by a reflection across the $y$ -axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by another reflection across the $x$ -axis will not return $T$ to its original position.)
$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$ | [asy] size(10cm); Label f; f.p=fontsize(6); xaxis(-6,6,Ticks(f, 2.0)); yaxis(-6,6,Ticks(f, 2.0)); filldraw(origin--(4,0)--(0,3)--cycle, gray, black+linewidth(1)); [/asy]
First, any combination of motions we can make must reflect $T$ an even number of times. This is because every time we reflect $T$ , it changes orientation. Once $T$ has been flipped once, no combination of rotations will put it back in place because it is the mirror image; however, flipping it again changes it back to the original orientation. Since we are only allowed $3$ transformations and an even number of them must be reflections, we either reflect $T$ $0$ times or $2$ times.
Case 1: $0$ reflections on $T$
In this case, we must use $3$ rotations to return $T$ to its original position. Notice that our set of rotations, $\{90^\circ,180^\circ,270^\circ\}$ , contains every multiple of $90^\circ$ except for $0^\circ$ . We can start with any two rotations $a,b$ in $\{90^\circ,180^\circ,270^\circ\}$ and there must be exactly one $c \equiv -a - b \pmod{360^\circ}$ such that we can use the three rotations $(a,b,c)$ which ensures that $a + b + c \equiv 0^\circ \pmod{360^\circ}$ . That way, the composition of rotations $a,b,c$ yields a full rotation. For example, if $a = b = 90^\circ$ , then $c \equiv -90^\circ - 90^\circ = -180^\circ \pmod{360^\circ}$ , so $c = 180^\circ$ and the rotations $(90^\circ,90^\circ,180^\circ)$ yields a full rotation.
The only case in which this fails is when $c$ would have to equal $0^\circ$ . This happens when $(a,b)$ is already a full rotation, namely, $(a,b) = (90^\circ,270^\circ),(180^\circ,180^\circ),$ or $(270^\circ,90^\circ)$ . However, we can simply subtract these three cases from the total. Selecting $(a,b)$ from $\{90^\circ,180^\circ,270^\circ\}$ yields $3 \cdot 3 = 9$ choices, and with $3$ that fail, we are left with $6$ combinations for case $1$
Case 2: $2$ reflections on $T$
In this case, we first eliminate the possibility of having two of the same reflection. Since two reflections across the x-axis maps $T$ back to itself, inserting a rotation before, between, or after these two reflections would change $T$ 's final location, meaning that any combination involving two reflections across the x-axis would not map $T$ back to itself. The same applies to two reflections across the y-axis.
Therefore, we must use one reflection about the x-axis, one reflection about the y-axis, and one rotation. Since a reflection about the x-axis changes the sign of the y component, a reflection about the y-axis changes the sign of the x component, and a $180^\circ$ rotation changes both signs, these three transformation composed (in any order) will suffice. It is therefore only a question of arranging the three, giving us $3! = 6$ combinations for case 2.
Combining both cases we get $6+6=\boxed{12}$ | A | 12 |
946a4ede4e4682a4a4635ab9a1709fdc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_23 | Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}, 180^{\circ},$ and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$ -axis, and reflection across the $y$ -axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by a reflection across the $y$ -axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by another reflection across the $x$ -axis will not return $T$ to its original position.)
$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$ | As in the previous solution, note that we must have either $0$ or $2$ reflections because of orientation since reflection changes orientation that is impossible to fix by rotation. We also know we can't have the same reflection twice, since that would give a net of no change and would require an identity rotation.
Suppose there are no reflections. Denote $90^{\circ}$ as $1$ $180^{\circ}$ as $2$ , and $270^{\circ}$ as $3$ , just for simplification purposes. We want a combination of $3$ of these that will sum to either $4$ or $8$ $0$ and $12$ are impossible since the minimum is $3$ and the max is $9$ ). $4$ can be achieved with any permutation of $(1-1-2)$ and $8$ can be achieved with any permutation of $(2-3-3)$ . This case can be done in $3+3=6$ ways.
Suppose there are two reflections. As noted already, they must be different, and as a result will take the triangle to the opposite side of the origin if we don't do any rotation. We have $1$ rotation left that we can do though, and the only one that will return to the original position is $2$ , which is $180^{\circ}$ AKA reflection across origin. Therefore, since all $3$ transformations are distinct. The three transformations can be applied anywhere since they are commutative (think quadrants). This gives $6$ ways.
$6+6=\boxed{12}$ | A | 12 |
946a4ede4e4682a4a4635ab9a1709fdc | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_23 | Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}, 180^{\circ},$ and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$ -axis, and reflection across the $y$ -axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by a reflection across the $y$ -axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$ -axis, followed by another reflection across the $x$ -axis will not return $T$ to its original position.)
$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$ | Define $s$ as a reflection, and $r$ as a $90^{\circ}$ counterclockwise rotation. Thus, $r^4=s^2=e$ , and the five transformations can be represented as ${r, r^2, r^3, r^2s, s}$ , and $rs=sr^{-1}$
Now either $s$ doesn't appear at all or appears twice. For the former case, it's easy to see that only $r, r, r^2$ and $r^2, r^3, r^3$ will work. Both can be permuted in $3$ ways, giving $6$ ways in total.
For the latter case, note that $s$ can't appear twice, neither does $r^2s$ , else we need to get $e$ from ${r, r^2, r^3}$ , which is not possible. So $r^2s$ and $s$ must appear once each. The last transformation must be $r^2$ . A quick check shows that ${r^2, r^2s, s}$ is permutable, since $r^2s=sr^{-2}=sr^2$ (since $r^4=e$ ). This gives $6$ ways.
Thus the answer is $\boxed{12}$ | A | 12 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We know that $\gcd(n+57,63)=21$ and $\gcd(n-57, 120)= 60$ by the Euclidean Algorithm. Hence, let $n+57=21\alpha$ and $n-57=60 \gamma$ , where $\gcd(\alpha,3)=1$ and $\gcd(\gamma,2)=1$ . Subtracting the two equations, $38=7\alpha-20\gamma$ . Letting $\gamma = 2s+1$ , we get $58=7\alpha-40s$ . Taking modulo $40$ , we have $\alpha \equiv{14} \pmod{40}$ . We are given that $n=21\alpha -57 >1000$ , so $\alpha \geq 51$ . Notice that if $\alpha =54$ then the condition $\gcd(\alpha,3)=1$ is violated. The next possible value of $\alpha = 94$ satisfies the given condition, giving us $n=1917$
Alternatively, we could have said $\alpha = 40k+14 \equiv{0} \pmod{3}$ for $k \equiv{1} \pmod{3}$ only, so $k \equiv{0,2} \pmod{3}$ , giving us our answer. Since the problem asks for the sum of the digits of $n$ , our answer is $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | The conditions of the problem reduce to the following: $n+120 = 21k$ and $n+63 = 60\ell$ , where $\gcd(k,3) = 1$ and $\gcd(\ell,2) = 1$ . From these equations, we see that $21k - 60\ell = 57$ . Solving this Diophantine equation gives us that $k = 20a + 17$ and $\ell = 7a + 5$ . Since, $n>1000$ , we can do some bounding and get that $k > 53$ and $\ell > 17$ . Now we start bashing by plugging in numbers that satisfy these conditions: $a=4$ is the first number that works so we get $\ell = 33$ $k = 97$ . Therefore, we have $n=21(97)-120=60(33)-63=1917$ , and our answer is $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We first find that $n\equiv6\pmod{21}$ and $n\equiv57\pmod{60}$ , then we get $n=21x+6$ and $n=60y+57$ by definitions, where $x$ and $y$ are integers. It follows that $y$ must be odd, since the GCD will be $120$ instead of $60$ if $y$ is even. Also, the unit digit of $n$ must be $7$ , since the unit digit of $60y$ is always $0$ and the unit digit of $57$ is $7$ . Therefore, we find that $x$ must end in $1$ to satisfy $n$ having a unit digit of $7$ . Also, we find that $x$ must not be a multiple of $3$ or else the GCD will be $63$ . Therefore, we test values for $x$ and find that $x=91$ satisfies all these conditions. Therefore, $n=1917$ and $1+9+1+7 = \boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We are given that $\gcd(63, n+120) =21$ and $\gcd(n+63, 120)=60.$ By applying the Euclidean algorithm in reverse, we have \[\gcd(63, n+120) = \gcd(63, n+120 + 63) = \gcd(63, n+183) = 21\] and \[\gcd(n+63, 120) = \gcd(n+63 + 120, 120) = \gcd(n+183, 120) = 60.\]
We now know that $n+183$ must be divisible by $21$ and $60,$ so it is divisible by $\text{lcm}(21, 60) = 420.$ Therefore, $n+183 = 420k$ for some integer $k.$ We know that $3 \nmid k,$ or else the first condition won't hold ( $\gcd$ will be $63$ ) and $2 \nmid k,$ or else the second condition won't hold ( $\gcd$ will be $120$ ). Since $k = 1$ gives us too small of an answer, then $k=5,$ from which $n = 1917.$ So, the answer is $1+9+1+7 = \boxed{18}.$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | $\gcd(n+63,120)=60$ tells us $n+63\equiv60\pmod {120}$ . The smallest $n+63$ that satisfies the previous condition and $n>1000$ is $1140$ , so we start from there. If $n+63=1140$ , then $n+120=1197$ . Because $\gcd(n+120,63)=21$ $n+120\equiv21\pmod {63}$ or $n+120\equiv42\pmod {63}$ . We see that $1197\equiv0\pmod {63}$ , which does not fulfill the requirement for $n+120$ , so we continue by keep on adding $120$ to $1197$ , in order to also fulfill the requirement for $n+63$ . Soon, we see that $n+120\pmod {63}$ decreases by $6$ every time we add $120$ , so we can quickly see that $n=1917$ because at that point $n+120\equiv21\pmod {63}$ . We add up all digits of $1917$ to get $\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We are able to set up the following system of congruences: \begin{align*} n &\equiv 6 \pmod {21}, \\ n &\equiv 57 \pmod {60}. \end{align*} Therefore, by definition, we are able to set-up the following system of equations: \begin{align*} n &= 21a + 6, \\ n &= 60b + 57. \end{align*} Thus, we have $21a + 6 = 60b + 57,$ from which \[7a + 2 = 20b + 19.\] We know $7a \equiv 0 \pmod {7},$ and since $7a = 20b + 17,$ therefore $20b + 17 \equiv 0 \pmod{7}.$ Simplifying this congruence further, we have \[b\equiv 3 \pmod{7}.\] Thus, by definition, $b = 7x + 3.$ Substituting this back into our original equation, we get \[n = 60(7x + 3) + 57 = 420x + 237.\] By definition, we are able to set up the following congruence: \[n \equiv 237 \pmod{420}.\] Thus, $n = 1917$ , so our answer is simply $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | First, we find $n$ . We know that it is greater than $1000$ , so we first input $n = 1000$ . From the first equation, $\gcd(63, n + 120) = 21$ , we know that if $n$ is correct, after we add $120$ to it, it should be divisible by $21$ , but not $63$ \[\frac{n + 120}{21} = \frac{1120}{21} = 53\text{ R }7.\] This does not work. To get to the nearest number divisible by $21$ , we have to add $14$ to cancel out the remainder. (Note that we don't subtract $7$ to get to $53$ $n$ is already at its lowest possible value!)
Adding $14$ to $1000$ gives us $n = 1014$ . (Note: $n$ is currently divisible by 63, but that's fine since we'll be changing it in the next step.)
Now using the second equation, $\gcd(n + 63, 120) = 60$ , we know that if $n$ is correct, then $n+63$ is divisible by $60$ but not $120$ \[\frac{n + 63}{60} = \frac{1077}{60} = 17\text{ R }57.\] Again, this does not work. This requires some guessing and checking. We can add $21$ over and over again until $n$ is valid. This changes $n$ while also maintaining that $\frac{n + 120}{21}$ has no remainders.
After adding $21$ once, we get $18 r 18$ . By pure luck, adding $21$ two more times gives us $19$ with no remainders.
We now have $1077 + 21 + 21 + 21 = 1140$ . However, this number is divisible by $120$ . To get the next possible number, we add the LCM of $21$ and $60$ (once again, to maintain divisibility), which is $420$ . Unfortunately, $1140 + 420 = 1560$ is still divisible by $120$ . Adding $420$ again gives us $1980$ , which is valid. However, remember that this is equal to $n + 63$ , so subtracting $63$ from $1980$ gives us $1917$ , which is $n$
The sum of its digits are $1 + 9 + 1 + 7 = \boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | By the Euclidean Algorithm, we have \begin{alignat*}{8} \gcd(63,n+120)&=\hspace{1mm}&&\gcd(63,\phantom{ }\underbrace{n+120-63k_1}_{(n+120) \ \mathrm{mod} \ 63}\phantom{ })&&=21, \\ \gcd(n+63,120)&=&&\gcd(\phantom{ }\underbrace{n+63-120k_2}_{(n+63) \ \mathrm{mod} \ 120}\phantom{ },120)&&=60. \end{alignat*} Clearly, $n+120-63k_1$ must be either $21$ or $42,$ and $n+63-120k_2$ must be $60.$
More generally, let $t\in\{1,2\},$ so we get \begin{align*} n+120-63k_1&=21t, &\hspace{55.5mm}(1) \\ n+63-120k_2&=60. &\hspace{55.5mm}(2) \end{align*} Subtracting $(2)$ from $(1)$ and then simplifying give \begin{align*} 57-63k_1+120k_2&=21t-60 \\ 117-63k_1+120k_2&=21t \\ 39-21k_1+40k_2&=7t. \hspace{54mm}(\bigstar) \end{align*} Taking $(\bigstar)$ modulo $7$ produces \begin{align*} 4+5k_2&\equiv0\pmod{7} \\ k_2&\equiv2\pmod{7}. \end{align*} Recall that $n>1000.$ From $(2),$ it follows that \[1063-120k_2<n+63-120k_2=60,\] from which $k_2>8.$ Therefore, the possible values for $k_2$ are $9,16,23,\ldots.$
We need to check whether positive integers $k_1$ and $t$ (where $t\in\{1,2\}$ ) exist in $(1):$
Finally, the least such positive integer $n$ is $1917.$ The sum of its digits is $1+9+1+7=\boxed{18}.$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | Because we are finding value of $n$ for $n > 1000$ , let $n = 1000 + k$
Using the Euclidean Algorithm, \begin{align*} \gcd(63, n+120) &= \gcd(63, 1000 + k + 120) \\ &= \gcd(63, k + 1120 - 63 \cdot 18) \\ &= \gcd(63, k-14) \\ &= 21, \\ \gcd(n+63, 120) &= \gcd(k + 1000 + 63, 120) \\ &= \gcd(k + 1000 + 63 - 120 \cdot 9, 120) \\ &= \gcd(k-17, 120) \\ &= 60. \end{align*} So, we have \begin{align*} k &\equiv 14 \pmod{21}, \\ k &\equiv 17 \pmod{60}. \end{align*} Let $k = 21p + 14 = 60q + 17$ $7p= 20q + 1$ (by the Division Algorithm), $7p = 21q - (q - 1)$ $q - 1$ is a multiple of $7$
Let $q-1 = 7r$ $q = 7r+1$ $k = 60(7r+1) + 17 = 420r + 77$
$n = 1000 + k = 420r + 1077$ $n = 1077, 1497, 1917$
By substituting $1077$ $1497$ $1917$ into $\gcd(63, n+120) =21$ and $\gcd(n+63, 120)=60$ $1077$ and $1497$ aren't valid answers, only $1917$ is. Therefore, the answer is $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We know $63 = 3 \cdot 21$ , and $\gcd(63, n + 120) = 21 \Longrightarrow n + 120 = 21a$ , where $a$ is not a multiple of $3$
Also, $120 = 2 \cdot 60$ , and $gcd(n+63, 120) = 60 \Longrightarrow n + 63 = 60b$ , where $b$ is not a multiple of $2$
Let $n+63 = 60b = x$ $n = x - 63$ $n+120 = x+57 = 21a$
Now the problem becomes $\gcd(63, x+57) =21$ and $\gcd(x, 120)=60$
Meaning $x + 57$ has to be a multiple of $21$ but not $63$ , and $x$ is a multiple of $60$ but not $120$
Using trial and error, the least values are $x = 33\cdot60 = 1980$ and $n = x-63 = 1917$
Therefore, the answer is $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | We have \begin{align*} \gcd(63, n+120) &= 21 \Longrightarrow n + 120 \equiv 0 \pmod{21}, \text{ where } 9 \nmid n + 120, \\ \gcd(n+63, 120) &= 60 \Longrightarrow n + 63 \equiv 0 \pmod{60}, \text{ where } 8 \nmid n + 63. \end{align*} So, we conclude that $n \equiv 6 \pmod{21}$ and $n \equiv 57 \pmod{60}$ , respectively.
Because the $2$ moduli $21$ and $60$ are not relatively prime, namely $\gcd{(21, 60)} = 3$ $21 = 3 \cdot 7$ , and $60 = 3 \cdot 20$ , we convert the system of $2$ linear congruences with non-coprime moduli into a system of $3$ linear congruences with coprime moduli: \begin{align*} n &\equiv 0 \pmod{3}, \\ n &\equiv 6 \pmod{7}, \\ n &\equiv 17 \pmod{20}. \end{align*} By Chinese Remainder Theorem , the general solution of system of $3$ linear congruences is \[n = 420k + 1077.\] We construct the following table: \[\begin{array}{c|c|c|c} n & 1077 & 1497 & 1917\\ \hline n + 120 & 1197 & 1617 & 2037\\ \hline n + 63 & 1140 & 1560 & 1980\\ \end{array}\] Only $n = 1917$ satisfies $9 \nmid n + 120$ and $8 \nmid n + 63$ . Therefore, the answer is $1+9+1+7=\boxed{18}$ | C | 18 |
0fb915d66f500fc4c97eccf9fa4103c2 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10A_Problems/Problem_24 | Let $n$ be the least positive integer greater than $1000$ for which
\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]
What is the sum of the digits of $n$
$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$ | From $\gcd(63, n + 120) = 21$ , we know that \begin{align} n + 120 &\equiv 0 \pmod{7} \Rightarrow n \equiv 6 \pmod{7} \tag{1} \\ n + 120 &\equiv 0 \pmod{3} \Rightarrow n \equiv 0 \pmod{3} \Rightarrow n \equiv 0, 3, 6 \pmod{9} \notag \end{align} Since \begin{align} n + 120 &\not\equiv 0 \pmod{9} \Rightarrow n \not\equiv 6 \pmod{9} \notag \end{align} We must have \begin{align} n &\equiv 0 \pmod{9} \tag{2} \end{align} Or \begin{align} n &\equiv 3 \pmod{9} \tag{3} \end{align} (Note that $n + 120 \equiv 0 \pmod{9}$ is impossible since then $9 | \gcd(63, n+120)$ .)
From $\gcd(n+63, 120) = 60$ , we have \begin{align} n + 63 &\equiv 0 \pmod{15} \Rightarrow n \equiv 12 \pmod {15} \tag{4} \\ n + 63 &\equiv 0 \pmod{4} \Rightarrow n \equiv 1 \pmod {4} \Rightarrow n \equiv 1, 5 \pmod{8} \notag \end{align} Since \begin{align} n + 63 &\not\equiv 0 \pmod{8} \Rightarrow n \not\equiv 1 \pmod{8} \notag \end{align} We must have \begin{align} n &\equiv 5 \pmod {8} \tag{5} \end{align} Solving equations $(1)$ $(4)$ , and $(5)$ , we get \begin{align} n &\equiv 237 \pmod{840} \tag{6} \end{align} Solving $(6)$ with $(2)$ , we have \begin{align} n &\equiv 1917 \pmod{2520} \tag{7} \end{align} Solving $(6)$ with $(3)$ , we have \begin{align} n &\equiv 237 \pmod{2520} \tag{8} \end{align} From $(7)$ , we obtain $1917$ , and from $(8)$ , we obtain $237 + 2520 = 2757$ as the smallest solutions above $1000$ . Thus, we get $1 + 9 + 1 + 7 = \boxed{18}$ | C | 18 |
dce7ec2027c692252248dc8e85b580b5 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_1 | What is the value of \[1-(-2)-3-(-4)-5-(-6)?\]
$\textbf{(A)}\ -20 \qquad\textbf{(B)}\ -3 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 21$ | We know that when we subtract negative numbers, $a-(-b)=a+b$
The equation becomes $1+2-3+4-5+6 = \boxed{5}$ | D | 5 |
dce7ec2027c692252248dc8e85b580b5 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_1 | What is the value of \[1-(-2)-3-(-4)-5-(-6)?\]
$\textbf{(A)}\ -20 \qquad\textbf{(B)}\ -3 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 21$ | Like Solution 1, we know that when we subtract $a-(-b)$ , that will equal $a+b$ as the opposite/negative of a negative is a positive. Thus, $1-(-2)-3-(-4)-5-(-6)=1+2-3+4-5+6$ . We can group together a few terms to make our computation a bit simpler. $1+(2-3)+4+(-5+6)= 1+(-1)+4+1=\boxed{5}$ | D | 5 |
8d4fbb0276cff4ac42abd58e1912d4d5 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_2 | Carl has $5$ cubes each having side length $1$ , and Kate has $5$ cubes each having side length $2$ . What is the total volume of these $10$ cubes?
$\textbf{(A)}\ 24 \qquad\textbf{(B)}\ 25 \qquad\textbf{(C)}\ 28 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ 45$ | A cube with side length $1$ has volume $1^3=1$ , so $5$ of these will have a total volume of $5\cdot1=5$
A cube with side length $2$ has volume $2^3=8$ , so $5$ of these will have a total volume of $5\cdot8=40$
$5+40=\boxed{45}$ ~quacker88 | E | 45 |
8d4fbb0276cff4ac42abd58e1912d4d5 | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_2 | Carl has $5$ cubes each having side length $1$ , and Kate has $5$ cubes each having side length $2$ . What is the total volume of these $10$ cubes?
$\textbf{(A)}\ 24 \qquad\textbf{(B)}\ 25 \qquad\textbf{(C)}\ 28 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ 45$ | The total volume of Carl's cubes is $5$ . This is because to find the volume of a cube or a rectangular prism, you have to multiply the height by the length by the width. So in this question, it would be $1 \times 1 \times 1$ . This is equal to $1$ . Since Carl has 5 cubes, you will have to multiply $1$ by $5$ , to account for all the $5$ cubes.
Next, to find the total volume of Kate's cubes you have to do the same thing. Except, this time, the height, the width, and the length, are all $2$ , so it will be $2 \times 2 \times 2 = 8.$ Now you have to multiply by $5$ to account for all the $5$ blocks. This is $40$ . So the total volume of Kate's cubes is $40$
Lastly, to find the total of Carl's and Kate's cubes, you must add the total volume of these people. This is going to be $5+40=\boxed{45}$ | E | 45 |
aefc0ec270cfc0039721e20ee9cb2ece | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_4 | The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$ , where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$
$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 11$ | Since the three angles of a triangle add up to $180^{\circ}$ and one of the angles is $90^{\circ}$ because it's a right triangle, $a^{\circ} + b^{\circ} = 90^{\circ}$
The greatest prime number less than $90$ is $89$ . If $a=89^{\circ}$ , then $b=90^{\circ}-89^{\circ}=1^{\circ}$ , which is not prime.
The next greatest prime number less than $90$ is $83$ . If $a=83^{\circ}$ , then $b=7^{\circ}$ , which IS prime, so we have our answer $\boxed{7}$ ~quacker88 | D | 7 |
aefc0ec270cfc0039721e20ee9cb2ece | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_4 | The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$ , where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$
$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 11$ | Looking at the answer choices, only $7$ and $11$ are coprime to $90$ . Testing $7$ , the smaller angle, makes the other angle $83$ which is prime, therefore our answer is $\boxed{7}$ | D | 7 |
aefc0ec270cfc0039721e20ee9cb2ece | https://artofproblemsolving.com/wiki/index.php/2020_AMC_10B_Problems/Problem_4 | The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$ , where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$
$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 11$ | It is clear that $\gcd(a,b)=1.$ By the Euclidean Algorithm, we have \[\gcd(a,b)=\gcd(a+b,b)=\gcd(90,b)=1,\] so $90$ and $b$ are relatively prime.
The least such prime number $b$ is $7,$ from which $a=90-b=83$ is also a prime number. Therefore, the answer is $\boxed{7}.$ | D | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.