 Chapter 11: Expressions and Formulas
 Chapter 12: Properties of Real Numbers
 Chapter 13: Solving Equations
 Chapter 14: Solving Absolute Value Equations
 Chapter 15: Solving Inequalities
 Chapter 16: Solving Compound and Absolute Value Inequalities
 Chapter 101: Midpoint and Distance Formulas
 Chapter 102: Parabolas
 Chapter 103: Circles
 Chapter 104: Ellipses
 Chapter 105: Hyperbolas
 Chapter 106: Conic Sections
 Chapter 107: Solving Quadratic Systems
 Chapter 111: Arithmetic Sequences
 Chapter 112: Arithmetic Series
 Chapter 113: Geometric Sequences
 Chapter 114: Geometric Series
 Chapter 115: Infinite Geometric Series
 Chapter 116: Recursion and Special Sequences
 Chapter 117: The Binomial Theorem
 Chapter 118: Proof and Mathematical Induction
 Chapter 121: The Counting Principle
 Chapter 1210: Sampling and Error
 Chapter 122: Permutations and Combinations
 Chapter 123: Probability
 Chapter 124: Multiplying Probabilities
 Chapter 125: Adding Probabilities
 Chapter 126: Statistical Measures
 Chapter 127: The Normal Distribution
 Chapter 128: Exponential and Binomial Distribu
 Chapter 129: Binomial Experiments
 Chapter 131: Right Triangle Trigonometry
 Chapter 132: Angles and Angle Measure
 Chapter 133: Trigonometric Functions of General Angles
 Chapter 134: Law of Sines
 Chapter 135: Law of Cosines
 Chapter 136: Circular Functions
 Chapter 137: Inverse Trigonometric Functions
 Chapter 141: Graphing Trigonometric Functions
 Chapter 142: Translations of Trigonometric Graphs
 Chapter 143: Trigonometric Identities
 Chapter 144: Verifying Trigonometric Identities
 Chapter 145: Sum and Differences of Angles Formulas
 Chapter 146: DoubleAngle and HalfAngle Formulas
 Chapter 147: Solving Trigonometric Equations
 Chapter 21: Relations and Functions
 Chapter 22: Linear Equations
 Chapter 23: Slope
 Chapter 24: Writing Linear Equations
 Chapter 25: Statistics: Using Scatter Plots
 Chapter 26: Special Functions
 Chapter 27: Graphing Inequalities
 Chapter 31: Solving Systems of Equations by Graphing
 Chapter 32: Solving Systems of Equations Algebraically
 Chapter 33: Solving Systems of Inequalities by Graphing
 Chapter 34: Linear Programming
 Chapter 35: Solving Systems of Equations in Three Variables
 Chapter 41: Introduction to Matrices
 Chapter 42: Operations with Matrices
 Chapter 43: Multiplying Matrices
 Chapter 44: Transformations with Matrices
 Chapter 45: Determinants
 Chapter 46: Cramers Rule
 Chapter 47: Identity and Inverse Matrices
 Chapter 48: Using Matrices to Solve Systems of Equations
 Chapter 51: Graphing Quadratic Functions
 Chapter 52: Solving Quadratic Equations by Graphing
 Chapter 53: Solving Quadratic Equations by Factoring
 Chapter 54: Complex Numbers
 Chapter 55: Completing the Square
 Chapter 56: The Quadratic Formula and the Discriminant
 Chapter 57: Analyzing Graphs of Quadratic Functions
 Chapter 58: Graphing and Solving Quadratic Inequalities
 Chapter 61: Properties of Exponents
 Chapter 62: Operations with Polynomials
 Chapter 63: Dividing Polynomials
 Chapter 64: Polynomial Functions
 Chapter 65: Analyzing Graphs of Polynomial Functions
 Chapter 66: Solving Polynomial Equations
 Chapter 67: The Remainder and Factor Theorems
 Chapter 68: Roots and Zeros
 Chapter 69: Rational Zero Theorem
 Chapter 71: Operations on Functions
 Chapter 72: Inverse Functions and Relations
 Chapter 73: Square Root Functions and Inequalities
 Chapter 74: n th Roots
 Chapter 75: Operations with Radical Expressions
 Chapter 76: Rational Exponents
 Chapter 77: Solving Radical Equations and Inequalities
 Chapter 81: Multiplying and Dividing Rational Expressions
 Chapter 82: Adding and Subtracting Rational Expressions
 Chapter 83: Graphing Rational Functions
 Chapter 84: Direct, Joint, and Inverse Variation
 Chapter 85: Classes of Functions
 Chapter 86: Solving Rational Equations and Inequalities
 Chapter 91: Exponential Functions
 Chapter 92: Logarithms and Logarithmic Functions
 Chapter 93: Properties of Logarithms
 Chapter 94: Common Logarithms
 Chapter 95: Base e and Natural Logarithms
 Chapter 96: Exponential Growth and Decay
 Chapter Chapter 1: Equations and Inequalities
 Chapter Chapter 10: Conic Sections
 Chapter Chapter 11: Sequences and Series
 Chapter Chapter 12: Probability and Statistics
 Chapter Chapter 13: Trigonometric Functions
 Chapter Chapter 14: Trigonometric Graphs and Identities
 Chapter Chapter 2: Linear Relations and Functions
 Chapter Chapter 3: Systems of Equations and Inequalities
 Chapter Chapter 4: Matrices
 Chapter Chapter 5: Quadratic Functions and Inequalities
 Chapter Chapter 6 : Polynomial Functions
 Chapter Chapter 7: Radical Equations and Inequalities
 Chapter Chapter 8: Rational Expressions and Equations
 Chapter Chapter 9: Exponential and Logarithmic Relations
Algebra 2, Student Edition (MERRILL ALGEBRA 2) 1st Edition  Solutions by Chapter
Full solutions for Algebra 2, Student Edition (MERRILL ALGEBRA 2)  1st Edition
ISBN: 9780078738302
Algebra 2, Student Edition (MERRILL ALGEBRA 2)  1st Edition  Solutions by Chapter
Get Full SolutionsSince problems from 115 chapters in Algebra 2, Student Edition (MERRILL ALGEBRA 2) have been answered, more than 11746 students have viewed full stepbystep answer. Algebra 2, Student Edition (MERRILL ALGEBRA 2) was written by Patricia and is associated to the ISBN: 9780078738302. This expansive textbook survival guide covers the following chapters: 115. This textbook survival guide was created for the textbook: Algebra 2, Student Edition (MERRILL ALGEBRA 2), edition: 1. The full stepbystep solution to problem in Algebra 2, Student Edition (MERRILL ALGEBRA 2) were answered by Patricia, our top Math solution expert on 01/30/18, 04:22PM.

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.

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

Cramer's Rule for Ax = b.
B j has b replacing column j of A; x j = det B j I det A

Cyclic shift
S. Permutation with S21 = 1, S32 = 1, ... , finally SIn = 1. Its eigenvalues are the nth roots e2lrik/n of 1; eigenvectors are columns of the Fourier matrix F.

Distributive Law
A(B + C) = AB + AC. Add then multiply, or mUltiply then add.

Dot product = Inner product x T y = XI Y 1 + ... + Xn Yn.
Complex dot product is x T Y . Perpendicular vectors have x T y = O. (AB)ij = (row i of A)T(column j of B).

Fast Fourier Transform (FFT).
A factorization of the Fourier matrix Fn into e = log2 n matrices Si times a permutation. Each Si needs only nl2 multiplications, so Fnx and Fn1c can be computed with ne/2 multiplications. Revolutionary.

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.

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

Permutation matrix P.
There are n! orders of 1, ... , n. The n! P 's have the rows of I in those orders. P A puts the rows of A in the same order. P is even or odd (det P = 1 or 1) based on the number of row exchanges to reach I.

Projection matrix P onto subspace S.
Projection p = P b is the closest point to b in S, error e = b  Pb is perpendicularto S. p 2 = P = pT, eigenvalues are 1 or 0, eigenvectors are in S or S...L. If columns of A = basis for S then P = A (AT A) 1 AT.

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.

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

Schur complement S, D  C A } B.
Appears in block elimination on [~ g ].

Semidefinite matrix A.
(Positive) semidefinite: all x T Ax > 0, all A > 0; A = any RT R.

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.

Trace of A
= sum of diagonal entries = sum of eigenvalues of A. Tr AB = Tr BA.

Transpose matrix AT.
Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and AI are BT AT and (AT)I.

Unitary matrix UH = U T = UI.
Orthonormal columns (complex analog of Q).

Vector space V.
Set of vectors such that all combinations cv + d w remain within V. Eight required rules are given in Section 3.1 for scalars c, d and vectors v, w.
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