Found problems: 730
2018 AMC 12/AHSME, 11
A paper triangle with sides of lengths 3, 4, and 5 inches, as shown, is folded so that point $A$ falls on point $B$. What is the length in inches of the crease?
[asy]
draw((0,0)--(4,0)--(4,3)--(0,0));
label("$A$", (0,0), SW);
label("$B$", (4,3), NE);
label("$C$", (4,0), SE);
label("$4$", (2,0), S);
label("$3$", (4,1.5), E);
label("$5$", (2,1.5), NW);
fill(origin--(0,0)--(4,3)--(4,0)--cycle, gray(0.9));
[/asy]
$\textbf{(A) } 1+\frac12 \sqrt2 \qquad \textbf{(B) } \sqrt3 \qquad \textbf{(C) } \frac74 \qquad \textbf{(D) } \frac{15}{8} \qquad \textbf{(E) } 2 $
2020 AMC 12/AHSME, 21
How many positive integers $n$ satisfy$$\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor?$$(Recall that $\lfloor x\rfloor$ is the greatest integer not exceeding $x$.)
$\textbf{(A) } 2 \qquad\textbf{(B) } 4 \qquad\textbf{(C) } 6 \qquad\textbf{(D) } 30 \qquad\textbf{(E) } 32$
1972 AMC 12/AHSME, 9
Ann and Sue bought identical boxes of stationery. Ann used hers to write 1-sheet letters and Sue used hers to write 3-sheet letters. Ann used all the envelopes and had 50 sheets of paper left, while Sue used all of the sheets of paper and had 50 envelopes left. The number of sheets of paper in each box was
\[ \begin{array}{rlrlrlrlrlrl} \hbox {(A)}& 150 \qquad & \hbox {(B)}& 125 \qquad & \hbox {(C)}& 120 \qquad & \hbox {(D)}& 100 \qquad & \hbox {(E)}& 80 & \end{array} \]
2009 AMC 12/AHSME, 11
The figures $ F_1$, $ F_2$, $ F_3$, and $ F_4$ shown are the first in a sequence of figures. For $ n\ge3$, $ F_n$ is constructed from $ F_{n \minus{} 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $ F_{n \minus{} 1}$ had on each side of its outside square. For example, figure $ F_3$ has $ 13$ diamonds. How many diamonds are there in figure $ F_{20}$?
[asy]unitsize(3mm);
defaultpen(linewidth(.8pt)+fontsize(10pt));
path d=(1/2,0)--(0,sqrt(3)/2)--(-1/2,0)--(0,-sqrt(3)/2)--cycle;
marker m=marker(scale(5)*d,Fill);
path f1=(0,0);
path f2=(0,0)--(-1,1)--(1,1)--(1,-1)--(-1,-1);
path[] g2=(-1,1)--(-1,-1)--(0,0)^^(1,-1)--(0,0)--(1,1);
path f3=f2--(-2,-2)--(-2,0)--(-2,2)--(0,2)--(2,2)--(2,0)--(2,-2)--(0,-2);
path[] g3=g2^^(-2,-2)--(0,-2)^^(2,-2)--(1,-1)^^(1,1)--(2,2)^^(-1,1)--(-2,2);
path[] f4=f3^^(-3,-3)--(-3,-1)--(-3,1)--(-3,3)--(-1,3)--(1,3)--(3,3)--
(3,1)--(3,-1)--(3,-3)--(1,-3)--(-1,-3);
path[] g4=g3^^(-2,-2)--(-3,-3)--(-1,-3)^^(3,-3)--(2,-2)^^(2,2)--(3,3)^^
(-2,2)--(-3,3);
draw(f1,m);
draw(shift(5,0)*f2,m);
draw(shift(5,0)*g2);
draw(shift(12,0)*f3,m);
draw(shift(12,0)*g3);
draw(shift(21,0)*f4,m);
draw(shift(21,0)*g4);
label("$F_1$",(0,-4));
label("$F_2$",(5,-4));
label("$F_3$",(12,-4));
label("$F_4$",(21,-4));[/asy]$ \textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$
2024 AMC 10, 5
What is the least value of $n$ such that $n!$ is a multiple of $2024$?
$
\textbf{(A) }11 \qquad
\textbf{(B) }21 \qquad
\textbf{(C) }22 \qquad
\textbf{(D) }23 \qquad
\textbf{(E) }253 \qquad
$
2023 AMC 10, 15
An even number of circles are nested, starting with a radius of $1$ and increasing by $1$ each time, all sharing a common point. The region between every other circle is shaded, starting with the region inside the circle of radius $2$ but outside the circle of radius $1.$ An example showing $8$ circles is displayed below. What is the least number of circles needed to make the total shaded area at least $2023\pi$?
2018 AMC 10, 9
The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$. Let $p$ be the probability that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$. What other sum occurs with the same probability as $p$?
$\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$
2017 AMC 10, 1
Mary thought of a positive two-digit number. She multiplied it by $3$ and added $11.$ Then she switched the digits of the result, obtaining a number between $71$ and $75$, inclusive. What was Mary's number?
$\textbf{(A)} \text{ 11} \qquad \textbf{(B)} \text{ 12} \qquad \textbf{(C)} \text{ 13} \qquad \textbf{(D)} \text{ 14} \qquad \textbf{(E)} \text{ 15}$
2022 AMC 12/AHSME, 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$
2019 AMC 10, 4
A box contains $28$ red balls, $20$ green balls, $19$ yellow balls, $13$ blue balls, $11$ white balls, and $9$ black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least $15$ balls of a single color will be drawn$?$
$\textbf{(A) } 75 \qquad\textbf{(B) } 76 \qquad\textbf{(C) } 79 \qquad\textbf{(D) } 84 \qquad\textbf{(E) } 91$
2020 AMC 10, 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$
2016 AMC 10, 16
A triangle with vertices $A(0, 2)$, $B(-3, 2)$, and $C(-3, 0)$ is reflected about the $x$-axis, then the image $\triangle A'B'C'$ is rotated counterclockwise about the origin by $90^{\circ}$ to produce $\triangle A''B''C''$. Which of the following transformations will return $\triangle A''B''C''$ to $\triangle ABC$?
$\textbf{(A)}$ counterclockwise rotation about the origin by $90^{\circ}$.
$\textbf{(B)}$ clockwise rotation about the origin by $90^{\circ}$.
$\textbf{(C)}$ reflection about the $x$-axis
$\textbf{(D)}$ reflection about the line $y = x$
$\textbf{(E)}$ reflection about the $y$-axis.
2022 AMC 10, 10
Daniel finds a rectangular index card and measures its diagonal to be 8 centimeters. Daniel then cuts out equal squares of side 1 cm at two opposite corners of the index card and measures the distance between the two closest vertices of these squares to be $4\sqrt{2}$ centimeters, as shown below. What is the area of the original index card?
[asy]
unitsize(0.6 cm);
pair A, B, C, D, E, F, G, H;
real x, y;
x = 9;
y = 5;
A = (0,y);
B = (x - 1,y);
C = (x - 1,y - 1);
D = (x,y - 1);
E = (x,0);
F = (1,0);
G = (1,1);
H = (0,1);
draw(A--B--C--D--E--F--G--H--cycle);
draw(interp(C,G,0.03)--interp(C,G,0.97), dashed, Arrows(6));
draw(interp(A,E,0.03)--interp(A,E,0.97), dashed, Arrows(6));
label("$1$", (B + C)/2, W);
label("$1$", (C + D)/2, S);
label("$8$", interp(A,E,0.3), NE);
label("$4 \sqrt{2}$", interp(G,C,0.2), SE);
[/asy]
$\textbf{(A) }14\qquad\textbf{(B) }10\sqrt{2}\qquad\textbf{(C) }16\qquad\textbf{(D) }12\sqrt{2}\qquad\textbf{(E) }18$
2019 AMC 12/AHSME, 7
Melanie computes the mean $\mu$, the median $M$, and the modes of the $365$ values that are the dates in the months of $2019$. Thus her data consist of $12$ $1\text{s}$, $12$ $2\text{s}$, . . . , $12$ $28\text{s}$, $11$ $29\text{s}$, $11$ $30\text{s}$, and $7$ $31\text{s}$. Let $d$ be the median of the modes. Which of the following statements is true?
$\textbf{(A) } \mu < d < M \qquad\textbf{(B) } M < d < \mu \qquad\textbf{(C) } d = M =\mu \qquad\textbf{(D) } d < M < \mu \qquad\textbf{(E) } d < \mu < M$
2020 AMC 10, 4
A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $\$0.50$ per mile, and her only expense is gasoline at $\$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense?
$\textbf{(A) }20 \qquad\textbf{(B) }22 \qquad\textbf{(C) }24 \qquad\textbf{(D) } 25\qquad\textbf{(E) } 26$
2008 ITest, 50
As the Kubiks head out of town for vacation, Jerry takes the first driving shift while Hannah and most of the kids settle down to read books they brought along. Tony does not feel like reading, so Alexis gives him one of her math notebooks and Tony gets to work solving some of the problems, and struggling over others. After a while, Tony comes to a problem he likes from an old AMC 10 exam:
\begin{align*}&\text{Four distinct circles are drawn in a plane. What is the maximum}\\&\quad\,\,\text{number of points where at least two of the circles intersect?}\end{align*}
Tony realizes that he can draw the four circles such that each pair of circles intersects in two points. After careful doodling, Tony finds the correct answer, and is proud that he can solve a problem from late on an AMC 10 exam.
"Mom, why didn't we all get Tony's brain?" Wendy inquires before turning he head back into her favorite Harry Potter volume (the fifth year).
Joshua leans over to Tony's seat to see his brother's work. Joshua knows that Tony has not yet discovered all the underlying principles behind the problem, so Joshua challenges, "What if there are a dozen circles?"
Tony gets to work on Joshua's problem of finding the maximum number of points of intersections where at least two of the twelve circles in a plane intersect. What is the answer to this problem?
2024 AMC 10, 3
What is the sum of the digits of the smallest prime that can be written as a sum of $5$ distinct primes?
$\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$
2024 AMC 10, 20
Three different pairs of shoes are placed in a row so that no left shoe is next to a right shoe from a different pair. In how many ways can these six shoes be lined up?
$
\textbf{(A) }60\qquad
\textbf{(B) }72\qquad
\textbf{(C) }90\qquad
\textbf{(D) }108\qquad
\textbf{(E) }120\qquad
$
2013 AMC 10, 4
A softball team played ten games, scoring $1,2,3,4,5,6,7,8,9$, and $10$ runs. They lost by one run in exactly five games. In each of the other games, they scored twice as many runs as their opponent. How many total runs did their opponents score?
$ \textbf {(A) } 35 \qquad \textbf {(B) } 40 \qquad \textbf {(C) } 45 \qquad \textbf {(D) } 50 \qquad \textbf {(E) } 55 $
2022 AMC 10, 18
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 system is $\{1x + 1y + 0z = 0, 0x + 1y + 1z = 0, 0x + 0y + 0z = 0\}$ with a nonzero solution of $\{x, y, z\} = \{1, -1, 1\}.$ How many such systems are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.)
$\textbf{(A) } 302 \qquad \textbf{(B) } 338 \qquad \textbf{(C) } 340 \qquad \textbf{(D) } 343 \qquad \textbf{(E) } 344$
2012 AMC 12/AHSME, 1
A bug crawls along a number line, starting at $-2$. It crawls to $-6$, then turns around and crawls to $5$. How many units does the bug crawl altogether?
$ \textbf{(A)}\ 9
\qquad\textbf{(B)}\ 11
\qquad\textbf{(C)}\ 13
\qquad\textbf{(D)}\ 14
\qquad\textbf{(E)}\ 15
$
2020 AMC 10, 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(4.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$
2024 AMC 10, 7
The product of three integers is $60$. What is the least possible positive sum of the three integers?
$\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 6 \qquad \textbf{(E) } 13$
2014 AMC 10, 18
A list of $11$ positive integers has a mean of $10$, a median of $9$, and a unique mode of $8$. What is the largest possible value of an integer in the list?
${ \textbf{(A)}\ 24\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 31\qquad\textbf{(D)}}\ 33\qquad\textbf{(E)}\ 35 $
2022 AMC 10, 3
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$