 6.4.1: To divide 16x3  32x2 + 2x + 4 by 4x, divide each term of _________...
 6.4.2: Consider the following long division problem: x + 46x  4 + 2x3. We...
 6.4.3: Consider the following long division problem: 3x  16x3 + 7x2 + 12x...
 6.4.4: In the following long division problem, the first step has been com...
 6.4.5: In the following long division problem, the first two steps have be...
 6.4.6: In the following long division problem, most of the steps have been...
 6.4.7: After performing polynomial long division, the answer may be checke...
 6.4.8: (18x7  9x6 + 20x5  10x4 ) , (2x4 )
 6.4.9: (18a3b2  9a2b  27ab2 ) , (9ab)
 6.4.10: (12a2b2 + 6a2b  15ab2 ) , (3ab)
 6.4.11: (36x4y3  18x3y2  12x2y) , (6x3y3 )
 6.4.12: (40x4y3  20x3y2  50x2y) , (10x3y3 )
 6.4.13: (x2 + 8x + 15) , (x + 5)
 6.4.14: (x2 + 3x  10) , (x  2)
 6.4.15: (x3  2x2  5x + 6) , (x  3)
 6.4.16: (x3 + 5x2 + 7x + 2) , (x + 2)
 6.4.17: (x2  7x + 12) , (x  5)
 6.4.18: (2x2 + x  9) , (x  2)
 6.4.19: (2x2 + 13x + 5) , (2x + 3)
 6.4.20: (8x2 + 6x  25) , (4x + 9)
 6.4.21: (x3 + 3x2 + 5x + 4) , (x + 1)
 6.4.22: (x3 + 6x2  2x + 3) , (x  1)
 6.4.23: (4y3 + 12y2 + 7y  3) , (2y + 3)
 6.4.24: (6y3 + 7y2 + 12y  5) , (3y  1)
 6.4.25: (9x3  3x2  3x + 4) , (3x + 2)
 6.4.26: (2x3 + 13x2 + 9x  6) , (2x + 3)
 6.4.27: (4x3  6x  11) , (2x  4)
 6.4.28: (2x3 + 6x  4) , (x + 4)
 6.4.29: (4y3  5y) , (2y  1)
 6.4.30: (6y3  5y) , (2y  1)
 6.4.31: (4y4  17y2 + 14y  3) , (2y  3)
 6.4.32: (2y4  y3 + 16y2  4) , (2y  1)
 6.4.33: (4x4 + 3x3 + 4x2 + 9x  6) , (x2 + 3)
 6.4.34: (3x5  x3 + 4x2  12x  8) , (x2  2)
 6.4.35: (15x4 + 3x3 + 4x2 + 4) , (3x2  1)
 6.4.36: (18x4 + 9x3 + 3x2 ) , (3x2 + 1)
 6.4.37: f(x) = 8x3  38x2 + 49x  10, g(x) = 4x  1
 6.4.38: f(x) = 2x3  9x2  17x + 39, g(x) = 2x  3
 6.4.39: f(x) = 2x4  7x3 + 7x2  9x + 10, g(x) = 2x  5
 6.4.40: f(x) = 4x4 + 6x3 + 3x  1, g(x) = 2x2 + 1
 6.4.41: x4 + y4 x + y
 6.4.42: x5 + y5 x + y
 6.4.43: 3x4 + 5x3 + 7x2 + 3x  2 x2 + x + 2
 6.4.44: x4  x3  7x2  7x  2 x2  3x  2
 6.4.45: 4x3  3x2 + x + 1 x2 + x + 1
 6.4.46: x4  x2 + 1 x2 + x + 1
 6.4.47: x5  1 x2  x + 2
 6.4.48: 5x5  7x4 + 3x3  20x2 + 28x  12 x3  4
 6.4.49: 4x3  7x2y  16xy2 + 3y3 x  3y
 6.4.50: 12x3  19x2y + 13xy2  10y3 4x  5y
 6.4.51: f(x) = 3x3 + 4x2  x  4, g(x) = 5x3 + 22x2  28x  12, h(x) = 4x + 1
 6.4.52: f(x) = x3 + 9x2  6x + 25, g(x) = 3x3 + 2x2  14x + 5, h(x) = 2x + 4
 6.4.53: ax + 2x + 4 = 3a3 + 10a2 + 6a
 6.4.54: ax  3x + 6 = a3  6a2 + 11a
 6.4.55: Find and interpret f(30). Identify the solution as a point on the g...
 6.4.56: Find and interpret f(70). Identify the solution as a point on the g...
 6.4.57: Rewrite the function by using long division to perform (80x  8000)...
 6.4.58: Rewrite the function by using long division to perform (80x  8000)...
 6.4.59: Explain how to divide a polynomial that is not a monomial by a mono...
 6.4.60: In your own words, explain how to divide by a polynomial containing...
 6.4.61: When performing polynomial long division, explain when to stop divi...
 6.4.62: After performing polynomial long division, explain how to check the...
 6.4.63: When performing polynomial long division with missing terms, explai...
 6.4.64: The idea of supplyside economics is that an increase in the tax ra...
 6.4.65: (6x2 + 16x + 8) , (3x + 2) = 2x + 4
 6.4.66: (4x3 + 7x2 + 8x + 20) , (2x + 4) = 2x2  1 2 x + 3
 6.4.67: (3x4 + 4x3  32x2  5x  20) , (x + 4) = 3x3  8x2 + 5
 6.4.68: Use the TABLE feature of a graphing utility to verify any two divis...
 6.4.69: When performing the division (2x3 + 13x2 + 9x  6) , (2x + 3), I me...
 6.4.70: When performing the division (x5 + 1) , (x + 1), theres no need for...
 6.4.71: Because of exponential properties, the degree of the quotient must ...
 6.4.72: When performing the division (x3 + 1) , (x + 2), the purpose of rew...
 6.4.73: All longdivision problems can be done by the alternative method of...
 6.4.74: Polynomial long division always shows that the answer is a polynomial.
 6.4.75: The long division process should be continued until the degree of t...
 6.4.76: If a polynomial longdivision problem results in a remainder that i...
 6.4.77: (x3n  4x2n  2xn  12) , (xn  5)
 6.4.78: (x3n + 1) , (xn + 1)
 6.4.79: When 2x2  7x + 9 is divided by a polynomial, the quotient is 2x  ...
 6.4.80: Find k so that the remainder is 0: (20x3 + 23x2  10x + k) , (4x + 3).
 6.4.81: Solve: 2x  3 7 4. (Section 4.3, Example 6)
 6.4.82: Write 40,610,000 in scientific notation. (Section 1.7, Example 2)
 6.4.83: Simplify: 2x  4[x  3(2x + 1)]. (Section 1.2, Example 14)
 6.4.84: a. Divide: 5x3 + 6x + 8 x + 2 . b. Find the sum of the numbers in e...
 6.4.85: a. Divide: 3x3  4x2 + 2x  1 x + 1 . b. Find the sum of the number...
 6.4.86: Divide 2x3  3x2  11x + 6 by x  3. Use your answer to factor 2x3 ...
Solutions for Chapter 6.4: Division of Polynomials
Full solutions for Intermediate Algebra for College Students  6th Edition
ISBN: 9780321758934
Solutions for Chapter 6.4: Division of Polynomials
Get Full SolutionsThis expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Intermediate Algebra for College Students, edition: 6. Chapter 6.4: Division of Polynomials includes 86 full stepbystep solutions. Intermediate Algebra for College Students was written by and is associated to the ISBN: 9780321758934. Since 86 problems in chapter 6.4: Division of Polynomials have been answered, more than 29791 students have viewed full stepbystep solutions from this chapter.

Change of basis matrix M.
The old basis vectors v j are combinations L mij Wi of the new basis vectors. The coordinates of CI VI + ... + cnvn = dl wI + ... + dn Wn are related by d = M c. (For n = 2 set VI = mll WI +m21 W2, V2 = m12WI +m22w2.)

Companion matrix.
Put CI, ... ,Cn in row n and put n  1 ones just above the main diagonal. Then det(A  AI) = ±(CI + c2A + C3A 2 + .•. + cnA nl  An).

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

Cross product u xv in R3:
Vector perpendicular to u and v, length Ilullllvlll sin el = area of parallelogram, u x v = "determinant" of [i j k; UI U2 U3; VI V2 V3].

Elimination matrix = Elementary matrix Eij.
The identity matrix with an extra eij in the i, j entry (i # j). Then Eij A subtracts eij times row j of A from row i.

Fibonacci numbers
0,1,1,2,3,5, ... satisfy Fn = Fnl + Fn 2 = (A7 A~)I()q A2). Growth rate Al = (1 + .J5) 12 is the largest eigenvalue of the Fibonacci matrix [ } A].

Full column rank r = n.
Independent columns, N(A) = {O}, no free variables.

Graph G.
Set of n nodes connected pairwise by m edges. A complete graph has all n(n  1)/2 edges between nodes. A tree has only n  1 edges and no closed loops.

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.

Multiplier eij.
The pivot row j is multiplied by eij and subtracted from row i to eliminate the i, j entry: eij = (entry to eliminate) / (jth pivot).

Nullspace matrix N.
The columns of N are the n  r special solutions to As = O.

Orthogonal subspaces.
Every v in V is orthogonal to every w in W.

Pascal matrix
Ps = pascal(n) = the symmetric matrix with binomial entries (i1~;2). Ps = PL Pu all contain Pascal's triangle with det = 1 (see Pascal in the index).

Reflection matrix (Householder) Q = I 2uuT.
Unit vector u is reflected to Qu = u. All x intheplanemirroruTx = o have Qx = x. Notice QT = Q1 = Q.

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 ().

Similar matrices A and B.
Every B = MI AM has the same eigenvalues as A.

Simplex method for linear programming.
The minimum cost vector x * is found by moving from comer to lower cost comer along the edges of the feasible set (where the constraints Ax = b and x > 0 are satisfied). Minimum cost at a comer!

Singular Value Decomposition
(SVD) A = U:E VT = (orthogonal) ( diag)( orthogonal) First r columns of U and V are orthonormal bases of C (A) and C (AT), AVi = O'iUi with singular value O'i > O. Last columns are orthonormal bases of nullspaces.

Special solutions to As = O.
One free variable is Si = 1, other free variables = o.