Homepage › Solution manuals › Kenneth Ireland › A Classical Introduction to Modern Number Theory › Exercise 9.14
Exercise 9.14
For which primes is solvable ?
Answers
Proof. If is associate to 5, then , so is solvable.
If is a primary prime not associate to 5, the Law of Cubic Reciprocity gives
(see Ex. 9.13)
Conclusion: the equation is solvable iff the primary prime associate to is congruent modulo 5 to (or 0).
Examples:
is a primary prime congruent to 3 modulo 5, thus the equation has a solution ( .
is the primary prime associate to the prime , and , thus the equation has a solution .
Indeed, , and , so . □