| A | B |
| compound inequality | 2 inequalities joined by "or" or "and" |
| consistent independent system | has just 1 solution |
| perpendicular lines slopes | opposite reciprocals |
| first 4 powers of i | i, -1, -i, 1 |
| undefined | slope of vertical line |
| factoring difference of cubes | (a^3 - b^3) = (a-b)(a^2 +ab + b^2) |
| factoring sum of cubes | (a^3 + b^3)=(a+b)(a^2-ab+b^2) |
| independent variable | the variable in an ordered pair subject to choice |
| discriminant | b^2 - 4ac |
| inverse of a square matrix | exists if its determinant does not equal 0 |
| Identity matrix | 1's on main diagonal; 0's elsewhere |
| Cramer's rule | method for solving sys of eqns using determinants of matrices |
| slope intercept form | y=mx + b |
| additive identity | a + 0 = a |
| Set of integers | ...-1, -2, -1, 0, 1, 2, 3.... |
| commutative prop of mult | a * b = b * a |
| point-slope form | y - ysub 1 = m(x - xsub 1) |
| difference of two squares | 4x^2 - 100 |
| set of natural #'s | 1, 2, 3, 4, 5... |
| Perfect square trinomial | x^2 - 8x + 16 |
| Ax + by = C | std form eqn of line |
| Distributive property | a(b + c) = ab + ac |
| domain | set of all x-values in a relation |
| constraints | set of all inequalities in linear programming |
| feasible region | shaded region of the graph in linear programming |
| a + bi | standard form of a complex # |
| rationalizing | to eliminate radicals or i from the denominator of a fraction |