 17.1CE: Exercise 1. This software implements the "Mod p irreducibility Test...
 17.1E: Verify the assertion made in Example 2.
 17.2E: Suppose that D is an integral domain and F is a field containing D....
 17.3E: Show that a nonconstant polynomial from Z[x] that is irreducible ov...
 17.4E: Suppose that If r is rational and x – r divides f(x), show that r i...
 17.5E: Let F be a field and let a be a nonzero element of F.a. If af(x) is...
 17.6E: Let F be a field and f(x) ? F[x]. Show that, as far as deciding upo...
 17.7E: Explain how the Mod p Irreducibility Test (Theorem 17.3) can be use...
 17.8E: Suppose that f(x)?Zp[x] and f(x) is irreducible over Zp, where p is...
 17.9E: Construct a field of order 25.
 17.10E: Construct a field of order 27.
 17.11E: Show that x3 + x2 + x + 1 is reducible over Q. Does this fact contr...
 17.12E: Determine which of the polynomials below is (are) irreducible over Q.
 17.13E: Show that x4 + 1 is irreducible over Q but reducible over R. (This ...
 17.14E: Show that x2 + x + 4 is irreducible over Z11.
 17.15E: Let f(x) = x3 + 6 ? Z7[x]. Write f(x) as a product of irreducible p...
 17.16E: Let f(x) = x3 + x2 + x + 1 ? Z2[x]. Write f(x) as a product of irre...
 17.17E: Let p be a prime.a. Show that the number of reducible polynomials o...
 17.18E: Let p be a prime.a. Determine the number of irreducible polynomials...
 17.19E: Show that for every prime p there exists a field of order p2.
 17.20E: Prove that, for every positive integer n, there are infinitely many...
 17.21E: Show that the field given in Example 11 in this chapter is isomorph...
 17.22E: Let f(x) ? Zp[x]. Prove that if f(x) has no factor of the form x2 +...
 17.23E: Find all monic irreducible polynomials of degree 2 over Z3.
 17.24E: Given that ? is not the zero of a nonzero polynomial with rational ...
 17.25E: Find all the zeros and their multiplicities of x5 + 4x4 + 4x3 – x2 ...
 17.26E: Find all zeros of f(x) = 3x2 + x + 4 over Z7 by substitution. Find ...
 17.27E: (Rational Root Theorem) and an ? 0. Prove that if r and s are relat...
 17.28E: Let F be a field and let p(x), a1(x), a2(x), . . . , ak(x) ? F[x], ...
 17.29E: Show that x4 + 1 is reducible over Zp for every prime p. (This exer...
 17.30E: If p is a prime, prove that xp–1 – xp–2 + xp–3 – ? ? ? – x + 1 is i...
 17.31E: Let F be a field and let p(x) be irreducible over F. If E is a fiel...
 17.32E: Prove that the ideal is prime in Z[x] but not maximal in Z[x].
 17.33E: Let F be a field and let p(x) be irreducible over F. Show that {a +...
 17.34E: Let F be a field and let f(x) be a polynomial in F[x] that is reduc...
 17.35E: Example 1 in this chapter shows the converse of Theorem 17.2 is not...
 17.36E: Suppose there is a real number r with the property that r + 1/r is ...
 17.37E: In the game of Monopoly, would the probabilities of landing on vari...
 17.38E: Carry out the analysis given in Example 12 for a pair of tetrahedro...
 17.39E: Suppose in Example 12 that we begin with n (n> 2) ordinary dice eac...
 17.40E: Show that one twosided die labeled with 1 and 4 and another 18 si...
Solutions for Chapter 17: Contemporary Abstract Algebra 8th Edition
Full solutions for Contemporary Abstract Algebra  8th Edition
ISBN: 9781133599708
Solutions for Chapter 17
Get Full SolutionsThis expansive textbook survival guide covers the following chapters and their solutions. Since 41 problems in chapter 17 have been answered, more than 15483 students have viewed full stepbystep solutions from this chapter. This textbook survival guide was created for the textbook: Contemporary Abstract Algebra , edition: 8th. Contemporary Abstract Algebra was written by Sieva Kozinsky and is associated to the ISBN: 9781133599708. Chapter 17 includes 41 full stepbystep solutions.

Basis for V.
Independent vectors VI, ... , v d whose linear combinations give each vector in V as v = CIVI + ... + CdVd. V has many bases, each basis gives unique c's. A vector space has many bases!

Big formula for n by n determinants.
Det(A) is a sum of n! terms. For each term: Multiply one entry from each row and column of A: rows in order 1, ... , nand column order given by a permutation P. Each of the n! P 's has a + or  sign.

Column space C (A) =
space of all combinations of the columns of A.

Complex conjugate
z = a  ib for any complex number z = a + ib. Then zz = Iz12.

Factorization
A = L U. If elimination takes A to U without row exchanges, then the lower triangular L with multipliers eij (and eii = 1) brings U back to A.

Fourier matrix F.
Entries Fjk = e21Cijk/n give orthogonal columns FT F = nI. Then y = Fe is the (inverse) Discrete Fourier Transform Y j = L cke21Cijk/n.

Hermitian matrix A H = AT = A.
Complex analog a j i = aU of a symmetric matrix.

Hessenberg matrix H.
Triangular matrix with one extra nonzero adjacent diagonal.

Incidence matrix of a directed graph.
The m by n edgenode incidence matrix has a row for each edge (node i to node j), with entries 1 and 1 in columns i and j .

Jordan form 1 = M 1 AM.
If A has s independent eigenvectors, its "generalized" eigenvector matrix M gives 1 = diag(lt, ... , 1s). The block his Akh +Nk where Nk has 1 's on diagonall. Each block has one eigenvalue Ak and one eigenvector.

Left nullspace N (AT).
Nullspace of AT = "left nullspace" of A because y T A = OT.

Length II x II.
Square root of x T x (Pythagoras in n dimensions).

Multiplication Ax
= Xl (column 1) + ... + xn(column n) = combination of columns.

Normal equation AT Ax = ATb.
Gives the least squares solution to Ax = b if A has full rank n (independent columns). The equation says that (columns of A)·(b  Ax) = o.

Pseudoinverse A+ (MoorePenrose inverse).
The n by m matrix that "inverts" A from column space back to row space, with N(A+) = N(AT). A+ A and AA+ are the projection matrices onto the row space and column space. Rank(A +) = rank(A).

Rayleigh quotient q (x) = X T Ax I x T x for symmetric A: Amin < q (x) < Amax.
Those extremes are reached at the eigenvectors x for Amin(A) and Amax(A).

Reduced row echelon form R = rref(A).
Pivots = 1; zeros above and below pivots; the r nonzero rows of R give a basis for the row space of A.

Right inverse A+.
If A has full row rank m, then A+ = AT(AAT)l has AA+ = 1m.

Rotation matrix
R = [~ CS ] rotates the plane by () and R 1 = RT rotates back by (). Eigenvalues are eiO and eiO , eigenvectors are (1, ±i). c, s = cos (), sin ().

Spectrum of A = the set of eigenvalues {A I, ... , An}.
Spectral radius = max of IAi I.
I don't want to reset my password
Need help? Contact support
Having trouble accessing your account? Let us help you, contact support at +1(510) 9441054 or support@studysoup.com
Forgot password? Reset it here