Difference between revisions of "2022 AMC 10A Problems/Problem 7"
MRENTHUSIASM (talk | contribs) (Added duplicates.) |
MRENTHUSIASM (talk | contribs) (→Solution 2: Fixed some errors and reformatted.) |
||
Line 24: | Line 24: | ||
== Solution 2 == | == Solution 2 == | ||
− | Since the | + | Since the LCM contains only factors of <math>2</math>, <math>3</math>, and <math>5</math>, <math>n</math> cannot be divisible by any other prime. |
− | |||
− | |||
− | |||
− | |||
− | + | Let <math>n = 2^a 3^b 5^c</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are nonnegative integers. | |
− | + | We know that <cmath>\operatorname{lcm}(n,18) = \operatorname{lcm}(n,2\cdot3^2) = \operatorname{lcm}(2^a \cdot 3^b \cdot 5^c, 2\cdot3^2) = 2^ {\max(a,1)} \cdot 3^ {\max(b,2)} \cdot 5^c = 180 = 2^2 \cdot 3^2 \cdot 5.</cmath> | |
+ | Thus, | ||
− | + | (1) <math>\max(a,1) = 2</math>, so <math>a = 2</math>. | |
− | + | (2) <math>\max(b,2) = 2</math>, so <math>0 \le b \le 2</math>. | |
− | = | + | |
− | This means, that since <math>c = 1</math>, <math> 3^{min(b,2)} \cdot 5 = | + | (3) <math>c = 1</math>. |
− | Hence, multiplying using <math>a = 2</math>, <math>b = 1</math>, <math>c = 1</math> gives <math>n = 60</math> and the sum of digits is | + | |
+ | From the GCD information, <cmath>\gcd(n,45) = \gcd(n, 3^2 \cdot 5) = \gcd(2^a \cdot 3^b \cdot 5^c, 3^2 \cdot 5) | ||
+ | = 3^{\min(b,2)} \cdot 5^{\min(c,1)} = 15 = 3\cdot5.</cmath> | ||
+ | This means, that since <math>c = 1</math>, it follows that <math>3^{\min(b,2)} \cdot 5 = 3\cdot5</math>, so <math>\min(b,2) = 1</math> and <math>b = 1</math>. | ||
+ | Hence, multiplying using <math>a = 2</math>, <math>b = 1</math>, <math>c = 1</math> gives <math>n = 60</math> and the sum of digits is <math>\boxed{\textbf{(B) } 6}</math>. | ||
~USAMO333 | ~USAMO333 |
Revision as of 21:09, 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 1
Note that From the least common multiple condition, we conclude that where
From the greatest common divisor condition, we conclude that
Therefore, we have The sum of its digits is
~MRENTHUSIASM
Solution 2
Since the LCM contains only factors of , , and , cannot be divisible by any other prime.
Let , where , , and are nonnegative integers.
We know that Thus,
(1) , so .
(2) , so .
(3) .
From the GCD information, This means, that since , it follows that , so and . Hence, multiplying using , , gives and the sum of digits is .
~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.