Three positive integers are each greater than , have a product of , and are pairwise relatively prime. What is their sum?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Relatively prime numbers share no prime, so all the 2s go in one number, all the 3s in another, all the 5s in the third: 8, 27, 125.
Solution
1. Break into primes: , and , . So
2. "Pairwise relatively prime" means no two of the numbers share a common factor bigger than . So if one number contains a , no other number can contain a . All three s must go into the same number. The same holds for the s and the s.
3. That means each number is made of whole blocks from , , .
4. There are three blocks and three numbers, and each number must be bigger than . If one number took two blocks, another would get none and would equal . So each number gets exactly one block: the numbers are , and .
5. Check: .
6. The sum is .
The answer is .
Why this works
"Relatively prime" is a statement about prime factors, so start with the prime factorization. Once no prime may be shared, each prime's whole block has to sit in one number, and here the three blocks exactly fill the three numbers.
The trap
Splitting 27000 into three similar-sized numbers such as 30, 30, 30, which share factors and so break the relatively prime rule.
Concise solution
Factor: .
If two of the numbers shared a prime factor they would not be relatively prime, so every copy of a given prime must sit inside the same number. The three primes must therefore be distributed with all of in one number, all of in another, and all of in a third. Because each number exceeds , no number can be left empty, so the numbers are exactly
Their sum is .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
Techniques
Set up the equation/formula and compute; no special trick needed