Homepage › Solution manuals › Kenneth Ireland › A Classical Introduction to Modern Number Theory › Exercise 9.21
Exercise 9.21
If is primary, show that there are infinitely many primary primes such that is not solvable. Show also that there are infinitely many primary primes such that is not solvable and the same for . (Hint: Imitate the proof of Theorem 3 of Chapter 5.)
Answers
Proof.
- a)
-
As some primary elements of
may be cubes, by example
, we must of course suppose that
is not the cube of some element of
(in the contrary case
is solvable for all prime
).
Note first that for all primes in , there exists such that . Indeed, there exist cubes in , which has elements, so there exists an element which is not a cube, therefore there exists such that . If , we put and if , we put . In the two cases, .
Let , where is primary. Then , where the are distinct primary primes. Write . Then grouping in the such that , we can write ( is a cube). Since by hypothesis is not a cube, . Moreover the equation is solvable iff is solvable. We may then suppose that
without cubic factors.
Note that the are not associate to (see Ex. 9.17).
Let a set (possibly empty) of distinct primary primes (therefore they are not associate), and not associate neither to , nor to .
We will show that we can find a primary prime distinct of the with the same properties and such that the equation is not solvable. This will prove the existence of infinitely many primes such that the equation is not solvable.
Using the initial note, let such that . As is a principal ideal domain, the Chinese Remainder Theorem is valid. Since is relatively prime to , there exists such that
The first equation show that is primary, so , where the are primary primes.
By Exercise 9.20,
As , and , we obtain , since or .
By Exercise 9.18, , with primary , so by induction, as ,
Thus there exists a subscript such that .
We can then take . Indeed, since and , is distinct of the and , and is not associate to since .
As , the equation is not solvable, so is convenient.
Conclusion : if is primary and is not a cube in , there exist infinitely many primes such that the equation is not solvable.
- b)
-
We show that
has no solution for infinitely many primes
.
To initialize the induction, we display such a prime , namely . Indeed, , 7 is a rational prime, so is a primary prime in , of the form , with , so : the equation is not solvable. Moreover is not associate to .
Suppose now the existence of a set , of distinct primary primes , not associate to and such the equation is not solvable for each . We will show that we can add a prime to the set with the same properties.
Let
is primary, so .
, where . By Exercise 9.19,
As , where the are primary primes, , so there exists a subscript such that .
Since , is associate neither to nor to . Moreover , thus the equation is not solvable: is convenient.
Conclusion: the equation is not solvable for infinitely many primes .
- c)
-
We show that
has no solution for infinitely many primes
.
To initialize the induction, we display such a prime , namely . Indeed, , 37 is a rational prime, so is a primary prime in , of the form , with , so : the equation is not solvable.
Suppose now the existence of a set , of distinct primary primes , not associate to and such the equation is not solvable. We will show that we can add a prime to the set with the same properties.
Let
is primary, so .
, where . By Exercise 9.19,
As , where the are primary primes, , so there exists a subscript such that .
Since , is associate neither to nor to . Moreover , thus the equation is not solvable : is convenient.
Conclusion : the equation is not solvable for infinitely many primes .