Browse · MathNet
PrintWinter Mathematical Competition
Bulgaria number theory
Problem
Find all positive integers and such that divides .
Solution
Since divides we conclude that divides . We consider two cases.
Case 1. Let . Then we have two possibilities:
1.1) If then . Hence , i.e. and , where is an integer. Since divides , this gives a solution.
1.2) If then divides , i.e. .
Hence in this case the solutions are , where is a positive integer.
Case 2. Let , i.e. . If , then . Therefore or .
2.1) If then is an integer. Hence divides and this gives the solutions and .
2.2) If then is an integer which gives .
2.3) If then is an integer. This implies that , i.e. for some positive integer . After simplifications we obtain that is an integer, which is impossible for .
Finally, the solutions are for all positive integers and .
Case 1. Let . Then we have two possibilities:
1.1) If then . Hence , i.e. and , where is an integer. Since divides , this gives a solution.
1.2) If then divides , i.e. .
Hence in this case the solutions are , where is a positive integer.
Case 2. Let , i.e. . If , then . Therefore or .
2.1) If then is an integer. Hence divides and this gives the solutions and .
2.2) If then is an integer which gives .
2.3) If then is an integer. This implies that , i.e. for some positive integer . After simplifications we obtain that is an integer, which is impossible for .
Finally, the solutions are for all positive integers and .
Final answer
All solutions are (x, y) = (a, 2a) for any positive integer a, and (x, y) = (3, 1), (8, 1).
Techniques
Divisibility / FactorizationTechniques: modulo, size analysis, order analysis, inequalities