Browse · MathNet
PrintBalkan Mathematical Olympiad
number theory
Problem
Let be a prime number. Determine all triples of positive integers such that and
Solution
Given equation is equivalent to , and therefore . So, at least one of , w.l.o.g. , is divisible by and let . First, let us suppose that . Then i.e. , and therefore . Since we have , and therefore , a contradiction.
Next, let us assume that , but . Let . Then i.e. , and therefore . If , then , and therefore . But then , a contradiction. So, , and therefore . By AG inequality , and therefore a contradiction.
So, each of the numbers is divisible by . Let . Given equation is equivalent to Let . Then and therefore .
* If , then , and . This is a solution of the problem if and only if , i.e. if and only if .
* If , and w.l.o.g. , then . Let . As in the previous part of the solution we get that . If , then , i.e. . This is a solution of the problem if and only if , i.e. . If , then . This is a solution of the problem if and only if , i.e. if and only if .
All solutions of the problem are permutation of the triples: , for , for * , for .
Next, let us assume that , but . Let . Then i.e. , and therefore . If , then , and therefore . But then , a contradiction. So, , and therefore . By AG inequality , and therefore a contradiction.
So, each of the numbers is divisible by . Let . Given equation is equivalent to Let . Then and therefore .
* If , then , and . This is a solution of the problem if and only if , i.e. if and only if .
* If , and w.l.o.g. , then . Let . As in the previous part of the solution we get that . If , then , i.e. . This is a solution of the problem if and only if , i.e. . If , then . This is a solution of the problem if and only if , i.e. if and only if .
All solutions of the problem are permutation of the triples: , for , for * , for .
Final answer
All solutions are permutations of the following triples, depending on the prime: - For p ≥ 31: (3p, 3p, 3p), (2p, 4p, 4p), (2p, 3p, 6p) - For p = 29: (3p, 3p, 3p), (2p, 4p, 4p) - For p = 23: (3p, 3p, 3p) There are no solutions for smaller primes.
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesPrime numbersQM-AM-GM-HM / Power Mean