Chapter 4: Q6E (page 124)
Let with . Prove that the roots of in is and . [Hint: Show that is equivalent to ; then complete the square to find role="math" localid="1653653599624" ].
Short Answer
The roots of in is and .
Chapter 4: Q6E (page 124)
Let with . Prove that the roots of in is and . [Hint: Show that is equivalent to ; then complete the square to find role="math" localid="1653653599624" ].
The roots of in is and .
All the tools & learning materials you need for study success - in one app.
Get started for freeLet be an isomorphism of rings such that for each . Suppose is a root of . Prove that is also a root of f (x).
Find an odd prime p for which x - 2 is a divisor of in role="math" localid="1648624672660" .
Let be the function that maps each polynomial in R[x] onto its constant term (an element of R). Show that is a surjective homomorphism of rings.
Show that each polynomial is irreducible in by finding a prime such that
role="math" localid="1649237593303" is irreducible in
(a)
Give an example of a polynomial and a prime p such that is reducible inrole="math" localid="1649243074209" but is irreducible in. Does this contradict Theorem 4.25?
What do you think about this solution?
We value your feedback to improve our textbook solutions.