a)
The remainder
b)
The remainder of the polynomial
c)
The remainder of the polynomial
d)
The remainder of the polynomial
e)
The remainder of the polynomial
f)
The remainder of the polynomial
g)
The remainder of the polynomial
h)
The remainder of the polynomial
i)
The remainder of the polynomial
j)
The remainder of the polynomial
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
Elements Of Modern Algebra
- Let F be a field and f(x)=a0+a1x+...+anxnF[x]. Prove that x1 is a factor of f(x) if and only if a0+a1+...+an=0. Prove that x+1 is a factor of f(x) if and only if a0+a1+...+(1)nan=0.arrow_forwardSuppose that f(x),g(x), and h(x) are polynomials over the field F, each of which has positive degree, and that f(x)=g(x)h(x). Prove that the zeros of f(x) in F consist of the zeros of g(x) in F together with the zeros of h(x) in F.arrow_forwardLet be a field. Prove that if is a zero of then is a zero ofarrow_forward
- In Exercises , a field , a polynomial over , and an element of the field obtained by adjoining a zero of to are given. In each case: Verify that is irreducible over . Write out a formula for the product of two arbitrary elements and of . Find the multiplicative inverse of the given element of . , ,arrow_forwardLet Q denote the field of rational numbers, R the field of real numbers, and C the field of complex. Determine whether each of the following polynomials is irreducible over each of the indicated fields, and state all the zeroes in each of the fields. a. x22 over Q, R, and C b. x2+1 over Q, R, and C c. x2+x2 over Q, R, and C d. x2+2x+2 over Q, R, and C e. x2+x+2 over Z3, Z5, and Z7 f. x2+2x+2 over Z3, Z5, and Z7 g. x3x2+2x+2 over Z3, Z5, and Z7 h. x4+2x2+1 over Z3, Z5, and Z7arrow_forwardCorollary requires that be a field. Show that each of the following polynomials of positive degree has more than zeros over where is not a field. over overarrow_forward
- Prove Theorem If and are relatively prime polynomials over the field and if in , then in .arrow_forwardProve Theorem Suppose is an irreducible polynomial over the field such that divides a product in , then divides some .arrow_forwardUse Theorem to show that each of the following polynomials is irreducible over the field of rational numbers. Theorem Irreducibility of in Suppose is a polynomial of positive degree with integral coefficients and is a prime integer that does not divide. Let Where for If is irreducible in then is irreducible in .arrow_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,