Find all triples consisting of a prime number and two positive integers and such that and are both powers of .
Find all triples of a prime number and a pair of positive integers such that and are both powers of .
Find all triples consisting of a prime number and two positive integers and such that and are both powers of .
Find all triples of a prime number and a pair of positive integers such that and are both powers of .
All solutions are .
(1) When , clearly all whose sum is a power of satisfy the problem's conditions, so we only need to consider .
(2) Suppose and . Without loss of generality, we assume , and hence . We therefore have
Taking both sides of the above equation modulo , and noting that is even, we thus have
If , then is clearly not divisible by , but this contradicts Eq. (1) (since .)
Hence does not divide , that is,
(3) By Fermat's little theorem, , so
that is, . Let be the highest power dividing .
(4) Now let us consider the highest power dividing . Let us expand binomially as a sum of a series of terms in . For all terms with , by the above it must be divisible by . The term is
which is clearly divisible by . The term is
which is clearly divisible by , but not by (since is the highest power dividing ). The last term is . Combining the above discussion: we know that the highest power dividing is .
(5) But on the other hand, we assumed from the start that , so we must have . But at the same time,
so we must have or .
(6) If , then all equalities in Eq. (2) must hold, so , but this clearly contradicts , so . Furthermore, based on , we have
Combining this with , we have ; in other words, .
(7) Now, if , we have
a contradiction! Hence , so , and .