Browse · MathNet
PrintBaltic Way 2019
Baltic Way 2019 number theory
Problem
Let a prime number. Prove that is not a perfect cube.
Solution
Assume that . Then we have that . Since is prime, either or . If , then and , which is impossible. Now consider the possibility that . Since is prime, we have one of 3 cases.
1) , which does not give a solution;
2) . Thus, , but no perfect cube is congruent to 3 (mod 9) and so we again reach a contradiction.
3) . Then is not a solution. And for odd we have , or, equivalently, . This is impossible because is not a square residue modulo . This detail is not quite elementary and can be checked via the properties of the Legendre symbol:
Assume for a certain . This yields . Clearly , so (prime) must divide ; hence for a certain . Elimination of leads to a quadratic equation whose discriminant must be an even square. Thus , recasting into ; and must be odd. This leaves 1 and 3 as admissible values of ; but neither of them yields an integer solution to the quadratic equation (displayed).
1) , which does not give a solution;
2) . Thus, , but no perfect cube is congruent to 3 (mod 9) and so we again reach a contradiction.
3) . Then is not a solution. And for odd we have , or, equivalently, . This is impossible because is not a square residue modulo . This detail is not quite elementary and can be checked via the properties of the Legendre symbol:
Assume for a certain . This yields . Clearly , so (prime) must divide ; hence for a certain . Elimination of leads to a quadratic equation whose discriminant must be an even square. Thus , recasting into ; and must be odd. This leaves 1 and 3 as admissible values of ; but neither of them yields an integer solution to the quadratic equation (displayed).
Techniques
Prime numbersFactorization techniquesQuadratic residues