 6.4.1: In 112, graph each set of real numbers on a number line.. 5xx 7 66
 6.4.2: In 112, graph each set of real numbers on a number line.5xx 7 26
 6.4.3: In 112, graph each set of real numbers on a number line.5xx 6 46
 6.4.4: In 112, graph each set of real numbers on a number line.5xx 6 06
 6.4.5: In 112, graph each set of real numbers on a number line.. 5xx 36
 6.4.6: In 112, graph each set of real numbers on a number line.5xx 56
 6.4.7: In 112, graph each set of real numbers on a number line.5xx 46
 6.4.8: In 112, graph each set of real numbers on a number line.. 5xx 76
 6.4.9: In 112, graph each set of real numbers on a number line.5x2 6 x 56
 6.4.10: In 112, graph each set of real numbers on a number line.5x3 x 6 76
 6.4.11: In 112, graph each set of real numbers on a number line.5x1 6 x 6 46
 6.4.12: In 112, graph each set of real numbers on a number line.5x7 x 06
 6.4.13: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.14: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.15: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.16: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.17: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.18: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.19: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.20: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.21: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.22: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.23: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.24: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.25: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.26: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.27: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.28: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.29: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.30: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.31: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.32: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.33: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.34: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.35: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.36: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.37: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.38: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.39: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.40: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.41: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.42: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.43: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.44: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.45: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.46: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.47: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.48: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.49: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.50: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.51: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.52: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.53: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.54: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.55: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.56: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.57: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.58: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.59: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.60: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.61: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.62: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.63: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.64: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.65: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.66: In 1366, solve each inequality and graph the solution set on a numb...
 6.4.67: In 6770, write an inequality with x isolated on the left side that ...
 6.4.68: In 6770, write an inequality with x isolated on the left side that ...
 6.4.69: In 6770, write an inequality with x isolated on the left side that ...
 6.4.70: In 6770, write an inequality with x isolated on the left side that ...
 6.4.71: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.72: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.73: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.74: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.75: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.76: In 7176, use setbuilder notation to find all real numbers satisfyi...
 6.4.77: The graphs show that the three components of love, namely passion, ...
 6.4.78: The graphs show that the three components of love, namely passion, ...
 6.4.79: The graphs show that the three components of love, namely passion, ...
 6.4.80: The graphs show that the three components of love, namely passion, ...
 6.4.81: The graphs show that the three components of love, namely passion, ...
 6.4.82: The graphs show that the three components of love, namely passion, ...
 6.4.83: The graphs show that the three components of love, namely passion, ...
 6.4.84: The graphs show that the three components of love, namely passion, ...
 6.4.85: In more U.S. marriages, spouses have different faiths. The bar grap...
 6.4.86: In more U.S. marriages, spouses have different faiths. The bar grap...
 6.4.87: On two examinations, you have grades of 86 and 88. There is an opti...
 6.4.88: On three examinations, you have grades of 88, 78, and 86. There is ...
 6.4.89: A car can be rented from Continental Rental for $80 per week plus 2...
 6.4.90: A car can be rented from Basic Rental for $60 per week plus 50 cent...
 6.4.91: An elevator at a construction site has a maximum capacity of 3000 p...
 6.4.92: An elevator at a construction site has a maximum capacity of 2800 p...
 6.4.93: A basic cellphone plan costs $20 per month for 60 calling minutes. ...
 6.4.94: The formula for converting Fahrenheit temperature, F, to Celsius te...
 6.4.95: When graphing the solutions of an inequality, what is the differenc...
 6.4.96: When solving an inequality, when is it necessary to change the dire...
 6.4.97: Describe ways in which solving a linear inequality is similar to so...
 6.4.98: Describe ways in which solving a linear inequality is different tha...
 6.4.99: Make Sense? In 99102, determine whether each statement makes sense ...
 6.4.100: Make Sense? In 99102, determine whether each statement makes sense ...
 6.4.101: Make Sense? In 99102, determine whether each statement makes sense ...
 6.4.102: Make Sense? In 99102, determine whether each statement makes sense ...
 6.4.103: A car can be rented from Basic Rental for $260 per week with no ext...
 6.4.104: A company manufactures and sells personalized stationery. The weekl...
Solutions for Chapter 6.4: Linear Inequalities in One Variable
Full solutions for Thinking Mathematically  6th Edition
ISBN: 9780321867322
Solutions for Chapter 6.4: Linear Inequalities in One Variable
Get Full SolutionsThis textbook survival guide was created for the textbook: Thinking Mathematically, edition: 6. Chapter 6.4: Linear Inequalities in One Variable includes 104 full stepbystep solutions. This expansive textbook survival guide covers the following chapters and their solutions. Thinking Mathematically was written by and is associated to the ISBN: 9780321867322. Since 104 problems in chapter 6.4: Linear Inequalities in One Variable have been answered, more than 66318 students have viewed full stepbystep solutions from this chapter.

Associative Law (AB)C = A(BC).
Parentheses can be removed to leave ABC.

Augmented matrix [A b].
Ax = b is solvable when b is in the column space of A; then [A b] has the same rank as A. Elimination on [A b] keeps equations correct.

Complete solution x = x p + Xn to Ax = b.
(Particular x p) + (x n in nullspace).

Free variable Xi.
Column i has no pivot in elimination. We can give the n  r free variables any values, then Ax = b determines the r pivot variables (if solvable!).

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

GaussJordan method.
Invert A by row operations on [A I] to reach [I AI].

Inverse matrix AI.
Square matrix with AI A = I and AAl = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B1 AI and (AI)T. Cofactor formula (Al)ij = Cji! detA.

Kronecker product (tensor product) A ® B.
Blocks aij B, eigenvalues Ap(A)Aq(B).

Krylov subspace Kj(A, b).
The subspace spanned by b, Ab, ... , AjIb. Numerical methods approximate A I b by x j with residual b  Ax j in this subspace. A good basis for K j requires only multiplication by A at each step.

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.

Orthogonal matrix Q.
Square matrix with orthonormal columns, so QT = Ql. Preserves length and angles, IIQxll = IIxll and (QX)T(Qy) = xTy. AlllAI = 1, with orthogonal eigenvectors. Examples: Rotation, reflection, permutation.

Orthonormal vectors q 1 , ... , q n·
Dot products are q T q j = 0 if i =1= j and q T q i = 1. The matrix Q with these orthonormal columns has Q T Q = I. If m = n then Q T = Q 1 and q 1 ' ... , q n is an orthonormal basis for Rn : every v = L (v T q j )q j •

Projection p = a(aTblaTa) onto the line through a.
P = aaT laTa has rank l.

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.

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

Schwarz inequality
Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def A.

Spanning set.
Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

Spectral Theorem A = QAQT.
Real symmetric A has real A'S and orthonormal q's.

Sum V + W of subs paces.
Space of all (v in V) + (w in W). Direct sum: V n W = to}.

Vector addition.
v + w = (VI + WI, ... , Vn + Wn ) = diagonal of parallelogram.