9.7. Find all triples of prime numbers such that the fourth power of any of them, decreased by 1, is divisible by the product of the other two.
(V. Senderov)
9.7. Find all triples of prime numbers such that the fourth power of any of them, decreased by 1, is divisible by the product of the other two.
(V. Senderov)
# Answer. .
Solution. It is clear that any two numbers in the triplet are distinct (if , then does not divide ). Let be the smallest of the numbers in the triplet. We know that the number is divisible by . Note that is less than any of the prime numbers and , and therefore is coprime with them. Furthermore, the number cannot be divisible by both and , since , which is only possible if . Then one of the numbers and is even, and since it is prime, . Finally, is a prime divisor of the number , different from , so .
It remains to check that the triplet satisfies the conditions of the problem.
Comment. Only the correct answer -1 point.
The idea of choosing the smallest from the three prime numbers to investigate the divisibility of by is worth 1 point.
If the solution is correct but lacks the indication that the obtained triplet fits, 1 point is deducted.