Found problems: 37
2022 AMC 10, 24
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 the condition because it contains at least $1$ digit less than $1$, at least $2$ digits less than $2$, at least $3$ digits less than $3$, and at least $4$ digits less than $4$. The string $23404$ does not satisfy the condition because it does not contain at least $2$ digits less than $2$.)
$\textbf{(A) }500\qquad\textbf{(B) }625\qquad\textbf{(C) }1089\qquad\textbf{(D) }1199\qquad\textbf{(E) }1296$
2022 AMC 12/AHSME, 6
A data set consists of $6$ (not distinct) positive integers: $1$, $7$, $5$, $2$, $5$, and $X$. The average (arithmetic mean) of the $6$ numbers equals a value in the data set. What is the sum of all positive values of $X$?
$\textbf{(A) } 10 \qquad \textbf{(B) } 26 \qquad \textbf{(C) } 32 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 40$
2022 AMC 10, 18
Let $T_k$ be the transformation of the coordinate plane that first rotates the plane $k$ degrees counterclockwise around the origin and then reflects the plane across the $y$-axis. What is the least positive integer $n$ such that performing the sequence of transformations transformations $T_1, T_2, T_3, \dots, T_n$ returns the point $(1,0)$ back to itself?
$\textbf{(A) } 359 \qquad \textbf{(B) } 360\qquad \textbf{(C) } 719 \qquad \textbf{(D) } 720 \qquad \textbf{(E) } 721$
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 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, 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 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 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 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$