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
Break every number into primes. The lcm condition says n has two 2s and one 5; the gcd condition says n has exactly one 3.
Solution
The least common multiple and greatest common divisor both work one prime at a time, so break everything into primes first.
1. Prime factors. , , , .
2. What n can contain. is a multiple of , so is built only from s, s and s, and has no more of each than has.
3. The lcm condition. For each prime, the lcm uses the larger count from and .
- Twos: has one , but has two. The extra must come from , so has exactly two s.
- Fives: has no , but has one, so has exactly one .
- Threes: already has two s, so this condition tells us nothing about the s in .
4. The gcd condition. For each prime, the gcd uses the smaller count. has two s, but the gcd has only one. So has exactly one . (With no s the gcd would have none; with two s it would have two.)
5. Put it together. . Check: and .
6. The digit sum of is .
The answer is .
Why this works
The lcm takes the larger power of each prime and the gcd takes the smaller one. So when a problem mixes the two, write every number in primes and settle one prime at a time. Here each condition fixed a different prime, and together they pinned down.
Alternative approach
List the candidates. Since , is a multiple of but not a multiple of . The multiples of that divide are ; removing the multiples of leaves . For the lcm with to be , must be a multiple of , and only is.
The trap
Using only the lcm condition, which allows n = 20, 60 or 180, and then guessing. The gcd condition is what decides how many 3s n has.
Concise 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 .
Review in the AoPS books
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.7)
Techniques
Set up the equation/formula and compute; no special trick needed