Browse · MathNet
PrintSelection tests for the Balkan Mathematical Olympiad 2013
Saudi Arabia 2013 number theory
Problem
For positive integers and , denotes their greatest common divisor and their least common multiple. Determine the number of ordered pairs of positive integers satisfying the equation
Solution
Let and , with two relatively prime positive integers. The equation becomes Therefore, divides and we have If , then , and this is impossible. Hence, , or .
1. If , the equation is equivalent to , which is impossible since does not divide .
2. If , the equation is equivalent to , which is impossible since does not divide .
3. If , the equation is equivalent to . Because are relatively prime positive integers, either or . This leads to two solutions and .
4. If , the equation is equivalent to , which is impossible since does not divide .
Therefore, the equation has two solutions and .
1. If , the equation is equivalent to , which is impossible since does not divide .
2. If , the equation is equivalent to , which is impossible since does not divide .
3. If , the equation is equivalent to . Because are relatively prime positive integers, either or . This leads to two solutions and .
4. If , the equation is equivalent to , which is impossible since does not divide .
Therefore, the equation has two solutions and .
Final answer
2
Techniques
Greatest common divisors (gcd)Least common multiples (lcm)Techniques: modulo, size analysis, order analysis, inequalities