Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia number theory

Problem

The product of positive integers , , and is divisible by , and the equations hold. Find the smallest possible sum of the numbers , , and under these conditions.
Solution
The given equations are equivalent to . So is divisible by , therefore is also divisible by . Since the product is divisible by , one of the numbers , and must be divisible by . If is divisible by , then is also divisible by , therefore must be divisible by . If is divisible by , then must also be divisible by . So in all cases is divisible by . Therefore is divisible by both and , so must be at least . If , then and and . If is larger, then and also and would be larger, hence the sum found is the smallest possible.
Final answer
96

Techniques

Least common multiples (lcm)Prime numbersIntegersSimple Equations