problem_id
stringlengths 32
32
| link
stringlengths 75
84
| problem
stringlengths 14
5.33k
| solution
stringlengths 15
6.63k
| letter
stringclasses 5
values | answer
stringclasses 957
values |
|---|---|---|---|---|---|
15422b10cd2f7a57f4d8a412de7ac36b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_10 | How many ways are there to split the integers $1$ through $14$ into $7$ pairs such that in each pair, the greater number is at least $2$ times the lesser number?
$\textbf{(A) } 108 \qquad \textbf{(B) } 120 \qquad \textbf{(C) } 126 \qquad \textbf{(D) } 132 \qquad \textbf{(E) } 144$ | The integers $x \in \{8, \ldots , 14 \}$ must each be the larger elements of a distinct pair.
Assign partners in decreasing order for $x \in \{7, \dots, 1\}$
Note that $7$ must pair with $14$ $\mathbf{1} \textbf{ choice}$
For $5 \leq x \leq 7$ , the choices are $\{2x, \dots, 14\} - \{ \text{previous choices}\}$ . As $x$ decreases by 1, The minuend increases by 2 elements, and the subtrahend increases by 1 element, so the difference increases by 1, yielding $\mathbf{3!} \textbf{ combined choices}$
After assigning a partner to $5$ , there are no invalid pairings for yet-unpaired numbers, so there are $\mathbf{4!} \textbf{ ways}$ to choose partners for $\{1,2,3,4\}$
The answer is $3! \cdot 4! = \boxed{144}$ | E | 144 |
2b8b7fc940a3430fc0d1bef17d569356 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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$ | Let $a = 2 \cdot |\log_6 10 - 1| = |\log_6 9 - \log_6 x| = |\log_6 \frac{9}{x}|$
$\pm a = \log_6 \frac{9}{x} \implies 6^{\pm a} = b^{\pm 1} = \frac{9}{x} \implies x = 9 \cdot b^{\pm 1}$
$9b^1 \cdot 9b^{-1} = \boxed{81}$ | null | 81 |
2b8b7fc940a3430fc0d1bef17d569356 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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$ | First, notice that there must be two such numbers: one greater than $\log_69$ and one less than it. Furthermore, they both have to be the same distance away, namely $2(\log_610 - 1)$ . Let these two numbers be $\log_6a$ and $\log_6b$ . Because they are equidistant from $\log_69$ , we have $\frac{\log_6a + \log_6b}{2} = \log_69$ . Using log properties, this simplifies to $\log_6{\sqrt{ab}} = \log_69$ . We then have $\sqrt{ab} = 9$ , so $ab = \boxed{81}$ | E | 81 |
2b8b7fc940a3430fc0d1bef17d569356 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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$ | \[\log_6 9 - \log_6 x_2 = -2d\] Subbing in for $-2d$ and using log rules, \[\log_6 \frac{9}{x_2} = \log_6 \frac{9}{25}\] From this we conclude that \[\frac{9}{x_2} = \frac{9}{25} \implies x_2 = 25\]
Finding the product of the distinct values, $x_1x_2 = \boxed{81}$ | E | 81 |
7f75458139b16ed3ffe2bc887f8d49a9 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_12 | Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$ | Without loss of generality, let the edge-length of $ABCD$ be $2.$ It follows that $MC=MD=\sqrt3.$
Let $O$ be the center of $\triangle ABD,$ so $\overline{CO}\perp\overline{MOD}.$ Note that $MO=\frac13 MD=\frac{\sqrt{3}}{3}.$
In right $\triangle CMO,$ we have \[\cos(\angle CMD)=\frac{MO}{MC}=\boxed{13}.\] ~MRENTHUSIASM | B | 13 |
7f75458139b16ed3ffe2bc887f8d49a9 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_12 | Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$ | Without loss of generality, let the edge-length of $ABCD$ be $2.$ It follows that $CM=DM=\sqrt3.$
By the Law of Cosines, \[\cos(\angle CMD) = \frac{CM^2 + DM^2 - CD^2}{2(CM)(DM)} = \boxed{13}.\] ~jamesl123456 | B | 13 |
7f75458139b16ed3ffe2bc887f8d49a9 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_12 | Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$ | As done above, let the edge-length equal $2$ (usually better than $1$ because we can avoid fractions when dropping altitudes). Notice that the triangle stated in the question has two side-lengths that are the altitudes of two equilateral triangles. By dropping the equilateral triangles' altitude and using $30^{\circ}$ $60^{\circ}$ $90^{\circ}$ properties, we find that the other two sides are equal to $\sqrt{3}$ . Now by dropping the main triangle's altitude, we see it equals $\sqrt{2}$ from the Pythagorean Theorem. we can use the Double Angle Identities for Cosine. Doing this, we obtain \[\cos(\angle CMD) = \frac{2}{3} - \frac13 = \boxed{13}.\] ~Misclicked | B | 13 |
981a0a5502eeca4ccbec8d1aac663c99 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_13 | Let $\mathcal{R}$ be the region in the complex plane consisting of all complex numbers $z$ that can be written as the sum of complex numbers $z_1$ and $z_2$ , where $z_1$ lies on the segment with endpoints $3$ and $4i$ , and $z_2$ has magnitude at most $1$ . What integer is closest to the area of $\mathcal{R}$
$\textbf{(A) } 13 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 15 \qquad \textbf{(D) } 16 \qquad \textbf{(E) } 17$ | [asy] size(250); import TrigMacros; rr_cartesian_axes(-2,6,-2,6,complexplane=true, usegrid = true); Label f; f.p=fontsize(6); xaxis(-1,5,Ticks(f, 1.0)); yaxis(-1,5,Ticks(f, 1.0)); dot((3,0)); dot((0,4)); draw((0,4)--(3,0), blue); draw((0.8, 4.6)..(-.6,4.8)..(-.8, 3.4),red); draw((-.8, 3.4)--(2.2, -0.6), red); draw((2.2, -0.6)..(3.6,-0.8)..(3.8,0.6), red); draw((0.8, 4.6)--(3.8,0.6),red); draw((0.8, 4.6)--(-.8, 3.4),red+dashed); draw((2.2, -0.6)--(3.8,0.6),red+ dashed); draw((3,0)--(3,-1),Arrow); label("1",(3,0)--(3,-1),E); draw((0,4)--(-.6,4.8),Arrow); label("1",(0,4)--(-.6,4.8),SW); draw((1.5,2)--(2.3,2.6),Arrow); label("1",(1.5,2)--(2.3,2.6),SE); [/asy]
If $z$ is a complex number and $z = a + bi$ , then the magnitude (length) of $z$ is $\sqrt{a^2 + b^2}$ . Therefore, $z_1$ has a magnitude of 5. If $z_2$ has a magnitude of at most one, that means for each point on the segment given by $z_1$ , the bounds of the region $\mathcal{R}$ could be at most 1 away. Alone the line, excluding the endpoints, a rectangle with a width of 2 and a length of 5, the magnitude, would be formed. At the endpoints, two semicircles will be formed with a radius of 1 for a total area of $\pi \approx 3$ .
Therefore, the total area is $5(2) + \pi \approx 10 + 3 = \boxed{13}$ | A | 13 |
4de0a3a40c6f9d79def771551f21227d | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$ | Let $\text{log } 2 = x$ . The expression then becomes \[(1+x)^3+(1-x)^3+(3x)(-2x)=\boxed{2}.\] | null | 2 |
4de0a3a40c6f9d79def771551f21227d | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$ | Using sum of cubes \[(\log 5)^{3}+(\log 20)^{3}\] \[= (\log 5 + \log 20)((\log 5)^{2}-(\log 5)(\log 20) + (\log 20)^{2})\] \[= 2((\log 5)^{2}-(\log 5)(2\log 2 + \log 5) + (2\log 2 + \log 5)^{2})\] Let x = $\log 5$ and y = $\log 2$ , so $x+y=1$
The entire expression becomes \[2(x^2-x(2y+x)+(2y+x)^2)-6y^2\] \[=2(x^2+2xy+4y^2-3y^2)\] \[=2(x+y)^2 = \boxed{2}\] | null | 2 |
4de0a3a40c6f9d79def771551f21227d | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$ | We can estimate the solution. Using $\log(2) \approx 0.3, \log(20) = \log(10)+\log(2) = 1 + 0.3 \approx 1.3, \log(8) \approx 0.9$ and $\log(.25) = \log(1)-\log(4)= 0 - 0.6\approx -0.6,$ we have
\[0.7^3 + 1.7^3 + .9\cdot(-0.6) = \boxed{2}\] ~kxiang | null | 2 |
4de0a3a40c6f9d79def771551f21227d | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$ | Using log properties, we combine the terms to make our expression equal to $\log {( (5^{\log^2{5}}) \cdot (20^{\log^2{20}}) \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ .
By exponent properties, we separate the part with base $20$ to become $20^{\log^2{5}} \cdot 20^{\log^2{20}-\log^2{5}}$ . Then, we substitute this into the original expression to get $\log {( (5^{\log^2{5}}) \cdot 20^{\log^2{5}} \cdot 20^{\log^2{20}-\log^2{5}} \cdot 8 ^ {\log{\frac{1}{4}}} ) } = \log {( (100^{\log^2{5}}) \cdot 20^{\log^2{20}-\log^2{5}} \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ .
Because $100^{\log^2{5}} = 25^{\log{5}}$ , and $\log^2{20}-\log^2{5} = (\log{20}+\log{5})(\log{20}-\log{5}) = \log{100}\cdot\log{4} = 2\log{4}$ , this expression is equal to $\log {( 25 ^ {\log{5}} \cdot 400^{\log{4}} \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ .
We perform the step with the base combining on $25$ and $400$ to get $25 ^ {\log{5}} \cdot 400^{\log{4}} = 25 ^ {\log{5}-\log{4}} \cdot 10000^{\log{4}} = 25^{\log{\frac{5}{4}}}\cdot 256$ . Putting this back into the whole equation gives $\log{( 25^{\log{\frac{5}{4}}}\cdot 256 \cdot 8^{\log{\frac{1}{4}}})}$ .
One last base merge remains - but $25\cdot 8$ isn't a power of 10. We can rectify this by converting $8^{\log{\frac{1}{4}}}$ to $(4^\frac{3}{2})^{\log{\frac{1}{4}}} = 4^{\log{ \frac{1}{8} }}$ .
Finally, we complete this arduous process by performing the base merge on $\log{( 25^{\log{\frac{5}{4}}}\cdot 256 \cdot 4^{\log{\frac{1}{8}}})}$ .
We get $25^{\log{\frac{5}{4}}} \cdot 4^{\log{\frac{1}{8}}} = 25^{\log{\frac{5}{4}}-\log{\frac{1}{8}}} \cdot 100^{\log{\frac{1}{8}}} = 25^{\log{10}} \cdot \frac{1}{64} = \frac{25}{64}$ .
Putting this back into that original equation one last time, we get $\log(256 \cdot \frac{25}{64}) = \log{100} = \boxed{2}$ .
~aop2014 | null | 2 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | Let $a$ $b$ $c$ be the three roots of the polynomial. The lengthened prism's volume is \[V = (a+2)(b+2)(c+2) = abc+2ac+2ab+2bc+4a+4b+4c+8 = abc + 2(ab+ac+bc) + 4(a+b+c) + 8.\] By Vieta's formulas, we know that a cubic polynomial $Ax^3+Bx^2+Cx+D$ with roots $a$ $b$ $c$ satisfies: \begin{alignat*}{8} a+b+c &= -\frac{B}{A} &&= \frac{39}{10}, \\ ab+ac+bc &= \hspace{2mm}\frac{C}{A} &&= \frac{29}{10}, \\ abc &= -\frac{D}{A} &&= \frac{6}{10}. \end{alignat*} We can substitute these into the expression, obtaining \[V = \frac{6}{10} + 2\left(\frac{29}{10}\right) + 4\left(\frac{39}{10}\right) + 8 = \boxed{30}.\] | D | 30 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | From the answer choices, we can assume the roots are rational numbers, and therefore this polynomial should be easily factorable.
The coefficients of $x$ must multiply to $10$ , so these coefficients must be $5,2,1$ or $10,1,$ in some order. We can try one at a time, and therefore write the factored form as follows: \[(5x-p)(2x-q)(x-r).\] Note that $p, q, r$ have to multiply to $6$ , so they must be either $3,2,1$ or $6,1,1$ in some order. Again, we can try one at a time in different positions and see if they multiply correctly.
We try $(5x-2)(2x-1)(x-3)$ and multiply the $x-$ terms, and sure enough they add up to $29$ . You can try to add up the $x^2$ terms and they add up to $-39$ . Therefore the roots are $\frac{2}{5}$ $\frac{1}{2}$ and $3$ . Now if you add $2$ to each root, you get the volume is $\frac{12}{5} \cdot \frac{5}{2} \cdot 5 = 6 \cdot 5 = 30 = \boxed{30}$ | D | 30 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | We can find the roots of the cubic using the Rational Root Theorem, which tells us that the rational roots of the cubic must be in the form $\frac{p}{q}$ , where $p$ is a factor of the constant $(-6)$ and $q$ is a factor of the leading coefficient $(10)$ . Therefore, $p$ is $\pm (1, 2, 3, 6)$ and q is $\pm (1, 2, 5, 10).$
Doing Synthetic Division, we find that $3$ is a root of the cubic: \[\begin{array}{c|rrrr}&10&-39&29&-6\\3&&30&-27&6\\\hline\\&10&-9&2&0\\\end{array}.\]
Then, we have a quadratic $10x^2-9x+2.$ Using the Quadratic Formula, we can find the other two roots: \[x=\frac{9 \pm \sqrt{(-9)^2-4(10)(2)}}{2 \cdot 10},\] which simplifies to $x=\frac{1}{2}, \frac{2}{5}.$
To find the new volume, we add $2$ to each of the roots we found: \[(3+2)\cdot\left(\frac{1}{2}+2\right)\cdot\left(\frac{2}{5}+2\right).\] Simplifying, we find that the new volume is $\boxed{30}.$ | D | 30 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | Let $P(x) = 10x^3 - 39x^2 + 29x - 6$ , and let $a, b, c$ be the roots of $P(x)$ . The roots of $P(x-2)$ are then $a + 2, b + 2, c + 2,$ so the product of the roots of $P(x-2)$ is the area of the desired rectangular prism.
$P(x-2)$ has leading coefficient $10$ and constant term $P(0-2) = P(-2) = 10(-2)^3 - 39(-2)^2 + 29(-2) - 6 = -300$
Thus, by Vieta's Formulas, the product of the roots of $P(x-2)$ is $\frac{-(-300)}{10} = \boxed{30}$ | D | 30 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | Let $P(x) = 10x^3 - 39x^2 + 29x - 6$ . This can be factored m as $P(x) = 10(x-a)(x-b)(x-c)$ , where $a$ $b$ , and $c$ are the roots of $P(x)$ . We want $V = (a+2)(b+2)(c+2)$
"Luckily" $P(-2) = 10(-2-a)(-2-b)(-2-c) = -10V$ $P(-2) = -300$ , giving $V = \boxed{30}$ | D | 30 |
6e53c7cf04a80ad6ee63955f6d308cc8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_15 | The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by $2$ units. What is the volume of the new box?
$\textbf{(A) } \frac{24}{5} \qquad \textbf{(B) } \frac{42}{5} \qquad \textbf{(C) } \frac{81}{5} \qquad \textbf{(D) } 30 \qquad \textbf{(E) } 48$ | By Vieta's, we can see that $ABC = \frac{6}{10}$ .
Using this, we can see that if each side $ABC$ is the same length, the length is between $0.8$ $0.512$ ) and $0.9$ $0.729$ ). Adding $2$ to these numbers would give us three numbers that are close to $3$ . Rounding up, we will just assume they are all three.
If we multiply all of them, it gives us $27$ .
The closest answer choice is $\boxed{30},$ as all of the other choices are far from this number (the second closest answer choice being $11$ away). | D | 30 |
1a6e10eef4e718c07aa6aeea455b2dab | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_16 | $\emph{triangular number}$ is a positive integer that can be expressed in the form $t_n = 1+2+3+\cdots+n$ , for some positive integer $n$ . The three smallest triangular numbers that are also perfect squares are $t_1 = 1 = 1^2$ $t_8 = 36 = 6^2$ , and $t_{49} = 1225 = 35^2$ . What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?
$\textbf{(A) } 6 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 27$ | We have $t_n = \frac{n (n+1)}{2}$ .
If $t_n$ is a perfect square, then it can be written as $\frac{n (n+1)}{2} = k^2$ ,
where $k$ is a positive integer.
Thus, $n (n+1) = 2 k^2$ . Rearranging, we get $(2n+1)^2-2(2k)^2=1$ , a Pell equation. So $\frac{2n+1}{2k}$ must be a truncation of the continued fraction for $\sqrt{2}$
\begin{eqnarray*} 1+\frac12&=&\frac{2\cdot1+1}{2\cdot1}\\ 1+\frac1{2+\frac1{2+\frac12}}&=&\frac{2\cdot8+1}{2\cdot6}\\ 1+\frac1{2+\frac1{2+\frac1{2+\frac1{2+\frac12}}}}&=&\frac{2\cdot49+1}{2\cdot35}\\ 1+\frac1{2+\frac1{2+\frac1{2+\frac1{2+\frac1{2+\frac1{2+\frac12}}}}}}&=&\frac{2\cdot288+1}{2\cdot204} \end{eqnarray*}
Therefore, $t_{288} = \frac{288\cdot289}{2} = 204^2 = 41616$ , so the answer is $4+1+6+1+6=\boxed{18}$ | D | 18 |
1a6e10eef4e718c07aa6aeea455b2dab | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_16 | $\emph{triangular number}$ is a positive integer that can be expressed in the form $t_n = 1+2+3+\cdots+n$ , for some positive integer $n$ . The three smallest triangular numbers that are also perfect squares are $t_1 = 1 = 1^2$ $t_8 = 36 = 6^2$ , and $t_{49} = 1225 = 35^2$ . What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?
$\textbf{(A) } 6 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 27$ | As mentioned above, $t_n = \frac{n (n+1)}{2}$ . If $t_n$ is a perfect square, one of two things must occur when the fraction is split into a product. Either $\frac{n}{2}$ and $n+1$ must both be squares, or $n$ and $\frac{n+1}{2}$ must both be squares, and thus the search for the next perfect square triangular number can be narrowed down by testing values of $n$ that are close to or are perfect squares. After some work, we reach $n = 288$ $1$ less than $289$ , and $t_{288} = \frac{288\cdot289}{2} = 144 \cdot 289 = 41616$ . This product is a perfect square, and thus the sum of the digits of the fourth smallest perfect square triangular number is therefore $4+1+6+1+6=\boxed{18}$ | D | 18 |
1a6e10eef4e718c07aa6aeea455b2dab | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_16 | $\emph{triangular number}$ is a positive integer that can be expressed in the form $t_n = 1+2+3+\cdots+n$ , for some positive integer $n$ . The three smallest triangular numbers that are also perfect squares are $t_1 = 1 = 1^2$ $t_8 = 36 = 6^2$ , and $t_{49} = 1225 = 35^2$ . What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?
$\textbf{(A) } 6 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 27$ | According to the problem, we want to find integer $p$ such $\frac{n(n+1)}{2}=p^2$ , after expanding, we have $n^2+n=2p^2, 4n^2+4n=8p^2, (2n+1)^2-8p^2=1$ , we call $2n+1=q$ , the equation becomes $q^2-8p^2=1$ , obviously $(q,p)=(3,1)$ is the elementary solution for this pell equation, thus the forth smallest solution set $q_4+2\sqrt{2}p_4=(3+2\sqrt{2})^4=577+408\sqrt{2}$ , which indicates $p=204, p^2=41616$ leads to $\boxed{18}$ | null | 18 |
1a6e10eef4e718c07aa6aeea455b2dab | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_16 | $\emph{triangular number}$ is a positive integer that can be expressed in the form $t_n = 1+2+3+\cdots+n$ , for some positive integer $n$ . The three smallest triangular numbers that are also perfect squares are $t_1 = 1 = 1^2$ $t_8 = 36 = 6^2$ , and $t_{49} = 1225 = 35^2$ . What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?
$\textbf{(A) } 6 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 27$ | If $n \choose 2$ is a square, then ${(2n-1)^2 \choose 2}$ is also a square. We can prove this quite simply:
\[{(2n-1)^2 \choose 2}\] \[= \frac{(2n-1)^2 \cdot ((2n-1)^2 - 1)}{2}\] \[= \frac{(2n-1)^2 \cdot (2n \cdot (2n - 2))}{2}\] \[= (2n-1)^2 \cdot 4{n \choose 2}.\]
Therefore, ${(2 \cdot 9 - 1)^2 \choose 2}$ is a square. Note that $T_n = {n+1 \choose 2}$ . We can easily check all smaller possibilities using a bit of casework, and they don't work. Our solution is thus ${289 \choose 2} = 204^2 = 41616$ , and so the answer is $\boxed{18}$ | null | 18 |
1a6e10eef4e718c07aa6aeea455b2dab | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_16 | $\emph{triangular number}$ is a positive integer that can be expressed in the form $t_n = 1+2+3+\cdots+n$ , for some positive integer $n$ . The three smallest triangular numbers that are also perfect squares are $t_1 = 1 = 1^2$ $t_8 = 36 = 6^2$ , and $t_{49} = 1225 = 35^2$ . What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?
$\textbf{(A) } 6 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 27$ | We want to find integer $n_i$ and $m_i$ such that $t_{n_i} =\frac{n_i (n_i + 1)}{2}=m_i^2, n_0 = 0.$
We use the formula $\sqrt{n_{i+1}} = \sqrt{2n_i} + \sqrt{n_i + 1}$ and get
\[n_1 = ( \sqrt{2n_0} + \sqrt{n_0 + 1})^2 = (0+1)^2 = 1,\] \[n_2= ( \sqrt{2n_1} + \sqrt{n_1 + 1})^2 = ( \sqrt{2} + \sqrt{1 + 1})^2 = 8,\] \[n_3= ( \sqrt{2n_2} + \sqrt{n_2 + 1})^2 = ( \sqrt{16} + \sqrt{8 + 1})^2 = 49,\] \[n_4 = ( \sqrt{2n_3} + \sqrt{n_3 + 1})^2 = ( \sqrt{98} + \sqrt{49 + 1})^2 = ((7 + 5)\sqrt{2})^2 = 288,\] \[n_5 = ( \sqrt{2n_4} + \sqrt{n_4 + 1})^2 = ( \sqrt{576} + \sqrt{289})^2 = (24 + 17)^2 = 1681,\] \[n_6 = ( \sqrt{2n_5} + \sqrt{n_5 + 1})^2 = ( 41\sqrt{2} + \sqrt{1682})^2 = ((41 + 29)\sqrt{2})^2 = 9800,...\] Therefore, $t_{n_4} = t_{288} = \frac{288\cdot289}{2} = 41616 \implies 4+1+6+1+6=\boxed{18}$ | D | 18 |
e83c04373ea644ea4877be2197585eef | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_17 | Suppose $a$ is a real number such that the equation \[a\cdot(\sin{x}+\sin{(2x)}) = \sin{(3x)}\] has more than one solution in the interval $(0, \pi)$ . The set of all such $a$ that can be written
in the form \[(p,q) \cup (q,r),\] where $p, q,$ and $r$ are real numbers with $p < q< r$ . What is $p+q+r$
$\textbf{(A) } {-}4 \qquad \textbf{(B) } {-}1 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } 1 \qquad \textbf{(E) } 4$ | We are given that $a\cdot(\sin{x}+\sin{(2x)})=\sin{(3x)}$
Using the sine double angle formula combine with the fact that $\sin{(3x)} = \sin{x}\cdot(4\cos^2{x}-1)$ , which can be derived using sine angle addition with $\sin{(2x + x)}$ , we have \[a\cdot(\sin{x}+2\sin{x}\cos{x})=\sin{x}\cdot(4\cos^2{x}-1)\] Since $\sin{x} \ne 0$ as it is on the open interval $(0, \pi)$ , we can divide out $\sin{x}$ from both sides, leaving us with \[a\cdot(1+2\cos{x})=4\cos^2{x}-1\] Now, distributing $a$ and rearranging, we achieve the equation \[4\cos^2{x} - 2a\cos{x} - (1+a) = 0\] which is a quadratic in $\cos{x}$
Applying the quadratic formula to solve for $\cos{x}$ , we get \[\cos{x} =\frac{2a\pm\sqrt{4a^2+4(4)(1+a)}}{8}\] and expanding the terms under the radical, we get \[\cos{x} =\frac{2a\pm\sqrt{4a^2+16a+16}}{8}\] Factoring, since $4a^2+16a+16 = (2a+4)^2$ , we can simplify our expression even further to \[\cos{x} =\frac{a\pm(a+2)}{4}\]
Now, solving for our two solutions, $\cos{x} = -\frac{1}{2}$ and $\cos{x} = \frac{a+1}{2}$
Since $\cos{x} = -\frac{1}{2}$ yields a solution that is valid for all $a$ , that being $x = \frac{2\pi}{3}$ , we must now solve for the case where $\frac{a+1}{2}$ yields a valid value.
As $x\in (0, \pi)$ $\cos{x}\in (-1, 1)$ , and therefore $\frac{a+1}{2}\in (-1, 1)$ , and $a\in(-3,1)$
There is one more case we must consider inside this interval though, the case where $\frac{a+1}{2} = -\frac{1}{2}$ , as this would lead to a double root for $\cos{x}$ , yielding only one valid solution for $x$ . Solving for this case, $a \ne -2$
Therefore, combining this fact with our solution interval, $a\in(-3, -2) \cup (-2, 1)$ , so the answer is $-3-2+1 = \boxed{4}$ | A | 4 |
e83c04373ea644ea4877be2197585eef | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_17 | Suppose $a$ is a real number such that the equation \[a\cdot(\sin{x}+\sin{(2x)}) = \sin{(3x)}\] has more than one solution in the interval $(0, \pi)$ . The set of all such $a$ that can be written
in the form \[(p,q) \cup (q,r),\] where $p, q,$ and $r$ are real numbers with $p < q< r$ . What is $p+q+r$
$\textbf{(A) } {-}4 \qquad \textbf{(B) } {-}1 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } 1 \qquad \textbf{(E) } 4$ | We can optimize from the step from \[a\cdot(1+2\cos{x})=4\cos^2{x}-1\] in solution 1 by writing
\[a = \frac{4\cos^2{x}-1}{1+2\cos{x}} = 2\cos x - 1\]
and then get \[\cos x = \frac{a+1}{2}.\]
Now, solving for our two solutions, $\cos{x} = -\frac{1}{2}$ and $\cos{x} = \frac{a+1}{2}$
Since $\cos{x} = -\frac{1}{2}$ yields a solution that is valid for all $a$ , that being $x = \frac{2\pi}{3}$ , we must now solve for the case where $\frac{a+1}{2}$ yields a valid value.
As $x\in (0, \pi)$ $\cos{x}\in (-1, 1)$ , and therefore $\frac{a+1}{2}\in (-1, 1)$ , and $a\in(-3,1)$
There is one more case we must consider inside this interval though, the case where $\frac{a+1}{2} = -\frac{1}{2}$ , as this would lead to a double root for $\cos{x}$ , yielding only one valid solution for $x$ . Solving for this case, $a \ne -2$
Therefore, combining this fact with our solution interval, $a\in(-3, -2) \cup (-2, 1)$ , so the answer is $-3-2+1 = \boxed{4}$ | A | 4 |
e83c04373ea644ea4877be2197585eef | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_17 | Suppose $a$ is a real number such that the equation \[a\cdot(\sin{x}+\sin{(2x)}) = \sin{(3x)}\] has more than one solution in the interval $(0, \pi)$ . The set of all such $a$ that can be written
in the form \[(p,q) \cup (q,r),\] where $p, q,$ and $r$ are real numbers with $p < q< r$ . What is $p+q+r$
$\textbf{(A) } {-}4 \qquad \textbf{(B) } {-}1 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } 1 \qquad \textbf{(E) } 4$ | Use the sum to product formula to obtain $2a\cdot\sin{\frac{3x}{2}}\cos{\frac{x}{2}}=\sin{3x}$ . Use the double angle formula on the RHS to obtain $a\cdot\sin{\frac{3x}{2}}\cos{\frac{x}{2}}=\sin{\frac{3x}{2}}\cos{\frac{3x}{2}}$ . From here, it is obvious that $x=\frac{2\pi}{3}$ is always a solution, and thus we divide by $\sin{\frac{3x}{2}}$ to get \[a\cdot\cos{\frac{x}{2}}=\cos{\frac{3x}{2}}\] We wish to find all $a$ such that there is at least one more solution to this equation distinct from $x=\frac{2\pi}{3}$ . Letting $y=\cos{\frac{x}{2}}$ , and noting that $\cos{\frac{3x}{2}}=4y^3-3y$ , we can rearrange our equation to $4y^3=y(3+a)$ The smallest value $x$ where $y=0$ is $\pi$ , which is not in our domain so we divide by $y$ to obtain $4y^2=a+3$ . By the trivial inequality, $a+3\ge{0}$ . Furthermore, $y\neq{0}$ , so $a+3>0$ . Also, if $a=-2$ , then the solution to this equation would be shared with $x=\frac{2\pi}{3}$ , so there would only be one distinct solution. Finally, because $y\le{1}$ due to the restrictions of a sine wave, and that $y\neq{1}$ due to the restrictions on $x$ , we have $-3<a<1$ with $a\neq{-2}$ . Thus, $p=-3,q=-2, r=1$ , so our final answer is $-3+(-2)+1=\boxed{4}$ | A | 4 |
65dd15be702c7a05b93ccacba5bded18 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 $T_1, T_2, T_3, \cdots, 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$ | Let $P=(r,\theta)$ be a point in polar coordinates, where $\theta$ is in degrees.
Rotating $P$ by $k^{\circ}$ counterclockwise around the origin gives the transformation $(r,\theta)\rightarrow(r,\theta+k^{\circ}).$ Reflecting $P$ across the $y$ -axis gives the transformation $(r,\theta)\rightarrow(r,180^{\circ}-\theta).$ Note that \begin{align*} T_k(P)&=(r,180^{\circ}-\theta-k^{\circ}), \\ T_{k+1}(T_k(P)) &= (r,\theta -1^{\circ}). \end{align*} We start with $(1,0^{\circ})$ in polar coordinates. For the sequence of transformations $T_1, T_2, T_3, \cdots, T_k,$ it follows that
The least such positive integer $k$ is $180.$ Therefore, the least such positive integer $n$ is $2k-1=\boxed{359}.$ | A | 359 |
65dd15be702c7a05b93ccacba5bded18 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 $T_1, T_2, T_3, \cdots, 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$ | Note that since we're reflecting across the $y$ -axis, if the point ever makes it to $(-1,0)$ then it will flip back to the original point. Note that after $T_1$ the point will be $1$ degree clockwise from the negative $x$ -axis. Applying $T_2$ will rotate it to be $1$ degree counterclockwise from the negative $x$ -axis, and then flip it so that it is $1$ degree clockwise from the positive $x$ -axis. Therefore, after every $2$ transformations, the point rotates $1$ degree clockwise. To rotate it so that it will rotate $179$ degrees clockwise will require $179 \cdot 2 = 358$ transformations. Then finally on the last transformation, it will rotate on to $(-1,0)$ and then flip back to its original position. Therefore, the answer is $358+1 = 359 = \boxed{359}$ | A | 359 |
65dd15be702c7a05b93ccacba5bded18 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 $T_1, T_2, T_3, \cdots, 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$ | In degrees:
Starting with $n=0$ , the sequence goes ${0}\rightarrow {179}\rightarrow {359}\rightarrow {178}\rightarrow {358}\rightarrow {177}\rightarrow {357}\rightarrow\cdots.$
We see that it takes $2$ steps to downgrade the point by $1^{\circ}$ . Since the $1$ st point in the sequence is ${179}$ , the answer is $1+2(179)=\boxed{359}.$ | A | 359 |
05ff7eade0686b9879adca7a3d5ea70b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 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$ | For $1\leq k\leq 12,$ suppose that cards $1, 2, \ldots, k$ are picked up on the first pass. It follows that cards $k+1,k+2,\ldots,13$ are picked up on the second pass.
Once we pick the spots for the cards on the first pass, there is only one way to arrange all $\boldsymbol{13}$ cards.
For each value of $k,$ there are $\binom{13}{k}-1$ ways to pick the $k$ spots for the cards on the first pass: We exclude the arrangement [asy] size(11cm); draw((0,0)--(2,0)--(2,3)--(0,3)--cycle); label("1", (1,1.5)); draw((3,0)--(5,0)--(5,3)--(3,3)--cycle); label("2", (4,1.5)); draw((6,0)--(8,0)--(8,3)--(6,3)--cycle); label("3", (7,1.5)); draw((9,0)--(11,0)--(11,3)--(9,3)--cycle); label("4", (10,1.5)); draw((12,0)--(14,0)--(14,3)--(12,3)--cycle); label("5", (13,1.5)); draw((15,0)--(17,0)--(17,3)--(15,3)--cycle); label("6", (16,1.5)); draw((18,0)--(20,0)--(20,3)--(18,3)--cycle); label("7", (19,1.5)); draw((21,0)--(23,0)--(23,3)--(21,3)--cycle); label("8", (22,1.5)); draw((24,0)--(26,0)--(26,3)--(24,3)--cycle); label("9", (25,1.5)); draw((27,0)--(29,0)--(29,3)--(27,3)--cycle); label("10", (28,1.5)); draw((30,0)--(32,0)--(32,3)--(30,3)--cycle); label("11", (31,1.5)); draw((33,0)--(35,0)--(35,3)--(33,3)--cycle); label("12", (34,1.5)); draw((36,0)--(38,0)--(38,3)--(36,3)--cycle); label("13", (37,1.5)); [/asy] in which the first pass consists of all $13$ cards.
Therefore, the answer is \[\sum_{k=1}^{12}\left[\binom{13}{k}-1\right] = \left[\sum_{k=1}^{12}\binom{13}{k}\right]-12 = \left[\sum_{k=0}^{13}\binom{13}{k}\right]-14 = 2^{13} - 14 = \boxed{8178}.\] | D | 8178 |
05ff7eade0686b9879adca7a3d5ea70b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 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$ | Since the $13$ cards are picked up in two passes, the first pass must pick up the first $n$ cards and the second pass must pick up the remaining cards $m$ through $13$ .
Also note that if $m$ , which is the card that is numbered one more than $n$ , is placed before $n$ , then $m$ will not be picked up on the first pass since cards are picked up in order. Therefore we desire $m$ to be placed before $n$ to create a second pass, and that after the first pass, the numbers $m$ through $13$ are lined up in order from least to greatest.
To construct this, $n$ cannot go in the $n$ th position because all cards $1$ to $n-1$ will have to precede it and there will be no room for $m$ . Therefore $n$ must be in slots $n+1$ to $13$ .
Let's do casework on which slot $n$ goes into to get a general idea for how the problem works.
Case 1: With $n$ in spot $n+1$ , there are $n$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve these slots for the $n-1$ cards is $\binom{n}{n-1}$ . Then there is only $1$ way to order these cards (since we want them in increasing order). Then card $m$ goes into whatever slot is remaining, and the $13-m$ cards are ordered in increasing order after slot $n+1$ , giving only $1$ way. Therefore in this case there are $\binom{n}{n-1}$ possibilities.
Case 2: With $n$ in spot $n+2$ , there are $n+1$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve slots for these cards are $\binom{n+1}{n-1}$ . Then there is one way to order these cards. Then cards $m$ and $m+1$ must go in the remaining two slots, and there is only one way to order them since they must be in increasing order. Finally, cards $m+2$ to $13$ will be ordered in increasing order after slot $n+1$ , which yields $1$ way. Therefore, this case has $\binom{n+1}{n-1}$ possibilities.
I think we can see a general pattern now. With $n$ in slot $x$ , there are $x-1$ slots to distribute to the previous $n-1$ cards, which can be done in $\binom{x-1}{n-1}$ ways. Then the remaining cards fill in in just $1$ way. Since the cases of $n$ start in slot $n+1$ and end in slot $13$ , this sum amounts to: \[\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\] for any $n$
Hmmm ... where have we seen this before?
We use wishful thinking to add a term of $\binom{n-1}{n-1}$ \[\binom{n-1}{n-1}+\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\]
This is just the hockey stick identity! Applying it, this expression is equal to $\binom{13}{n}$ . However, we added an extra term, so subtracting it off, the total number of ways to order the $13$ cards for any $n$ is \[\binom{13}{n}-1\]
Finally, to calculate the total for all $n$ , we sum from $n=0$ to $13$ . This yields us:
\[\sum_{n=0}^{13} \binom{13}{n}-1 \implies \sum_{n=0}^{13} \binom{13}{n} - \sum_{n=0}^{13} 1\] \[\implies 2^{13} - 14 = 8192 - 14 = 8178 = \boxed{8178}.\] | D | 8178 |
05ff7eade0686b9879adca7a3d5ea70b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 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$ | To solve this problem, we can use recursion on $n$ . Let $A_n$ be the number of arrangements for $n$ numbers. Now, let's look at how these arrangements are formed by case work on the first number $a_1$
If $a_1 = 1$ , the remaining $n-1$ numbers from $2$ to $n$ are arranged in the same way just like number 1 to $n-1$ in the case of $n-1$ numbers. So there are $A_{n-1}$ arrangements.
If $a_1 = 2$ , then we need to choose 1 position from position 2 to $n-1$ to put 1, and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{1}$ such arrangements.
If $a_1 = k$ , then we need to choose $k-1$ positions from position 2 to $n-1$ to put $1, 2,\cdots k-1$ , and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{k-1}$ such arrangements.
So we can write \[A_n = A_{n-1} + \binom{n-1}{1} + \binom{n-1}{2} + \cdots + \binom{n-1}{n-1}\] which can be simplified to \[A_n = A_{n-1} + 2^{n-1} - 1\] We can solve this recursive sequence by summing up $n-1$ lines of the recursive formula \[A_n - A_{n-1} = 2^{n-1} - 1\] \[A_{n-1} - A_{n-2} = 2^{n-2} - 1\] \[\cdots\] \[A_2 - A_{1} = 2^{1} - 1\] to get \[A_n - A_1 = \sum_{k=1}^{n-1} (2^k - 1) = 2^n - 2 - (n-1) = 2^n - n - 1\] since $A_1=0$ , we have \[A_n = 2^n - n - 1\] and $A_{13} = 2^{13} - 14 = \boxed{8178}$ | D | 8178 |
05ff7eade0686b9879adca7a3d5ea70b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 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$ | When we have $3$ cards arranged in a row, after listing out all possible arrangements, we see that we have $4$ ones: $(1, 3, 2), (2, 1, 3), (2, 3, 1),$ and $(3, 1, 2)$ . When we have $4$ cards, we find $11$ possible arrangements: $(1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (2, 1, 3, 4), (2, 3, 1, 4), (2, 3, 4, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 4, 1, 2),$ and $(4, 1, 2, 3).$ Hence, we recognize the pattern that for $n$ cards, we have $2^n - n - 1$ valid arrangements, so our answer is $2^{13} - 13 - 1 = \boxed{8178}.$ ~eibc | D | 8178 |
05ff7eade0686b9879adca7a3d5ea70b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19 | Suppose that $13$ cards numbered $1, 2, 3, \ldots, 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$ | Notice that for each card "position", we can choose for it to be picked up on the first or second pass, for a total of $2^{13}$ options. However, if all of the cards selected to be picked up first are before all of the cards to be picked up second, then this means that the list is in consecutive ascending order (and thus all cards will be picked up on the first pass instead). This can happen in 14 ways, so our answer is $2^{13}-14=\boxed{8178}$ | D | 8178 |
8b26f0584a2e22e76ab99c24f14cfa3e | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_22 | Let $c$ be a real number, and let $z_1$ and $z_2$ be the two complex numbers satisfying the equation $z^2 - cz + 10 = 0$ . Points $z_1$ $z_2$ $\frac{1}{z_1}$ , and $\frac{1}{z_2}$ are the vertices of (convex) quadrilateral $\mathcal{Q}$ in the complex plane. When the area of $\mathcal{Q}$ obtains its maximum possible value, $c$ is closest to which of the following?
$\textbf{(A) }4.5 \qquad\textbf{(B) }5 \qquad\textbf{(C) }5.5 \qquad\textbf{(D) }6\qquad\textbf{(E) }6.5$ | Because $c$ is real, $z_2 = \bar z_1$ .
We have \begin{align*} 10 & = z_1 z_2 \\ & = z_1 \bar z_1 \\ & = |z_1|^2 , \end{align*} where the first equality follows from Vieta's formula.
Thus, $|z_1| = \sqrt{10}$
We have \begin{align*} c & = z_1 + z_2 \\ & = z_1 + \bar z_1 \\ & = 2 {\rm Re}(z_1), \end{align*} where the first equality follows from Vieta's formula.
Thus, ${\rm Re}(z_1) = \frac{c}{2}$
We have \begin{align*} \frac{1}{z_1} & = \frac{1}{10}\cdot\frac{10}{z_1} \\ & = \frac{1}{10}\cdot\frac{z_1 z_2}{z_1} \\ & = \frac{z_2}{10} \\ & = \frac{\bar z_1}{10}. \end{align*} where the second equality follows from Vieta's formula.
We have \begin{align*} \frac{1}{z_2} & = \frac{1}{10}\cdot\frac{10}{z_2} \\ & = \frac{1}{10}\cdot\frac{z_1 z_2}{z_2} \\ & = \frac{z_1}{10}. \end{align*} where the second equality follows from Vieta's formula.
Therefore, \begin{align*} {\rm Area} \ Q & = \frac{1}{2} \left| {\rm Re}(z_1) \right| \cdot 2 \left| {\rm Im}(z_1) \right| \cdot \left( 1 - \frac{1}{10^2} \right) \\ & = \frac{1}{2} |c| \sqrt{10 - \frac{c^2}{4}} \left( 1 - \frac{1}{10^2} \right) \\ & = \frac{1 - \frac{1}{10^2}}{4} \sqrt{c^2 \left( 40 - c^2 \right)} \\ & \leq \frac{1 - \frac{1}{10^2}}{4} \cdot \frac{c^2 + \left( 40 - c^2 \right)}{2} \\ & = \frac{1 - \frac{1}{10^2}}{4} \cdot 20 , \end{align*} where the inequality follows from the AM-GM inequality, and it is augmented to an equality if and only if $c^2 = 40 - c^2$ .
Thus, $|c| = 2 \sqrt{5} \approx \boxed{4.5}$ | A | 4.5 |
8b26f0584a2e22e76ab99c24f14cfa3e | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_22 | Let $c$ be a real number, and let $z_1$ and $z_2$ be the two complex numbers satisfying the equation $z^2 - cz + 10 = 0$ . Points $z_1$ $z_2$ $\frac{1}{z_1}$ , and $\frac{1}{z_2}$ are the vertices of (convex) quadrilateral $\mathcal{Q}$ in the complex plane. When the area of $\mathcal{Q}$ obtains its maximum possible value, $c$ is closest to which of the following?
$\textbf{(A) }4.5 \qquad\textbf{(B) }5 \qquad\textbf{(C) }5.5 \qquad\textbf{(D) }6\qquad\textbf{(E) }6.5$ | Since $c$ , which is the sum of roots $z_1$ and $z_2$ , is real, $z_1=\overline{z_2}$
Let $z_1=a+bi$ . Then $z_2=a-bi$ . Note that the product of the roots is $10$ by Vieta's, so $z_1z_2=(a+bi)(a-bi)=a^2+b^2=10$
Thus, $\frac{1}{z_1}=\frac{1}{a-bi}\cdot\frac{a+bi}{a+bi}=\frac{a+bi}{a^2+b^2}=\frac{a+bi}{10}$ . With the same process, $\frac{1}{z_2}=\frac{a-bi}{10}$
So, our four points are $a+bi,\frac{a+bi}{10},a-bi,$ and $\frac{a-bi}{10}$ . WLOG let $a+bi$ be in the first quadrant and graph these four points on the complex plane. Notice how quadrilateral Q is a trapezoid with the real axis as its axis of symmetry. It has a short base with endpoints $\frac{a+bi}{10}$ and $\frac{a-bi}{10}$ , so its length is $\left|\frac{a+bi}{10} - \frac{a-bi}{10}\right| =\frac{b}{5}$ . Likewise, its long base has endpoints $a+bi$ and $a-bi$ , so its length is $|(a+bi)-(a-bi)|=2b$
The height, which is the distance between the two lines, is the difference between the real values of the two bases $\implies h= a-\frac{a}{10}=\frac{9a}{10}$
Plugging these into the area formula for a trapezoid, we are trying to maximize $\frac12\cdot\left(2b+\frac{b}{5}\right)\cdot\frac{9a}{10}=\frac{99ab}{100}$ . Thus, the only thing we need to maximize is $ab$
With the restriction that $a^2+b^2=(a-b)^2+2ab=10$ $ab$ is maximized when $a=b=\sqrt{5}$
Remember, $c$ is the sum of the roots, so $c=z_1+z_2=2a=2\sqrt5=\sqrt{20}\approx\boxed{4.5}$ | null | 4.5 |
8b26f0584a2e22e76ab99c24f14cfa3e | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_22 | Let $c$ be a real number, and let $z_1$ and $z_2$ be the two complex numbers satisfying the equation $z^2 - cz + 10 = 0$ . Points $z_1$ $z_2$ $\frac{1}{z_1}$ , and $\frac{1}{z_2}$ are the vertices of (convex) quadrilateral $\mathcal{Q}$ in the complex plane. When the area of $\mathcal{Q}$ obtains its maximum possible value, $c$ is closest to which of the following?
$\textbf{(A) }4.5 \qquad\textbf{(B) }5 \qquad\textbf{(C) }5.5 \qquad\textbf{(D) }6\qquad\textbf{(E) }6.5$ | Like the solutions above we can know that $|z_1| = |z_2| = \sqrt{10}$ and $z_1=\overline{z_2}$
Let $z_1=\sqrt{10}e^{i\theta}$ where $0<\theta<\pi$ , then $z_2=\sqrt{10}e^{-i\theta}$ $\frac{1}{z_1}=\frac{1}{\sqrt{10}}e^{-i\theta}$ $\frac{1}{z_2}= \frac{1}{\sqrt{10}}e^{i\theta}$
On the basis of symmetry, the area $A$ of $\mathcal{Q}$ is the difference between two isoceles triangles,so
$2A=10\sin2\theta-\frac{1}{10}\sin2\theta\leq10-\frac{1}{10}$ . The inequality holds when $2\theta=\frac{\pi}{2}$ , or $\theta=\frac{\pi}{4}$
Thus, $c= 2 {\rm Re} \ z_1 =2 \sqrt{10} \cos\frac{\pi}{4}=\sqrt{20} \approx \boxed{4.5}$ | A | 4.5 |
8b26f0584a2e22e76ab99c24f14cfa3e | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_22 | Let $c$ be a real number, and let $z_1$ and $z_2$ be the two complex numbers satisfying the equation $z^2 - cz + 10 = 0$ . Points $z_1$ $z_2$ $\frac{1}{z_1}$ , and $\frac{1}{z_2}$ are the vertices of (convex) quadrilateral $\mathcal{Q}$ in the complex plane. When the area of $\mathcal{Q}$ obtains its maximum possible value, $c$ is closest to which of the following?
$\textbf{(A) }4.5 \qquad\textbf{(B) }5 \qquad\textbf{(C) }5.5 \qquad\textbf{(D) }6\qquad\textbf{(E) }6.5$ | Like in Solution 3, we find that $Q = \frac12\cdot\left(2b+\frac{b}{5}\right)\cdot\frac{9a}{10}= \frac{99}{100}ab$ , thus, $Q$ is maximized when $ab$ is maximized. $ab = a \cdot \sqrt{10 - a^2} = \sqrt{10a^2 - a^4}$ , let $f(a) = \sqrt{10a^2 - a^4}$
By the Chain Rule and the Power Rule, $f'(a) = \frac12 \cdot (10a^2 - a^4)^{-\frac12} \cdot (10(2a)-4a^3)) = \frac{20a-4a^3}{ 2\sqrt{10a^2 - a^4} } = \frac{10a-2a^3}{ \sqrt{10a^2 - a^4} }$
$f'(a) = 0$ $10a-2a^3 = 0$ $a \neq 0$ $a^2 = 5$ $a = \sqrt{5}$
$\because f'(a) = 0$ when $a = \sqrt{5}$ $f'(a)$ is positive when $a < \sqrt{5}$ , and $f'(a)$ is negative when $a > \sqrt{5}$
$\therefore f(a)$ has a local maximum when $a = \sqrt{5}$
Notice that $ab = \frac{ (a+b)^2 - (a^2+b^2) }{2} = \frac{c^2 - 10}{2}$ $\frac{c^2 - 10}{2} = 5$ $c = \sqrt{2 \cdot 5 + 10} = \sqrt{20} \approx \boxed{4.5}$ | A | 4.5 |
df53d911b93e1757ec9b8cb688470c4a | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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, \ldots, n$ . For how many integers 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$ | We are given that \[\sum_{i=1}^{n}\frac1i = \frac{1}{L_n}\sum_{i=1}^{n}\frac{L_n}{i} = \frac{h_n}{k_n}.\] Since $k_n < L_n,$ we need $\gcd\left(\sum_{i=1}^{n}\frac{L_n}{i}, L_n\right)>1.$
For all primes $p$ such that $p\leq n,$ let $v_p(L_n)=e\geq1$ be the largest power of $p$ that is a factor of $L_n.$
It is clear that $L_n\equiv0\pmod{p},$ so we test whether $\sum_{i=1}^{n}\frac{L_n}{i}\equiv0\pmod{p}.$ Note that \[\sum_{i=1}^{n}\frac{L_n}{i} \equiv \sum_{i=1}^{\left\lfloor\tfrac{n}{p^e}\right\rfloor}\frac{L_n}{ip^e} \ (\operatorname{mod} \ p^e) \equiv \sum_{i=1}^{\left\lfloor\tfrac{n}{p^e}\right\rfloor}\frac{L_n}{ip^e} \ (\operatorname{mod} \ p).\] We construct the following table for $v_p(L_n)=e:$ \[\begin{array}{c|c|l|c} \textbf{Case of }\boldsymbol{(p,e)} & \textbf{Interval of }\boldsymbol{n} & \hspace{22.75mm}\textbf{Sum} & \boldsymbol{\stackrel{?}{\equiv}0\ (\operatorname{mod} \ p)} \\ [0.5ex] \hline\hline & & & \\ [-2ex] (2,1) & [2,3] & L_n/2 & \\ (2,2) & [4,7] & L_n/4 & \\ (2,3) & [8,15] & L_n/8 & \\ (2,4) & [16,22] & L_n/16 & \\ [0.5ex] \hline & & & \\ [-2ex] (3,1) & [3,5] & L_n/3 & \\ & [6,8] & L_n/3 + L_n/6 & \checkmark \\ (3,2) & [9,17] & L_n/9 & \\ & [18,22] & L_n/9 + L_n/18 & \checkmark \\ [0.5ex] \hline & & & \\ [-2ex] (5,1) & [5,9] & L_n/5 & \\ & [10,14] & L_n/5 + L_n/10 & \\ & [15,19] & L_n/5 + L_n/10 + L_n/15 & \\ & [20,22] & L_n/5 + L_n/10 + L_n/15 + L_n/20 & \checkmark \\ [0.5ex] \hline & & & \\ [-2ex] (7,1) & [7,13] & L_n/7 & \\ & [14,20] & L_n/7 + L_n/14 & \\ & [21,22] & L_n/7 + L_n/14 + L_n/21 & \\ [0.5ex] \hline & & & \\ [-2ex] (11,1) & [11,21] & L_n/11 & \\ & \{22\} & L_n/11 + L_n/22 & \\ [0.5ex] \hline & & & \\ [-2ex] (13,1) & [13,22] & L_n/13 & \\ [0.5ex] \hline & & & \\ [-2ex] (17,1) & [17,22] & L_n/17 & \\ [0.5ex] \hline & & & \\ [-2ex] (19,1) & [19,22] & L_n/19 & \\ [0.5ex] \end{array}\] Note that:
Together, there are $\boxed{8}$ such integers $n,$ namely \[6,7,8,18,19,20,21,22.\] ~MRENTHUSIASM | D | 8 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | For some $n$ , let there be $n+1$ parking spaces counterclockwise in a circle. Consider a string of $n$ integers $c_1c_2 \ldots c_n$ each between $0$ and $n$ , and let $n$ cars come into this circle so that the $i$ th car tries to park at spot $c_i$ , but if it is already taken then it instead keeps going counterclockwise and takes the next available spot. After this process, exactly one spot will remain empty.
Then the strings of $n$ numbers between $0$ and $n-1$ that contain at least $k$ integers $<k$ for $1 \leq k \leq n$ are exactly the set of strings that leave spot $n$ empty. Also note for any string $c_1c_2 \ldots c_n$ , we can add $1$ to each $c_i$ (mod $n+1$ ) to shift the empty spot counterclockwise, meaning for each string there exists exactly one $j$ with $0 \leq j \leq n$ so that $(c_1+j)(c_2+j) \ldots (c_n+j)$ leaves spot $n$ empty. This gives there are $\frac{(n+1)^{n}}{n+1} = (n+1)^{n-1}$ such strings.
Plugging in $n = 5$ gives $\boxed{1296}$ such strings. | E | 1296 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | Note that a valid string must have at least one $0.$
We perform casework on the number of different digits such strings can have. For each string, we list the digits in ascending order, then consider permutations:
Together, the answer is $1+75+500+600+120=\boxed{1296}.$ | E | 1296 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | Denote by $N \left( p, q \right)$ the number of $p$ -digit strings formed by using numbers $0, 1, \cdots, q$ , where for each $j \in \{1,2, \cdots , q\}$ , at least $j$ of the digits are less than $j$
We have the following recursive equation: \[N \left( p, q \right) = \sum_{i = 0}^{p - q} \binom{p}{i} N \left( p - i, q - 1 \right) , \ \forall \ p \geq q \mbox{ and } q \geq 1\] and the boundary condition $N \left( p, 0 \right) = 1$ for any $p \geq 0$
By solving this recursive equation, for $q = 1$ and $p \geq q$ , we get \begin{align*} N \left( p , 1 \right) & = \sum_{i = 0}^{p - 1} \binom{p}{i} N \left( p - i, 0 \right) \\ & = \sum_{i = 0}^{p - 1} \binom{p}{i} \\ & = \sum_{i = 0}^p \binom{p}{i} - \binom{p}{p} \\ & = 2^p - 1 . \end{align*}
For $q = 2$ and $p \geq q$ , we get \begin{align*} N \left( p , 2 \right) & = \sum_{i = 0}^{p - 2} \binom{p}{i} N \left( p - i, 1 \right) \\ & = \sum_{i = 0}^{p - 2} \binom{p}{i} \left( 2^{p - i} - 1 \right) \\ & = \sum_{i = 0}^p \binom{p}{i} \left( 2^{p - i} - 1 \right) - \sum_{i = p - 1}^p \binom{p}{i} \left( 2^{p - i} - 1 \right) \\ & = \sum_{i = 0}^p \left( \binom{p}{i} 1^i 2^{p - i} - \binom{p}{i} 1^i 1^{p - i} \right) - p \\ & = \left( 1 + 2 \right)^p - \left( 1 + 1 \right)^p - p \\ & = 3^p - 2^p - p . \end{align*}
For $q = 3$ and $p \geq q$ , we get \begin{align*} N \left( p , 3 \right) & = \sum_{i = 0}^{p - 3} \binom{p}{i} N \left( p - i, 2 \right) \\ & = \sum_{i = 0}^{p - 3} \binom{p}{i} \left( 3^{p - i} - 2^{p - i} - \left( p - i \right) \right) \\ & = \sum_{i = 0}^p \binom{p}{i} \left( 3^{p - i} - 2^{p - i} - \left( p - i \right) \right) - \sum_{i = p - 2}^p \binom{p}{i} \left( 3^{p - i} - 2^{p - i} - \left( p - i \right) \right) \\ & = \sum_{i = 0}^p \left( \binom{p}{i} 1^i 3^{p - i} - \binom{p}{i} 1^i 2^{p - i} - \binom{p}{i} \left( p - i \right) \right) - \frac{3}{2} p \left( p - 1 \right) \\ & = \left( 1 + 3 \right)^p - \left( 1 + 2 \right)^p - \frac{d \left( 1 + x \right)^p}{dx} \bigg|_{x = 1} - \frac{3}{2} p \left( p - 1 \right) \\ & = 4^p - 3^p - 2^{p-1} p - \frac{3}{2} p \left( p - 1 \right) . \end{align*}
For $q = 4$ and $p = 5$ , we get \begin{align*} N \left( 5 , 4 \right) & = \sum_{i = 0}^1 \binom{5}{i} N \left( 5 - i , 3 \right) \\ & = N \left( 5 , 3 \right) + 5 N \left( 4 , 3 \right) \\ & = \boxed{1296} | E | 1296 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | The number of strings is $(n+1)^{(n-1)}$ as shown by Solution 1 (Parking Function), which is always equivalent to 1 (mod n). Thus you can choose $\boxed{1296}$ | E | 1296 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | Solution 4 tried to observe the answer modulo $5$ to easily solve the problem, but apparently had faulty logic. This solution is still completely viable though:
Notice that for any valid set $\{a_1, a_2, a_3, a_4, a_5\}$ , if there is at least one element in the set that is unique (i.e. there is at least one digit in the set that is found nowhere else in the set), then the number of distinct permutations of the set is clearly divisible by $5$ . Therefore to evaluate the answer modulo $5$ , we only need to look at sets where each element has a multiplicity of at least $2$ (i.e. appears twice or more in the set).
These sets are of the form $\{a,a,b,b,b\}$ and $\{a,a,a,a,a\}$ . The first set can be permuted in $\binom{5}{2,3}=10 \equiv 0\pmod{5}$ , and the second set can be permuted one way, and the only set of the form $\{a,a,a,a,a\}$ is $\{0,0,0,0,0\}$ . Therefore the answer is congruent to $1\pmod{5}$ and you CAN choose $\boxed{1296}$ | E | 1296 |
be7b0ba93d2022d618d8dcc167740e52 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_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 this 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$ | We list out all possibilities for the string, sorted in increasing order. Note that 1 cannot appear before the 2nd position, 2 cannot appear before the 3rd position, and so on. We also make a list of the number of possible permutations of each sorted string.
00000 - 1
00001 - 5
00002 - 5
00003 - 5
00004 - 5
00011 - 10
00012 - 20
00013 - 20
00014 - 20
00022 - 10
00023 - 20
00024 - 20
00033 - 10
00034 - 20
00111 - 10
00112 - 30
00113 - 30
00114 - 30
00122 - 30
00123 - 60
00124 - 60
00133 - 30
00134 - 60
00222 - 10
00223 - 30
00224 - 30
00233 - 30
00234 - 60
01111 - 5
01112 - 20
01113 - 20
01114 - 20
01122 - 30
01123 - 60
01124 - 60
01133 - 30
01134 - 60
01222 - 20
01223 - 60
01224 - 60
01233 - 60
01234 - 120
Finally, adding all of these up, we obtain $1\cdot 1+5\cdot 5+5\cdot 10+10\cdot 20+10\cdot 30 + 10\cdot 60 + 1\cdot 120 = \boxed{1296}$ . (Or alternatively, we could notice as in solution 5 that the only possible string with only 1 permutation is 00000, and thus the answer must be congruent to 1 modulo 5) | E | 1296 |
a7c41d53d75cac888ff1eeb77184e013 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_25 | A circle with integer radius $r$ is centered at $(r, r)$ . Distinct line segments of length $c_i$ connect points $(0, a_i)$ to $(b_i, 0)$ for $1 \le i \le 14$ and are tangent to the circle, where $a_i$ $b_i$ , and $c_i$ are all positive integers and $c_1 \le c_2 \le \cdots \le c_{14}$ . What is the ratio $\frac{c_{14}}{c_1}$ for the least possible value of $r$
$\textbf{(A)} ~\frac{21}{5} \qquad\textbf{(B)} ~\frac{85}{13} \qquad\textbf{(C)} ~7 \qquad\textbf{(D)} ~\frac{39}{5} \qquad\textbf{(E)} ~17$ | Suppose that with a pair $(a_i,b_i)$ the circle is an excircle. Then notice that the hypotenuse must be $(r-x)+(r-y)$ , so it must be the case that \[a_i^2+b_i^2=(2r-a_i-b_i)^2.\] Similarly, if with a pair $(a_i,b_i)$ the circle is an incircle, the hypotenuse must be $(x-r)+(y-r)$ , leading to the same equation.
Notice that this equation can be simplified through SFFT to \[(a_i-2r)(b_i-2r)=2r^2.\] Thus, we want the smallest $r$ such that this equation has at least $14$ distinct pairs $(a_i,b_i)$ for which this holds. The obvious choice to check is $r=6$ . In this case, since $2r^2=2^3\cdot 3^2$ has $12$ positive factors, we get $12$ pairs, and we get another two if the factors are $-8,-9$ or vice versa. One can check that for smaller values of $r$ , we do not even get close to $14$ possible pairs.
When $r=6$ , the smallest possible $c$ -value is clearly when the factors are negative. When this occurs, $a_i=4, b_i=3$ (or vice versa), so the mimimal $c$ is $5$ . The largest possible $c$ -value occurs when the largest of $a_i$ and $b_i$ are maximized. This occurs when the factors are $72$ and $1$ , leading to $a_i=84, b_i=13$ (or vice-versa), leading to a maximal $c$ of $85$
Hence the answer is $\frac{85}5=\boxed{17}$ | null | 17 |
a7c41d53d75cac888ff1eeb77184e013 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_25 | A circle with integer radius $r$ is centered at $(r, r)$ . Distinct line segments of length $c_i$ connect points $(0, a_i)$ to $(b_i, 0)$ for $1 \le i \le 14$ and are tangent to the circle, where $a_i$ $b_i$ , and $c_i$ are all positive integers and $c_1 \le c_2 \le \cdots \le c_{14}$ . What is the ratio $\frac{c_{14}}{c_1}$ for the least possible value of $r$
$\textbf{(A)} ~\frac{21}{5} \qquad\textbf{(B)} ~\frac{85}{13} \qquad\textbf{(C)} ~7 \qquad\textbf{(D)} ~\frac{39}{5} \qquad\textbf{(E)} ~17$ | Case 1: The tangent and the origin are on the opposite sides of the circle.
In this case, $a, b > 2r$
We can easily prove that \[a + b - 2 r = c . \hspace{1cm} (1)\]
Recall that $c = \sqrt{a^2 + b^2}$
Taking square of (1) and reorganizing all terms, (1) is converted as \[\left( a - 2 r \right) \left( b - 2 r \right) = 2 r^2 .\]
Case 2: The tangent and the origin are on the same sides of the circle.
In this case, $0 < a, b < r$
We can easily prove that \[2 r - a - b = c . \hspace{1cm} (2)\]
Recall that $c = \sqrt{a^2 + b^2}$
Taking square of (2) and reorganizing all terms, (2) is converted as \[\left( a - 2 r \right) \left( b - 2 r \right) = 2 r^2 .\]
Putting both cases together, for given $r$ , we look for solutions of $a$ and $b$ satisfying \[\left( a - 2 r \right) \left( b - 2 r \right) = 2 r^2 ,\] with either $a, b > 2r$ or $0 < a, b < r$
Now, we need to find the smallest $r$ , such that the number of feasible solutions of $(a, b)$ is at least 14.
For equation \[uv = 2 r^2 ,\] we observe that the R.H.S. is a not a perfect square. Thus, the number of positive $(u, v)$ is equal to the number of positive divisors of $2 r^2$
Second, for each feasible positive solution $(u, v)$ , its opposite $(-u, -v)$ is also a solution. However, $(u,v)$ corresponds to a feasible solution if $(a, b)$ with $a = u + 2r$ and $b = v + 2r$ , but $(-u, -v)$ may not lead to a feasible solution if $(a, b)$ with $a = 2 r - u$ and $b = 2 r - v$
Recall that we are looking for $r$ that leads to at least 14 solutions.
Therefore, the above observations imply that we must have $r$ , such that $2 r^2$ has least 7 positive divisors.
Following this guidance, we find the smallest $r$ is 6. This leads to the following solutions:
$\left( a_1, b_1, c_1 \right) = \left( 3, 4, 5 \right)$ $\left( a_2, b_2, c_2 \right) = \left( 4, 3, 5 \right)$
$\left( a_3, b_3, c_3 \right) = \left( 20, 21, 29 \right)$ $\left( a_4, b_4, c_4 \right) = \left( 21, 20, 29 \right)$
$\left( a_5, b_5, c_5 \right) = \left( 18, 24, 30 \right)$ $\left( a_6, b_6, c_6 \right) = \left( 24, 18, 30 \right)$
$\left( a_7, b_7, c_7 \right) = \left( 16, 30, 34 \right)$ $\left( a_8, b_8, c_8 \right) = \left( 30, 16, 34 \right)$
$\left( a_9, b_9, c_9 \right) = \left( 15, 36, 39 \right)$ $\left( a_{10}, b_{10}, c_{10} \right) = \left( 36, 15, 39 \right)$
$\left( a_{11}, b_{11}, c_{11} \right) = \left( 14, 48, 50 \right)$ $\left( a_{12}, b_{12}, c_{12} \right) = \left( 48, 14, 50 \right)$
$\left( a_{13}, b_{13}, c_{13} \right) = \left( 13, 84, 85 \right)$ $\left( a_{14}, b_{14}, c_{14} \right) = \left( 84, 13, 85 \right)$
Therefore, $\frac{c_{14}}{c_1} = \boxed{17}$ | E | 17 |
a7c41d53d75cac888ff1eeb77184e013 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_25 | A circle with integer radius $r$ is centered at $(r, r)$ . Distinct line segments of length $c_i$ connect points $(0, a_i)$ to $(b_i, 0)$ for $1 \le i \le 14$ and are tangent to the circle, where $a_i$ $b_i$ , and $c_i$ are all positive integers and $c_1 \le c_2 \le \cdots \le c_{14}$ . What is the ratio $\frac{c_{14}}{c_1}$ for the least possible value of $r$
$\textbf{(A)} ~\frac{21}{5} \qquad\textbf{(B)} ~\frac{85}{13} \qquad\textbf{(C)} ~7 \qquad\textbf{(D)} ~\frac{39}{5} \qquad\textbf{(E)} ~17$ | As $c_i$ is the length of the segment $(0,a_i)$ and $(b_i,0)$ $a_i^2+b_i^2=c_i^2$ . The equation for the line that passes through $(0,a_i)$ and $(b_i,0)$ is $a_ix+b_iy-a_ib_i=0$
By the point-line distance formula from point $(r,r)$ to line $a_ix+b_iy-a_ib_i=0$
\[r = \frac{ |a_ir+b_ir-a_ib_i| }{ \sqrt{a_i^2+b_i^2} }, \quad c_i = \frac{ |a_ir+b_ir-a_ib_i| }{r} = |a_i+b_i- \frac{a_ib_i}{r}|\]
\[\because c_i \quad \text{is an integer}, \quad \therefore r|a_ib_i\]
To find $c_1$ and $c_{14}$ for the smallest $r$ , we will list Pythagorean triples $(a_i,b_i,c_i)$ with relatively prime elements from the smallest. Notice that we only need to find $7$ triples with $a_i<b_i$ , the $7$ other triples will simply be $(b_i,a_i,c_i)$ $a_i$ will not equal $b_i$ because then $c_i = a_i \cdot \sqrt{2}$ , meaning that $a_i$ $b_i$ , and $c_i$ cannot all be integers.
The $7$ smallest triples are: $(3,4,5)$ $(5,12,13)$ $(7,24,25)$ $(8,15,17)$ $(11,60,61)$ $(12,35,37)$ $(13,84,85)$
Therefore, $\frac{c_{14}}{c_1} = \frac{85}{5} = \boxed{17}$ | E | 17 |
2a208317814e143623bcb0de0ececef2 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_1 | Define $x\diamond y$ to be $|x-y|$ for all real numbers $x$ and $y.$ What is the value of \[(1\diamond(2\diamond3))-((1\diamond2)\diamond3)?\]
$\textbf{(A)}\ {-}2 \qquad \textbf{(B)}\ {-}1 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$ | We have \begin{align*} (1\diamond(2\diamond3))-((1\diamond2)\diamond3) &= |1-|2-3|| - ||1-2|-3| \\ &= |1-1| - |1-3| \\ &= 0-2 \\ &= \boxed{2} ~MRENTHUSIASM | A | 2 |
2a208317814e143623bcb0de0ececef2 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_1 | Define $x\diamond y$ to be $|x-y|$ for all real numbers $x$ and $y.$ What is the value of \[(1\diamond(2\diamond3))-((1\diamond2)\diamond3)?\]
$\textbf{(A)}\ {-}2 \qquad \textbf{(B)}\ {-}1 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$ | Observe that the $\diamond$ function is simply the positive difference between two numbers. Thus, we evaluate: the difference between $2$ and $3$ is $1;$ the difference between $1$ and $1$ is $0;$ the difference between $1$ and $2$ is $1;$ the difference between $1$ and $3$ is $2;$ and finally, $0-2=\boxed{2}.$ | A | 2 |
d972ec98bcd704ac3ca4eaf6409d69e3 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_2 | In rhombus $ABCD$ , point $P$ lies on segment $\overline{AD}$ so that $\overline{BP}$ $\perp$ $\overline{AD}$ $AP = 3$ , and $PD = 2$ . What is the area of $ABCD$ ? (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]
$\textbf{(A) }3\sqrt 5 \qquad \textbf{(B) }10 \qquad \textbf{(C) }6\sqrt 5 \qquad \textbf{(D) }20\qquad \textbf{(E) }25$ | [asy] pair A = (0,0); label("$A$", A, SW); pair B = (2.25,3); label("$B$", B, NW); pair C = (6,3); label("$C$", C, NE); pair D = (3.75,0); label("$D$", D, SE); pair P = (2.25,0); label("$P$", P, S); draw(A--B--C--D--cycle); draw(P--B); draw(rightanglemark(B,P,D)); [/asy]
\[\textbf{Figure redrawn to scale.}\]
$AD = AP + PD = 3 + 2 = 5$
$ABCD$ is a rhombus, so $AB = AD = 5$
$\bigtriangleup APB$ is a $3-4-5$ right triangle, hence $BP = 4$
The area of the rhombus is base times height: $bh = (AD)(BP) = 5 \cdot 4 = \boxed{20}$ | D | 20 |
d972ec98bcd704ac3ca4eaf6409d69e3 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_2 | In rhombus $ABCD$ , point $P$ lies on segment $\overline{AD}$ so that $\overline{BP}$ $\perp$ $\overline{AD}$ $AP = 3$ , and $PD = 2$ . What is the area of $ABCD$ ? (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]
$\textbf{(A) }3\sqrt 5 \qquad \textbf{(B) }10 \qquad \textbf{(C) }6\sqrt 5 \qquad \textbf{(D) }20\qquad \textbf{(E) }25$ | [asy] pair A = (0,0); label("$A$", A, SW); pair B = (2.25,3); label("$B$", B, NW); pair C = (6,3); label("$C$", C, NE); pair D = (3.75,0); label("$D$", D, SE); pair P = (2.25,0); label("$P$", P, S); draw(A--B--C--D--cycle); draw(D--B); draw(B--P); draw(rightanglemark(B,P,D)); [/asy]
The diagram is from as Solution 1, but a line is constructed at $BD$
When it comes to the sides of a rhombus, their opposite sides are congruent and parallel. This means that $\angle ABD \cong \angle BDC$ , by the Alternate Interior Angles Theorem.
By SAS Congruence, we get $\triangle ABD \cong \triangle BDC$
Since $AP=3$ and $AB=5$ , we know that $BP=4$ because $\triangle APB$ is a 3-4-5 right triangle, as stated in Solution 1.
The area of $\triangle ABD$ would be $10$ , since the area of the triangle is $\frac{bh}{2}$
Since we know that $\triangle ABD \cong \triangle BDC$ and that $ABCD=\triangle ABD + \triangle BDC$ , so we can double the area of $\triangle ADB$ to get $10 \cdot 2 = \boxed{20}$ | D | 20 |
b977259b2636c191cb4043f52690218f | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_3 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | The $n$ th term of this sequence is \[\sum_{k=n}^{2n}10^k + \sum_{k=0}^{n}10^k = 10^n\sum_{k=0}^{n}10^k + \sum_{k=0}^{n}10^k = \left(10^n+1\right)\sum_{k=0}^{n}10^k.\] It follows that the terms are \begin{align*} 121 &= 11\cdot11, \\ 11211 &= 101\cdot111, \\ 1112111 &= 1001\cdot1111, \\ & \ \vdots \end{align*} Therefore, there are $\boxed{0}$ prime numbers in this sequence. | A | 0 |
b977259b2636c191cb4043f52690218f | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_3 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Denote this sequence as $a_{n}$ , then we can find that \begin{align*} a_{1} &= 121 = 10^2 + 2\cdot10 + 1 = (10^2 + 10) + (10 + 1), \\ a_{2} &= 11211 = (10^4 + 10^3 + 10^2) + (10^2 + 10 + 1), \\ a_{3} &= 1112111 = (10^6 + 10^5 + 10^4 + 10^3) + (10^3 + 10^2 + 10 + 1), \\ & \ \vdots \end{align*} So, we can induct that the general term is \begin{align*} a_n &= (10^{2n} + 10^{2n-1} + \ldots + 10^{n+1} + 10^n) + (10^n + 10^{n-1} + \ldots +10 + 1) \\ &= 10^n\cdot(10^n + 10^{n-1} + \ldots +10 + 1) + (10^n + 10^{n-1} + \ldots +10 + 1) \\ &= \left(10^n+1\right)\sum_{k=0}^{n}10^k. \end{align*} Therefore, there are $\boxed{0}$ prime numbers in this sequence. | A | 0 |
b977259b2636c191cb4043f52690218f | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_3 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Observe how \begin{align*} 121 &= 110 + 11, \\ 11211 &= 11100 + 111, \\ 1112111 &= 1111000 + 1111, \\ & \ \vdots \end{align*} all take the form of \[\underbrace{111\ldots}_{n+1}\underbrace{00\ldots}_{n} + \underbrace{111\ldots}_{n+1} = \underbrace{111\ldots}_{n+1}(10^{n} + 1).\] Factoring each of the sums, we have \[11(10+1), 111(100+1), 1111(1000+1), \ldots\] respectively. With each number factored, there are $\boxed{0}$ primes in the set. | A | 0 |
b977259b2636c191cb4043f52690218f | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_3 | How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$ | Note that $121$ is divisible by $11$ and $11211$ is divisible by $3$ . Because this is Problem 6 of the AMC 10, we assume we do not need to check two-digit prime divisibility or use obscure theorems. Therefore, the answer is $\boxed{0}.$ | A | 0 |
ff5ae5744ccfcb23c53c9a377ad934ae | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Let $p$ and $q$ be the roots of $x^{2}+kx+36.$ By Vieta's Formulas , we have $p+q=-k$ and $pq=36.$
It follows that $p$ and $q$ must be distinct factors of $36.$ The possibilities of $\{p,q\}$ are \[\pm\{1,36\},\pm\{2,18\},\pm\{3,12\},\pm\{4,9\}.\] Each unordered pair gives a unique value of $k.$ Therefore, there are $\boxed{8}$ values of $k,$ namely $\pm37,\pm20,\pm15,\pm13.$ | B | 8 |
ff5ae5744ccfcb23c53c9a377ad934ae | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Note that $k$ must be an integer. Using the quadratic formula $x=\frac{-k \pm \sqrt{k^2-144}}{2}.$ Since $4$ divides $144$ evenly, $k$ and $k^2-144$ have the same parity, so $x$ is an integer if and only if $k^2-144$ is a perfect square.
Let $k^2-144=n^2.$ Then, $(k+n)(k-n)=144.$ Since $k$ is an integer and $144$ is even, $k+n$ and $k-n$ must both be even. Assuming that $k$ is positive, we get $5$ possible values of $k+n$ , namely $2, 4, 8, 6, 12$ , which will give distinct positive values of $k$ , but $k+n=12$ gives $k+n=k-n$ and $n=0$ , giving $2$ identical integer roots. Therefore, there are $4$ distinct positive values of $k.$ Multiplying that by $2$ to take the negative values into account, we get $4\cdot2=\boxed{8}$ values of $k$ | B | 8 |
ff5ae5744ccfcb23c53c9a377ad934ae | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Proceed similar to Solution 2 and deduce that the discriminant of $x^{2}+kx+36$ must be a perfect square greater than $0$ to satisfy all given conditions. Seeing something like $k^2-144$ might remind us of a right triangle, where $k$ is the hypotenuse, and $12$ is a leg. There are four ways we could have this: a $9$ $12$ $15$ triangle, a $12$ $16$ $20$ triangle, a $5$ $12$ $13$ triangle, and a $12$ $35$ $37$ triangle.
Multiply by $2$ to account for negative $k$ values (since $k$ is being squared), and our answer is $\boxed{8}$ | B | 8 |
ff5ae5744ccfcb23c53c9a377ad934ae | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Since $36 = 2^2\cdot3^2$ , that means there are $(2+1)(2+1) = 9$ possible factors of $36$ . Since $6 \cdot 6$ violates the distinct root condition, subtract $1$ from $9$ to get $8$ . Each sum is counted twice, and we count of those twice for negatives. This cancels out, so we get $\boxed{8}$ | B | 8 |
6064a4bd2fb688581cc590901c80949c | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_5 | The point $(-1, -2)$ is rotated $270^{\circ}$ counterclockwise about the point $(3, 1)$ . What are the coordinates of its new position?
$\textbf{(A)}\ (-3, -4) \qquad \textbf{(B)}\ (0,5) \qquad \textbf{(C)}\ (2,-1) \qquad \textbf{(D)}\ (4,3) \qquad \textbf{(E)}\ (6,-3)$ | $(-1,-2)$ is $4$ units west and $3$ units south of $(3,1)$ . Performing a counterclockwise rotation of $270^{\circ}$ , which is equivalent to a clockwise rotation of $90^{\circ}$ , the answer is $3$ units west and $4$ units north of $(3,1)$ , or $\boxed{0,5}$ | B | 0,5 |
6064a4bd2fb688581cc590901c80949c | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_5 | The point $(-1, -2)$ is rotated $270^{\circ}$ counterclockwise about the point $(3, 1)$ . What are the coordinates of its new position?
$\textbf{(A)}\ (-3, -4) \qquad \textbf{(B)}\ (0,5) \qquad \textbf{(C)}\ (2,-1) \qquad \textbf{(D)}\ (4,3) \qquad \textbf{(E)}\ (6,-3)$ | We write $(-1, -2)$ as $-1-2i.$ We'd like to rotate about $(3, 1),$ which is $3+i$ in the complex plane, by an angle of $270^{\circ} = \frac{3\pi}{2} \text{ rad}$ counterclockwise.
The formula for rotating the complex number $z$ about the complex number $w$ by an angle of $\theta$ counterclockwise is given as $(z-w)e^{\theta i} + w.$ Plugging in our values $z = -1-2i, w = 3+i, \theta = \frac{3\pi}{2}$ , we evaluate the expression as $((-1-2i) - (3+i))e^{\frac{3\pi i}{2}} + (3+i) = (-4-3i)(-i) + (3+i) = 4i-3i^2+3+i = 4i-3+3+i = 5i,$ which corresponds to $\boxed{0,5}$ on the Cartesian plane. | B | 0,5 |
1b6afcac8eaac4227a1bf3091caf4405 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_6 | Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50$ | We apply casework to this problem. The only sets that contain two multiples of seven are those for which:
Each case has $\left\lfloor\frac{100}{7}\right\rfloor=14$ sets. Therefore, the answer is $14\cdot3=\boxed{42}.$ | B | 42 |
1b6afcac8eaac4227a1bf3091caf4405 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_6 | Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50$ | We find a pattern. \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} We can figure out that the first set has $1$ multiple of $7$ . The second set also has $1$ multiple of $7$ . The third set has $2$ multiples of $7$ . The fourth set has $1$ multiple of $7$ . The fifth set has $2$ multiples of $7$ . The sixth set has $1$ multiple of $7$ . The seventh set has $2$ multiples of $7$ . Calculating this pattern further, we can see (reasonably) that it repeats for each $7$ sets.
We see that the pattern for the number of multiples per $7$ sets goes: $1,1,2,1,2,1,2.$ So, for every $7$ sets, there are three sets with $2$ multiples of $7$ . We calculate $\left\lfloor\frac{100}{7}\right\rfloor$ and multiply that by $3$ . (We also disregard the remainder of $2$ since it doesn't add any extra sets with $2$ multiples of $7$ .). We get $14\cdot3= \boxed{42}$ | B | 42 |
1b6afcac8eaac4227a1bf3091caf4405 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_6 | Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50$ | Each set contains exactly $1$ or $2$ multiples of $7$
There are $\dfrac{1000}{10}=100$ total sets and $\left\lfloor\dfrac{1000}{7}\right\rfloor = 142$ multiples of $7$
Thus, there are $142-100=\boxed{42}$ sets with $2$ multiples of $7$ | B | 42 |
76ef7ef8460e73a0e012cd421413681a | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_7 | Camila writes down five positive integers. The unique mode of these integers is $2$ greater than their median, and the median is $2$ greater than their arithmetic mean. What is the least possible value for the mode?
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 13$ | Let $M$ be the median. It follows that the two largest integers are both $M+2.$
Let $a$ and $b$ be the two smallest integers such that $a<b.$ The sorted list is \[a,b,M,M+2,M+2.\] Since the median is $2$ greater than their arithmetic mean, we have $\frac{a+b+M+(M+2)+(M+2)}{5}+2=M,$ or \[a+b+14=2M.\] Note that $a+b$ must be even. We minimize this sum so that the arithmetic mean, the median, and the unique mode are minimized. Let $a=1$ and $b=3,$ from which $M=9$ and $M+2=\boxed{11}.$ | D | 11 |
76ef7ef8460e73a0e012cd421413681a | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_7 | Camila writes down five positive integers. The unique mode of these integers is $2$ greater than their median, and the median is $2$ greater than their arithmetic mean. What is the least possible value for the mode?
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 13$ | We can also easily test all the answer choices. (This strategy is generally good to use for multiple-choice questions if you don't have a concrete method to proceed with!)
For answer choice $\textbf{(A)},$ the mode is $5,$ the median is $3,$ and the arithmetic mean is $1.$ However, we can quickly see this doesn't work, as there are five integers, and they can't have an arithmetic mean of $1$ while having a mode of $5.$
Trying answer choice $\textbf{(B)},$ the mode is $7,$ the median is $5,$ and the arithmetic mean is $3.$ From the arithmetic mean, we know that all the numbers have to sum to $15.$ We know three of the numbers: $\underline{\hspace{3mm}},\underline{\hspace{3mm}},5,7,7.$ This exceeds the sum of $15.$
Now we try answer choice $\textbf{(C)}.$ The mode is $9,$ the median is $7,$ and the arithmetic mean is $5.$ From the arithmetic mean, we know that the list sums to $25.$ Three of the numbers are $\underline{\hspace{3mm}},\underline{\hspace{3mm}},7,9,9,$ which is exactly $25.$ However, our list needs positive integers, so this won't work.
Since we were really close on answer choice $\textbf{(C)},$ we can intuitively feel that the answer is probably going to be $\textbf{(D)}.$ We can confirm this by creating a list that satisfies the problem and choose $\textbf{(D)}: 1,3,9,11,11.$
So, our answer is $\boxed{11}.$ | D | 11 |
02fb05f82ebbf821344834fff2dea62c | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_9 | The sequence $a_0,a_1,a_2,\cdots$ is a strictly increasing arithmetic sequence of positive integers such that \[2^{a_7}=2^{27} \cdot a_7.\] What is the minimum possible value of $a_2$
$\textbf{(A)}\ 8 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 16 \qquad \textbf{(D)}\ 17 \qquad \textbf{(E)}\ 22$ | We can rewrite the given equation as $2^{a_7-27}=a_7$ . Hence, $a_7$ must be a power of $2$ and larger than $27$ . The first power of 2 that is larger than $27$ , namely $32$ , does satisfy the equation: $2^{32 - 27} = 2^5 = 32$ . In fact, this is the only solution; $2^{a_7-27}$ is exponential whereas $a_7$ is linear, so their graphs will not intersect again.
Now, let the common difference in the sequence be $d$ . Hence, $a_0 = 32 - 7d$ and $a_2 = 32 - 5d$ . To minimize $a_2$ , we maxmimize $d$ . Since the sequence contains only positive integers, $32 - 7d > 0$ and hence $d \leq 4$ . When $d = 4$ $a_2 = \boxed{12}$ | B | 12 |
2efa357bb31a88b91f9dcdcb8a16df25 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Converting both summands to exponential form, \begin{align*} -1 + i\sqrt{3} &= 2e^{\frac{2\pi i}{3}}, \\ -1 - i\sqrt{3} &= 2e^{-\frac{2\pi i}{3}} = 2e^{\frac{4\pi i}{3}}. \end{align*} Notice that both are scaled copies of the third roots of unity.
When we replace the summands with their exponential form, we get \[f(n) = \left(e^{\frac{2\pi i}{3}}\right)^n + \left(e^{\frac{4\pi i}{3}}\right)^n.\] When we substitute $n = 2022$ , we get \[f(2022) = \left(e^{\frac{2\pi i}{3}}\right)^{2022} + \left(e^{\frac{4\pi i}{3}}\right)^{2022}.\] We can rewrite $2022$ as $3 \cdot 674$ , how does that help? \[f(2022) = \left(e^{\frac{2\pi i}{3}}\right)^{3 \cdot 674} + \left(e^{\frac{4\pi i}{3}}\right)^{3 \cdot 674} = \left(\left(e^{\frac{2\pi i}{3}}\right)^{3}\right)^{674} + \left(\left(e^{\frac{4\pi i}{3}}\right)^{3}\right)^{674} = 1^{674} + 1^{674} = \boxed{2}.\] Since any third root of unity must cube to $1$ | E | 2 |
2efa357bb31a88b91f9dcdcb8a16df25 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | The numbers $\frac{-1+i\sqrt{3}}{2}$ and $\frac{-1-i\sqrt{3}}{2}$ are both $\textbf{Eisenstein Units}$ (along with $1$ ), denoted as $\omega$ and $\omega^2$ , respectively. They have the property that when they are cubed, they equal to $1$ . Thus, we can immediately solve: \[\omega^{2022} + \omega^{2 \cdot 2022} = \omega^{3 \cdot 674} + \omega^{3 \cdot 2 \cdot 674} = 1^{674} + 1^{2 \cdot 674} = \boxed{2}.\] ~mathboy100 | E | 2 |
2efa357bb31a88b91f9dcdcb8a16df25 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | We begin by recognizing this form looks similar to the definition of cosine: \[\cos(x)=\frac{e^{ix}+e^{-ix}}{2}.\] We can convert our two terms into exponential form to find \[f(n) = \left( e^{\frac{2\pi i}{3}} \right ) ^n + \left ( e^{-\frac{2\pi i}{3}} \right ) ^n=e^{\frac{2 \pi i n}{3}} + e^{-\frac{2\pi i n}{3}}.\] This simplifies nicely: \[f(n)=2\cos\left( \frac{2\pi n}{3} \right).\] Thus, \[f(2022)=2\cos \left ( \frac{2\pi (2022) }{3} \right) = 2\cos(1348 \pi) = \boxed{2}.\] | E | 2 |
2efa357bb31a88b91f9dcdcb8a16df25 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Notice how this looks like the closed form of the Fibonacci sequence except different roots. This is motivation to turn this closed formula into a recurrence relation. The base of the exponents are the roots of the characteristic equation $r^3-1=0$ . So we have \begin{align*} a_0&=2\\ a_1&=-1\\ a_2&=-1\\ a_n&=a_{n-3} \end{align*} Every time $n$ is multiple of $3$ as is true when $n=2022$ $a_n= \boxed{2}$ ~lopkiloinm | E | 2 |
2efa357bb31a88b91f9dcdcb8a16df25 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Converting the two terms into rectangular form,
\[f(2022)=\left(\cos{\frac{2\pi}{3}}+i\sin{\frac{2\pi}{3}}\right)^{2022}+\left(\cos{\frac{4\pi}{3}}+i\sin{\frac{4\pi}{3}}\right)^{2022}.\]
By DeMoivre's Theorem,
\[f(2022)=\left(\cos{\left(\frac{2\pi}{3}\cdot{2022}\right)}+i\sin{\left(\frac{2\pi}{3}\cdot{2022}\right)}\right)+\left(\cos{\left(\frac{4\pi}{3}\cdot{2022}\right)}+i\sin{\left(\frac{4\pi}{3}\cdot{2022}\right)}\right).\]
Note that $\cos{\pi\cdot{k}}=1$ if $k$ is even and $-1$ if $k$ is odd, and that $\sin{\pi\cdot{k}}=0$ for all integers $k$
All arguments are even in the second equation for $f(2022)$ , so the two $\cos$ terms are equal to $1$ , and the two $\sin$ terms are equal to $0$
Therefore the answer is $1+1=\boxed{2}.$ | E | 2 |
7174c2f8c284dbabed00a6cf6e9cd5f7 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_17 | How many $4 \times 4$ arrays whose entries are $0$ s and $1$ s are there such that the row sums (the sum of the entries in each row) are $1, 2, 3,$ and $4,$ in some order, and the column sums (the sum of the entries in each column) are also $1, 2, 3,$ and $4,$ in some order? For example, the array \[\left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right]\] satisfies the condition.
$\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624$ | Note that the arrays and the sum configurations have one-to-one correspondence. Furthermore, the row sum configuration and the column sum configuration are independent of each other. Therefore, the answer is $(4!)^2=\boxed{576}.$ | D | 576 |
7174c2f8c284dbabed00a6cf6e9cd5f7 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_17 | How many $4 \times 4$ arrays whose entries are $0$ s and $1$ s are there such that the row sums (the sum of the entries in each row) are $1, 2, 3,$ and $4,$ in some order, and the column sums (the sum of the entries in each column) are also $1, 2, 3,$ and $4,$ in some order? For example, the array \[\left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right]\] satisfies the condition.
$\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624$ | In this problem, we call a matrix that satisfies all constraints given in the problem a feasible matrix.
First, we observe that if a matrix is feasible, and we swap two rows or two columns to get a new matrix, then this new matrix is still feasible.
Therefore, any feasible matrix can be obtained through a sequence of such swapping operations from a feasible matrix where for all $i \in \left\{ 1, 2, 3 ,4 \right\}$ , the sum of entries in row $i$ is $i$ and the sum of entries in column $i$ is $i$ , hereafter called as a benchmark matrix.
Second, we observe that there is a unique benchmark matrix, as shown below: \[\left[ \begin{array}{cccc} 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 \\ \end{array} \right]\] With above observations, we now count the number of feasible matrixes.
We construct a feasible matrix in the following steps.
Step 1: We make a permutation of rows of the benchmark matrix.
The number of ways is $4!$
Step 2: We make a permutation of columns of the matrix obtained after Step 1.
The number of ways is $4!$
Following from the rule of product, the total number of feasible matrixes is $4! \cdot 4! = \boxed{576}$ | D | 576 |
7174c2f8c284dbabed00a6cf6e9cd5f7 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_17 | How many $4 \times 4$ arrays whose entries are $0$ s and $1$ s are there such that the row sums (the sum of the entries in each row) are $1, 2, 3,$ and $4,$ in some order, and the column sums (the sum of the entries in each column) are also $1, 2, 3,$ and $4,$ in some order? For example, the array \[\left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right]\] satisfies the condition.
$\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624$ | Of the sixteen entries in one such array, there are six $0$ s and ten $1$ s. The rows and the columns each have zero, one, two, and three $0$ s, in some order. Once we decide the positions of the $0$ s, we form one such array.
We perform the following steps:
Together, the answer is $4\cdot4\cdot3\cdot3\cdot4=\boxed{576}.$ | D | 576 |
7174c2f8c284dbabed00a6cf6e9cd5f7 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_17 | How many $4 \times 4$ arrays whose entries are $0$ s and $1$ s are there such that the row sums (the sum of the entries in each row) are $1, 2, 3,$ and $4,$ in some order, and the column sums (the sum of the entries in each column) are also $1, 2, 3,$ and $4,$ in some order? For example, the array \[\left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right]\] satisfies the condition.
$\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624$ | Since exactly $1$ row sum is $4$ and exactly $1$ column sum is $4$ , there is a unique entry in the array such that it, and every other entry in the same row or column, is a $1.$ Since there are $16$ total entries in the array, there are $16$ ways to choose the entry with only $1$ s in its row and column.
Without loss of generality, let that entry be in the top-left corner of the square. Note that there is already $1$ entry numbered $1$ in each unfilled row, and $1$ entry numbered $1$ in each unfilled column. Since exactly $1$ row sum is $1$ and exactly $1$ column sum is $1$ , there is a unique entry in the $3\times3$ array of the empty squares such that it, and every other entry in the same row or column in the $3\times3$ array is a $0.$ Using a process similar to what we used in the first paragraph, we can see that there are $9$ ways to choose the entry with only $0$ in its row and column (in the $3\times3$ array).
Without loss of generality, let that entry be in the bottom-right corner of the square. Then, the remaining empty squares are the $4$ center squares. Of these, one of the columns of the empty $2\times2$ array will have two $1$ s and the other column will have one $1.$ That happens if and only if exactly $1$ of the remaining squares is filled with a $0$ , and there are $4$ ways to choose that square. Filling that square with a $0$ and the other $3$ squares with $1$ s completes the grid.
All in all, there are $4\cdot9\cdot16=\boxed{576}$ ways to complete the grid. | D | 576 |
7174c2f8c284dbabed00a6cf6e9cd5f7 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_17 | How many $4 \times 4$ arrays whose entries are $0$ s and $1$ s are there such that the row sums (the sum of the entries in each row) are $1, 2, 3,$ and $4,$ in some order, and the column sums (the sum of the entries in each column) are also $1, 2, 3,$ and $4,$ in some order? For example, the array \[\left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right]\] satisfies the condition.
$\textbf{(A) }144 \qquad \textbf{(B) }240 \qquad \textbf{(C) }336 \qquad \textbf{(D) }576 \qquad \textbf{(E) }624$ | Note that swapping any two rows or any two columns or both from the given example array, leads to a new array that satisfies the condition. There are $4$ rows, and you choose $2$ to swap, so $\frac{4!}{2!2!} = 6$ ; likewise for columns. Therefore, $6\cdot6 = 36$ . Clearly, the final answer must be divisible by $36$ , so we can eliminate $\textbf{(B)}$ $\textbf{(C)}$ and $\textbf{(E)}$
Now, you are in exam mode with not much time left. You see that $144 = 4\cdot36$ while $576 = 16\cdot36$ . There are $16$ elements in the array ( $4$ rows and $4$ columns), so you go with $\boxed{576}$ , and this is indeed the correct answer! | D | 576 |
59984d65302fc4acc4f8d116285323ad | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_18 | 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:
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 $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,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] $\textbf{(A)}\ 14 \qquad\textbf{(B)}\ 18 \qquad\textbf{(C)}\ 22 \qquad\textbf{(D)}\ 26 \qquad\textbf{(E)}\ 30$ | There are two cases for the initial configuration:
Together, the answer is $2+20=\boxed{22}.$ | C | 22 |
9de985a76df7ff6e3a65b23a0f9e6b68 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_19 | 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?$
$\textbf{(A) }44 \qquad \textbf{(B) }48 \qquad \textbf{(C) }52 \qquad \textbf{(D) }56 \qquad \textbf{(E) }60$ | Let $AG = AE = GE = CE = 1$ . Since $G$ is the centroid, $DG = \frac12$ $BG = 2$
\[\angle BGD = \angle AGE = 60^{\circ}\]
By the Law of Cosine in $\triangle BGD$
\[BD^2 = BG^2 + DG^2 - 2 \cdot BG \cdot DG \cdot \cos \angle BGD\]
\[BD = \sqrt {2^2 + \left( \frac{1}{2} \right)^2 - 2 \cdot 2 \cdot \frac12 \cdot \cos \angle BGD} = \frac{\sqrt{13}}{2}, \quad CD = \frac{\sqrt{13}}{2}\]
By the Law of Cosine in $\triangle ACD$
\[AD^2 = AC^2 + CD^2 - 2 \cdot AC \cdot CD \cdot \cos \angle C\]
\[\cos \angle C = \frac{ AC^2 + CD^2 - AD^2 }{ 2 \cdot AC \cdot CD } = \frac{ 2^2 + \left( \frac{\sqrt{13}}{2} \right)^2 - \left( \frac{3}{2} \right)^2 }{ 2 \cdot 2 \cdot \frac{\sqrt{13}}{2} } = \frac{ 5 \sqrt{13} }{26}\]
\[5 + 13 + 26 = \boxed{44}\] | A | 44 |
9de985a76df7ff6e3a65b23a0f9e6b68 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_19 | 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?$
$\textbf{(A) }44 \qquad \textbf{(B) }48 \qquad \textbf{(C) }52 \qquad \textbf{(D) }56 \qquad \textbf{(E) }60$ | Using reference triangle $\triangle AGE$ , we can let \[A=(1,0,0),G=(0,1,0),E=(0,0,1),C=(-1,0,2),D=(-\tfrac{1}{2},\tfrac{3}{2},0),B=(0,3,-2).\] If we move $A,B,C$ each over by $(1,0,-2)$ , leaving $\angle C$ unchanged, we have \[A=(2,0,-2),B=(1,3,-4),C=(0,0,0).\] The angle $\theta$ between vectors $\overrightarrow{CA}$ and $\overrightarrow{CB}$ satisfies \[\cos\theta=\frac{(2)(1)+(0)(3)+(-2)(-4)}{\sqrt{\left[2^{2}+0^{2}+(-2)^{2}\right]\left[1^{2}+3^{2}+(-4)^{2}\right]}}=\frac{10}{\sqrt{8\cdot 26}}=\frac{10}{4\sqrt{13}}=\frac{5\sqrt{13}}{26},\] giving the answer, $5+13+26=\boxed{44}$ | A | 44 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Given that all the answer choices and coefficients are integers, we hope that $P(x)$ has positive integer coefficients.
Throughout this solution, we will express all polynomials in base $x$ . E.g. $x^2 + x + 1 = 111_{x}$
We are given: \[111a + 12 = 101b + 21 = P(x).\] We add $111$ and $101$ to each side and balance respectively: \[111(a - 1) + 123 = 101(b - 1) + 122 = P(x).\] We make the unit's digits equal: \[111(a - 1) + 123 = 101(b - 2) + 223 = P(x).\] We now notice that: \[111(a - 11) + 1233 = 101(b - 12) + 1233 = P(x).\] Therefore $a = 11_{x} = x + 1$ $b = 12_{x} = x + 2$ , and $P(x) = 1233_{x} = x^3 + 2x^2 + 3x + 3$ $3$ is the minimal degree of $P(x)$ since there is no way to influence the $x$ ‘s digit in $101b + 21$ when $b$ is an integer. The desired sum is $1^2 + 2^2 +3^2+ 3^2 = \boxed{23}$ | E | 23 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Let $P(x) = Q(x)(x^2+x+1) + x + 2$ , then $P(x) = Q(x)(x^2+1) + xQ(x) + x + 2$ , therefore $xQ(x) + x + 2 \equiv 2x + 1 \pmod{x^2+1}$ , or $xQ(x) \equiv x-1 \pmod{x^2+1}$ . Clearly the minimum is when $Q(x) = x+1$ , and expanding gives $P(x) = x^3+2x^2+3x+3$ . Summing the squares of coefficients gives $\boxed{23}$ | E | 23 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Let $P(x) = (x^2+x+1)Q_1(x) + x + 2$ ,
then $P(x) = (x^2+1)Q_1(x) + xQ_1(x) + x + 2$
Also $P(x) = (x^2+1)Q_2(x) + 2x + 1$
We infer that $Q_1(x)$ and $Q_2(x)$ have same degree, we can assume $Q_1(x) = x + a$ , and $Q_2(x) = x + b$ , since $P(x)$ has least degree. If this cannot work, we will try quadratic, etc.
Then we get: $(x^2+1)(Q_1(x) - Q_2(x)) + xQ_1(x) - x + 1 = 0$
The constant term gives us: $(Q_1(x) - Q_2(x)) + 1 = 0$
So $Q_1(x) - Q_2(x) = -1$
Substituting this in gives: $-(x^2+1) + xQ_1(x) - x + 1 = 0$
Solving this equation, we get $Q_1(x) = x + 1$
Plugging this into our original equation we get $P(x) = x^3 + 2x^2 + 3x + 3$
Verify this works with $P(x) = (x^2+1)Q_2(x) + 2x + 1$
Therefore the answer is $1^2 + 2^2 + 3^2 + 3^2 = \boxed{23}$ | E | 23 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | Notice that we cannot have the quotients equal to some constants, since the same constant will yield different constant terms for $P(x)$ (which is bad) and different constants will yield different first coefficients (also bad). Thus, we try setting the quotients equal to linear terms (for minimizing degree).
Let $P(x)=(x^2+x+1)(ax+b)+(x+2)$ and $P(x)=(x^2+1)(ax+c)+(2x+1)$ . The quotients have the same $x$ coefficient, since $P(x)$ must have the same $x^3$ coefficient in both cases. Expanding, we get \[P(x)=ax^3+(a+b)x^2+(a+b+1)x+(b+2)\] and \[P(x)=ax^3+cx^2+(a+2)x+(c+1).\]
Equating coefficients, we get $b+2=c+1$ $a+b+1=a+2$ , and $a+b=c$ . From the second equation, we get $b=1$ , then substituting into the first, $c=2$ . Finally, from $a+b=c$ , we have $a=1$ . Now, $P(x)=(x^2+x+1)(ax+b)+(x+2)=(x^2+x+1)(x+1)+(x+2)=x^3+2x^2+3x+3$ and our answer is \[1^2+2^2+3^2+3^2=\boxed{23}.\] | E | 23 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | We construct the following equations in terms of $P(x)$ and the information given by the problem: \[\textbf{(1) } P(x)=(x^2+x+1)\cdot Q(x)+x+2\] \[\textbf{(2) } P(x)=(x^2+1)\cdot R(x)+2x+1\] Upon inspection, $Q(x)$ and $R(x)$ cannot be constant, so the smallest possible degree of $P(x)$ is $3,$ and both $Q(x)$ and $R(x)$ are linear.
Let $Q(x)=x-q$ and $R(x)=x-r.$ We know there will be values for $q$ and $r$ that make the below equation hold, so we can assume that $P(x)$ has a leading coefficient of $1$
Substituting these values in, and setting $\textbf{(1)}$ and $\textbf{(2)}$ equal to each other, \[(x^2+x+1)(x-q)+x+2=(x^2+1)(x-r)+2x+1.\] We plug in $x=0$ , yielding $r+1=q.$ Substituting this value into the above equation, \[(x^2+x+1)(x-r-1)+x+2=(x^2+1)(x-r)+2x+1.\] Letting $x=1,$ we conclude that $r=-2,$ so $R(x)=x+2.$ Therefore, \[P(x)=(x^2+1)(x+2)+2x+1 = x^3+2x^3+3x+3.\] The requested sum is \[1^2+2^2+3^2+3^2=\boxed{23}\] | E | 23 |
b936a7513b0269574af6877646ba1223 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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$ | By remainder theorem, the polynomial can be written as follows.
\[P(x) = (x^2+x+1)Q_{1}(x)+x+2 = (x^2+1)Q_{2}(x)+2x+1\] This is a timed exam, we can use the information given by answer choices. The answer choices tell us this is the polynomial with integer coefficients, and we need to find the polynomial with the least degree so we can assume both $Q_{1}(x)$ and $Q_{2}(x)$ are linear (the coefficient of x should be same).
Then we can write $P(x)$ as a cubic polynomial.
\[P(x) = (x^2+x+1)(ax+b)+x+2 = (x^2+1)(ax+c)+2x+1\] Substituting $x=0,1,-1$ to determine the value of $a$ and $b$
We have: \[P(0) = b+2 = c+1\] \[P(1) = 3a+3b+3 = 2a+2c+3\] \[P(-1) = -a+b+1 = -2a+2c-1\]
We can solve the simultaneous equations: $a=1,b=1,c=2$
Hence, $P(x)=(x^2+x+1)(x+1)+x+2=x^3+2x^2+3x+3$ . The answer is $1^2+2^2+3^2+3^2=\boxed{23}$ | E | 23 |
1fb19062aa608361f75d6736ba701ce8 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_21 | Let $S$ be the set of circles in the coordinate plane that are tangent to each of the three circles with equations $x^{2}+y^{2}=4$ $x^{2}+y^{2}=64$ , and $(x-5)^{2}+y^{2}=3$ . What is the sum of the areas of all circles in $S$
$\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$ | We denote by $C_1$ the circle that has the equation $x^2 + y^2 = 4$ .
We denote by $C_2$ the circle that has the equation $x^2 + y^2 = 64$ .
We denote by $C_3$ the circle that has the equation $(x-5)^2 + y^2 = 3$
We denote by $C_0$ a circle that is tangent to $C_1$ $C_2$ and $C_3$ .
We denote by $\left( u, v \right)$ the coordinates of circle $C_0$ , and $r$ the radius of this circle.
From the graphs of circles $C_1$ $C_2$ $C_3$ , we observe that if $C_0$ is tangent to all of them, then $C_0$ must be internally tangent to $C_2$ .
We have \[ u^2 + v^2 = \left( 8 - r \right)^2 . \hspace{1cm} (1) \]
We do the following casework analysis in terms of the whether $C_0$ is externally tangent to $C_1$ and $C_3$
Case 1: $C_0$ is externally tangent to $C_1$ and $C_3$
We have \[ u^2 + v^2 = \left( r + 2 \right)^2 \hspace{1cm} (2) \] and \[ (u-5)^2 + v^2 = \left( r + \sqrt{3} \right)^2 . \hspace{1cm} (3) \]
Taking $(2) - (1)$ , we get $r + 2 = 8 - r$ . Thus, $r = 3$ .
We can further compute (omitted here) that there exist feasible $(u,v)$ with this given $r$
Case 2: $C_1$ is internally tangent to $C_0$ and $C_3$ is externally tangent to $C_0$
We have \[ u^2 + v^2 = \left( r - 2 \right)^2 \hspace{1cm} (2) \] and \[ (u-5)^2 + v^2 = \left( r + \sqrt{3} \right)^2 . \hspace{1cm} (3) \]
Taking $(2) - (1)$ , we get $r - 2 = 8 - r$ . Thus, $r = 5$ .
We can further compute (omitted here) that there exist feasible $(u,v)$ with this given $r$
Case 3: $C_1$ is externally tangent to $C_0$ and $C_3$ is internally tangent to $C_0$
We have \[ u^2 + v^2 = \left( r + 2 \right)^2 \hspace{1cm} (2) \] and \[ (u-5)^2 + v^2 = \left( r - \sqrt{3} \right)^2 . \hspace{1cm} (3) \]
Taking $(2) - (1)$ , we get $r + 2 = 8 - r$ . Thus, $r = 3$ .
We can further compute (omitted here) that there exist feasible $(u,v)$ with this given $r$
Case 4: $C_1$ is internally tangent to $C_0$ and $C_3$ is internally tangent to $C_0$
We have \[ u^2 + v^2 = \left( r - 2 \right)^2 \hspace{1cm} (2) \] and \[ (u-5)^2 + v^2 = \left( r - \sqrt{3} \right)^2 . \hspace{1cm} (3) \]
Taking $(2) - (1)$ , we get $r - 2 = 8 - r$ . Thus, $r = 5$ .
We can further compute (omitted here) that there exist feasible $(u,v)$ with this given $r$
Because the graph is symmetric with the $x$ -axis, and for each case above, the solution of $v$ is not 0. Hence, in each case, there are two congruent circles whose centers are symmetric through the $x$ -axis.
Therefore, the sum of the areas of all the circles in $S$ is $2\left( 3^2 \pi +5^2 \pi +3^2 \pi +5^2 \pi \right) = \boxed{136}$ | E | 136 |
8b06678c4102e642b1b36d62bb05be8b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_23 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qquad \textbf{(B) } 7 \qquad \textbf{(C) }12\qquad \textbf{(D) } 14\qquad \textbf{(E) }15$ | In binary numbers, we have \[S_n = (x_{n-1} x_{n-2} x_{n-3} x_{n-4} \ldots x_{2} x_{1} x_{0})_2.\] It follows that \[8S_n = (x_{n-1} x_{n-2} x_{n-3} x_{n-4} \ldots x_{2} x_{1} x_{0}000)_2.\] We obtain $7S_n$ by subtracting the equations: \[\begin{array}{clccrccccccr} & (x_{n-1} & x_{n-2} & x_{n-3} & x_{n-4} & \ldots & x_2 & x_1 & x_0 & 0 & 0 & 0 \ )_2 \\ -\quad & & & & (x_{n-1} & \ldots & x_5 & x_4 & x_3 & x_2 & x_1 & x_0)_2 \\ \hline & & & & & & & & & & & \\ [-2.5ex] & ( \ \ ?& ? & ? & 0 \ \ \ & \ldots & 0 & 0 & 0 & 0 & 0 & 1 \ )_2 \\ \end{array}\] We work from right to left: \begin{alignat*}{6} x_0=x_1=x_2=1 \quad &\implies \quad &x_3 &= 0& \\ \quad &\implies \quad &x_4 &= 1& \\ \quad &\implies \quad &x_5 &= 1& \\ \quad &\implies \quad &x_6 &= 0& \\ \quad &\implies \quad &x_7 &= 1& \\ \quad &\implies \quad &x_8 &= 1& \\ \quad &\quad \vdots & & & \end{alignat*} For all $n\geq3,$ we conclude that
Finally, we get $(x_{2019},x_{2020},x_{2021},x_{2022})=(0,1,1,0),$ from which \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \boxed{6}.\] ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | A | 6 |
8b06678c4102e642b1b36d62bb05be8b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_23 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qquad \textbf{(B) } 7 \qquad \textbf{(C) }12\qquad \textbf{(D) } 14\qquad \textbf{(E) }15$ | First, notice that \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \frac{S_{2023} - S_{2019}}{2^{2019}}.\] Then since $S_n$ is the modular inverse of $7$ in $\mathbb{Z}_{2^n}$ , we can perform the Euclidean Algorithm to find it for $n = 2019,2023$
Starting with $2019$ \begin{align*} 7S_{2019} &\equiv 1 \pmod{2^{2019}} \\ 7S_{2019} &= 2^{2019}k + 1. \end{align*} Now, take both sides $\operatorname{mod} \ 7$ \[0 \equiv 2^{2019}k + 1 \pmod{7}.\] Using Fermat's Little Theorem, \[2^{2019} = (2^{336})^6 \cdot 2^3 \equiv 2^3 \equiv 1 \pmod{7}.\] Thus, \[0 \equiv k + 1 \pmod{7} \implies k \equiv 6 \pmod{7} \implies k = 7j + 6.\] Therefore, \[7S_{2019} = 2^{2019} (7j + 6) + 1 \implies S_{2019} = \frac{2^{2019} (7j + 6) + 1}{7}.\]
We may repeat this same calculation with $S_{2023}$ to yield \[S_{2023} = \frac{2^{2023} (7h + 3) + 1}{7}.\] Now, we notice that $S_n$ is basically an integer expressed in binary form with $n$ bits.
This gives rise to a simple inequality, \[0 \leqslant S_n \leqslant 2^n.\] Since the maximum possible number that can be generated with $n$ bits is \[\underbrace{{11111\dotsc1}_2}_{n} = \sum_{k=0}^{n-1} 2^k = 2^n - 1 \leqslant 2^n.\] Looking at our calculations for $S_{2019}$ and $S_{2023}$ , we see that the only valid integers that satisfy that constraint are $j = h = 0$ \[\frac{S_{2023} - S_{2019}}{2^{2019}} = \frac{\tfrac{2^{2023} \cdot 3 + 1}{7} - \tfrac{2^{2019} \cdot 6 + 1}{7}}{2^{2019}} = \frac{2^4 \cdot 3 - 6}{7} = \boxed{6}.\] ~zoomanTV | A | 6 |
8b06678c4102e642b1b36d62bb05be8b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_23 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qquad \textbf{(B) } 7 \qquad \textbf{(C) }12\qquad \textbf{(D) } 14\qquad \textbf{(E) }15$ | As in Solution 2, we note that \[x_{2019}+2x_{2020}+4x_{2021}+8x_{2022}=\frac{S_{2023}-S_{2019}}{2^{2019}}.\] We also know that $7S_{2023} \equiv 1 \pmod{2^{2023}}$ and $7S_{2019} \equiv 1 \pmod{2^{2019}}$ , this implies: \[\textbf{(1) } 7S_{2023}=2^{2023}\cdot{x} + 1,\] \[\textbf{(2) } 7S_{2019}=2^{2019}\cdot{y} + 1.\] Dividing by $7$ , we can isolate the previous sums: \[\textbf{(3) } S_{2023}=\frac{2^{2023}\cdot{x} + 1}{7},\] \[\textbf{(4) } S_{2019}=\frac{2^{2019}\cdot{y} + 1}{7}.\] The maximum value of $S_n$ occurs when every $x_i$ is equal to $1$ . Even when this happens, the value of $S_n$ is less than $2^n$ . Therefore, we can construct the following inequalities: \[\textbf{(3) } S_{2023}=\frac{2^{2023}\cdot{x} + 1}{7} < 2^{2023},\] \[\textbf{(4) } S_{2019}=\frac{2^{2019}\cdot{y} + 1}{7} < 2^{2019}.\] From these two equations, we can deduce that both $x$ and $y$ are less than $7$
Reducing $\textbf{1}$ and $\textbf{2}$ $\pmod{7},$ we see that \[2^{2023}\cdot{x}\equiv 6\pmod{7},\] and \[2^{2019}\cdot{y}\equiv 6\pmod{7}.\]
The powers of $2$ repeat every $3, \pmod{7}.$
Therefore, $2^{2023}\equiv 2 \pmod 7$ and $2^{2019} \equiv 1 \pmod {7}.$ Substituing this back into the above equations, \[2x\equiv{6}\pmod{7}\] and \[y\equiv{6}\pmod{7}.\]
Since $x$ and $y$ are integers less than $7$ , the only values of $x$ and $y$ are $3$ and $6$ respectively.
The requested sum is \begin{align*} \frac{S_{2023}-S_{2019}}{2^{2019}} &= \frac{\frac{2^{2023}\cdot{x} + 1}{7} - \frac{2^{2019}\cdot{y} + 1}{7}}{2^{2019}} \\ &= \frac{1}{2^{2019}}\left(\frac{2^{2023}\cdot{3} + 1}{7} -\left(\frac{2^{2019}\cdot{6} + 1}{7} \right)\right) \\ &= \frac{3\cdot{2^4}-6}{7} \\ &= \boxed{6} -Benedict T (countmath1) | A | 6 |
8b06678c4102e642b1b36d62bb05be8b | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_23 | Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define \[S_n = \sum_{k=0}^{n-1} x_k 2^k\] Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?\] $\textbf{(A) } 6 \qquad \textbf{(B) } 7 \qquad \textbf{(C) }12\qquad \textbf{(D) } 14\qquad \textbf{(E) }15$ | Note that, as in Solution 2, we have \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \frac{S_{2023} - S_{2019}}{2^{2019}}.\] This is because \[S_{2023} = x_{0}2^{0} + x_{1}2^{1} + \cdots + x_{2019}2^{2019} + \cdots + x_{2022}2^{2022}\] and \[S_{2019} = x_{0}2^{0} + x_{1}2^{1} + \cdots + x_{2018}2^{2018}.\] Note that \[S_{2023} - S_{2019} = x_{2019}2^{2019} + \cdots + x_{2022}2^{2022} = 2^{2019}(x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}).\] Therefore, \[x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022} = \frac{S_{2023} - S_{2019}}{2^{2019}}.\] Multiplying both sides by 7 gives us \[7(x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}) = \frac{7S_{2023} - 7S_{2019}}{2^{2019}}.\] We can write \[7S_{2023} = 1\pmod{2^{2023}} = 1 + 2^{2023}a = 1 + 2^{2019}*16a\] and \[7S_{2019} = 1\pmod{2^{2019}} = 1 + 2^{2019}b\] for some a and b. Substituting, we get \[7(x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}) = \frac{(1 + 2^{2019} * 16a) - (1 + 2^{2019}b)}{2^{2019}} = 16a - b.\] Therefore, our answer can be written as \[\frac{16a - b}{7}.\] Another thing to notice is that a and b are integers between 0 and 6. This is because \[7(1 + 2 + 4 + 8 + \cdots + 2^{2022}) \geqslant 7S_{2023} = 1 + 2^{2023}a\] which is \[7(2^{2023}) - 7 \geqslant 1 + 2^{2023}a\] \[(7-a) \geqslant \frac{8}{2^{2023}}\] which only holds when a is less than 7 because the right is very small positive number, so the left must be positive, too. Clearly, a is also non-negative, because otherwise, \[7S_{2023} = 1 + 2^{2023}a < 0\] which would mean \[S_{2023} < 0\] which cannot happen, so a is greater than 0. A similar explanation for b shows that b is an integer between 0 and 6 inclusive.
Going back to the solution, if our answer to the problem is n, then \[16a - b = 7n\] and \[16a = 7n + b,\] so we can try the five option choices and see which one, when multiplied by 7 and added to some whole number between 0 and 6 results in a multiple of 16. Trying all the option choices, we see that you need to add 7n to something more than 6 to equal a multiple of 16 other than for option A. Therefore, the answer is $\boxed{6}.$ | A | 6 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | There are $7$ segments whose lengths are $2 \sin \frac{\pi}{7}$ $7$ segments whose lengths are $2 \sin \frac{2 \pi}{7}$ $7$ segments whose lengths are $2 \sin \frac{3\pi}{7}$
Therefore, the sum of the $4$ th powers of these lengths is \begin{align*} 7 \cdot 2^4 \sin^4 \frac{\pi}{7} + 7 \cdot 2^4 \sin^4 \frac{2 \pi}{7} + 7 \cdot 2^4 \sin^4 \frac{3 \pi}{7} & = \frac{7 \cdot 2^4}{(2i)^4} \left( e^{i \frac{\pi}{7}} - e^{i \frac{\pi}{7}} \right)^4 + \frac{7 \cdot 2^4}{(2i)^4} \left( e^{i \frac{2 \pi}{7}} - e^{i \frac{2 \pi}{7}} \right)^4 + \frac{7 \cdot 2^4}{(2i)^4} \left( e^{i \frac{3 \pi}{7}} - e^{i \frac{4 \pi}{7}} \right)^4 \\ & = 7 \left( e^{i \frac{4 \pi}{7}} - 4 e^{i \frac{2 \pi}{7}} + 6 - 4 e^{- i \frac{2 \pi}{7}} + e^{- i \frac{4 \pi}{7}} \right) \\ & \quad + 7 \left( e^{i \frac{8 \pi}{7}} - 4 e^{i \frac{4 \pi}{7}} + 6 - 4 e^{- i \frac{4 \pi}{7}} + e^{- i \frac{8 \pi}{7}} \right) \\ & \quad + 7 \left( e^{i \frac{12 \pi}{7}} - 4 e^{i \frac{6 \pi}{7}} + 6 - 4 e^{- i \frac{6 \pi}{7}} + e^{- i \frac{12 \pi}{7}} \right) \\ & = 7 \left( e^{i \frac{4 \pi}{7}} + e^{i \frac{8 \pi}{7}} + e^{i \frac{12 \pi}{7}} + e^{-i \frac{4 \pi}{7}} + e^{-i \frac{8 \pi}{7}} + e^{-i \frac{12 \pi}{7}} \right) \\ & \quad - 7 \cdot 4 \left( e^{i \frac{2 \pi}{7}} + e^{i \frac{4 \pi}{7}} + e^{i \frac{6 \pi}{7}} + e^{-i \frac{2 \pi}{7}} + e^{-i \frac{4 \pi}{7}} + e^{-i \frac{6 \pi}{7}} \right) \\ & \quad + 7 \cdot 6 \cdot 3 \\ & = 7 \left( e^{i \frac{4 \pi}{7}} + e^{-i \frac{6 \pi}{7}} + e^{-i \frac{2 \pi}{7}} + e^{-i \frac{4 \pi}{7}} + e^{i \frac{6 \pi}{7}} + e^{i \frac{2 \pi}{7}} \right) \\ & \quad - 7 \cdot 4 \left( e^{i \frac{2 \pi}{7}} + e^{i \frac{4 \pi}{7}} + e^{i \frac{6 \pi}{7}} + e^{-i \frac{2 \pi}{7}} + e^{-i \frac{4 \pi}{7}} + e^{-i \frac{6 \pi}{7}} \right) \\ & \quad + 7 \cdot 6 \cdot 3 \\ & = -7 + 7 \cdot 4 + 7 \cdot 6 \cdot 3 \\ & = \boxed{147} ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | There are $7$ segments whose lengths are $2 \sin \frac{\pi}{7}$ $7$ segments whose lengths are $2 \sin \frac{2 \pi}{7}$ $7$ segments whose lengths are $2 \sin \frac{3\pi}{7}$
Therefore, the sum of the $4$ th powers of these lengths is \begin{align*} & 7 \cdot 2^4 \sin^4 \frac{\pi}{7} + 7 \cdot 2^4 \sin^4 \frac{2 \pi}{7} + 7 \cdot 2^4 \sin^4 \frac{3 \pi}{7} \\ & = 7 \cdot 2^4 \left( \frac{1 - \cos \frac{2 \pi}{7}}{2} \right)^2 + 7 \cdot 2^4 \left( \frac{1 - \cos \frac{4 \pi}{7}}{2} \right)^2 + 7 \cdot 2^4 \left( \frac{1 - \cos \frac{6 \pi}{7}}{2} \right)^2 \\ & = 7 \cdot 2^2 \left( 1 - 2 \cos \frac{2 \pi}{7} + \cos^2 \frac{2 \pi}{7} \right) + 7 \cdot 2^2 \left( 1 - 2 \cos \frac{4 \pi}{7} + \cos^2 \frac{4 \pi}{7} \right) + 7 \cdot 2^2 \left( 1 - 2 \cos \frac{6 \pi}{7} + \cos^2 \frac{6 \pi}{7} \right) \\ & = 7 \cdot 2^2 \cdot 3 - 7 \cdot 2^3 \left( \cos \frac{2 \pi}{7} + \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} \right) + 7 \cdot 2^2 \left( \cos^2 \frac{2 \pi}{7} + \cos^2 \frac{4 \pi}{7} + \cos^2 \frac{6 \pi}{7} \right) \\ & = 7 \cdot 2^2 \cdot 3 - 7 \cdot 2^3 \left( \cos \frac{2 \pi}{7} + \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} \right) + 7 \cdot 2^2 \left( \frac{1 + \cos \frac{4 \pi}{7} }{2} + \frac{1 + \cos \frac{8 \pi}{7} }{2} + \frac{1 + \cos \frac{12 \pi}{7} }{2} \right) \\ & = 7 \cdot 2^2 \cdot 3 - 7 \cdot 2^3 \left( \cos \frac{2 \pi}{7} + \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} \right) + 7 \cdot 2 \cdot 3 + 7 \cdot 2 \left( \cos \frac{4 \pi}{7} + \cos \frac{8 \pi}{7} + \cos \frac{12 \pi}{7} \right) \\ & = 7 \cdot 2^2 \cdot 3 - 7 \cdot 2^3 \left( \cos \frac{2 \pi}{7} + \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} \right) + 7 \cdot 2 \cdot 3 + 7 \cdot 2 \left( \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} + \cos \frac{2 \pi}{7} \right) \\ & = 7 \cdot 2 \cdot 3 \left( 2 + 1 \right) - 7 \cdot 2 \left( 4 - 1 \right) \left( \cos \frac{4 \pi}{7} + \cos \frac{6 \pi}{7} + \cos \frac{2 \pi}{7} \right) \\ & = 7 \cdot 2 \cdot 3 \left( 2 + 1 \right) - 7 \cdot 2 \left( 4 - 1 \right) \cdot \left( - \frac{1}{2} \right) \\ & = \boxed{147} . \] | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | As explained in Solutions 1 and 2, what we are trying to find is $7 \cdot 2^4 \sin^4 \frac{\pi}{7} + 7 \cdot 2^4 \sin^4 \frac{2 \pi}{7} + 7 \cdot 2^4 \sin^4 \frac{3 \pi}{7}$ . Using trig we get \begin{align*} & \sin^4 \frac{\pi}{7} + \sin^4 \frac{2 \pi}{7} + \sin^4 \frac{3 \pi}{7} \\ = & \sin^2 \frac{\pi}{7} \left(1 - \cos^2 \frac{\pi}{7} \right) + \sin^2 \frac{2\pi}{7} \left(1 - \cos^2 \frac{2\pi}{7} \right) + \sin^2 \frac{3\pi}{7} \left(1 - \cos^2 \frac{3\pi}{7} \right) \\ = & \sin^2 \frac{\pi}{7} - \left(\frac{1}{2} \sin \frac{2\pi}{7}\right)^2 + \sin^2 \frac{2\pi}{7} - \left(\frac{1}{2} \sin \frac{4\pi}{7}\right)^2 + \sin^2 \frac{3\pi}{7} - \left(\frac{1}{2} \sin \frac{6\pi}{7}\right)^2\\ = & \sin^2 \frac{\pi}{7} - \frac{1}{4} \sin^2 \frac{2\pi}{7} + \sin^2 \frac{2\pi}{7} - \frac{1}{4} \sin^2 \frac{4\pi}{7} + \sin^2 \frac{3\pi}{7} - \frac{1}{4} \sin^2 \frac{6\pi}{7} \\ = & \frac{3}{4} \left(\sin^2 \frac{\pi}{7} + \sin^2 \frac{2\pi}{7} + \sin^2 \frac{3\pi}{7}\right) \\ = & \frac{3}{4} \cdot \frac{1}{2} \left(1 - \cos \frac{2\pi}{7} + 1 - \cos \frac{4\pi}{7} + 1 - \cos \frac{6\pi}{7} \right)\\ = & \frac{3}{4} \cdot \frac{1}{2} \left(3 - \left(-\frac{1}{2}\right)\right) \\ = & \frac{21}{16}. \end{align*} Like in the second solution, we also use the fact that $\cos \frac{2\pi}{7} + \cos \frac{4\pi}{7} + \cos \frac{6\pi}{7} = -\frac{1}{2}$ , which admittedly might need some explanation.
For explanation see supplement
Notice that \begin{align*} \cos \frac{2\pi}{7} + \cos \frac{4\pi}{7} + \cos \frac{6\pi}{7} & = \frac{1}{2}\left(e^\frac{2i\pi}{7}+ e^{-\frac{2i\pi}{7}} \right) + \frac{1}{2}\left( e^\frac{4i\pi}{7}+ e^{-\frac{4i\pi}{7}} \right) + \frac{1}{2}\left( e^\frac{6i\pi}{7}+ e^{-\frac{6i\pi}{7}}\right) \\ & = \frac{1}{2}\left(e^\frac{2i\pi}{7}+ e^{-\frac{2i\pi}{7}}+ e^\frac{4i\pi}{7}+ e^{-\frac{4i\pi}{7}} +e^\frac{6i\pi}{7}+ e^{-\frac{6i\pi}{7}} + 1\right) - \frac{1}{2} \end{align*} In the brackets we have the sum of the roots of the polynomial $x^7 - 1 = 0$ . These sum to $0$ by Vieta’s formulas , and the desired identity follows. See Roots of unity if you have not seen this technique.
Going back to the question: \[7 \cdot 2^4 \sin^4 \frac{\pi}{7} + 7 \cdot 2^4 \sin^4 \frac{2 \pi}{7} + 7 \cdot 2^4 \sin^4 \frac{3 \pi}{7} = 7 \cdot 2^4 \left(\sin^4 \frac{\pi}{7} + \sin^4 \frac{2 \pi}{7} + \sin^4 \frac{3 \pi}{7}\right) = 7 \cdot 2^4 \cdot \frac{21}{16} = \boxed{147}.\] ~obscene_kangaroo | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | This solution follows the same steps as the trigonometry solutions (Solutions 2 and 3), except it gives an alternate way to prove the statement below true without complex numbers:
\[\cos \frac{2\pi}{7} + \cos \frac{4\pi}{7} + \cos \frac{6\pi}{7} = -\frac{1}{2}\]
\begin{align*} S &= \cos \frac{2\pi}{7} + \cos \frac{4\pi}{7} + \cos \frac{6\pi}{7}, \\ S^2 &= \cos^2 \frac{2\pi}{7} + \cos^2 \frac{4\pi}{7} + \cos^2 \frac{6\pi}{7} + 2\cos \frac{2\pi}{7}\cos \frac{4\pi}{7} + 2\cos \frac{2\pi}{7}\cos \frac{6\pi}{7} + 2\cos \frac{4\pi}{7}\cos \frac{6\pi}{7} \\ &= \left(\frac{1+ \cos \frac{4\pi}{7}}{2}\right) + \left(\frac{1+ \cos \frac{8\pi}{7}}{2}\right) + \left(\frac{1+ \cos \frac{12\pi}{7}}{2}\right) + 2\cos \frac{2\pi}{7}\cos \frac{4\pi}{7} + 2\cos \frac{2\pi}{7}\cos \frac{6\pi}{7} + 2\cos \frac{4\pi}{7}\cos \frac{6\pi}{7} \\ &= \frac{1}{2}(3 + S) + \left(\cos \frac{6\pi}{7} + \cos \frac{2\pi}{7}\right) + \left(\cos \frac{8\pi}{7} + \cos \frac{4\pi}{7}\right) + \left(\cos \frac{10\pi}{7} + \cos \frac{2\pi}{7}\right) \\ &= \frac{1}{2}(3 + S) + 2\cos \frac{2\pi}{7} + 2\cos \frac{4\pi}{7} + 2\cos \frac{6\pi}{7}\\ &= \frac{1}{2}(3 + S) + 2S. \\ \end{align*} We end up with \[2S^2 - 5S - 3 = 0.\] Using the quadratic formula, we find the solutions for $S$ to be $-\frac{1}{2}$ and $3$ . Because $3$ is impossible, $S = -\frac{1}{2}$ .
With this result, following similar to steps to Solutions 2 and 3 will get $\boxed{147}$ | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | Let $x$ $y$ , and $z$ be the lengths of the chords with arcs $\frac{2\pi}{7}$ $\frac{4\pi}{7}$ and $\frac{6\pi}{7}$ respectively.
Then by the law of cosines we get: \begin{align*} x^2 &= 2\left(1-\cos\frac{2\pi}{7}\right), \\ y^2 &= 2\left(1-\cos\frac{4\pi}{7}\right), \\ z^2 &= 2\left(1-\cos\frac{6\pi}{7}\right). \end{align*} The answer is then just $7(x^4+y^4+z^4)$ (since there's $7$ of each diagonal/side), obtained by summing the squares of the above equations and then multiplying by $7$ \begin{align*} & \quad7\cdot2^2\left( \left(1-\cos\frac{2\pi}{7}\right)^2 + \left(1-\cos\frac{4\pi}{7}\right)^2 + \left(1-\cos\frac{6\pi}{7}\right)^2 \right) \\ &= 7\cdot4\left( \left(1-2\cos\frac{2\pi}{7}+\cos^2\frac{2\pi}{7}\right) + \left(1-2\cos\frac{4\pi}{7}+\cos^2\frac{4\pi}{7}\right) + \left(1-2\cos\frac{6\pi}{7}+\cos^2\frac{6\pi}{7}\right) \right) \\ &= 7\cdot4\left(3-2\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right) + \left(\cos^2\frac{2\pi}{7}+\cos^2\frac{4\pi}{7}+\cos^2\frac{6\pi}{7}\right) \right) \\ &= 7\cdot4\left(3-2\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right) + \frac12 \left(1+\cos\frac{4\pi}{7}+1+\cos\frac{8\pi}{7}+1+\cos\frac{12\pi}{7}\right) \right) \\ &= 7\cdot4\left(\frac{9}{2}-2\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right) + \frac12 \left(\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}+\cos\frac{2\pi}{7}\right) \right) \\ &= 7\cdot4\left(\frac{9}{2}-\frac{3}{2}\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right) \right) \\ &= 7\cdot4\left(\frac{9}{2}-\frac{3}{2}\left(-\frac{1}{2}\right)\right) \\ &= \boxed{147} | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | Hope you had a ruler handy! This problem can be done with a ruler and basic estimation.
First, measuring the radius of the circle obtains $2.9$ cm (when done on the paper version). Thus, any other measurement we get for the sides/diagonals should be divided by $2.9$
Measuring the sides of the circle gets $2.5$ cm. The shorter diagonals are $4.5$ cm, and the longest diagonals measure $5.6$ cm. Thus, we'd like to estimate \[7\left(\frac{2.5}{2.9}\right)^4 + 7\left(\frac{4.5}{2.9}\right)^4 + 7\left(\frac{5.6}{2.9}\right)^4.\]
We know $\left(\frac{2.5}{2.9}\right)^4$ is slightly less than $1.$ Let's approximate it as 1 for now. Thus, $7\left(\frac{2.5}{2.9}\right)^4 \approx 7.$
Next, $\left(\frac{4.5}{2.9}\right)^4$ is slightly more than $\left(\frac{4.5}{3}\right)^4.$ We know $\left(\frac{4.5}{3}\right)^4 = 1.5^4 = \frac{81}{16},$ slightly more than $5,$ so we can approximate $\left(\frac{4.5}{2.9}\right)^4$ as $5.5.$ Thus, $7\left(\frac{4.5}{2.9}\right)^4 \approx 38.5.$
Finally, $\left(\frac{5.6}{2.9}\right)^4$ is slightly less than $\left(\frac{5.6}{2.8}\right)^4 = 2^4 = 16.$ We say it's around $15,$ so then $7\left(\frac{5.6}{2.9}\right)^4 \approx 105.$
Adding what we have, we get $105 + 38.5 + 1 = 144.5$ as our estimate. We see $\boxed{147}$ is very close to our estimate, so we have successfully finished the problem. | C | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | First, we put the figure in the coordinate plane with the center of the circle at the origin and a vertex on the positive x-axis. Thus, the coordinates of the vertices will be the terminal points of integer multiples of the angle $\frac{2\pi}{7},$ which are \[\left(\cos\dfrac{2\pi n}{7}, \sin\dfrac{2\pi n}{7}\right)\] for integer $n.$ Then, we notice there are three types of diagonals: the ones with chords of arcs $\dfrac{2\pi}{7}, \dfrac{4\pi}{7},$ and $\dfrac{6\pi}{7}.$ We notive there are here are $7$ of each type of diagonal. Then, we use the pythagorean theorem to find the distance from $\left(\cos\frac{2\pi n}{7}, \sin\frac{2\pi n}{7}\right)$ to $(1, 0)$ \[\left(\sqrt{\left(\cos\frac{2\pi n}{7}-1\right)^2+\sin^2\frac{2\pi n}{7}}\right)^4=\left(\sqrt{\cos^2\frac{2\pi n}{7}+\sin^2\frac{2\pi n}{7}-2\cos\frac{2\pi n}{7}+1}\right)^4\] \[=\left(\sqrt{2-2\cos\frac{2\pi n}{7}}\right)^4\] \[=4\cos^2\frac{2\pi n}{7}-8\cos\frac{2\pi n}{7}+4.\] By the cosine double angle identity, $\cos{2\theta}=2\cos^2\theta-1.$ This means that $2\cos^2\theta=\cos{2\theta}+1.$ Substituting this in, \[4\cos^2\frac{2\pi n}{7}-8\cos\frac{2\pi n}{7}+4=2\left(\cos\frac{4\pi n}{7}+1\right)-8\cos\frac{2\pi n}{7}+4=2\cos\frac{4\pi n}{7}-8\cos\frac{2\pi n}{7}+6.\] Summing this up for $n=1,2,3,$ \[2\cos\frac{4\pi}{7}-8\cos\frac{2\pi}{7}+6+2\cos\frac{8\pi}{7}-8\cos\frac{4\pi}{7}+6+2\cos\frac{12\pi}{7}-8\cos\frac{6\pi}{7}+6\] \[=2\left(\cos\frac{4\pi}{7}+\cos\frac{8\pi}{7}+\cos\frac{12\pi}{7}\right)-8\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right)+18\] \[=2\left(\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}+\cos\frac{2\pi}{7}\right)-8\left(\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}\right)+18\] \[=2(-0.5)-8(-0.5)+18=21.\] (These equalities are based on $\cos\theta=\cos(2\pi-\theta)$ and $\cos\frac{2\pi}{7}+\cos\frac{4\pi}{7}+\cos\frac{6\pi}{7}=-\frac{1}{2}.$ ) (For explanation of this see supplement .)
Finally, because there are $7$ of each type of diagonal, the answer is $7\cdot 21=\boxed{147}.$ | null | 147 |
b430429b8155131e340e49534a88abf4 | https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_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 $4$ th powers of the lengths of all $21$ of its edges and diagonals?
$\textbf{(A) }49 \qquad \textbf{(B) }98 \qquad \textbf{(C) }147 \qquad \textbf{(D) }168 \qquad \textbf{(E) }196$ | Place the figure on the complex plane and let $w = e^{\frac{2\pi}{7}}$ (a $7$ th root of unity). The vertices of the $7$ -gon are $w^0,w^1,w^2,\dots,w^6$ . We wish to find \[\sum_{i=0}^5\sum_{j=i+1}^6\lvert w^i-w^j\rvert^4 = \frac{1}{2}\sum_{i=0}^6\sum_{j=0}^6\lvert w^i-w^j\rvert^4.\] The second expression is more convenient to work with. The factor of $\tfrac{1}{2}$ is because it double-counts each edge (and includes when $i=j$ , but the length is $0$ so it doesn't matter).
Recall the identity $|z|^2 = z\overline{z}$ . Since $|w| = 1$ $\overline{w} = w^{-1}$ , and \begin{align*} \lvert w^i-w^j\rvert^4 &= ((w^i-w^j)(w^{-i}-w^{-j}))^2 \\ &= (2-w^{i-j}-w^{j-i})^2 \\ &= 4+w^{2i-2j}+w^{2j-2i}+2(-2w^{i-j}-2w^{j-i}+1) \\ &= 6-4w^{i-j}-4w^{j-i}+w^{2i-2j}+w^{2j-2i}. \end{align*}
But notice that, for a fixed value of $i$ , over all values of $j$ from $0$ to $6$ , by properties of modular arithmetic with $w^7 = w^0$ (or expanding),
each of the $w^\bullet$ -terms takes on every value in $w^0,w^1,w^2,\dots,w^6$ exactly once. Since $\sum_{j=0}^6 w^j = 0$ \begin{align*} \frac{1}{2}\sum_{i=0}^6\sum_{j=0}^6\lvert w^i-w^j\rvert^4 &= \frac{1}{2}\sum_{i=0}^6\sum_{j=0}^6(6-4w^{i-j}-4w^{j-i}+w^{2i-2j}+w^{2j-2i}) \\ &= \frac{1}{2}\sum_{i=0}^6\left(\sum_{j=0}^6 6-4\sum_{j=0}^6 w^{i-j}-4\sum_{j=0}^6 w^{j-i}+\sum_{j=0}^6 w^{2i-2j}+\sum_{j=0}^6 w^{2j-2i}\right) \\ &= \frac{1}{2}\sum_{i=0}^6\left(\sum_{j=0}^6 6-4\sum_{j=0}^6 w^j-4\sum_{j=0}^6 w^j+\sum_{j=0}^6 w^j+\sum_{j=0}^6 w^j\right) \\ &= \frac{1}{2}\sum_{i=0}^6\sum_{j=0}^6 6 \\ &= \frac{1}{2}\cdot7\cdot7\cdot6 \\ &= \boxed{147} | C | 147 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.