Found problems: 649
2017 AMC 10, 19
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of $5$ chairs under these conditions?
$\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$
2023 AMC 12/AHSME, 14
For how many ordered pairs $(a,b)$ of integers does the polynomial $x^3+ax^2+bx+6$ have $3$ distinct integer roots?
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 4$
2022 AMC 10, 21
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 the squares of the coefficients of that polynomial?
$\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23$
2018 AMC 12/AHSME, 22
Consider polynomials $P(x)$ of degree at most $3$, each of whose coefficients is an element of $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$. How many such polynomials satisfy $P(-1) = -9$?
$\textbf{(A) } 110 \qquad \textbf{(B) } 143 \qquad \textbf{(C) } 165 \qquad \textbf{(D) } 220 \qquad \textbf{(E) } 286 $
2017 AMC 12/AHSME, 13
Driving at a constant speed, Sharon usually takes $180$ minutes to drive from her house to her mother's house. One day Sharon begins the drive at her usual speed, but after driving $\frac{1}{3}$ of the way, she hits a bad snowstorm and reduces her speed by $20$ miles per hour. This time the trip takes her a total of $276$ minutes. How many miles is it from Sharon's house to her mother's house?
$\textbf{(A)}\ 132\qquad\textbf{(B)}\ 135\qquad\textbf{(C)}\ 138\qquad\textbf{(D)}\ 141\qquad\textbf{(E)}\ 144$
2024 AMC 12/AHSME, 16
A set of $12$ tokens ---- $3$ red, $2$ white, $1$ blue, and $6$ black ---- is to be distributed at random to $3$ game players, $4$ tokens per player. The probability that some player gets all the red tokens, another gets all the white tokens, and the remaining player gets the blue token can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?
$
\textbf{(A) }387 \qquad
\textbf{(B) }388 \qquad
\textbf{(C) }389 \qquad
\textbf{(D) }390 \qquad
\textbf{(E) }391 \qquad
$
2018 AMC 10, 14
A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$
2023 AMC 12/AHSME, 13
In a table tennis tournament every participant played every other participant exactly once. Although there were twice as many right-handed players as left-handed players, the number of games won by left-handed players was $40\%$ more than the number of games won by right-handed players. (There were no ties and no ambidextrous players.) What is the total number of games played?
$\textbf{(A) }15\qquad\textbf{(B) }36\qquad\textbf{(C) }45\qquad\textbf{(D) }48\qquad\textbf{(E) }66$
2021 AMC 10 Fall, 18
Three identical square sheets of paper each with side length $6{ }$ are stacked on top of each other. The middle sheet is rotated clockwise $30^\circ$ about its center and the top sheet is rotated clockwise $60^\circ$ about its center, resulting in the $24$-sided polygon shown in the figure below. The area of this polygon can be expressed in the form $a-b\sqrt{c}$, where $a$, $b$, and $c$ are positive integers, and $c$ is not divisible by the square of any prime. What is $a+b+c?$
[asy]
size(160);
defaultpen(linewidth(1.1));
path square = (1,1)--(1,-1)--(-1,-1)--(-1,1)--cycle;
filldraw(square,white);
filldraw(rotate(30)*square,white);
filldraw(rotate(60)*square,white);
dot((0,0),linewidth(7));
[/asy]
$\textbf{(A)}\: 75\qquad\textbf{(B)} \: 93\qquad\textbf{(C)} \: 96\qquad\textbf{(D)} \: 129\qquad\textbf{(E)} \: 147$
2020 AMC 12/AHSME, 14
Regular octagon $ABCDEFGH$ has area $n$. Let $m$ be the area of quadrilateral $ACEG$. What is $\tfrac{m}{n}?$
$\textbf{(A) } \frac{\sqrt{2}}{4} \qquad \textbf{(B) } \frac{\sqrt{2}}{2} \qquad \textbf{(C) } \frac{3}{4} \qquad \textbf{(D) } \frac{3\sqrt{2}}{5} \qquad \textbf{(E) } \frac{2\sqrt{2}}{3}$
2022 AMC 10, 8
Consider the following $100$ sets of $10$ elements each:
\begin{align*}
&\{1,2,3,\cdots,10\}, \\
&\{11,12,13,\cdots,20\},\\
&\{21,22,23,\cdots,30\},\\
&\vdots\\
&\{991,992,993,\cdots,1000\}.
\end{align*}
How many of these sets contain exactly two multiples of $7$?
$\textbf{(A)} 40\qquad\textbf{(B)} 42\qquad\textbf{(C)} 43\qquad\textbf{(D)} 49\qquad\textbf{(E)} 50$
2023 AMC 12/AHSME, 12
What is the value of
\[ 2^3 - 1^2 + 4^3 - 3^3 + 6^3 - 5^3 + \dots + 18^3 - 17^3?\]
$\textbf{(A) } 2023 \qquad\textbf{(B) } 2679 \qquad\textbf{(C) } 2941 \qquad\textbf{(D) } 3159 \qquad\textbf{(E) } 3235$
2021 AMC 12/AHSME Fall, 8
Let $M$ be the least common multiple of all the integers $10$ through $30,$ inclusive. Let $N$ be the least common multiple of $M,$ $32,$ $33,$ $34,$ $35,$ $36,$ $37,$ $38,$ $39,$ and $40.$ What is the value of $\frac{N}{M}?$
$(\textbf{A})\: 1\qquad(\textbf{B}) \: 2\qquad(\textbf{C}) \: 37\qquad(\textbf{D}) \: 74\qquad(\textbf{E}) \: 2886$
2015 AMC 10, 22
Eight people are sitting around a circular table, each holding a fair coin. All eight people flip their coins and those who flip heads stand while those who flip tails remain seated. What is the probability that no two adjacent people will stand?
$\textbf{(A) }\dfrac{47}{256}\qquad\textbf{(B) }\dfrac{3}{16}\qquad\textbf{(C) }\dfrac{49}{256}\qquad\textbf{(D) }\dfrac{25}{128}\qquad\textbf{(E) }\dfrac{51}{256}$
2021 AMC 12/AHSME Fall, 13
The angle bisector of the acute angle formed at the origin by the graphs of the lines $y=x$ and $y=3x$ has equation $y=kx$. What is $k$?
$\textbf{(A)} \: \frac{1+\sqrt{5}}{2} \qquad \textbf{(B)} \: \frac{1+\sqrt{7}}{2} \qquad \textbf{(C)} \: \frac{2+\sqrt{3}}{2} \qquad \textbf{(D)} \: 2\qquad \textbf{(E)} \: \frac{2+\sqrt{5}}{2}$
2017 AMC 12/AHSME, 16
The number $21!=51,090,942,171,709,440,000$ has over $60,000$ positive integer divisors. One of them is chosen at random. What is the probability that it is odd?
$\textbf{(A)} \frac{1}{21} \qquad \textbf{(B)} \frac{1}{19} \qquad \textbf{(C)} \frac{1}{18} \qquad \textbf{(D)} \frac{1}{2} \qquad \textbf{(E)} \frac{11}{21}$
2021 AMC 10 Fall, 5
Let $n = 8^{2022}$. Which of the following is equal to $\frac{n}{4}$?
$\textbf{(A) }4^{1010}\qquad\textbf{(B) }2^{2022}\qquad\textbf{(C) }8^{2018}\qquad\textbf{(D) }4^{3031}\qquad\textbf{(E) }4^{3032}$
2018 AMC 12/AHSME, 10
A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$
2019 AMC 10, 25
For how many integers $n$ between $1$ and $50$, inclusive, is
\[
\frac{(n^2-1)!}{(n!)^n}
\]an integer? (Recall that $0! = 1$.)
$\textbf{(A) } 31 \qquad \textbf{(B) } 32 \qquad \textbf{(C) } 33 \qquad \textbf{(D) } 34 \qquad \textbf{(E) } 35$
2022 AMC 12/AHSME, 10
Regular hexagon $ABCDEF$ has side length $2$. Let $G$ be the midpoint of $\overline{AB}$, and let $H$ be the midpoint of $\overline{DE}$. What is the perimeter of $GCHF$?
$ \textbf{(A)}\ 4\sqrt3 \qquad
\textbf{(B)}\ 8 \qquad
\textbf{(C)}\ 4\sqrt5 \qquad
\textbf{(D)}\ 4\sqrt7 \qquad
\textbf{(E)}\ 12$
2021 AMC 12/AHSME Fall, 2
What is the area of the shaded figure shown below?
[asy]
size(200);
defaultpen(linewidth(0.4)+fontsize(12));
pen s = linewidth(0.8)+fontsize(8);
pair O,X,Y;
O = origin;
X = (6,0);
Y = (0,5);
fill((1,0)--(3,5)--(5,0)--(3,2)--cycle, palegray+opacity(0.2));
for (int i=1; i<7; ++i)
{
draw((i,0)--(i,5), gray+dashed);
label("${"+string(i)+"}$", (i,0), 2*S);
if (i<6)
{
draw((0,i)--(6,i), gray+dashed);
label("${"+string(i)+"}$", (0,i), 2*W);
}
}
label("$0$", O, 2*SW);
draw(O--X+(0.15,0), EndArrow);
draw(O--Y+(0,0.15), EndArrow);
draw((1,0)--(3,5)--(5,0)--(3,2)--(1,0), black+1.5);
[/asy]
2020 AMC 12/AHSME, 12
Let $\overline{AB}$ be a diameter in a circle of radius $5\sqrt2.$ Let $\overline{CD}$ be a chord in the circle that intersects $\overline{AB}$ at a point $E$ such that $BE=2\sqrt5$ and $\angle AEC = 45^{\circ}.$ What is $CE^2+DE^2?$
$\textbf{(A)}\ 96 \qquad\textbf{(B)}\ 98 \qquad\textbf{(C)}\ 44\sqrt5 \qquad\textbf{(D)}\ 70\sqrt2 \qquad\textbf{(E)}\ 100$
2017 AMC 12/AHSME, 12
What is the sum of the roots of $z^{12} = 64$ that have a positive real part?
$\textbf{(A) }2 \qquad\textbf{(B) }4 \qquad\textbf{(C) }\sqrt{2} +2\sqrt{3}\qquad\textbf{(D) }2\sqrt{2}+ \sqrt{6} \qquad\textbf{(E) }(1 + \sqrt{3}) + (1+\sqrt{3})i$
2017 AMC 12/AHSME, 4
Jerry and Silvia wanted to go from the southwest corner of a square field to the northeast corner. Jerry walked due east and then due north to reach the goal, but Silvia headed northeast and reached the goal walking in a straight line. Which of the following is closest to how much shorter Silvia's trip was, compared to Jerry's trip?
$\textbf{(A)}\ 30 \%\qquad\textbf{(B)}\ 40 \%\qquad\textbf{(C)}\ 50 \%\qquad\textbf{(D)}\ 60 \%\qquad\textbf{(E)}\ 70 \%$
2022 AMC 12/AHSME, 18
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:
[list]
[*] Any filled square with two or three filled neighbors remains filled.
[*] Any empty square with exactly three filled neighbors becomes a filled square.
[*] All other squares remain empty or become empty.
[/list]
A sample transformation is shown in the figure below.
[asy]
import geometry;
unitsize(0.6cm);
void ds(pair x) {
filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible);
}
ds((1,1));
ds((2,1));
ds((3,1));
ds((1,3));
for (int i = 0; i <= 5; ++i) {
draw((0,i)--(5,i));
draw((i,0)--(i,5));
}
label("Initial", (2.5,-1));
draw((6,2.5)--(8,2.5),Arrow);
ds((10,2));
ds((11,1));
ds((11,0));
for (int i = 0; i <= 5; ++i) {
draw((9,i)--(14,i));
draw((i+9,0)--(i+9,5));
}
label("Transformed", (11.5,-1));
[/asy]
Suppose the $5 \times 5$ grid has a border of empty squares surrounding a $3 \times 3$ subgrid. How many initial configurations will lead to a transformed grid consisting of a single filled square in the center after a single transformation? (Rotations and reflections of the same configuration are considered different.)
[asy]
import geometry;
unitsize(0.6cm);
void ds(pair x) {
filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible);
}
for (int i = 1; i < 4; ++ i) {
for (int j = 1; j < 4; ++j) {
label("?",(i + 0.5, j + 0.5));
}
}
for (int i = 0; i <= 5; ++i) {
draw((0,i)--(5,i));
draw((i,0)--(i,5));
}
label("Initial", (2.5,-1));
draw((6,2.5)--(8,2.5),Arrow);
ds((11,2));
for (int i = 0; i <= 5; ++i) {
draw((9,i)--(14,i));
draw((i+9,0)--(i+9,5));
}
label("Transformed", (11.5,-1));
[/asy]
$$\textbf{(A) 14}~\textbf{(B) 18}~\textbf{(C) 22}~\textbf{(D) 26}~\textbf{(E) 30}$$