Found problems: 38
2022 AMC 10, 16
The diagram below shows a rectangle with side lengths $4$ and $8$ and a square with side length $5$. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle?
[asy]
size(5cm);
filldraw((4,0)--(8,3)--(8-3/4,4)--(1,4)--cycle,mediumgray);
draw((0,0)--(8,0)--(8,4)--(0,4)--cycle,linewidth(1.1));
draw((1,0)--(1,4)--(4,0)--(8,3)--(5,7)--(1,4),linewidth(1.1));
label("$4$", (8,2), E);
label("$8$", (4,0), S);
label("$5$", (3,11/2), NW);
draw((1,.35)--(1.35,.35)--(1.35,0),linewidth(.4));
draw((5,7)--(5+21/100,7-28/100)--(5-7/100,7-49/100)--(5-28/100,7-21/100)--cycle,linewidth(.4));
[/asy]
$\textbf{(A) } 15\dfrac{1}{8} \qquad \textbf{(B) } 15\dfrac{3}{8} \qquad \textbf{(C) } 15\dfrac{1}{2} \qquad \textbf{(D) } 15\dfrac{5}{8} \qquad \textbf{(E) } 15\dfrac{7}{8}$
2022 AMC 12/AHSME, 25
Four regular hexagons surround a square with a side length $1$, each one sharing an edge with the square, as shown in the figure below. The area of the resulting 12-sided outer nonconvex polygon can be written as $m\sqrt{n} + p$, where $m$, $n$, and $p$ are integers and $n$ is not divisible by the square of any prime. What is $m + n + p$?
[asy]
import geometry;
unitsize(3cm);
draw((0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle);
draw(shift((1/2,1-sqrt(3)/2))*polygon(6));
draw(shift((1/2,sqrt(3)/2))*polygon(6));
draw(shift((sqrt(3)/2,1/2))*rotate(90)*polygon(6));
draw(shift((1-sqrt(3)/2,1/2))*rotate(90)*polygon(6));
draw((0,1-sqrt(3))--(1,1-sqrt(3))--(3-sqrt(3),sqrt(3)-2)--(sqrt(3),0)--(sqrt(3),1)--(3-sqrt(3),3-sqrt(3))--(1,sqrt(3))--(0,sqrt(3))--(sqrt(3)-2,3-sqrt(3))--(1-sqrt(3),1)--(1-sqrt(3),0)--(sqrt(3)-2,sqrt(3)-2)--cycle,linewidth(2));
[/asy]
$\textbf{(A)}-12~\textbf{(B)}-4~\textbf{(C)} 4~\textbf{(D)}24~\textbf{(E)}32$
2022 AMC 12/AHSME, 13
The diagram below shows a rectangle with side lengths $4$ and $8$ and a square with side length $5$. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle?
[asy]
size(5cm);
filldraw((4,0)--(8,3)--(8-3/4,4)--(1,4)--cycle,mediumgray);
draw((0,0)--(8,0)--(8,4)--(0,4)--cycle,linewidth(1.1));
draw((1,0)--(1,4)--(4,0)--(8,3)--(5,7)--(1,4),linewidth(1.1));
label("$4$", (8,2), E);
label("$8$", (4,0), S);
label("$5$", (3,11/2), NW);
draw((1,.35)--(1.35,.35)--(1.35,0),linewidth(.4));
draw((5,7)--(5+21/100,7-28/100)--(5-7/100,7-49/100)--(5-28/100,7-21/100)--cycle,linewidth(.4));
[/asy]
$\textbf{(A) } 15\dfrac{1}{8} \qquad \textbf{(B) } 15\dfrac{3}{8} \qquad \textbf{(C) } 15\dfrac{1}{2} \qquad \textbf{(D) } 15\dfrac{5}{8} \qquad \textbf{(E) } 15\dfrac{7}{8}$
2022 AMC 10, 23
Ant Amelia starts on the number line at $0$ and crawls in the following manner. For $n=1,2,3,$ Amelia chooses a time duration $t_n$ and an increment $x_n$ independently and uniformly at random from the interval $(0,1).$ During the $n$th step of the process, Amelia moves $x_n$ units in the positive direction, using up $t_n$ minutes. If the total elapsed time has exceeded $1$ minute during the $n$th step, she stops at the end of that step; otherwise, she continues with the next step, taking at most $3$ steps in all. What is the probability that Amelia’s position when she stops will be greater than $1$?
$\textbf{(A) }\frac{1}{3} \qquad \textbf{(B) }\frac{1}{2} \qquad \textbf{(C) }\frac{2}{3} \qquad \textbf{(D) }\frac{3}{4} \qquad \textbf{(E) }\frac{5}{6}$
2022 AMC 12/AHSME, 24
The figure below depicts a regular 7-gon inscribed in a unit circle.
[asy]
import geometry;
unitsize(3cm);
draw(circle((0,0),1),linewidth(1.5));
for (int i = 0; i < 7; ++i) {
for (int j = 0; j < i; ++j) {
draw(dir(i * 360/7) -- dir(j * 360/7),linewidth(1.5));
}
}
for(int i = 0; i < 7; ++i) {
dot(dir(i * 360/7),5+black);
}
[/asy]
What is the sum of the 4th powers of the lengths of all 21 of its edges and diagonals?
$\textbf{(A)}49~\textbf{(B)}98~\textbf{(C)}147~\textbf{(D)}168~\textbf{(E)}196$
2022 AMC 10, 17
One of the following numbers is not divisible by any prime number less than 10. Which is it?
(A) $2^{606} - 1 \ \ $ (B) $2^{606} + 1 \ \ $ (C) $2^{607} - 1 \ \ $ (D) $2^{607} + 1 \ \ $ (E) $2^{607} + 3^{607} \ \ $
2022 AMC 12/AHSME, 20
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$
2022 AMC 12/AHSME, 2
In rhombus $ABCD$, point $P$ lies on segment $\overline{AD}$ such that $BP\perp AD$, $AP = 3$, and $PD = 2$. What is the area of $ABCD$?
[asy]
import olympiad;
size(180);
real r = 3, s = 5, t = sqrt(r*r+s*s);
defaultpen(linewidth(0.6) + fontsize(10));
pair A = (0,0), B = (r,s), C = (r+t,s), D = (t,0), P = (r,0);
draw(A--B--C--D--A^^B--P^^rightanglemark(B,P,D));
label("$A$",A,SW);
label("$B$", B, NW);
label("$C$",C,NE);
label("$D$",D,SE);
label("$P$",P,S);
[/asy]
$\textbf{(A) }3\sqrt 5 \qquad
\textbf{(B) }10 \qquad
\textbf{(C) }6\sqrt 5 \qquad
\textbf{(D) }20\qquad
\textbf{(E) }25$
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 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 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 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}$$