×
×

# Solutions for Chapter 6.6: Solving Quadratic Equations by Factoring

## Full solutions for Introductory & Intermediate Algebra for College Students | 4th Edition

ISBN: 9780321758941

Solutions for Chapter 6.6: Solving Quadratic Equations by Factoring

Solutions for Chapter 6.6
4 5 0 310 Reviews
20
1
##### ISBN: 9780321758941

This textbook survival guide was created for the textbook: Introductory & Intermediate Algebra for College Students, edition: 4. Chapter 6.6: Solving Quadratic Equations by Factoring includes 123 full step-by-step solutions. Since 123 problems in chapter 6.6: Solving Quadratic Equations by Factoring have been answered, more than 71002 students have viewed full step-by-step solutions from this chapter. Introductory & Intermediate Algebra for College Students was written by and is associated to the ISBN: 9780321758941. This expansive textbook survival guide covers the following chapters and their solutions.

Key Math Terms and definitions covered in this textbook
• Adjacency matrix of a graph.

Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).

• 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.

• Cramer's Rule for Ax = b.

B j has b replacing column j of A; x j = det B j I det A

• Echelon matrix U.

The first nonzero entry (the pivot) in each row comes in a later column than the pivot in the previous row. All zero rows come last.

• Full column rank r = n.

Independent columns, N(A) = {O}, no free variables.

• Independent vectors VI, .. " vk.

No combination cl VI + ... + qVk = zero vector unless all ci = O. If the v's are the columns of A, the only solution to Ax = 0 is x = o.

• lA-II = l/lAI and IATI = IAI.

The big formula for det(A) has a sum of n! terms, the cofactor formula uses determinants of size n - 1, volume of box = I det( A) I.

• Lucas numbers

Ln = 2,J, 3, 4, ... satisfy Ln = L n- l +Ln- 2 = A1 +A~, with AI, A2 = (1 ± -/5)/2 from the Fibonacci matrix U~]' Compare Lo = 2 with Fo = O.

• Markov matrix M.

All mij > 0 and each column sum is 1. Largest eigenvalue A = 1. If mij > 0, the columns of Mk approach the steady state eigenvector M s = s > O.

• Multiplicities AM and G M.

The algebraic multiplicity A M of A is the number of times A appears as a root of det(A - AI) = O. The geometric multiplicity GM is the number of independent eigenvectors for A (= dimension of the eigenspace).

• Orthogonal subspaces.

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

• Pivot.

The diagonal entry (first nonzero) at the time when a row is used in elimination.

• Pseudoinverse A+ (Moore-Penrose 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).

• Random matrix rand(n) or randn(n).

MATLAB creates a matrix with random entries, uniformly distributed on [0 1] for rand and standard normal distribution for randn.

• Rank r (A)

= number of pivots = dimension of column space = dimension of row space.

• Schwarz inequality

Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def 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!

• Standard basis for Rn.

Columns of n by n identity matrix (written i ,j ,k in R3).

• Tridiagonal matrix T: tij = 0 if Ii - j I > 1.

T- 1 has rank 1 above and below diagonal.

• Vandermonde matrix V.

V c = b gives coefficients of p(x) = Co + ... + Cn_IXn- 1 with P(Xi) = bi. Vij = (Xi)j-I and det V = product of (Xk - Xi) for k > i.

×