Browse · MathNet
PrintCroatian Mathematical Society Competitions
Croatia number theory
Problem
Find all pairs of integers such that and divides . (Nikola Adžaga, Petar Bakić)
Solution
Note that , and that hence we have two cases:
1)
This implies and , from which we get and . Therefore, there is no solution in this case.
2)
This implies that and are both squares of integers. That is true only for and , since holds for , and holds for . Both and yield , i.e. , and among four possibilities only two satisfy the given conditions: and .
1)
This implies and , from which we get and . Therefore, there is no solution in this case.
2)
This implies that and are both squares of integers. That is true only for and , since holds for , and holds for . Both and yield , i.e. , and among four possibilities only two satisfy the given conditions: and .
Final answer
(-1, 0), (1, 0)
Techniques
Greatest common divisors (gcd)Factorization techniquesTechniques: modulo, size analysis, order analysis, inequalities