Factorization of Polynomials
[43/63%]Verify the assertion made in Example 2 (the polynomial is irreducible over but reducible over ).
Suppose that is an integral domain and is a field containing . If and is irreducible over but reducible over , what can you say about the factorization of over ?
Show that a nonconstant polynomial from that is irreducible over is primitive. (This exercise is referred to in this chapter.)
Suppose that . If is rational and divides , show that is an integer.
Let be a field and let be a nonzero element of .
If is irreducible over , prove that is irreducible over .
If is irreducible over , prove that is irreducible over .
If is irreducible over , prove that is irreducible over .
Use part c to prove that is irreducible over . (This exercise is referred to in this chapter.)
Let be a field and . Show that, as far as deciding upon the irreducibility of over is concerned, we may assume that is monic. (This assumption is useful when one uses a computer to check for irreducibility.)
Suppose there is a real number with the property that is an odd integer. Prove that is irrational.
Show that the equation has no solutions in the integers.
Explain how the Mod Irreducibility Test (Theorem 17.3) can be used to test members of for irreducibility.
Suppose that and is irreducible over , where is a prime. If , prove that is a field with elements.
Construct a field of order .
Construct a field of order .
Show that is reducible over . Does this fact contradict the corollary to Theorem 17.4?
Corollary (Irreducibility of th Cyclotomic Polynomial): For any prime , the th cyclotomic polynomial is irreducible over .
Determine which of the polynomials below is (are) irreducible over .
Referring to the field in Example 10 and denoting a coset by its representative only, find the representatives for and .
Let denote the field in Example 10 and be the multiplicative subgroup of . Prove that for any element of other than the identity, the cyclic subgroup generated by is . Would the same be true for a field if ? What about ?
What can you conclude about a polynomial in if is irreducible over for some prime (i.e., when the coefficients of are reduced modulo )? What can you conclude about a polynomial in if is reducible over for every prime (i.e., when the coefficients of are reduced modulo )?
Let and . If neither nor is a zero of , explain why, in order to prove that is irreducible over , it suffices to show that is not a factor of .
For the field where , find the multiplicative orders of and . Find the multiplicative inverse of .
Let be a field and be reducible over with . Prove that is not an integral domain.
Show that is irreducible over .
Let . If is a factor of in prove that is also a factor of in .
Let . Write as a product of irreducible polynomials over .
Let . Write as a product of irreducible polynomials over .
Prove that is irreducible over .
Find all zeros of over by substitution. Find all zeros of by using the quadratic formula (all calculations are done in ). Do your answers agree? Should they? Find all zeros of over by substitution. Try the quadratic formula on . Do your answers agree? State necessary and sufficient conditions for the quadratic formula to yield the zeros of a quadratic from , where is a prime greater than .
Let be a prime.
Show that the number of reducible polynomials over of the form is .
Determine the number of reducible quadratic polynomials over .
Let be a prime.
Determine the number of irreducible polynomials over of the form .
Determine the number of irreducible quadratic monic polynomials over .
Show that for every prime there exists a field of order .
Prove that, for every positive integer , there are infinitely many monic polynomials of degree in that are irreducible over .
Show that the field given in Example 11 in this chapter is isomorphic to the field given in Example 9 in Chapter 13.
Let . Prove that if has no factor of the form , then it has no quadratic factor over .
Find all monic irreducible polynomials of degree over .
Given that is not the zero of a nonzero polynomial with rational coefficients, prove that cannot be written in the form , where and are rational.
(Rational Root Theorem) Let
and . Prove that if and are relatively prime integers and , then and .
Let be a field and let , where is irreducible over . If , show that divides some . (This exercise is referred to in the proof of Theorem 17.6.)
Theorem 16.4 ( Is a PID): Let be a field. Then is a principal ideal domain.
Let be a field and . Use Theorem 14.4 to prove that if is a maximal ideal in , then is irreducible over (see Theorem 17.5).
If is a prime, prove that is irreducible over .
Let be a field and let be irreducible over . If is a field that contains and there is an element in such that , show that the mapping given by is a ring homomorphism with kernel . (This exercise is referred to in Chapter 19.)
Prove that the ideal is prime in but not maximal in .
Let be a field and let be irreducible over . Show that is a subfield of isomorphic to . (This exercise is referred to in Chapter 19.)
Let be a field and let be a polynomial in that is reducible over . Prove that is not a prime ideal in .
Example 1 in this chapter shows the converse of Theorem 17.2 is not true. That is, a polynomial in can be reducible over but irreducible over . State a condition on that makes the converse true.