Difference between revisions of "2022 AMC 12B Problems"
(→Problem 11) |
(→Problem 23) |
||
(36 intermediate revisions by 8 users not shown) | |||
Line 3: | Line 3: | ||
==Problem 1 == | ==Problem 1 == | ||
− | Define <math>x\diamond y</math> to be <math>|x-y|</math> for all real numbers <math>x</math> and <math>y</math> | + | Define <math>x\diamond y</math> to be <math>|x-y|</math> for all real numbers <math>x</math> and <math>y.</math> What is the value of <cmath>(1\diamond(2\diamond3))-((1\diamond2)\diamond3)?</cmath> |
− | <math> \textbf{(A)}\ -2 \qquad | + | |
− | \textbf{(B)}\ -1 \qquad | + | <math> \textbf{(A)}\ {-}2 \qquad |
+ | \textbf{(B)}\ {-}1 \qquad | ||
\textbf{(C)}\ 0 \qquad | \textbf{(C)}\ 0 \qquad | ||
\textbf{(D)}\ 1 \qquad | \textbf{(D)}\ 1 \qquad | ||
Line 14: | Line 15: | ||
==Problem 2 == | ==Problem 2 == | ||
− | In rhombus <math>ABCD</math>, point <math>P</math> lies on segment <math>\overline{AD}</math> | + | In rhombus <math>ABCD</math>, point <math>P</math> lies on segment <math>\overline{AD}</math> so that <math>\overline{BP}</math> <math>\perp</math> <math>\overline{AD}</math>, <math>AP = 3</math>, and <math>PD = 2</math>. What is the area of <math>ABCD</math>? (Note: The figure is not drawn to scale.) |
+ | |||
+ | <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> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<math>\textbf{(A) }3\sqrt 5 \qquad | <math>\textbf{(A) }3\sqrt 5 \qquad | ||
\textbf{(B) }10 \qquad | \textbf{(B) }10 \qquad | ||
Line 39: | Line 41: | ||
==Problem 3 == | ==Problem 3 == | ||
− | How many of the first ten numbers of the sequence <math>121 | + | How many of the first ten numbers of the sequence <math>121, 11211, 1112111, \ldots</math> are prime numbers? |
− | <math>\ | + | <math>\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4</math> |
[[2022 AMC 12B Problems/Problem 3|Solution]] | [[2022 AMC 12B Problems/Problem 3|Solution]] | ||
Line 57: | Line 59: | ||
The point <math>(-1, -2)</math> is rotated <math>270^{\circ}</math> counterclockwise about the point <math>(3, 1)</math>. What are the coordinates of its new position? | The point <math>(-1, -2)</math> is rotated <math>270^{\circ}</math> counterclockwise about the point <math>(3, 1)</math>. What are the coordinates of its new position? | ||
− | <math>\textbf{(A)}\ (-3, -4) \qquad \textbf{(B)}\ (0,5) \qquad \textbf{(C)}\ (2,-1) \qquad \textbf{(D)}\ (4,3) \qquad \textbf{(E)}\ (6,-3)</math> | + | <math>\textbf{(A) }\ (-3, -4) \qquad \textbf{(B) }\ (0,5) \qquad \textbf{(C) }\ (2,-1) \qquad \textbf{(D) }\ (4,3) \qquad \textbf{(E) }\ (6,-3)</math> |
[[2022 AMC 12B Problems/Problem 5|Solution]] | [[2022 AMC 12B Problems/Problem 5|Solution]] | ||
Line 65: | Line 67: | ||
Consider the following <math>100</math> sets of <math>10</math> elements each: | Consider the following <math>100</math> sets of <math>10</math> elements each: | ||
<cmath>\begin{align*} | <cmath>\begin{align*} | ||
− | &\{1,2,3,\ | + | &\{1,2,3,\ldots,10\}, \\ |
− | &\{11,12,13,\ | + | &\{11,12,13,\ldots,20\},\\ |
− | &\{21,22,23,\ | + | &\{21,22,23,\ldots,30\},\\ |
&\vdots\\ | &\vdots\\ | ||
− | &\{991,992,993,\ | + | &\{991,992,993,\ldots,1000\}. |
\end{align*}</cmath> | \end{align*}</cmath> | ||
How many of these sets contain exactly two multiples of <math>7</math>? | How many of these sets contain exactly two multiples of <math>7</math>? | ||
− | <math>\textbf{(A)} 40\qquad\textbf{(B)} 42\qquad\textbf{(C)} | + | <math>\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50</math> |
[[2022 AMC 12B Problems/Problem 6|Solution]] | [[2022 AMC 12B Problems/Problem 6|Solution]] | ||
Line 89: | Line 91: | ||
What is the graph of <math>y^4+1=x^4+2y^2</math> in the coordinate plane? | What is the graph of <math>y^4+1=x^4+2y^2</math> in the coordinate plane? | ||
− | <math> \textbf{(A)}\ \ | + | <math>\textbf{(A) }\ \text{two intersecting parabolas} \qquad \textbf{(B) }\ \text{two nonintersecting parabolas} \qquad \textbf{(C) }\ \text{two intersecting circles} \qquad</math> |
− | \textbf{(B)}\ \ | ||
− | \textbf{(C)}\ \ | ||
− | <math>\textbf{(D)}\ \ | + | <math>\textbf{(D) }\ \text{a circle and a hyperbola} \qquad \textbf{(E) }\ \text{a circle and two parabolas}</math> |
− | \textbf{(E)}\ \ | ||
[[2022 AMC 12B Problems/Problem 8|Solution]] | [[2022 AMC 12B Problems/Problem 8|Solution]] | ||
Line 100: | Line 99: | ||
==Problem 9 == | ==Problem 9 == | ||
+ | The sequence <math>a_0,a_1,a_2,\cdots</math> is a strictly increasing arithmetic sequence of positive integers such that <cmath>2^{a_7}=2^{27} \cdot a_7.</cmath> What is the minimum possible value of <math>a_2</math>? | ||
− | + | <math>\textbf{(A) }\ 8 \qquad \textbf{(B) }\ 12 \qquad \textbf{(C) }\ 16 \qquad \textbf{(D) }\ 17 \qquad \textbf{(E) }\ 22</math> | |
− | |||
− | |||
− | <math>\textbf{(A)}8 \qquad \textbf{(B)}12 \qquad \textbf{(C)}16 \qquad \textbf{(D)}17 \qquad \textbf{(E)}22</math> | ||
[[2022 AMC 12B Problems/Problem 9|Solution]] | [[2022 AMC 12B Problems/Problem 9|Solution]] | ||
Line 112: | Line 109: | ||
Regular hexagon <math>ABCDEF</math> has side length <math>2</math>. Let <math>G</math> be the midpoint of <math>\overline{AB}</math>, and let <math>H</math> be the midpoint of <math>\overline{DE}</math>. What is the perimeter of <math>GCHF</math>? | Regular hexagon <math>ABCDEF</math> has side length <math>2</math>. Let <math>G</math> be the midpoint of <math>\overline{AB}</math>, and let <math>H</math> be the midpoint of <math>\overline{DE}</math>. What is the perimeter of <math>GCHF</math>? | ||
− | <math> \textbf{(A)}\ 4\sqrt3 \qquad | + | <math> \textbf{(A) }\ 4\sqrt3 \qquad |
− | \textbf{(B)}\ 8 \qquad | + | \textbf{(B) }\ 8 \qquad |
− | \textbf{(C)}\ 4\sqrt5 \qquad | + | \textbf{(C) }\ 4\sqrt5 \qquad |
− | \textbf{(D)}\ 4\sqrt7 \qquad | + | \textbf{(D) }\ 4\sqrt7 \qquad |
− | \textbf{(E)}\ 12</math> | + | \textbf{(E) }\ 12</math> |
[[2022 AMC 12B Problems/Problem 10|Solution]] | [[2022 AMC 12B Problems/Problem 10|Solution]] | ||
Line 124: | Line 121: | ||
Let <math> f(n) = \left( \frac{-1+i\sqrt{3}}{2} \right)^n + \left( \frac{-1-i\sqrt{3}}{2} \right)^n </math>, where <math>i = \sqrt{-1}</math>. What is <math>f(2022)</math>? | Let <math> f(n) = \left( \frac{-1+i\sqrt{3}}{2} \right)^n + \left( \frac{-1-i\sqrt{3}}{2} \right)^n </math>, where <math>i = \sqrt{-1}</math>. What is <math>f(2022)</math>? | ||
− | <math> \textbf{(A)}\ -2 \qquad | + | <math> \textbf{(A) }\ -2 \qquad |
− | \textbf{(B)}\ -1 \qquad | + | \textbf{(B) }\ -1 \qquad |
− | \textbf{(C)}\ 0 \qquad | + | \textbf{(C) }\ 0 \qquad |
− | \textbf{(D)}\ \sqrt{3} \qquad | + | \textbf{(D) }\ \sqrt{3} \qquad |
− | \textbf{(E)}\ 2</math> | + | \textbf{(E) }\ 2</math> |
[[2022 AMC 12B Problems/Problem 11|Solution]] | [[2022 AMC 12B Problems/Problem 11|Solution]] | ||
Line 134: | Line 131: | ||
==Problem 12 == | ==Problem 12 == | ||
− | + | Kayla rolls four fair <math>6</math>-sided dice. What is the probability that at least one of the numbers Kayla rolls is greater than <math>4</math> and at least two of the numbers she rolls are greater than <math>2</math>? | |
+ | |||
+ | <math>\textbf{(A) }\frac{2}{3} \qquad \textbf{(B) }\frac{19}{27} \qquad \textbf{(C) }\frac{59}{81} \qquad \textbf{(D) }\frac{61}{81} \qquad \textbf{(E) }\frac{7}{9}</math> | ||
[[2022 AMC 12B Problems/Problem 12|Solution]] | [[2022 AMC 12B Problems/Problem 12|Solution]] | ||
Line 140: | Line 139: | ||
==Problem 13 == | ==Problem 13 == | ||
− | + | The diagram below shows a rectangle with side lengths <math>4</math> and <math>8</math> and a square with side length <math>5</math>. 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(1.1)); | ||
+ | </asy> | ||
+ | |||
+ | <math>\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} </math> | ||
[[2022 AMC 12B Problems/Problem 13|Solution]] | [[2022 AMC 12B Problems/Problem 13|Solution]] | ||
Line 146: | Line 162: | ||
==Problem 14 == | ==Problem 14 == | ||
− | + | The graph of <math>y=x^2+2x-15</math> intersects the <math>x</math>-axis at points <math>A</math> and <math>C</math> and the <math>y</math>-axis at point <math>B</math>. What is <math>\tan(\angle ABC)</math>? | |
+ | |||
+ | <math>\textbf{(A) }\frac{1}{7} \qquad \textbf{(B) }\frac{1}{4} \qquad \textbf{(C) }\frac{3}{7} \qquad \textbf{(D) }\frac{1}{2} \qquad \textbf{(E) }\frac{4}{7}</math> | ||
[[2022 AMC 12B Problems/Problem 14|Solution]] | [[2022 AMC 12B Problems/Problem 14|Solution]] | ||
Line 152: | Line 170: | ||
==Problem 15 == | ==Problem 15 == | ||
− | + | One of the following numbers is not divisible by any prime number less than <math>10.</math> Which is it? | |
+ | |||
+ | <math>\textbf{(A) } 2^{606}-1 \qquad\textbf{(B) } 2^{606}+1 \qquad\textbf{(C) } 2^{607}-1 \qquad\textbf{(D) } 2^{607}+1\qquad\textbf{(E) } 2^{607}+3^{607}</math> | ||
[[2022 AMC 12B Problems/Problem 15|Solution]] | [[2022 AMC 12B Problems/Problem 15|Solution]] | ||
Line 158: | Line 178: | ||
==Problem 16 == | ==Problem 16 == | ||
− | + | Suppose <math>x</math> and <math>y</math> are positive real numbers such that | |
+ | <cmath>x^y=2^{64}\text{ and }(\log_2{x})^{\log_2{y}}=2^{7}.</cmath> | ||
+ | What is the greatest possible value of <math>\log_2{y}</math>? | ||
+ | |||
+ | <math>\textbf{(A) }3 \qquad \textbf{(B) }4 \qquad \textbf{(C) }3+\sqrt{2} \qquad \textbf{(D) }4+\sqrt{3} \qquad \textbf{(E) }7</math> | ||
[[2022 AMC 12B Problems/Problem 16|Solution]] | [[2022 AMC 12B Problems/Problem 16|Solution]] | ||
==Problem 17 == | ==Problem 17 == | ||
+ | How many <math>4 \times 4</math> arrays whose entries are <math>0</math>s and <math>1</math>s are there such that the row sums (the sum of the entries in each row) are <math>1, 2, 3,</math> and <math>4,</math> in some order, and the column sums (the sum of the entries in each column) are also <math>1, 2, 3,</math> and <math>4,</math> in some order? For example, the array | ||
+ | <cmath>\left[ | ||
+ | \begin{array}{cccc} | ||
+ | 1 & 1 & 1 & 0 \\ | ||
+ | 0 & 1 & 1 & 0 \\ | ||
+ | 1 & 1 & 1 & 1 \\ | ||
+ | 0 & 1 & 0 & 0 \\ | ||
+ | \end{array} | ||
+ | \right]</cmath> | ||
+ | satisfies the condition. | ||
− | + | <math>\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624</math> | |
[[2022 AMC 12B Problems/Problem 17|Solution]] | [[2022 AMC 12B Problems/Problem 17|Solution]] | ||
Line 170: | Line 204: | ||
==Problem 18 == | ==Problem 18 == | ||
− | + | Each square in a <math>5 \times 5</math> 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: | |
+ | |||
+ | * 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. | ||
+ | |||
+ | 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,mediumgray,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 <math>5 \times 5</math> grid has a border of empty squares surrounding a <math>3 \times 3</math> 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,mediumgray,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> | ||
+ | <math>\textbf{(A)}\ 14 \qquad\textbf{(B)}\ 18 \qquad\textbf{(C)}\ 22 \qquad\textbf{(D)}\ 26 \qquad\textbf{(E)}\ 30</math> | ||
[[2022 AMC 12B Problems/Problem 18|Solution]] | [[2022 AMC 12B Problems/Problem 18|Solution]] | ||
Line 176: | Line 283: | ||
==Problem 19 == | ==Problem 19 == | ||
− | + | In <math>\triangle{ABC}</math> medians <math>\overline{AD}</math> and <math>\overline{BE}</math> intersect at <math>G</math> and <math>\triangle{AGE}</math> is equilateral. Then <math>\cos(C)</math> can be written as <math>\frac{m\sqrt p}n</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers and <math>p</math> is a positive integer not divisible by the square of any prime. What is <math>m+n+p?</math> | |
+ | |||
+ | <math>\textbf{(A) }44 \qquad \textbf{(B) }48 \qquad \textbf{(C) }52 \qquad \textbf{(D) }56 \qquad \textbf{(E) }60</math> | ||
[[2022 AMC 12B Problems/Problem 19|Solution]] | [[2022 AMC 12B Problems/Problem 19|Solution]] | ||
Line 182: | Line 291: | ||
==Problem 20 == | ==Problem 20 == | ||
− | + | Let <math>P(x)</math> be a polynomial with rational coefficients such that when <math>P(x)</math> is divided by the polynomial <math>x^2 + x + 1</math>, the remainder is <math>x + 2</math>, and when <math>P(x)</math> is divided by the polynomial <math>x^2 + 1</math>, the remainder is <math>2x + 1</math>. 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? | |
+ | |||
+ | <math>\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23</math> | ||
[[2022 AMC 12B Problems/Problem 20|Solution]] | [[2022 AMC 12B Problems/Problem 20|Solution]] | ||
+ | ==Problem 21 == | ||
− | == | + | Let <math>S</math> be the set of circles in the coordinate plane that are tangent to each of the three circles with equations <math>x^{2}+y^{2}=4</math>, <math>x^{2}+y^{2}=64</math>, and <math>(x-5)^{2}+y^{2}=3</math>. What is the sum of the areas of all circles in <math>S</math>? |
− | + | <math>\textbf{(A) } 48 \pi \qquad | |
+ | \textbf{(B) } 68 \pi \qquad | ||
+ | \textbf{(C) } 96 \pi \qquad | ||
+ | \textbf{(D) } 102 \pi \qquad | ||
+ | \textbf{(E) } 136 \pi \qquad</math> | ||
[[2022 AMC 12B Problems/Problem 21|Solution]] | [[2022 AMC 12B Problems/Problem 21|Solution]] | ||
Line 195: | Line 311: | ||
==Problem 22 == | ==Problem 22 == | ||
− | + | Ant Amelia starts on the number line at <math>0</math> and crawls in the following manner. For <math>n=1,2,3,</math> Amelia chooses a time duration <math>t_n</math> and an increment <math>x_n</math> independently and uniformly at random from the interval <math>(0,1).</math> During the <math>n</math>th step of the process, Amelia moves <math>x_n</math> units in the positive direction, using up <math>t_n</math> minutes. If the total elapsed time has exceeded <math>1</math> minute during the <math>n</math>th step, she stops at the end of that step; otherwise, she continues with the next step, taking at most <math>3</math> steps in all. What is the probability that Amelia’s position when she stops will be greater than <math>1</math>? | |
+ | |||
+ | <math>\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}</math> | ||
[[2022 AMC 12B Problems/Problem 22|Solution]] | [[2022 AMC 12B Problems/Problem 22|Solution]] | ||
− | ==Problem 23 == | + | ==Problem 23== |
− | + | Let <math>x_0,x_1,x_2,\dotsc</math> be a sequence of numbers, where each <math>x_k</math> is either <math>0</math> or <math>1</math>. For each positive integer <math>n</math>, define | |
− | + | <cmath>S_n = \sum_{k=0}^{n-1} x_k 2^k</cmath> | |
+ | Suppose <math>7S_n \equiv 1 \pmod{2^n}</math> for all <math>n \geq 1</math>. What is the value of the sum | ||
+ | <cmath>x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?</cmath> | ||
+ | <math>\textbf{(A) } 6 \qquad \textbf{(B) } 7 \qquad \textbf{(C) }12\qquad \textbf{(D) } 14\qquad \textbf{(E) }15</math> | ||
[[2022 AMC 12B Problems/Problem 23|Solution]] | [[2022 AMC 12B Problems/Problem 23|Solution]] | ||
Line 207: | Line 328: | ||
==Problem 24 == | ==Problem 24 == | ||
− | + | The figure below depicts a regular <math>7</math>-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 <math>4</math>th powers of the lengths of all <math>21</math> of its edges and diagonals? | ||
+ | |||
+ | <math>\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196</math> | ||
[[2022 AMC 12B Problems/Problem 24|Solution]] | [[2022 AMC 12B Problems/Problem 24|Solution]] | ||
Line 213: | Line 350: | ||
==Problem 25 == | ==Problem 25 == | ||
− | + | Four regular hexagons surround a square with a side length <math>1</math>, 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 <math>m\sqrt{n} + p</math>, where <math>m</math>, <math>n</math>, and <math>p</math> are integers and <math>n</math> is not divisible by the square of any prime. What is <math>m + n + p</math>? | |
+ | |||
+ | <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> | ||
+ | |||
+ | <math>\textbf{(A) } -12 \qquad | ||
+ | \textbf{(B) }-4 \qquad | ||
+ | \textbf{(C) } 4 \qquad | ||
+ | \textbf{(D) }24 \qquad | ||
+ | \textbf{(E) }32</math> | ||
[[2022 AMC 12B Problems/Problem 25|Solution]] | [[2022 AMC 12B Problems/Problem 25|Solution]] | ||
+ | |||
+ | ==See also== | ||
+ | {{AMC12 box|year=2022|ab=B|before=[[2022 AMC 12A Problems]]|after=[[2023 AMC 12A Problems]]}} | ||
+ | |||
+ | [[Category:AMC 12 Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 10:02, 3 November 2024
2022 AMC 12B (Answer Key) Printable versions: • AoPS Resources • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 |
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
Define to be for all real numbers and What is the value of
Problem 2
In rhombus , point lies on segment so that , , and . What is the area of ? (Note: The figure is not drawn to scale.)
Problem 3
How many of the first ten numbers of the sequence are prime numbers?
Problem 4
For how many values of the constant will the polynomial have two distinct integer roots?
Problem 5
The point is rotated counterclockwise about the point . What are the coordinates of its new position?
Problem 6
Consider the following sets of elements each: How many of these sets contain exactly two multiples of ?
Problem 7
Camila writes down five positive integers. The unique mode of these integers is greater than their median, and the median is greater than their arithmetic mean. What is the least possible value for the mode?
Problem 8
What is the graph of in the coordinate plane?
Problem 9
The sequence is a strictly increasing arithmetic sequence of positive integers such that What is the minimum possible value of ?
Problem 10
Regular hexagon has side length . Let be the midpoint of , and let be the midpoint of . What is the perimeter of ?
Problem 11
Let , where . What is ?
Problem 12
Kayla rolls four fair -sided dice. What is the probability that at least one of the numbers Kayla rolls is greater than and at least two of the numbers she rolls are greater than ?
Problem 13
The diagram below shows a rectangle with side lengths and and a square with side length . 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?
Problem 14
The graph of intersects the -axis at points and and the -axis at point . What is ?
Problem 15
One of the following numbers is not divisible by any prime number less than Which is it?
Problem 16
Suppose and are positive real numbers such that What is the greatest possible value of ?
Problem 17
How many arrays whose entries are s and s are there such that the row sums (the sum of the entries in each row) are and in some order, and the column sums (the sum of the entries in each column) are also and in some order? For example, the array satisfies the condition.
Problem 18
Each square in a 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:
- 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.
A sample transformation is shown in the figure below. Suppose the grid has a border of empty squares surrounding a 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.)
Problem 19
In medians and intersect at and is equilateral. Then can be written as , where and are relatively prime positive integers and is a positive integer not divisible by the square of any prime. What is
Problem 20
Let be a polynomial with rational coefficients such that when is divided by the polynomial , the remainder is , and when is divided by the polynomial , the remainder is . 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?
Problem 21
Let be the set of circles in the coordinate plane that are tangent to each of the three circles with equations , , and . What is the sum of the areas of all circles in ?
Problem 22
Ant Amelia starts on the number line at and crawls in the following manner. For Amelia chooses a time duration and an increment independently and uniformly at random from the interval During the th step of the process, Amelia moves units in the positive direction, using up minutes. If the total elapsed time has exceeded minute during the th step, she stops at the end of that step; otherwise, she continues with the next step, taking at most steps in all. What is the probability that Amelia’s position when she stops will be greater than ?
Problem 23
Let be a sequence of numbers, where each is either or . For each positive integer , define Suppose for all . What is the value of the sum
Problem 24
The figure below depicts a regular -gon inscribed in a unit circle. What is the sum of the th powers of the lengths of all of its edges and diagonals?
Problem 25
Four regular hexagons surround a square with a side length , 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 , where , , and are integers and is not divisible by the square of any prime. What is ?
See also
2022 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by 2022 AMC 12A Problems |
Followed by 2023 AMC 12A Problems |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.