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 ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Compare prime exponents: lcm(n, 18) = 180 = 2^2 3^2 5 forces 2^2 and 5 into n; gcd(n, 45) = 15 pins the exponent of 3 at exactly 1.
Solution
Factor everything: , , , . Write (no other primes can appear, since divides ).
From : the exponent of in the lcm is , so ; the exponent of is , so ; and , so .
From : the exponent of is , so (and confirms ).
Therefore , whose digit sum is .
The answer is .
Why this works
Both lcm and gcd act prime by prime: lcm takes the larger exponent, gcd the smaller. Each condition therefore becomes a small statement about a single exponent, and two conditions together pin every exponent down. Whenever a problem mixes gcd and lcm, factor and compare exponents rather than testing numbers.
Alternative approach
Since , is a multiple of but not of ; since , the candidates are . Only is a multiple of , which requires.
The trap
Using only the lcm condition (n = 20, 60, or 180 all work) and guessing, instead of letting the gcd condition fix the power of 3.
Common mistakes
- Using only the lcm condition (n = 20, 60, or 180 all work) and guessing, instead of letting the gcd condition fix the power of 3.
- Taking (digit sum ) or (digit sum , accidentally right) without checking both conditions.
Techniques
Set up the equation/formula and compute; no special trick needed