Difference between revisions of "2022 AMC 10A Problems/Problem 7"
MRENTHUSIASM (talk | contribs) (→Solution 2: Fixed some errors and reformatted.) |
MRENTHUSIASM (talk | contribs) (Merged solutions so that they are more self-explanatory. Retained credits of authors.) |
||
Line 7: | Line 7: | ||
<math>\textbf{(A) } 3 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 12</math> | <math>\textbf{(A) } 3 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 12</math> | ||
− | == Solution | + | == Solution == |
Note that | Note that | ||
<cmath>\begin{align*} | <cmath>\begin{align*} | ||
Line 15: | Line 15: | ||
15 &= 3\cdot5. | 15 &= 3\cdot5. | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
− | From the least common multiple condition, we | + | Let <math>n = 2^a\cdot3^b\cdot5^c.</math> It follows that: |
+ | <ol style="margin-left: 1.5em;"> | ||
+ | <li>From the least common multiple condition, we have <cmath>\operatorname{lcm}(n,18) = \operatorname{lcm}(2^a\cdot3^b\cdot5^c,2\cdot3^2) = 2^{\max(a,1)}\cdot3^{\max(b,2)}\cdot5^{\max(c,0)} = 2^2\cdot3^2\cdot5,</cmath> from which <math>a=2, b\in\{0,1,2\},</math> and <math>c=1.</math></li><p> | ||
+ | <li>From the greatest common divisor condition, we have <cmath>\gcd(n,45) = \gcd(2^2\cdot3^b\cdot5,3^2\cdot5) = 2^{\min(2,0)}\cdot3^{\min(b,2)}\cdot5^{\min(1,1)} = 3\cdot5,</cmath> from which <math>b=1.</math></li><p> | ||
+ | </ol> | ||
+ | Together, we have <math>n=2^2\cdot3^1\cdot5^1=60.</math> The sum of its digits is <math>6+0=\boxed{\textbf{(B) } 6}.</math> | ||
− | + | ~MRENTHUSIASM ~USAMO333 | |
− | |||
− | |||
− | |||
− | ~MRENTHUSIASM | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | ~USAMO333 | ||
==Video Solution 1 (Quick and Easy)== | ==Video Solution 1 (Quick and Easy)== |
Revision as of 22:12, 10 January 2023
- The following problem is from both the 2022 AMC 10A #7 and 2022 AMC 12A #4, so both problems redirect to this page.
Problem
The least common multiple of a positive integer and is , and the greatest common divisor of and is . What is the sum of the digits of ?
Solution
Note that Let It follows that:
- From the least common multiple condition, we have from which and
- From the greatest common divisor condition, we have from which
Together, we have The sum of its digits is
~MRENTHUSIASM ~USAMO333
Video Solution 1 (Quick and Easy)
~Education, the Study of Everything
See Also
2022 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
2022 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 3 |
Followed by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.