3. If a, beFand ab, show that x + a andx+ bare relatively prime in FIx. 4 (a) Let fly) drle ETyl If (lof v) and of v showthat f(y) cef r) for

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.8: Probability
Problem 32E
icon
Related questions
Question

#3 on the book 

b MATLAB: An Introduction with A X
Thomas W. Hungerford - Abstrac ×
+
O File | C:/Users/angel/Downloads/Thomas%20W.%20Hungerford%20-%20Abstract%20Algebra_%20AN%20lntroduction-Cengage%20Learning%20(2014).pdf
- A) Read aloud V Draw
F Highlight
O Erase
121
of 621
Proof - Adapt the proof of Corollary 1.3 to F[x].
Polynomials f(x) and g(x) are said to be relatively prime if their greatest common
divisor is 1p
Theorem 4.10
Let F be a field and a(x), b(x), c(x)eF[x]. If a(x)| b(x)c(x) and a(x) and b(x) are
relatively prime, then a(x)|c(x).
Proof Adapt the proof of Theorem 1.4 to F[x]. I
I Exercises
NOTE: F denotes a field.
A. 1. If f(x) EF[x], show that every nonzero constant polynomial divides f(x).
2. If f(x) = G + · · · + co with C, # Op, what is the gcd of f(x) and Op?
3. If a, beFand a + b, show that x+a and x + b are relatively prime in F[x].
4. (a) Let f(x), g(x)EF[x]. If f(x)|g(x) and g(x)\f(x), show that f(x) = cg(x) for
some nonzero cEF.
(b) If f(x) and g(x) in part (a) are monic, show that f(x) = g(x).
5. The Euclidean Algorithm for finding god'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:
(a) x*-x - + 1 and x - 1 in Q[x]
(b) * +x + 2x -x- x- 2 and x* + 2x' + 5x? + 4x + 4 in Q[x]
(c) x* + 3x + 2x + 4 and x – 1 in Z[]
(d) 4x* + 2x + 6x² + 4x + 5 and 3x+ 5x? + 6x in Z,[x]
Coprte 2012 O La AI Rig Rad May aot be copled t or te wae or in part D to leroic d,e rd perty eo y be fnte Bodk ndrC . Balvw b
ded that ny d dn at any ha he oaa ngmpera Cglaing ieomveddidonal tay te dghteinaguire i
100 Chapter 4 Arithmetic in F[x]
11:13 AM
e Type here to search
EPIC
Ai
EPIC
99+
10/30/2020
Transcribed Image Text:b MATLAB: An Introduction with A X Thomas W. Hungerford - Abstrac × + O File | C:/Users/angel/Downloads/Thomas%20W.%20Hungerford%20-%20Abstract%20Algebra_%20AN%20lntroduction-Cengage%20Learning%20(2014).pdf - A) Read aloud V Draw F Highlight O Erase 121 of 621 Proof - Adapt the proof of Corollary 1.3 to F[x]. Polynomials f(x) and g(x) are said to be relatively prime if their greatest common divisor is 1p Theorem 4.10 Let F be a field and a(x), b(x), c(x)eF[x]. If a(x)| b(x)c(x) and a(x) and b(x) are relatively prime, then a(x)|c(x). Proof Adapt the proof of Theorem 1.4 to F[x]. I I Exercises NOTE: F denotes a field. A. 1. If f(x) EF[x], show that every nonzero constant polynomial divides f(x). 2. If f(x) = G + · · · + co with C, # Op, what is the gcd of f(x) and Op? 3. If a, beFand a + b, show that x+a and x + b are relatively prime in F[x]. 4. (a) Let f(x), g(x)EF[x]. If f(x)|g(x) and g(x)\f(x), show that f(x) = cg(x) for some nonzero cEF. (b) If f(x) and g(x) in part (a) are monic, show that f(x) = g(x). 5. The Euclidean Algorithm for finding god'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: (a) x*-x - + 1 and x - 1 in Q[x] (b) * +x + 2x -x- x- 2 and x* + 2x' + 5x? + 4x + 4 in Q[x] (c) x* + 3x + 2x + 4 and x – 1 in Z[] (d) 4x* + 2x + 6x² + 4x + 5 and 3x+ 5x? + 6x in Z,[x] Coprte 2012 O La AI Rig Rad May aot be copled t or te wae or in part D to leroic d,e rd perty eo y be fnte Bodk ndrC . Balvw b ded that ny d dn at any ha he oaa ngmpera Cglaing ieomveddidonal tay te dghteinaguire i 100 Chapter 4 Arithmetic in F[x] 11:13 AM e Type here to search EPIC Ai EPIC 99+ 10/30/2020
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Paths and Circuits
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage