Browse · MathNet
PrintCroatia_2018
Croatia 2018 number theory
Problem
Determine all pairs of positive integers such that divides .
Solution
The given condition implies that for some positive integer . The equation implies and . Therefore, the numbers are integers. By multiplying the second and the third one, we conclude that is an integer, meaning that . Now we have for some positive integers and . This implies . Hence, , which means that . The initial condition now implies .
We have three possible values for .
If , then , so the initial condition becomes , i.e. divides . We obtain one solution .
If , then , so , i.e. . Since is a multiple of , there is no solution in this case.
If , then , so , i.e. . Since is a multiple of , we obtain a solution .
The only solutions are and .
We have three possible values for .
If , then , so the initial condition becomes , i.e. divides . We obtain one solution .
If , then , so , i.e. . Since is a multiple of , there is no solution in this case.
If , then , so , i.e. . Since is a multiple of , we obtain a solution .
The only solutions are and .
Final answer
[(1, 1), (1, 3)]
Techniques
Factorization techniques