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 .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.