id int64 1 7.14k | link stringlengths 75 84 | no int64 1 14 | problem stringlengths 14 5.33k | solution stringlengths 21 6.43k | answer int64 0 999 |
|---|---|---|---|---|---|
1,801 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_21 | 5 | A bowl is formed by attaching four regular hexagons of side $1$ to a square of side $1$ . The edges of the adjacent hexagons coincide, as shown in the figure. What is the area of the octagon obtained by joining the top eight vertices of the four hexagons, situated on the rim of the bowl? [asy] import three; size(225); ... | Through observation, we can reasonably assume that each of the triangles on this shape is a right triangle. Since each side length of the hexagons is $1$ , the hypotenuse of the triangles would be $\sqrt2$ . Now we know the side lengths of the octagon whose area we are solving for. The octagon can be broken into nine p... | 7 |
1,802 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_22 | 1 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on... | For $1\leq k\leq 12,$ suppose that cards $1, 2, \ldots, k$ are picked up on the first pass. It follows that cards $k+1,k+2,\ldots,13$ are picked up on the second pass.
Once we pick the spots for the cards on the first pass, there is only one way to arrange all $\boldsymbol{13}$ cards.
For each value of $k,$ there are $... | 178 |
1,803 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_22 | 2 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on... | Since the $13$ cards are picked up in two passes, the first pass must pick up the first $n$ cards and the second pass must pick up the remaining cards $m$ through $13$ .
Also note that if $m$ , which is the card that is numbered one more than $n$ , is placed before $n$ , then $m$ will not be picked up on the first pas... | 178 |
1,804 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_22 | 3 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on... | To solve this problem, we can use recursion on $n$ . Let $A_n$ be the number of arrangements for $n$ numbers. Now, let's look at how these arrangements are formed by case work on the first number $a_1$
If $a_1 = 1$ , the remaining $n-1$ numbers from $2$ to $n$ are arranged in the same way just like number 1 to $n-1$ in... | 178 |
1,805 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_22 | 4 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on... | When we have $3$ cards arranged in a row, after listing out all possible arrangements, we see that we have $4$ ones: $(1, 3, 2), (2, 1, 3), (2, 3, 1),$ and $(3, 1, 2)$ . When we have $4$ cards, we find $11$ possible arrangements: $(1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (2, 1, 3, 4), (2, 3, 1, 4), (2, 3... | 178 |
1,806 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_22 | 5 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on... | Notice that for each card "position", we can choose for it to be picked up on the first or second pass, for a total of $2^{13}$ options. However, if all of the cards selected to be picked up first are before all of the cards to be picked up second, then this means that the list is in consecutive ascending order (and th... | 178 |
1,807 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_24 | 1 | How many strings of length $5$ formed from the digits $0$ $1$ $2$ $3$ $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition
because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at least $... | For some $n$ , let there be $n+1$ parking spaces counterclockwise in a circle. Consider a string of $n$ integers $c_1c_2 \ldots c_n$ each between $0$ and $n$ , and let $n$ cars come into this circle so that the $i$ th car tries to park at spot $c_i$ , but if it is already taken then it instead keeps going counterclockw... | 296 |
1,808 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_24 | 2 | How many strings of length $5$ formed from the digits $0$ $1$ $2$ $3$ $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition
because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at least $... | Note that a valid string must have at least one $0.$
We perform casework on the number of different digits such strings can have. For each string, we list the digits in ascending order, then consider permutations:
Together, the answer is $1+75+500+600+120=\boxed{1296}.$ | 296 |
1,809 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_24 | 3 | How many strings of length $5$ formed from the digits $0$ $1$ $2$ $3$ $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition
because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at least $... | Denote by $N \left( p, q \right)$ the number of $p$ -digit strings formed by using numbers $0, 1, \cdots, q$ , where for each $j \in \{1,2, \cdots , q\}$ , at least $j$ of the digits are less than $j$
We have the following recursive equation: \[N \left( p, q \right) = \sum_{i = 0}^{p - q} \binom{p}{i} N \left( p - i, q... | 296 |
1,810 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_24 | 4 | How many strings of length $5$ formed from the digits $0$ $1$ $2$ $3$ $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition
because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at least $... | The number of strings is $(n+1)^{(n-1)}$ as shown by Solution 1 (Parking Function), which is always equivalent to 1 (mod n). Thus you can choose $\boxed{1296}$ | 296 |
1,811 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_24 | 5 | How many strings of length $5$ formed from the digits $0$ $1$ $2$ $3$ $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition
because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at least $... | Solution 4 tried to observe the answer modulo $5$ to easily solve the problem, but apparently had faulty logic. This solution is still completely viable though:
Notice that for any valid set $\{a_1, a_2, a_3, a_4, a_5\}$ , if there is at least one element in the set that is unique (i.e. there is at least one digit in t... | 296 |
1,812 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_25 | 1 | Let $R$ $S$ , and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the $x$ -axis. The left edge of $R$ and the right edge of $S$ are on the $y$ -axis, and $R$ contains $\fra... | Let $r$ be the number of lattice points on the side length of square $R$ $s$ be the number of lattice points on the side length of square $S$ , and $t$ be the number of lattice points on the side length of square $T$ . Note that the actual lengths of the side lengths are the number of lattice points minus $1$ , so we c... | 337 |
1,813 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_25 | 2 | Let $R$ $S$ , and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the $x$ -axis. The left edge of $R$ and the right edge of $S$ are on the $y$ -axis, and $R$ contains $\fra... | Notice that each answer choice has a different residue mod $13$ . Therefore, we can just find the residue of $r+s+t-3$ mod $13$ and find the unique answer choice that fits, without actually finding $r, s, t$
From Solution 1, we have $16t^2 = s(13s-4)$ from the second condition. From the third condition, $t\equiv -1 \pm... | 337 |
1,814 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_25 | 3 | Let $R$ $S$ , and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the $x$ -axis. The left edge of $R$ and the right edge of $S$ are on the $y$ -axis, and $R$ contains $\fra... | Solution: Let $r$ $s$ $t$ be the edge length of square $R$ $S$ , and $T$ respectively. Then we have \[(r+1)^2=\dfrac{9}{4}(s+1)^2\ \ \ \ \ (t+1)^2=\dfrac{1}{4}((s+1)^2+(r+1)^2-(s+1))\] Therefore \[r=\dfrac{3s+1}{2}\ \ \ \ \ t=\dfrac{1}{4}\sqrt{(s+1)(13s+9)}-1\] Therefore \[r+s+t=\dfrac{3s+1}{2}+s+\dfrac{1}{4}\sqrt{(s+1... | 337 |
1,815 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_1 | 1 | Define $x\diamond y$ to be $|x-y|$ for all real numbers $x$ and $y.$ What is the value of \[(1\diamond(2\diamond3))-((1\diamond2)\diamond3)?\]
$\textbf{(A)}\ {-}2 \qquad \textbf{(B)}\ {-}1 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$ | We have \begin{align*} (1\diamond(2\diamond3))-((1\diamond2)\diamond3) &= |1-|2-3|| - ||1-2|-3| \\ &= |1-1| - |1-3| \\ &= 0-2 \\ &= \boxed{2} ~MRENTHUSIASM | 2 |
1,816 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_1 | 2 | Define $x\diamond y$ to be $|x-y|$ for all real numbers $x$ and $y.$ What is the value of \[(1\diamond(2\diamond3))-((1\diamond2)\diamond3)?\]
$\textbf{(A)}\ {-}2 \qquad \textbf{(B)}\ {-}1 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$ | Observe that the $\diamond$ function is simply the positive difference between two numbers. Thus, we evaluate: the difference between $2$ and $3$ is $1;$ the difference between $1$ and $1$ is $0;$ the difference between $1$ and $2$ is $1;$ the difference between $1$ and $3$ is $2;$ and finally, $0-2=\boxed{2}.$ | 2 |
1,817 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_2 | 1 | In rhombus $ABCD$ , point $P$ lies on segment $\overline{AD}$ so that $\overline{BP}$ $\perp$ $\overline{AD}$ $AP = 3$ , and $PD = 2$ . What is the area of $ABCD$ ? (Note: The figure is not drawn to scale.)
[asy] import olympiad; size(180); real r = 3, s = 5, t = sqrt(r*r+s*s); defaultpen(linewidth(0.6) + fontsize(10))... | [asy] pair A = (0,0); label("$A$", A, SW); pair B = (2.25,3); label("$B$", B, NW); pair C = (6,3); label("$C$", C, NE); pair D = (3.75,0); label("$D$", D, SE); pair P = (2.25,0); label("$P$", P, S); draw(A--B--C--D--cycle); draw(P--B); draw(rightanglemark(B,P,D)); [/asy]
\[\textbf{Figure redrawn to scale.}\]
$AD = AP +... | 20 |
1,818 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_2 | 2 | In rhombus $ABCD$ , point $P$ lies on segment $\overline{AD}$ so that $\overline{BP}$ $\perp$ $\overline{AD}$ $AP = 3$ , and $PD = 2$ . What is the area of $ABCD$ ? (Note: The figure is not drawn to scale.)
[asy] import olympiad; size(180); real r = 3, s = 5, t = sqrt(r*r+s*s); defaultpen(linewidth(0.6) + fontsize(10))... | [asy] pair A = (0,0); label("$A$", A, SW); pair B = (2.25,3); label("$B$", B, NW); pair C = (6,3); label("$C$", C, NE); pair D = (3.75,0); label("$D$", D, SE); pair P = (2.25,0); label("$P$", P, S); draw(A--B--C--D--cycle); draw(D--B); draw(B--P); draw(rightanglemark(B,P,D)); [/asy]
The diagram is from as Solution 1, ... | 20 |
1,819 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_3 | 1 | How many three-digit positive integers have an odd number of even digits?
$\textbf{(A) }150\qquad\textbf{(B) }250\qquad\textbf{(C) }350\qquad\textbf{(D) }450\qquad\textbf{(E) }550$ | We use simple case work to solve this problem.
Case 1: even, even, even = $4 \cdot 5 \cdot 5 = 100$
Case 2: even, odd, odd = $4 \cdot 5 \cdot 5 = 100$
Case 3: odd, even, odd = $5 \cdot 5 \cdot 5 = 125$
Case 4: odd, odd, even = $5 \cdot 5 \cdot 5 = 125$
Simply sum up the cases to get your answer. $100 + 100 + 125 + 125 ... | 450 |
1,820 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_3 | 2 | How many three-digit positive integers have an odd number of even digits?
$\textbf{(A) }150\qquad\textbf{(B) }250\qquad\textbf{(C) }350\qquad\textbf{(D) }450\qquad\textbf{(E) }550$ | We will show that the answer is $450$ by proving a bijection between the three digit integers that have an even number of even digits and the three digit integers that have an odd number of even digits. For every even number with an odd number of even digits, we increment the number's last digit by $1$ , unless the las... | 450 |
1,821 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_5 | 1 | What is the value of \[\frac{\left(1+\frac13\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}?\] $\textbf{(A)}\ \sqrt3 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ \sqrt{15} \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \sqrt{105}$ | We apply the difference of squares to the denominator, and then regroup factors: \begin{align*} \frac{\left(1+\frac13\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}} &= \frac{\left(1+\frac13\right)\left(1+\frac15\right)\lef... | 2 |
1,822 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_5 | 2 | What is the value of \[\frac{\left(1+\frac13\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}?\] $\textbf{(A)}\ \sqrt3 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ \sqrt{15} \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \sqrt{105}$ | Since these numbers are fairly small, we can use brute force as follows: \[\frac{(1+\frac{1}{3})(1+\frac{1}{5})(1+\frac{1}{7})}{\sqrt{(1-\frac{1}{3^2})(1-\frac{1}{5^2})(1-\frac{1}{7^2})}} =\frac{\frac{4}{3}\cdot\frac{6}{5}\cdot\frac{8}{7}}{\sqrt{\frac{8}{9}\cdot\frac{24}{25}\cdot\frac{48}{49}}} =\frac{\frac{4\cdot6\cdo... | 2 |
1,823 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_5 | 3 | What is the value of \[\frac{\left(1+\frac13\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}?\] $\textbf{(A)}\ \sqrt3 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ \sqrt{15} \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \sqrt{105}$ | This solution starts precisely like the one above. We simplify to get the following:
\[\frac{(1+\frac{1}{3})(1+\frac{1}{5})(1+\frac{1}{7})}{\sqrt{(1-\frac{1}{3^2})(1-\frac{1}{5^2})(1-\frac{1}{7^2})}} = \frac{\frac{4\cdot6\cdot8}{3\cdot5\cdot7}}{\sqrt{\frac{(2^3)(2^3\cdot3^1)(2^4\cdot3^1)}{(3^2)(5^2)(7^2)}}}\]
But now, ... | 2 |
1,824 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_6 | 1 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | The $n$ th term of this sequence is \[\sum_{k=n}^{2n}10^k + \sum_{k=0}^{n}10^k = 10^n\sum_{k=0}^{n}10^k + \sum_{k=0}^{n}10^k = \left(10^n+1\right)\sum_{k=0}^{n}10^k.\] It follows that the terms are \begin{align*} 121 &= 11\cdot11, \\ 11211 &= 101\cdot111, \\ 1112111 &= 1001\cdot1111, \\ & \ \vdots \end{align*} Therefor... | 0 |
1,825 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_6 | 2 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Denote this sequence as $a_{n}$ , then we can find that \begin{align*} a_{1} &= 121 = 10^2 + 2\cdot10 + 1 = (10^2 + 10) + (10 + 1), \\ a_{2} &= 11211 = (10^4 + 10^3 + 10^2) + (10^2 + 10 + 1), \\ a_{3} &= 1112111 = (10^6 + 10^5 + 10^4 + 10^3) + (10^3 + 10^2 + 10 + 1), \\ & \ \vdots \end{align*} So, we can induct that th... | 0 |
1,826 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_6 | 3 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Observe how \begin{align*} 121 &= 110 + 11, \\ 11211 &= 11100 + 111, \\ 1112111 &= 1111000 + 1111, \\ & \ \vdots \end{align*} all take the form of \[\underbrace{111\ldots}_{n+1}\underbrace{00\ldots}_{n} + \underbrace{111\ldots}_{n+1} = \underbrace{111\ldots}_{n+1}(10^{n} + 1).\] Factoring each of the sums, we have \[11... | 0 |
1,827 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_6 | 4 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Note that $121$ is divisible by $11$ and $11211$ is divisible by $3$ . Because this is Problem 6 of the AMC 10, we assume we do not need to check two-digit prime divisibility or use obscure theorems. Therefore, the answer is $\boxed{0}.$ | 0 |
1,828 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_7 | 2 | For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$ have two distinct integer roots?
$\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 16$ | Note that $k$ must be an integer. Using the quadratic formula $x=\frac{-k \pm \sqrt{k^2-144}}{2}.$ Since $4$ divides $144$ evenly, $k$ and $k^2-144$ have the same parity, so $x$ is an integer if and only if $k^2-144$ is a perfect square.
Let $k^2-144=n^2.$ Then, $(k+n)(k-n)=144.$ Since $k$ is an integer and $144$ is ev... | 8 |
1,829 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_7 | 3 | For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$ have two distinct integer roots?
$\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 16$ | Proceed similar to Solution 2 and deduce that the discriminant of $x^{2}+kx+36$ must be a perfect square greater than $0$ to satisfy all given conditions. Seeing something like $k^2-144$ might remind us of a right triangle, where $k$ is the hypotenuse, and $12$ is a leg. There are four ways we could have this: a $9$ $1... | 8 |
1,830 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_7 | 4 | For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$ have two distinct integer roots?
$\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 16$ | Since $36 = 2^2\cdot3^2$ , that means there are $(2+1)(2+1) = 9$ possible factors of $36$ . Since $6 \cdot 6$ violates the distinct root condition, subtract $1$ from $9$ to get $8$ . Each sum is counted twice, and we count of those twice for negatives. This cancels out, so we get $\boxed{8}$ | 8 |
1,831 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_8 | 1 | Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)... | We apply casework to this problem. The only sets that contain two multiples of seven are those for which:
Each case has $\left\lfloor\frac{100}{7}\right\rfloor=14$ sets. Therefore, the answer is $14\cdot3=\boxed{42}.$ | 42 |
1,832 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_8 | 2 | Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)... | We find a pattern. \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} We can figure out that the first set has $1$ multiple of $7$ . The second set also has $1$ multiple of $7$ . The third set has $2$ multiples of $7$ . The ... | 42 |
1,833 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_9 | 1 | The sum \[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\] can be expressed as $a-\frac{1}{b!}$ , where $a$ and $b$ are positive integers. What is $a+b$
$\textbf{(A)}\ 2020 \qquad\textbf{(B)}\ 2021 \qquad\textbf{(C)}\ 2022 \qquad\textbf{(D)}\ 2023 \qquad\textbf{(E)}\ 2024$ | Note that $\frac{n}{(n+1)!} = \frac{1}{n!} - \frac{1}{(n+1)!}$ , and therefore this sum is a telescoping sum, which is equivalent to $1 - \frac{1}{2022!}$ . Our answer is $1 + 2022 = \boxed{2023}$ | 23 |
1,834 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_9 | 2 | The sum \[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\] can be expressed as $a-\frac{1}{b!}$ , where $a$ and $b$ are positive integers. What is $a+b$
$\textbf{(A)}\ 2020 \qquad\textbf{(B)}\ 2021 \qquad\textbf{(C)}\ 2022 \qquad\textbf{(D)}\ 2023 \qquad\textbf{(E)}\ 2024$ | We add $\frac{1}{2022!}$ to the original expression \[\left(\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\right)+\frac{1}{2022!}=\left(\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\dots+\frac{2020}{2021!}\right)+\frac{1}{2021!}.\] This sum clearly telescopes, thus we end up with $\left(\frac{1}{2!}+\frac{2... | 23 |
1,835 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_9 | 4 | The sum \[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\] can be expressed as $a-\frac{1}{b!}$ , where $a$ and $b$ are positive integers. What is $a+b$
$\textbf{(A)}\ 2020 \qquad\textbf{(B)}\ 2021 \qquad\textbf{(C)}\ 2022 \qquad\textbf{(D)}\ 2023 \qquad\textbf{(E)}\ 2024$ | Let $x=\frac{1}{1!}+\frac{1}{2!}+\frac{1}{3!}+\dots+\frac{1}{2022!}.$
Note that \begin{align*} \left(\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\dots+\frac{2021}{2022!}\right)+\left(\frac{1}{1!}+\frac{1}{2!}+\frac{1}{3!}+\dots+\frac{1}{2022!}\right)&=\frac{1}{1!}+\frac{2}{2!}+\frac{3}{3!}+\dots+\frac{2022}{2022!}\\ \left(\... | 23 |
1,836 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_9 | 5 | The sum \[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\] can be expressed as $a-\frac{1}{b!}$ , where $a$ and $b$ are positive integers. What is $a+b$
$\textbf{(A)}\ 2020 \qquad\textbf{(B)}\ 2021 \qquad\textbf{(C)}\ 2022 \qquad\textbf{(D)}\ 2023 \qquad\textbf{(E)}\ 2024$ | Because the fractions get smaller, it is obvious that the answer is less than $1$ , so we can safely assume that $a=1$ (this can also be guessed by intuition using similar math problems). Looking at the answer choices, $2018<b<2024$ . Because the last term consists of $2022!$ (and the year is $2022$ ) we can guess that... | 23 |
1,837 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_9 | 6 | The sum \[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{2021}{2022!}\] can be expressed as $a-\frac{1}{b!}$ , where $a$ and $b$ are positive integers. What is $a+b$
$\textbf{(A)}\ 2020 \qquad\textbf{(B)}\ 2021 \qquad\textbf{(C)}\ 2022 \qquad\textbf{(D)}\ 2023 \qquad\textbf{(E)}\ 2024$ | Knowing that the answer will be in the form $a-\frac{1}{b!}$ , we can guess that the sum telescopes. Using partial fractions, we can hope to rewrite $\frac{n-1}{n!}$ as $\frac{A}{(n-1)!}-\frac{B}{n}$ . Setting these equal and multiplying by $n!$ , we get $n-1=An-B(n-1)!$ . Since $An$ is the only term with $n$ with degr... | 23 |
1,838 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_10 | 1 | Camila writes down five positive integers. The unique mode of these integers is $2$ greater than their median, and the median is $2$ greater than their arithmetic mean. What is the least possible value for the mode?
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ ... | Let $M$ be the median. It follows that the two largest integers are both $M+2.$
Let $a$ and $b$ be the two smallest integers such that $a<b.$ The sorted list is \[a,b,M,M+2,M+2.\] Since the median is $2$ greater than their arithmetic mean, we have $\frac{a+b+M+(M+2)+(M+2)}{5}+2=M,$ or \[a+b+14=2M.\] Note that $a+b$ mus... | 11 |
1,839 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_10 | 2 | Camila writes down five positive integers. The unique mode of these integers is $2$ greater than their median, and the median is $2$ greater than their arithmetic mean. What is the least possible value for the mode?
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ ... | We can also easily test all the answer choices. (This strategy is generally good to use for multiple-choice questions if you don't have a concrete method to proceed with!)
For answer choice $\textbf{(A)},$ the mode is $5,$ the median is $3,$ and the arithmetic mean is $1.$ However, we can quickly see this doesn't work,... | 11 |
1,840 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_12 | 1 | A pair of fair $6$ -sided dice is rolled $n$ times. What is the least value of $n$ such that the probability that the sum of the numbers face up on a roll equals $7$ at least once is greater than $\frac{1}{2}$
$\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 5 \qquad \textbf{(E) } 6$ | Rolling a pair of fair $6$ -sided dice, the probability of getting a sum of $7$ is $\frac16:$ Regardless what the first die shows, the second die has exactly one outcome to make the sum $7.$ We consider the complement: The probability of not getting a sum of $7$ is $1-\frac16=\frac56.$ Rolling the pair of dice $n$ time... | 4 |
1,841 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_12 | 2 | A pair of fair $6$ -sided dice is rolled $n$ times. What is the least value of $n$ such that the probability that the sum of the numbers face up on a roll equals $7$ at least once is greater than $\frac{1}{2}$
$\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 5 \qquad \textbf{(E) } 6$ | Let's try the answer choices. We can quickly find that when we roll $3$ dice, either the first and second sum to $7$ , the first and third sum to $7$ , or the second and third sum to $7$ . There are $6$ ways for the first and second dice to sum to $7$ $6$ ways for the first and third to sum to $7$ , and $6$ ways for th... | 4 |
1,842 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_12 | 3 | A pair of fair $6$ -sided dice is rolled $n$ times. What is the least value of $n$ such that the probability that the sum of the numbers face up on a roll equals $7$ at least once is greater than $\frac{1}{2}$
$\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 5 \qquad \textbf{(E) } 6$ | We can start by figuring out what the probability is for each die to add up to $7$ if there is only $1$ roll. We can quickly see that the probability is $\frac16$ , as there are $6$ ways to make $7$ from $2$ numbers on a die, and there are a total of $36$ ways to add $2$ numbers on a die. And since each time we roll th... | 4 |
1,843 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_13 | 1 | The positive difference between a pair of primes is equal to $2$ , and the positive difference between the cubes of the two primes is $31106$ . What is the sum of the digits of the least prime that is greater than those two primes?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 13 \q... | Let the two primes be $a$ and $b$ . We would have $a-b=2$ and $a^{3}-b^{3}=31106$ . Using difference of cubes, we would have $(a-b)(a^{2}+ab+b^{2})=31106$ . Since we know $a-b$ is equal to $2$ $(a-b)(a^{2}+ab+b^{2})$ would become $2(a^{2}+ab+b^{2})=31106$ . Simplifying more, we would get $a^{2}+ab+b^{2}=15553$
Now let'... | 16 |
1,844 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_13 | 2 | The positive difference between a pair of primes is equal to $2$ , and the positive difference between the cubes of the two primes is $31106$ . What is the sum of the digits of the least prime that is greater than those two primes?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 13 \q... | Let the two primes be $a$ and $b$ , with $a$ being the larger prime. We have $a - b = 2$ , and $a^3 - b^3 = 31106$ . Using difference of cubes, we obtain $a^2 + ab + b^2 = 15553$ . Now, we use the equation $a - b = 2$ to obtain $a^2 - 2ab + b^2 = 4$ . Hence, \[a^2 + ab + b^2 - (a^2 - 2ab + b^2) = 3ab = 15553 - 4 = 1554... | 16 |
1,845 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_13 | 3 | The positive difference between a pair of primes is equal to $2$ , and the positive difference between the cubes of the two primes is $31106$ . What is the sum of the digits of the least prime that is greater than those two primes?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 13 \q... | Let the two primes be $p$ and $q$ such that $p-q=2$ and $p^{3}-q^{3}=31106$
By the difference of cubes formula, $p^{3}-q^{3}=(p-q)(p^{2}+pq+q^{2})$
Plugging in $p-q=2$ and $p^{3}-q^{3}=31106$
$31106=2(p^{2}+pq+q^{2})$
Through the givens, we can see that $p \approx q$
Thus, $31106=2(p^{2}+pq+q^{2})\approx 6p^{2}\\p^2\ap... | 16 |
1,846 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_13 | 4 | The positive difference between a pair of primes is equal to $2$ , and the positive difference between the cubes of the two primes is $31106$ . What is the sum of the digits of the least prime that is greater than those two primes?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 13 \q... | Let the two primes be $x + 1$ and $x - 1$ . Then, plugging it into the second condition, we get $(x + 1)^3 - (x - 1)^3 = 31106.$ Expanding the left side, \[6x^2 + 2 = 31106 \implies x^2 = 5184.\] Taking the square root of both sides, we get that $x = 72$ and the larger prime is $73$ . The smallest prime larger than $73... | 16 |
1,847 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_14 | 1 | Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qqua... | Let $M$ be the largest number in $S$ .
We categorize numbers $\left\{ 1, 2, \ldots , M-1 \right\}$ (except $\frac{M}{2}$ if $M$ is even) into $\left\lfloor \frac{M-1}{2} \right\rfloor$ groups, such that the $i$ th group contains two numbers $i$ and $M-i$
Recall that $M \in S$ and the sum of two numbers in $S$ cannot be... | 13 |
1,848 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_14 | 2 | Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qqua... | We know that two odd numbers sum to an even number, so we can easily say that odd numbers $1-25$ can be included in the list, making for $13$ elements. But, how do we know we can't include even numbers for a higher element value? Well, to get a higher element value than $13$ , odd numbers as well as even numbers would ... | 13 |
1,849 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_14 | 3 | Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qqua... | The smallest sum of a number $a + b$ where $b \geq a$ is $a + a = 2a$ as we are using the smallest value of $b$ . Using this, we can say that if $12$ were an element of $S$ , then one of the sums (the smallest) would be $12 + 12 = 24 < 25$ . Thus $13$ must be the smallest element. So the largest amount of elements that... | 13 |
1,850 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_14 | 4 | Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qqua... | We construct a possible subset $S$ with $13$ elements by including all odd integers from $1$ to $25$ , inclusive. $S=\left\{ 1, 3, 5, \cdots , 25 \right\}$ . The sum of any $2$ elements is even, and thus cannot be an element of $S$
To show that $S$ cannot have more than $13$ elements, assume for sake of contradiction t... | 13 |
1,851 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_14 | 5 | Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qqua... | We can start by building a list of the elements of $S$ ,and see if we can find a pattern. Let's start with $1$ . If we include 1, that means we cannot include $2$ (which is $1$ $1$ ), so we write the next valid number, $3$ . Similarly, we cannot include $4$ or $6$ , so we write $5$ . Proceeding, our list looks like thi... | 13 |
1,852 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_15 | 1 | Let $S_n$ be the sum of the first $n$ terms of an arithmetic sequence that has a common difference of $2$ . The quotient $\frac{S_{3n}}{S_n}$ does not depend on $n$ . What is $S_{20}$
$\textbf{(A) } 340 \qquad \textbf{(B) } 360 \qquad \textbf{(C) } 380 \qquad \textbf{(D) } 400 \qquad \textbf{(E) } 420$ | Suppose that the first number of the arithmetic sequence is $a$ . We will try to compute the value of $S_{n}$ . First, note that the sum of an arithmetic sequence is equal to the number of terms multiplied by the median of the sequence. The median of this sequence is equal to $a + n - 1$ . Thus, the value of $S_{n}$ is... | 400 |
1,853 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_15 | 2 | Let $S_n$ be the sum of the first $n$ terms of an arithmetic sequence that has a common difference of $2$ . The quotient $\frac{S_{3n}}{S_n}$ does not depend on $n$ . What is $S_{20}$
$\textbf{(A) } 340 \qquad \textbf{(B) } 360 \qquad \textbf{(C) } 380 \qquad \textbf{(D) } 400 \qquad \textbf{(E) } 420$ | Recall that the sum of the first $n$ odd numbers is $n^2$
Since $\frac{S_{3n}}{S_{n}} = \frac{9n^2}{n^2} = 9$ , we have $S_n = 20^2 = \boxed{400}$ | 400 |
1,854 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_18 | 1 | Consider systems of three linear equations with unknowns $x$ $y$ , and $z$ \begin{align*} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x=y=z=0$ .
For example, one such ... | Let $M_1=\begin{bmatrix}a_1 & b_1 & c_1\end{bmatrix}, M_2=\begin{bmatrix}a_2 & b_2 & c_2\end{bmatrix},$ and $M_3=\begin{bmatrix}a_3 & b_3 & c_3\end{bmatrix}.$
We wish to count the ordered triples $(M_1,M_2,M_3)$ of row matrices. We perform casework:
There are $9+3=12$ ordered triples $(M_1,M_2,M_3).$
Similarly, for eac... | 338 |
1,855 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_18 | 2 | Consider systems of three linear equations with unknowns $x$ $y$ , and $z$ \begin{align*} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x=y=z=0$ .
For example, one such ... | We will use complementary counting and do casework on the equations.
There are $8$ possible equations:
Equation 1: $0 = 0$
Equation 2: $x = 0$
Equation 3: $y = 0$
Equation 4: $z = 0$
Equation 5: $x + y = 0$
Equation 6: $x + z = 0$
Equation 7: $y + z = 0$
Equation 8: $x + y + z = 0$
We will continue to refer to the equa... | 338 |
1,856 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_18 | 3 | Consider systems of three linear equations with unknowns $x$ $y$ , and $z$ \begin{align*} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x=y=z=0$ .
For example, one such ... | The total number of possible systems is $2^9 = 512$ , with $8$ possible sets of coefficients per equation. We will use complementary counting to find the number of systems which only have the solution $(0, 0, 0)$ and subtract that from the total. Similar to what is observed in Solution 2, if any equation is repeated or... | 338 |
1,857 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_18 | 4 | Consider systems of three linear equations with unknowns $x$ $y$ , and $z$ \begin{align*} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x=y=z=0$ .
For example, one such ... | Denote vector $\overrightarrow{i} = \left( i_1, i_2, i_3 \right)^T$ for $i \in \left\{ a, b, c \right\}$ .
Thus, we need to count how many vector tuples $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ are linearly dependent.
We do complementary counting.
First, the total number of vector t... | 338 |
1,858 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_19 | 1 | Each square in a $5 \times 5$ grid is either filled or empty, and has up to eight adjacent neighboring squares, where neighboring squares share either a side or a corner. The grid is transformed by the following rules:
A sample transformation is shown in the figure below. [asy] import geometry; unitsize... | There are two cases for the initial configuration:
Together, the answer is $2+20=\boxed{22}.$ | 22 |
1,859 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 1 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | Without loss of generality, we assume the length of each side of $ABCD$ is $2$ .
Because $E$ is the midpoint of $CD$ $CE = 1$
Because $ABCD$ is a rhombus, $\angle BCE = 180^\circ - \angle D$
In $\triangle BCE$ , following from the law of sines, \[ \frac{CE}{\sin \angle FBC} = \frac{BC}{\sin \angle BEC} . \]
We have $\a... | 113 |
1,860 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 2 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | Extend segments $\overline{AD}$ and $\overline{BE}$ until they meet at point $G$
Because $\overline{AB} \parallel \overline{ED}$ , we have $\angle ABG = \angle DEG$ and $\angle GDE = \angle GAB$ , so $\triangle ABG \sim \triangle DEG$ by AA.
Because $ABCD$ is a rhombus, $AB = CD = 2DE$ , so $AG = 2GD$ , meaning that $D... | 113 |
1,861 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 3 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | Let $\overline{AC}$ meet $\overline{BD}$ at $O$ , then $AOFB$ is cyclic and $\angle FBO = \angle FAO$ . Also, $AC \cdot BO = [ABCD] = 2 \cdot [ABE] = AF \cdot BE$ , so $\frac{AF}{BO} = \frac{AC}{BE}$ , thus $\triangle AFC \sim \triangle BOE$ by SAS, and $\angle OEB = \angle ACF$ , then $\angle CFE = \angle EOC = \angle... | 113 |
1,862 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 4 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | Observe that all answer choices are close to $112.5 = 90+\frac{45}{2}$ . A quick solve shows that having $\angle D = 90^\circ$ yields $\angle BFC = 135^\circ = 90 + \frac{90}{2}$ , meaning that $\angle BFC$ increases with $\angle D$ .
Substituting, $\angle BFC = 90 + \frac{46}{2} = \boxed{113}$ | 113 |
1,863 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 5 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | This solution refers to the Diagram section.
We extend $AD$ and $BE$ to point $G$ , as shown below: [asy] /* Made by ghfhgvghj10 Edited by MRENTHUSIASM */ size(300); pair A, B, C, D, E, F, G; D = origin; A = 6*dir(46); C = (6,0); B = C + (A-D); E = midpoint(C--D); F = foot(A,B,E); G = 6*dir(226); dot("$A$",A,1.5*NW,lin... | 113 |
1,864 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_20 | 6 | Let $ABCD$ be a rhombus with $\angle ADC = 46^\circ$ . Let $E$ be the midpoint of $\overline{CD}$ , and let $F$ be the point
on $\overline{BE}$ such that $\overline{AF}$ is perpendicular to $\overline{BE}$ . What is the degree measure of $\angle BFC$
$\textbf{(A)}\ 110 \qquad\textbf{(B)}\ 111 \qquad\textbf{(C)}\ 112 \q... | If angle $ADC$ was a right angle, it would be much easier. Thus, first pretend that $ADC$ is a right angle. $ABCD$ is now a square. WLOG, let each of the side lengths be 1. We can use the Pythagorean Theorem to find the length of line $AE$ , which is $\sqrt{5}/2$ . We want the measure of angle $BFC$ , so to work closer... | 113 |
1,865 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 1 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | Given that all the answer choices and coefficients are integers, we hope that $P(x)$ has positive integer coefficients.
Throughout this solution, we will express all polynomials in base $x$ . E.g. $x^2 + x + 1 = 111_{x}$
We are given: \[111a + 12 = 101b + 21 = P(x).\] We add $111$ and $101$ to each side and balance res... | 23 |
1,866 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 2 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | Let $P(x) = Q(x)(x^2+x+1) + x + 2$ , then $P(x) = Q(x)(x^2+1) + xQ(x) + x + 2$ , therefore $xQ(x) + x + 2 \equiv 2x + 1 \pmod{x^2+1}$ , or $xQ(x) \equiv x-1 \pmod{x^2+1}$ . Clearly the minimum is when $Q(x) = x+1$ , and expanding gives $P(x) = x^3+2x^2+3x+3$ . Summing the squares of coefficients gives $\boxed{23}$ | 23 |
1,867 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 3 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | Let $P(x) = (x^2+x+1)Q_1(x) + x + 2$ ,
then $P(x) = (x^2+1)Q_1(x) + xQ_1(x) + x + 2$
Also $P(x) = (x^2+1)Q_2(x) + 2x + 1$
We infer that $Q_1(x)$ and $Q_2(x)$ have same degree, we can assume $Q_1(x) = x + a$ , and $Q_2(x) = x + b$ , since $P(x)$ has least degree. If this cannot work, we will try quadratic, etc.
Then we... | 23 |
1,868 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 4 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | Notice that we cannot have the quotients equal to some constants, since the same constant will yield different constant terms for $P(x)$ (which is bad) and different constants will yield different first coefficients (also bad). Thus, we try setting the quotients equal to linear terms (for minimizing degree).
Let $P(x)=... | 23 |
1,869 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 5 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | We construct the following equations in terms of $P(x)$ and the information given by the problem: \[\textbf{(1) } P(x)=(x^2+x+1)\cdot Q(x)+x+2\] \[\textbf{(2) } P(x)=(x^2+1)\cdot R(x)+2x+1\] Upon inspection, $Q(x)$ and $R(x)$ cannot be constant, so the smallest possible degree of $P(x)$ is $3,$ and both $Q(x)$ and $R(x... | 23 |
1,870 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_21 | 6 | Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$ , the remainder is $x+2$ , and when $P(x)$ is divided by the polynomial $x^2+1$ , the remainder
is $2x+1$ . There is a unique polynomial of least degree with these two properties. What is the sum of
th... | By remainder theorem, the polynomial can be written as follows.
\[P(x) = (x^2+x+1)Q_{1}(x)+x+2 = (x^2+1)Q_{2}(x)+2x+1\] This is a timed exam, we can use the information given by answer choices. The answer choices tell us this is the polynomial with integer coefficients, and we need to find the polynomial with the least... | 23 |
1,871 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_22 | 1 | Let $S$ be the set of circles in the coordinate plane that are tangent to each of the three circles with equations $x^{2}+y^{2}=4$ $x^{2}+y^{2}=64$ , and $(x-5)^{2}+y^{2}=3$ . What is the sum of the areas of all circles in $S$
$\textbf{(A)}~48\pi\qquad\textbf{(B)}~68\pi\qquad\textbf{(C)}~96\pi\qquad\textbf{(D)}~102\pi\... | We denote by $C_1$ the circle that has the equation $x^2 + y^2 = 4$ .
We denote by $C_2$ the circle that has the equation $x^2 + y^2 = 64$ .
We denote by $C_3$ the circle that has the equation $(x-5)^2 + y^2 = 3$
We denote by $C_0$ a circle that is tangent to $C_1$ $C_2$ and $C_3$ .
We denote by $\left( u, v \right)$ t... | 136 |
1,872 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_24 | 1 | Consider functions $f$ that satisfy \[|f(x)-f(y)|\leq \frac{1}{2}|x-y|\] for all real numbers $x$ and $y$ . Of all such functions that also satisfy the equation $f(300) = f(900)$ , what is the greatest possible value of \[f(f(800))-f(f(400))?\] $\textbf{(A)}\ 25 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 100 \qquad\tex... | We have \begin{align*} |f(f(800))-f(f(400))| &\leq \frac12|f(800)-f(400)| &&(\bigstar) \\ &\leq \frac12\left|\frac12|800-400|\right| \\ &= 100, \end{align*} from which we eliminate answer choices $\textbf{(D)}$ and $\textbf{(E)}.$
Note that \begin{alignat*}{8} |f(800)-f(300)| &\leq \frac12|800-300| &&= 250, \\ |f(800)-... | 50 |
1,873 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_24 | 2 | Consider functions $f$ that satisfy \[|f(x)-f(y)|\leq \frac{1}{2}|x-y|\] for all real numbers $x$ and $y$ . Of all such functions that also satisfy the equation $f(300) = f(900)$ , what is the greatest possible value of \[f(f(800))-f(f(400))?\] $\textbf{(A)}\ 25 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 100 \qquad\tex... | Denote $f(900)-f(600) = a$ .
Because $f(300) = f(900)$ $f(300) - f(600) = a$
Following from the Lipschitz condition given in this problem, $|a| \leq 150$ and \[ f(800) - f(600) \leq \min \left\{ a + 50 , 100 \right\} \] and \[ f(400) - f(600) \geq \max \left\{ a - 50 , -100 \right\} . \] Thus, \begin{align*} f(800) - f... | 50 |
1,874 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_24 | 3 | Consider functions $f$ that satisfy \[|f(x)-f(y)|\leq \frac{1}{2}|x-y|\] for all real numbers $x$ and $y$ . Of all such functions that also satisfy the equation $f(300) = f(900)$ , what is the greatest possible value of \[f(f(800))-f(f(400))?\] $\textbf{(A)}\ 25 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 100 \qquad\tex... | Divide both sides by $|x - y|$ to get $\frac{|f(x) - f(y)|}{|x - y|} \leq \frac{1}{2}$ . This means that when we take any two points on $f$ , the absolute value of the slope between the two points is at most $\frac{1}{2}$
Let $f(300) = f(900) = c$ , and since we want to find the maximum value of $|f(800) - f(400)|$ , w... | 50 |
1,875 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_24 | 4 | Consider functions $f$ that satisfy \[|f(x)-f(y)|\leq \frac{1}{2}|x-y|\] for all real numbers $x$ and $y$ . Of all such functions that also satisfy the equation $f(300) = f(900)$ , what is the greatest possible value of \[f(f(800))-f(f(400))?\] $\textbf{(A)}\ 25 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 100 \qquad\tex... | Consider $g(x) = f(x)-f(300)$ . Then $g(x)$ satisfies all the conditions and $g(300) = g(900) = 0$ . We would want $g(400)$ and $g(800)$ as distant from each other as possible. So assign $g(400) = -50$ and $g(800) = 50$ , the possible lower and upper bounds respectively. It follows that one can obtain the upper bound f... | 50 |
1,876 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_25 | 1 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qq... | In binary numbers, we have \[S_n = (x_{n-1} x_{n-2} x_{n-3} x_{n-4} \ldots x_{2} x_{1} x_{0})_2.\] It follows that \[8S_n = (x_{n-1} x_{n-2} x_{n-3} x_{n-4} \ldots x_{2} x_{1} x_{0}000)_2.\] We obtain $7S_n$ by subtracting the equations: \[\begin{array}{clccrccccccr} & (x_{n-1} & x_{n-2} & x_{n-3} & x_{n-4} & \ldots ... | 6 |
1,877 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_25 | 2 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qq... | First, notice that \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \frac{S_{2023} - S_{2019}}{2^{2019}}.\] Then since $S_n$ is the modular inverse of $7$ in $\mathbb{Z}_{2^n}$ , we can perform the Euclidean Algorithm to find it for $n = 2019,2023$
Starting with $2019$ \begin{align*} 7S_{2019} &\equiv 1 \pmod{2^{2019}}... | 6 |
1,878 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_10B_Problems/Problem_25 | 4 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qq... | Note that, as in Solution 2, we have \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \frac{S_{2023} - S_{2019}}{2^{2019}}.\] This is because \[S_{2023} = x_{0}2^{0} + x_{1}2^{1} + \cdots + x_{2019}2^{2019} + \cdots + x_{2022}2^{2022}\] and \[S_{2019} = x_{0}2^{0} + x_{1}2^{1} + \cdots + x_{2018}2^{2018}.\] Note that \... | 6 |
1,879 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_1 | 1 | What is the value of $\frac{(2112-2021)^2}{169}$
$\textbf{(A) } 7 \qquad\textbf{(B) } 21 \qquad\textbf{(C) } 49 \qquad\textbf{(D) } 64 \qquad\textbf{(E) } 91$ | We have \[\frac{(2112-2021)^2}{169}=\frac{91^2}{169}=\frac{91^2}{13^2}=\left(\frac{91}{13}\right)^2=7^2=\boxed{49}.\] ~MRENTHUSIASM | 49 |
1,880 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_1 | 2 | What is the value of $\frac{(2112-2021)^2}{169}$
$\textbf{(A) } 7 \qquad\textbf{(B) } 21 \qquad\textbf{(C) } 49 \qquad\textbf{(D) } 64 \qquad\textbf{(E) } 91$ | We have \[\frac{(2112-2021)^2}{169}=\frac{91^2}{169}=\frac{(10^2-3^2)^2}{13^2}=\frac{((10+3)(10-3))^2}{13^2}=\frac{(13\cdot7)^2}{13^2}=\frac{13^2 \cdot 7^2}{13^2}=7^2=\boxed{49}.\] | 49 |
1,881 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_1 | 3 | What is the value of $\frac{(2112-2021)^2}{169}$
$\textbf{(A) } 7 \qquad\textbf{(B) } 21 \qquad\textbf{(C) } 49 \qquad\textbf{(D) } 64 \qquad\textbf{(E) } 91$ | We know that $2112-2021 = 91$ . Approximate this as $100$ as it is pretty close to it. Also, approximate $169$ to $170$ . We then have \[\frac{(2112 - 2021)^2}{169} \approx \frac{100^2}{170} \approx \frac{1000}{17} \approx 58.\] Now check the answer choices. The two closest answers are $49$ and $64$ . As the numerator ... | 49 |
1,882 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_2 | 1 | Menkara has a $4 \times 6$ index card. If she shortens the length of one side of this card by $1$ inch, the card would have area $18$ square inches. What would the area of the card be in square inches if instead she shortens the length of the other side by $1$ inch?
$\textbf{(A) } 16 \qquad\textbf{(B) } 17 \qquad\textb... | We construct the following table: \[\begin{array}{c||c|c||c} & & & \\ [-2.5ex] \textbf{Scenario} & \textbf{Length} & \textbf{Width} & \textbf{Area} \\ [0.5ex] \hline & & & \\ [-2ex] \text{Initial} & 4 & 6 & 24 \\ \text{Menkara shortens one side.} & 3 & 6 & 18 \\ \text{Menkara shortens other side instead.} & 4 & 5 & 20 ... | 20 |
1,883 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_3 | 1 | What is the maximum number of balls of clay of radius $2$ that can completely fit inside a cube of side length $6$ assuming the balls can be reshaped but not compressed before they are packed in the cube?
$\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }7$ | The volume of the cube is $V_{\text{cube}}=6^3=216,$ and the volume of a clay ball is $V_{\text{ball}}=\frac43\cdot\pi\cdot2^3=\frac{32}{3}\pi.$
Since the balls can be reshaped but not compressed, the maximum number of balls that can completely fit inside a cube is \[\left\lfloor\frac{V_{\text{cube}}}{V_{\text{ball}}}\... | 6 |
1,884 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_3 | 2 | What is the maximum number of balls of clay of radius $2$ that can completely fit inside a cube of side length $6$ assuming the balls can be reshaped but not compressed before they are packed in the cube?
$\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }7$ | As shown in Solution 1, we conclude that the maximum number of balls that can completely fit inside a cube is $\left\lfloor\frac{81}{4\pi}\right\rfloor.$
By an underestimation $\pi\approx3,$ we have $4\pi>12,$ or $\frac{81}{4\pi}<6\frac34.$
By an overestimation $\pi\approx\frac{22}{7},$ we have $4\pi<\frac{88}{7},$ or ... | 6 |
1,885 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_3 | 3 | What is the maximum number of balls of clay of radius $2$ that can completely fit inside a cube of side length $6$ assuming the balls can be reshaped but not compressed before they are packed in the cube?
$\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }7$ | As shown in Solution 1, we conclude that the maximum number of balls that can completely fit inside a cube is $\left\lfloor\frac{81}{4\pi}\right\rfloor.$
Approximating with $\pi\approx3,$ we have $\frac{81}{4\pi}\approx6\frac34.$ Since $\pi$ is about $5\%$ greater than $3,$ it is safe to claim that $\left\lfloor\frac{8... | 6 |
1,886 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_5 | 1 | The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9$ | First, modulo $2$ or $5$ $\underline{20210A} \equiv A$ .
Hence, $A \neq 0, 2, 4, 5, 6, 8$
Second modulo $3$ $\underline{20210A} \equiv 2 + 0 + 2 + 1 + 0 + A \equiv 5 + A$ .
Hence, $A \neq 1, 4, 7$
Third, modulo $11$ $\underline{20210A} \equiv A + 1 + 0 - 0 - 2 - 2 \equiv A - 3$ .
Hence, $A \neq 3$
Therefore, the answer... | 9 |
1,887 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_5 | 2 | The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9$ | Any number ending in $5$ is divisible by $5$ . So we can eliminate option $\textbf{(C)}$
If the sum of the digits of a number is divisible by $3$ , the number is divisible by $3$ . The sum of the digits of this number is $2 + 0 + 2 + 1 + 0 + A = 5 + A$ . If $5 + A$ is divisible by $3$ , the number is divisible by $3$ .... | 9 |
1,888 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_5 | 3 | The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9$ | $202100 \implies$ divisible by $2$
$202101 \implies$ divisible by $3$
$202102 \implies$ divisible by $2$
$202103 \implies$ divisible by $11$
$202104 \implies$ divisible by $2$
$202105 \implies$ divisible by $5$
$202106 \implies$ divisible by $2$
$202107 \implies$ divisible by $3$
$202108 \implies$ divisible by $2$
This... | 9 |
1,889 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_6 | 1 | Elmer the emu takes $44$ equal strides to walk between consecutive telephone poles on a rural road. Oscar the ostrich can cover the same distance in $12$ equal leaps. The telephone poles are evenly spaced, and the $41$ st pole along this road is exactly one mile ( $5280$ feet) from the first pole. How much longer, in f... | There are $41-1=40$ gaps between the $41$ telephone poles, so the distance of each gap is $5280\div40=132$ feet.
Each of Oscar's leaps covers $132\div12=11$ feet, and each of Elmer's strides covers $132\div44=3$ feet.
Therefore, Oscar's leap is $11-3=\boxed{8}$ feet longer than Elmer's stride. | 8 |
1,890 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_6 | 2 | Elmer the emu takes $44$ equal strides to walk between consecutive telephone poles on a rural road. Oscar the ostrich can cover the same distance in $12$ equal leaps. The telephone poles are evenly spaced, and the $41$ st pole along this road is exactly one mile ( $5280$ feet) from the first pole. How much longer, in f... | There are $41-1=40$ gaps between the $41$ telephone poles, so Elmer takes $44 \cdot 40 = 1760$ strides in total, and Oscar takes $12 \cdot 40 = 480$ leaps in total. Therefore, the answer is $(5280 \div 480) - (5280 \div 1760) = 11-3=\boxed{8}$ | 8 |
1,891 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_7 | 1 | As shown in the figure below, point $E$ lies on the opposite half-plane determined by line $CD$ from point $A$ so that $\angle CDE = 110^\circ$ . Point $F$ lies on $\overline{AD}$ so that $DE=DF$ , and $ABCD$ is a square. What is the degree measure of $\angle AFE$
[asy] size(6cm); pair A = (0,10); label("$A$", A, N); p... | By angle subtraction, we have $\angle ADE = 360^\circ - \angle ADC - \angle CDE = 160^\circ.$ Note that $\triangle DEF$ is isosceles, so $\angle DFE = \frac{180^\circ - \angle ADE}{2}=10^\circ.$ Finally, we get $\angle AFE = 180^\circ - \angle DFE = \boxed{170}$ degrees. | 170 |
1,892 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_7 | 2 | As shown in the figure below, point $E$ lies on the opposite half-plane determined by line $CD$ from point $A$ so that $\angle CDE = 110^\circ$ . Point $F$ lies on $\overline{AD}$ so that $DE=DF$ , and $ABCD$ is a square. What is the degree measure of $\angle AFE$
[asy] size(6cm); pair A = (0,10); label("$A$", A, N); p... | We can extend $\overline{AD}$ to $G$ , making $\angle CDG$ a right angle. It follows that $\angle GDE$ is $110^\circ - 90^\circ = 20^\circ$ , as shown below. [asy] size(6cm); pair A = (0,10); label("$A$", A, N); pair B = (0,0); label("$B$", B, S); pair C = (10,0); label("$C$", C, S); pair D = (10,10); label("$D$", D, S... | 170 |
1,893 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_11 | 1 | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts $210$ equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts $42$ steps of the same size from the... | Let $x$ be the length of the ship.
Then, in the time that Emily walks $210$ steps, the ship moves $210-x$ steps.
Also, in the time that Emily walks $42$ steps, the ship moves $x-42$ steps.
Since the ship and Emily have the same ratio of absolute speeds in either direction, $\frac{210}{210-x} = \frac{42}{x-42}$ . Dividi... | 70 |
1,894 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_11 | 2 | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts $210$ equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts $42$ steps of the same size from the... | Let the speed at which Emily walks be $42$ steps per hour. Let the speed at which the ship is moving be $s$ . Walking in the direction of the ship, it takes her $210$ steps, or $\frac {210}{42} = 5$ hours, to travel. We can create an equation: \[d = 5(42-s),\] where $d$ is the length of the ship. Walking in the opposit... | 70 |
1,895 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_11 | 3 | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts $210$ equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts $42$ steps of the same size from the... | Suppose that Emily and the ship take steps simultaneously such that Emily's steps cover a greater length than the ship's steps.
Let $L$ be the length of the ship, $E$ be Emily's step length, and $S$ be the ship's step length. We wish to find $\frac LE.$
When Emily walks from the back of the ship to the front, she walks... | 70 |
1,896 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_11 | 4 | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts $210$ equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts $42$ steps of the same size from the... | Every time Emily takes a step, the boat also "takes a step". Call the length of the boats step $s$ . Call the length of the boat $x$
When Emily is walking in the same direction as the boat, every time she takes a step the boat moves an additional distance of $s$ . This means that she travels a total distance of $x + 21... | 70 |
1,897 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_11 | 5 | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts $210$ equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts $42$ steps of the same size from the... | Call the speed of the boat $v_s$ and the speed of Emily $v_e$
Consider the scenario when Emily is walking along with the boat. Relative to an observer on the boat, her speed is $v_e-v_s$
Consider the scenario when Emily is walking in the opposite direction. Relative to an observer on the boat, her speed is $v_e+v_s$
Si... | 70 |
1,898 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_14 | 1 | How many ordered pairs $(x,y)$ of real numbers satisfy the following system of equations? \begin{align*} x^2+3y&=9 \\ (|x|+|y|-4)^2 &= 1 \end{align*} $\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 5 \qquad\textbf{(E) } 7$ | The second equation is $(|x|+|y| - 4)^2 = 1$ . We know that the graph of $|x| + |y|$ is a very simple diamond shape, so let's see if we can reduce this equation to that form: \[(|x|+|y| - 4)^2 = 1 \implies |x|+|y| - 4 = \pm 1 \implies |x|+|y| = \{3,5\}.\] We now have two separate graphs for this equation and one graph ... | 5 |
1,899 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_15 | 1 | Isosceles triangle $ABC$ has $AB = AC = 3\sqrt6$ , and a circle with radius $5\sqrt2$ is tangent to line $AB$ at $B$ and to line $AC$ at $C$ . What is the area of the circle that passes through vertices $A$ $B$ , and $C?$
$\textbf{(A) }24\pi\qquad\textbf{(B) }25\pi\qquad\textbf{(C) }26\pi\qquad\textbf{(D) }27\pi\qquad\... | Let $\odot O_1$ be the circle with radius $5\sqrt2$ that is tangent to $\overleftrightarrow{AB}$ at $B$ and to $\overleftrightarrow{AC}$ at $C.$ Note that $\angle ABO_1 = \angle ACO_1 = 90^\circ.$ Since the opposite angles of quadrilateral $ABO_1C$ are supplementary, quadrilateral $ABO_1C$ is cyclic.
Let $\odot O_2$ be... | 26 |
1,900 | https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10A_Problems/Problem_15 | 2 | Isosceles triangle $ABC$ has $AB = AC = 3\sqrt6$ , and a circle with radius $5\sqrt2$ is tangent to line $AB$ at $B$ and to line $AC$ at $C$ . What is the area of the circle that passes through vertices $A$ $B$ , and $C?$
$\textbf{(A) }24\pi\qquad\textbf{(B) }25\pi\qquad\textbf{(C) }26\pi\qquad\textbf{(D) }27\pi\qquad\... | [asy] import olympiad; unitsize(50); pair A,B,C,D,E,I,F,G,O; A=origin; B=(2,3); C=(-2,3); D=(4.3,6.3); E=(-4.3,6.3); F=(1,1.5); G=(-1,1.5); O=circumcenter(A,B,C); // olympiad - circumcenter I=incenter(A,D,E); draw(A--B--C--cycle); dot(O); dot(I); dot(F); dot(G); draw(circumcircle(A,B,C)); // olympiad - circumcircle dra... | 26 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.