- 22.214.171.124.371: Market Purchases During the fall festival at Wambachs Farmers marke...
- 126.96.36.199.372: Landscape Purchases Agway Lawn and Garden collected the following i...
- 188.8.131.52.373: Real Estate The Maiellos are moving to Wilmington, Delaware. Their ...
- 184.108.40.206.374: Racing Fleet Foot Racing interviewed 150 longdistance runners to de...
- 220.127.116.11.375: Cultural Activities Thirty-three U.S. cities were researched to det...
- 18.104.22.168.376: Amusement Parks In a survey of 85 amusement parks, it was found tha...
- 22.214.171.124.377: Book Purchases A survey of 85 customers was taken at Barnes & Noble...
- 126.96.36.199.378: Movies A survey of 350 customers was taken at Regal Cinemas in Aust...
- 188.8.131.52.379: Jobs at a Restaurant Panera Bread compiled the following informatio...
- 184.108.40.206.380: Electronic Devices In a survey of college students, it was found th...
- 220.127.116.11.381: Homeowners Insurance Policies A committee of the Florida legislatur...
- 18.104.22.168.382: ppetizers Survey Da Tulios Restaurant hired Dennis Goldstein to det...
- 22.214.171.124.383: Discovering an Error An immigration agent sampled cars going from t...
- 126.96.36.199.384: Parks A survey of 300 parks showed the following. 15 had only campi...
- 188.8.131.52.385: Surveying Farmers A survey of 500 farmers in a midwestern state sho...
- 184.108.40.206.386: Family Reunion When the Montesano family members discussed where th...
- 220.127.116.11.387: Number of Elements A universal set U consists of 12 elements. If se...
Solutions for Chapter 2.5: Sets
Full solutions for A Survey of Mathematics with Applications | 9th Edition
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.
Diagonal matrix D.
dij = 0 if i #- j. Block-diagonal: zero outside square blocks Du.
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.
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.
Hankel matrix H.
Constant along each antidiagonal; hij depends on i + j.
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.
Left inverse A+.
If A has full column rank n, then A+ = (AT A)-I AT has A+ A = In.
Left nullspace N (AT).
Nullspace of AT = "left nullspace" of A because y T A = OT.
Minimal polynomial of A.
The lowest degree polynomial with meA) = zero matrix. This is peA) = det(A - AI) if no eigenvalues are repeated; always meA) divides peA).
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).
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).
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).
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).
Semidefinite matrix A.
(Positive) semidefinite: all x T Ax > 0, all A > 0; A = any RT R.
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).
Symmetric matrix A.
The transpose is AT = A, and aU = a ji. A-I is also symmetric.
Unitary matrix UH = U T = U-I.
Orthonormal columns (complex analog of Q).
v + w = (VI + WI, ... , Vn + Wn ) = diagonal of parallelogram.