Found problems: 98
2022 AMC 10, 5
Square $ABCD$ has side length $1$. Point $P$, $Q$, $R$, and $S$ each lie on a side of $ABCD$ such that $APQCRS$ is an equilateral convex hexagon with side length $s$. What is $s$?
$\textbf{(A) } \frac{\sqrt{2}}{3} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } 2-\sqrt{2} \qquad \textbf{(D) } 1-\frac{\sqrt{2}}{4} \qquad \textbf{(E) } \frac{2}{3}$
2022 AMC 10, 2
Mike cycled $15$ laps in $57$ minutes. Assume he cycled at a constant speed throughout. Approximately how many laps did he complete in the first $27$ minutes?
$\textbf{(A) } 5 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 9 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 13$
2022 AMC 10, 13
Let $\triangle ABC$ be a scalene triangle. Point $P$ lies on $\overline{BC}$ so that $\overline{AP}$ bisects $\angle BAC$. The line through $B$ perpendicular to $\overline{AP}$ intersects the line through $A$ parallel to $\overline{BC}$ at point $D$. Suppose $BP = 2$ and $PC = 3$. What is $AD$ ?
$\textbf{(A) }8\qquad\textbf{(B) }9\qquad\textbf{(C) }10\qquad\textbf{(D) }11\qquad\textbf{(E) }12$
2022 AMC 12/AHSME, 21
Let $P(x) = x^{2022} + x^{1011} + 1$. Which of the following polynomials divides $P(x)$?
$\textbf{(A)}~x^2 - x + 1\qquad\textbf{(B)}~x^2 + x + 1\qquad\textbf{(C)}~x^4 + 1\qquad\textbf{(D)}~x^6 - x^3 + 1\qquad\textbf{(E)}~x^6 + x^3 + 1$
2022 AMC 12/AHSME, 7
A rectangle is partitioned into 5 regions as shown. Each region is to be painted a solid color - red, orange, yellow, blue, or green - so that regions that touch are painted different colors, and colors can be used more than once. How many different colorings are possible?
[asy]
size(5.5cm);
draw((0,0)--(0,2)--(2,2)--(2,0)--cycle);
draw((2,0)--(8,0)--(8,2)--(2,2)--cycle);
draw((8,0)--(12,0)--(12,2)--(8,2)--cycle);
draw((0,2)--(6,2)--(6,4)--(0,4)--cycle);
draw((6,2)--(12,2)--(12,4)--(6,4)--cycle);
[/asy]
$\textbf{(A) }120\qquad\textbf{(B) }270\qquad\textbf{(C) }360\qquad\textbf{(D) }540\qquad\textbf{(E) }720$
2022 AMC 12/AHSME, 11
Let $ f(n) = \left( \frac{-1+i\sqrt{3}}{2} \right)^n + \left( \frac{-1-i\sqrt{3}}{2} \right)^n $, where $i = \sqrt{-1}$. What is $f(2022)$
$ \textbf{(A)}\ -2 \qquad
\textbf{(B)}\ -1 \qquad
\textbf{(C)}\ 0 \qquad
\textbf{(D)}\ \sqrt{3} \qquad
\textbf{(E)}\ 2$
2022 AMC 10, 1
What is the value of
$$3 + \frac{1}{3+\frac{1}{3+\frac{1}{3}}}?$$
$\textbf{(A) } \frac{31}{10} \qquad \textbf{(B) } \frac{49}{15} \qquad \textbf{(C) } \frac{33}{10} \qquad \textbf{(D) } \frac{109}{33} \qquad \textbf{(E) } \frac{15}{4}$
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$
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$
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$
2022 AMC 12/AHSME, 11
What is the product of all real numbers $x$ such that the distance on the number line between $\log_6x$ and $\log_69$ is twice the distance on the number line between $\log_610$ and $1$?
$\textbf{(A) }10\qquad\textbf{(B) }18\qquad\textbf{(C) }25\qquad\textbf{(D) }36\qquad\textbf{(E) }81$
2022 AMC 12/AHSME, 19
Don't have original wording:
In $\triangle{ABC}$ medians $\overline{AD}$ and $\overline{BE}$ intersect at $G$ and $\triangle{AGE}$ is equilateral. Then $\cos(C)$ can be written as $\frac{m\sqrt p}n$, where $m$ and $n$ are relatively prime positive integers and $p$ is a positive integer not divisible by the square of any prime. What is $m+n+p?$
[asy]
import geometry;
unitsize(2cm);
real arg(pair p) {
return atan2(p.y, p.x) * 180/pi;
}
pair G=(0,0),E=(1,0),A=(1/2,sqrt(3)/2),D=1.5*G-0.5*A,C=2*E-A,B=2*D-C;
pair t(pair p) {
return rotate(-arg(dir(B--C)))*p;
}
path t(path p) {
return rotate(-arg(dir(B--C)))*p;
}
void d(path p, pen q = black+linewidth(1.5)) {
draw(t(p),q);
}
void o(pair p, pen q = 5+black) {
dot(t(p),q);
}
void l(string s, pair p, pair d) {
label(s, t(p),d);
}
d(A--B--C--cycle);
d(A--D);
d(B--E);
o(A);
o(B);
o(C);
o(D);
o(E);
o(G);
l("$A$",A,N);
l("$B$",B,SW);
l("$C$",C,SE);
l("$D$",D,S);
l("$E$",E,NE);
l("$G$",G,NW);
[/asy]
$\textbf{(A)}44~\textbf{(B)}48~\textbf{(C)}52~\textbf{(D)}56~\textbf{(E)}60$
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$
2022 AMC 10, 22
Suppose that 13 cards numbered $1, 2, 3, \dots, 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 the fourth pass, and 11, 12, 13 on the fifth pass. For how many of the $13!$ possible orderings of the cards will the $13$ cards be picked up in exactly two passes?
[asy]
size(11cm);
draw((0,0)--(2,0)--(2,3)--(0,3)--cycle);
label("7", (1,1.5));
draw((3,0)--(5,0)--(5,3)--(3,3)--cycle);
label("11", (4,1.5));
draw((6,0)--(8,0)--(8,3)--(6,3)--cycle);
label("8", (7,1.5));
draw((9,0)--(11,0)--(11,3)--(9,3)--cycle);
label("6", (10,1.5));
draw((12,0)--(14,0)--(14,3)--(12,3)--cycle);
label("4", (13,1.5));
draw((15,0)--(17,0)--(17,3)--(15,3)--cycle);
label("5", (16,1.5));
draw((18,0)--(20,0)--(20,3)--(18,3)--cycle);
label("9", (19,1.5));
draw((21,0)--(23,0)--(23,3)--(21,3)--cycle);
label("12", (22,1.5));
draw((24,0)--(26,0)--(26,3)--(24,3)--cycle);
label("1", (25,1.5));
draw((27,0)--(29,0)--(29,3)--(27,3)--cycle);
label("13", (28,1.5));
draw((30,0)--(32,0)--(32,3)--(30,3)--cycle);
label("10", (31,1.5));
draw((33,0)--(35,0)--(35,3)--(33,3)--cycle);
label("2", (34,1.5));
draw((36,0)--(38,0)--(38,3)--(36,3)--cycle);
label("3", (37,1.5));
[/asy]
$\textbf{(A) }4082\qquad\textbf{(B) }4095\qquad\textbf{(C) }4096\qquad\textbf{(D) }8178\qquad\textbf{(E) }8191$
2022 AMC 12/AHSME, 23
Let $h_n$ and $k_n$ be the unique relatively prime positive integers such that
\[\frac{1}{1} + \frac{1}{2} + \frac{1}{3} + \cdots + \frac{1}{n} = \frac{h_n}{k_n}.\]
Let $L_n$ denote the least common multiple of the numbers $1, 2, 3,\cdots, n$. For how many integers $n$ with $1 \le n \le 22$ is $k_n<L_n$?
$\textbf{(A)} ~0 \qquad\textbf{(B)} ~3 \qquad\textbf{(C)} ~7 \qquad\textbf{(D)} ~8 \qquad\textbf{(E)} ~10 $
2022 AMC 12/AHSME, 3
How many of the first ten numbers of the sequence $121$, $11211$, $1112111$, ... are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$
2022 AMC 10, 19
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}$$
2022 AMC 10, 14
What is the number of ways the numbers from $1$ to $14$ can be split into $7$ pairs such that for each pair, the greater number is at least $2$ times the smaller number?
$\textbf{(A) }108\qquad\textbf{(B) }120\qquad\textbf{(C) }126\qquad\textbf{(D) }132\qquad\textbf{(E) }144$
2022 AMC 10, 9
The sum
\[\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\dots+\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$
2022 AMC 10, 20
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 \qquad \textbf{(D)}\ 113 \qquad \textbf{(E)}\ 114$
2022 AMC 12/AHSME, 10
What is the number of ways the numbers from $1$ to $14$ can be split into $7$ pairs such that for each pair, the greater number is at least $2$ times the smaller number?
$\textbf{(A) }108\qquad\textbf{(B) }120\qquad\textbf{(C) }126\qquad\textbf{(D) }132\qquad\textbf{(E) }144$
2022 AMC 12/AHSME, 14
What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\displaystyle\frac{3}{2}\qquad\textbf{(B)}~\displaystyle\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\displaystyle\frac{9}{4}\qquad\textbf{(E)}~3$
2022 AMC 10, 6
Which expression is equal to $\left | a-2-\sqrt{(a-1)^2} \right|$ for $a<0$?
$\textbf{(A) } 3-2a \qquad \textbf{(B) } 1-a \qquad \textbf{(C) } 1 \qquad \textbf{(D) } a+1 \qquad \textbf{(E) } 3$