Browse · MathNet
Print51st Ukrainian National Mathematical Olympiad, 3rd Round
Ukraine number theory
Problem
Suppose that for two natural numbers the following equality holds Where and are the least common multiple and the greatest common divisor of respectively. Prove that one number is divisible by another.
Solution
Let , then , , and using the formula we get, that . This implies that , which is possible if either or and the result follows.
Techniques
Greatest common divisors (gcd)Least common multiples (lcm)