Browse · MathNet
PrintSelection Examination A
Greece number theory
Problem
If is prime and are positive integers, find with respect to , all the pairs satisfying the equation: .
For the case we are given that , find all triads satisfying equation (1).
For the case we are given that , find all triads satisfying equation (1).
Solution
If , then and we have the solution .
If , then, since is prime, from the equation it follows that and or . Therefore we have the cases:
If , then , where positive integer, and then:
If , then , where is a positive integer and then
Moreover, if we are given , then we have:
Considering the solutions , we find , and so .
Considering the solutions , then , and hence we find .
If , then, since is prime, from the equation it follows that and or . Therefore we have the cases:
If , then , where positive integer, and then:
If , then , where is a positive integer and then
Moreover, if we are given , then we have:
Considering the solutions , we find , and so .
Considering the solutions , then , and hence we find .
Final answer
All solutions: (x, y) = (2, 1) or (x, y) = (p, p − 1) or (x, y) = (2p, p). With x + y = 21, the solutions are (x, y, p) = (11, 10, 11) and (14, 7, 7).
Techniques
Prime numbersFactorization techniquesTechniques: modulo, size analysis, order analysis, inequalities