Browse · MathNet
PrintChina Mathematical Olympiad
China number theory
Problem
Find all triples such that where , are positive odd primes and is an integer.
Solution
It is easy to check that () satisfy both equations. Now let be another triple satisfying the condition. Then we must have , , . We may assume that .
If , then , or . Then either or , since cannot divide both and . On the other hand, , . This leads to a contradiction.
So . From , , we get Since , and , primes, we have Then . That means .
As and , we have , and consequently . Since , we have . So , and we get . Then , .
From , we know ; from we know . By Fermat's little theorem, we get . Then .
If , then . From and , we get . So . From , we get . This is a contradiction.
So we have , and that means . In a similar way, we have . As (since ) and , we know that . Then From and , we get and . So Then we have . Consequently, But this contradicts ① which says .
So we reach the conclusion that () are all the triples that satisfy the conditions.
If , then , or . Then either or , since cannot divide both and . On the other hand, , . This leads to a contradiction.
So . From , , we get Since , and , primes, we have Then . That means .
As and , we have , and consequently . Since , we have . So , and we get . Then , .
From , we know ; from we know . By Fermat's little theorem, we get . Then .
If , then . From and , we get . So . From , we get . This is a contradiction.
So we have , and that means . In a similar way, we have . As (since ) and , we know that . Then From and , we get and . So Then we have . Consequently, But this contradicts ① which says .
So we reach the conclusion that () are all the triples that satisfy the conditions.
Final answer
p = 3, q = 3, and n ≥ 2
Techniques
Fermat / Euler / Wilson theoremsGreatest common divisors (gcd)Factorization techniquesTechniques: modulo, size analysis, order analysis, inequalitiesPolynomial operations