Chapter 4: Q14. (page 110)
(a) Suppose are roots of (with ). Use the
Factor Theorem to show that and .
(b) Suppose are roots of (with )·Show that and role="math" localid="1648655841662" and .
Short Answer
It is shown that,
- and .
- and and
Chapter 4: Q14. (page 110)
(a) Suppose are roots of (with ). Use the
Factor Theorem to show that and .
(b) Suppose are roots of (with )·Show that and role="math" localid="1648655841662" and .
It is shown that,
All the tools & learning materials you need for study success - in one app.
Get started for freeWhich of the following subsets of are sub rings of ? Justify your answer:
Let R be an integral domain. Then the Division Algorithm holds in R [x] whenever the divisor is monic by exercise 14 in 4.1. Use fact to show that the remainder and factor theorem holds in R [x].
Show that a nonzero polynomial in has exactly p-1associates.
Prove that every non-zero has a unique monic associate in .
Question: The Euclidean Algorithm for finding gcd's is described for integers in Exercise 15 of Section 1.2. The process given there also works for polynomials over a field, with one minor adjustment. For integers, the last nonzero remainder is the gcd. For polynomials the last nonzero remainder is a common divisor of highest degree, but it may not be monic. In that case, multiply it by the inverse of its leading coefficient to obtain the gcd. Use the Euclidean Algorithm to find the gcd of the given polynomials:
What do you think about this solution?
We value your feedback to improve our textbook solutions.