## Math 116: Study Guide - Chapter 5

- Solve the system of equations by the method of substitution. One linear system, one non-linear system. Look at problems 5.1.11 - 39*.
- Find the system of linear equations which has the given solution. There is more than one
possible solution. One part has an ordered pair, the other part has an ordered triplet.
- Use a graphing calculator to approximate all points of intersection of the graph of the system
of equations. One system involving transcendental functions, one non-linear system. Look at
problems 5.1.41 - 51*.
- Write, but do not solve, the system of linear equations necessary to find the equation of a
circle passing through three points. The model is given to you. Look at problems 5.3.43 - 46.
- Use back substitution to find the solution to the system of equations. Look at
*all* problems
5.3.1 - 6*.
- Find the equation of a parabola passing through three points. Look at problems 5.3.39 - 42.
You will need to give the generic model (y=ax
^{2} + bx + c), substitute in the values for x and y,
solve the system of equations, and then write the final model.
- Solve the system of equations by the method of elimination. Two parts. Look at problems
5.2.11 - 29*.
- Solve the system of linear equations. Show your work. One is a three by three system of
linear equations, the other is a two by three system of linear equations. Look at problems
5.3.9 - 25*.
- Write the partial fraction decomposition for the rational expression. Look at problems 5.4.11
- 5.4.27*.
- Derive a system of inequalities to describe the region. Two parts. One of the systems is non-linear. Look at problems 5.5.51 - 60. The equations are given, all you have to do is put in the
correct inequality.
- Maximize and minimize the objective function subject to the given constraints. Look at
*all*
problems 5.6.1 - 5.6.12*.
- True or False.
- Know what consistent / inconsistent systems are.
- Know when a unique solution is possible and when it isn't.
- Know how to write a dependent solution
- Know the fundamental theorem of linear programming
- Know when a maximum and minimum will occur in a linear programming problem.

### Notes:

- *'d problems are directly from the text.
- Most of the *'d problems are directly from the homework exercises, a few are not.

# |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
Tot |

Pts |
12 |
6 |
8 |
6 |
6 |
6 |
12 |
10 |
6 |
10 |
8 |
10 |
100 |