586 8 Systems of Equations and Inequalities

In this chapter we move from the standard methods of solving two linear
equations with two variables to a method that can be used to solve linear
systems with any number of variables and equations. This method is well-
suited to computer use in the solution of larger systems. We also discuss sys-
tems involving nonlinear equations and systems of linear inequalities.
Finally, we introduce a relatively new and powerful mathematical tool called
linear programming. Many applications in mathematics involve systems of
equations or inequalities. The mathematical techniques discussed in this
chapter are applied to a variety of interesting and significant applications.

SECTION 8-1 Systems of Linear Equations

and Augmented Matrices
• Substitution: A Brief Review
• Graphing
• Elimination by Addition
• Matrices
• Solving Linear Systems Using Augmented Matrices

In this section we will continue our discussion, began in Section 1-2, of systems
involving two linear equations and two variables:

ax  by  h
(1)
cx  dy  k

where x and y are variables, a, b, c, and d are real numbers called the coefficients of
x and y, and h and k are real numbers called the constant terms in the equations.
Recall that a pair of numbers x  x0 and y  y0, also written as an ordered pair
(x0, y0), is a solution of this system if each equation is satisfied by the pair. The set
of all such ordered pairs of numbers is called the solution set for the system.
In Section 1-2, we used substitution to solve system (1). After briefly reviewing
this method, we will explore the relationship between the graph of the equations in a
system and the solution of the system and review the standard elimination-by-addi-
tion method. Then we will introduce augmented matrices to transform the elimina-
tion-by-addition method into a solution process that is well-suited for computer use
in the solution of linear systems involving large numbers of equations and variables.
To keep the introduction to augmented matrices in this section as simple as pos-
sible, we restrict the discussion to two equations with two variables. In the next sec-
tion, the solution process is generalized and applied to larger linear systems.

• Substitution: To review some of the basic concepts introduced in Section 1-2, consider the fol-
A Brief Review lowing simple example. At a computer fair, student tickets cost $2 and general admis-
sion tickets cost $3. If a total of 7 tickets are purchased for a total cost of $18, how
many of each type were purchased?
Let

x  Number of student tickets

y  Number of general admission tickets
 8-1 Systems of Linear Equations and Augmented Matrices 587

Then

x y 7 Total number of tickets purchased

2x  3y  18 Total purchase cost

To solve this system by substitution, we solve the first equation for y in terms of x
and substitute in the second equation:

xy7 2x  3y  18
y7x 2x  3(7  x)  18
x  21  18
x3

Now, replace x with 3 in y  7  x:

y7x
73
y4

Thus the solution is 3 student tickets and 4 general admission tickets. You should
check this result in each of the original equations.

• Graphing Recall that the graph of a linear equation is the line consisting of all ordered pairs
that satisfy the equation. If we graph both equations in system (1) in the same coor-
dinate system, then the coordinates of any points that the lines have in common must
be solutions to the system. Example 1 illustrates this process for the ticket problem
discussed above.

EXAMPLE 1 Solving a System by Graphing

Solve the ticket problem by graphing: x y 7

2x  3y  18

Solution From Figure 1 we see that:

FIGURE 1 y x3 Student tickets

y4 General admission tickets

10

Check xy7 2x  3y  18

5
34‚7 2(3)  3(4) ‚ 18
(3, 4)
2x  3y  18 7⁄7 18 ⁄ 18

10
x
5

xy7
588 8 Systems of Equations and Inequalities

Matched Problem 1 Solve by graphing and check: x  y  3

x  2y  3

It is clear that the preceding example has exactly one solution, since the lines
have exactly one point of intersection. In general, lines in a rectangular coordinate
system are related to each other in one of three ways illustrated in the next example.

EXAMPLE 2 Solving Three Important Types of Systems by Graphing

Solve each of the following systems by graphing:

(A) 2x  3y  2 (B) 4x  6y  12 (C) 2x  3y  6

x  2y  8 2x  3y  6 x  32 y  3

Solutions (A) y (B) y

5 5
(4, 2)

x x
5 5 5 5

5 5

Lines intersect at one point only. Lines are parallel (each has
Exactly one solution: x  4, y  2 slope 23). No solution.

(C) y

x
5 5

5

Lines coincide.
Infinitely many solutions.

Matched Problem 2 Solve each of the following systems by graphing:

(A) 2x  3y  12 (B) x  3y  3 (C) 2x  3y  12

x  3y  3 2x  6y  12 x  32y  6
 8-1 Systems of Linear Equations and Augmented Matrices 589

We now define some terms that can be used to describe the different types of
solutions to systems of equations illustrated in Example 2.

Systems of Linear Equations: Basic Terms

A system of linear equations is consistent if it has one or more solutions and

inconsistent if no solutions exist. Furthermore, a consistent system is said to
be independent if it has exactly one solution (often referred to as the unique
solution) and dependent if it has more than one solution.

Referring to the three systems in Example 2, the system in part A is consistent

and independent, with the unique solution x  4 and y  2. The system in part B is
inconsistent, with no solution. And the system in part C is consistent and dependent,
with an infinite number of solutions: all the points on the two coinciding lines.

EXPLORE-DISCUSS 1 (A) Can a consistent and dependent system have exactly two solutions? Exactly
three solutions? Explain.
(B) Solve each of the systems in Example 2 by the substitution method. Based on
your results, describe how you might recognize a dependent system or an
inconsistent system when using substitution.

By geometrically interpreting a system of two linear equations in two variables,

we gain useful information about what to expect in the way of solutions to the sys-
tem. In general, any two lines in a rectangular coordinate plane must intersect in
exactly one point, be parallel, or coincide (have identical graphs). Thus, the systems
in Example 2 illustrate the only three possible types of solutions for systems of two
linear equations in two variables. These ideas are summarized in Theorem 1.

Theorem 1 Possible Solutions to a Linear System

The linear system

ax  by  h
cx  dy  k

must have:

1. Exactly one solution Consistent and independent

or
2. No solution Inconsistent
or
3. Infinitely many solutions Consistent and dependent

There are no other possibilities.

590 8 Systems of Equations and Inequalities

One drawback of finding a solution by graphing is the inaccuracy of hand-drawn

graphs. Graphic solutions performed on a graphing utility, however, provide both a
useful geometric interpretation and an accurate approximation of the solution to a sys-
tem of linear equations in two variables.

EXAMPLE 3 Solving a System Using a Graphing Utility

Solve to two decimal places using a graphing utility: 5x  3y  13

2x  4y  15

Solution First solve each equation for y:

5x  3y  13 2x  4y  15
3y  5x  13 4y  2x  15
y 5
3x  13
3 y  0.5x  3.75

Next, enter each equation in a graphing utility [Fig. 2(a)], graph in an appropriate
viewing window, and approximate the intersection point [Fig. 2(b)].

FIGURE 2 10

10 10

10

(a) Equation definitions (b) Intersection point

Rounding the values in Figure 2(b) to two decimal places, we see that the solution is

x  3.73 and y  1.88 or (3.73, 1.88)

Check 5x  3y  13 2x  4y  15
5(3.73)  3(1.88) ‚ 13 2(3.73)  4(1.88) ‚ 15
13.01 ± 13 14.98 ± 15

The checks are not exact because the values of x and y are approximations.

Matched Problem 3 Solve to two decimal places using a graphing utility: 2x  5y  25
4x  3y  5

Graphic methods help us visualize a system and its solutions, frequently reveal
relationships that might otherwise be hidden, and, with the assistance of a graphing
utility, provide very accurate approximations to solutions.
 8-1 Systems of Linear Equations and Augmented Matrices 591

• Elimination Now we turn to elimination by addition. This is probably the most important method
by Addition of solution, since it is readily generalized to higher-order systems. The method
involves the replacement of systems of equations with simpler equivalent systems, by
performing appropriate operations, until we obtain a system with an obvious solution.
Equivalent systems of equations are, as you would expect, systems that have exactly
the same solution set. Theorem 2 lists operations that produce equivalent systems.

Theorem 2 Elementary Equation Operations Producing Equivalent Systems

A system of linear equations is transformed into an equivalent system if:

1. Two equations are interchanged.

2. An equation is multiplied by a nonzero constant.
3. A constant multiple of another equation is added to a given equation.

Any one of the three operations in Theorem 2 can be used to produce an equiv-
alent system, but operations 2 and 3 will be of most use to us now. Operation 1
becomes more important later in the section. The use of Theorem 2 is best illustrated
by examples.

EXAMPLE 4 Solving a System Using Elimination by Addition

Solve using elimination by addition: 3x  2y  8

2x  5y  1

Solution We use Theorem 2 to eliminate one of the variables and thus obtain a system with
an obvious solution.

3x  2y  8 If we multiply the top equation by 5, the bottom by 2, and

then add, we can eliminate y.
2x  5y  1

15x  10y  40
4x  10y  2
19x  38
x2
The equation x  2 paired with either of the two original equations produces an equiv-
alent system. Thus, we can substitute x  2 back into either of the two original equa-
tions to solve for y. We choose the second equation.

2(2)  5y  1
5y  5
y  1

Solution: x  2, y  1 or (2, 1).

592 8 Systems of Equations and Inequalities

Check 3x  2y  8 2x  5y  1
3(2)  2(1) ‚ 8 2(2)  5(1) ‚ 1
8⁄8 1 ⁄ 1

Matched Problem 4 Solve using elimination by addition: 6x  3y  3

5x  4y  7

Let’s see what happens in the elimination process when a system either has no
solution or has infinitely many solutions. Consider the following system:

2x  6y  3
x  3y  2

Multiplying the second equation by 2 and adding, we obtain

2x  6y  3
2x  6y  4
0  7

We have obtained a contradiction. An assumption that the original system has solu-
tions must be false, otherwise, we have proved that 0  7! Thus, the system has
no solution. The graphs of the equations are parallel and the system is inconsistent.
Now consider the system

x  12 y  4
2x  y  8

If we multiply the top equation by 2 and add the result to the bottom equation,
we get

2x  y  8
2x  y  8
0 0

Obtaining 0  0 by addition implies that the two original equations are equivalent.
That is, their graphs coincide and the system is dependent. If we let x  t, where t
is any real number, and solve either equation for y, we obtain y  2t  8. Thus,

(t, 2t  8) t a real number

describes the solution set for the system. The variable t is called a parameter, and
replacing t with a real number produces a particular solution to the system. For
example, some particular solutions to this system are

t  1 t  2 t  5 t  9.4
(1, 10) (2, 4) (5, 2) (9.4, 10.8)
 8-1 Systems of Linear Equations and Augmented Matrices 593

Many real-world problems are readily solved by applying two-equation–two-

variable methods. Example 5 provides an illustration of an application that leads to
such a system.

EXAMPLE 5 Food Processing

A food manufacturer produces regular and lite smoked sausages. A regular sausage is
72% pork and 28% turkey, and a lite sausage is 22% pork and 78% turkey. The com-
pany has just received a shipment of 2,000 pounds of pork and 2,000 pounds of turkey.
How many pounds of each type of sausage should be produced to use all the meat in
this shipment?

Solution First we define the relevant variables:

x  Number of pounds of regular sausage

y  Number of pounds of lite sausage

Next we summarize the given information in Table 1. It is convenient to organize the

table so that the quantities represented by variables correspond to columns in the table
rather than to rows.

TABLE 1
Regular Lite
sausage sausage Total

Pork 72% 22% 2,000

Turkey 28% 78% 2,000

Now we use the information in the table to form equations involving x and y:

ofPorkregular sausage 
in x pounds
Pork
of lite sausage 
in y pounds
pork 
Total
0.72x  0.22y  2,000

Turkey
of regular sausage 
in x pounds

of lite sausage 
Turkey in y pounds

turkey 
Total

0.28x  0.78y  2,000

To solve using elimination by addition, we multiply the first equation by 0.78, the
second by 0.22, and add:

0.5616x  0.1716y  1,560 0.72(2,240)  0.22y  2,000

0.0616x  0.1716y  1,440 0.72(2,240)  0.22y  387.2
0.0 0.5x  0.1716y  1,120 0.72(2,240)  0.22y  1,760
0.0 0.5x  0.1716x  2,240 0.72(2,240)  0.22y  1,760
594 8 Systems of Equations and Inequalities

Producing 2,240 pounds of regular sausage and 1,760 pounds of lite sausage will use
all the available pork and turkey.

Check (2,240)  0.72x  0.22y  2,000 0.28(2,240) 0.28x  0.78y  2,000

0.72(2,240)  0.22(1,760) ‚ 2,000 0.28(2,240)  0.78(1,760) ‚ 2,000
0.72(2,240)  0.22((2,000 ⁄ 2,000 0.28(2,240)  0.98((2,000 ⁄ 2,000

Matched Problem 5 A food manufacturer produces regular and deluxe rice mixtures by mixing wild rice
with long-grain rice. The regular rice mixture is 5% wild rice and 95% long-grain
rice, and the deluxe rice mixture is 10% wild rice and 90% long-grain rice. The com-
pany has just received a shipment of 120 pounds of wild rice and 1,500 pounds of
long-grain rice. How many pounds of each type of rice mixture should be produced
to use all the rice in this shipment?

• Matrices In solving systems of equations using elimination by addition, the coefficients of the
variables and the constant terms played a central role. The process can be made more
efficient for generalization and computer work by the introduction of a mathematical
form called a matrix. A matrix is a rectangular array of numbers written within brack-
ets. Two examples are

 
5 4 11
3
15 
7 0 1 6
A B (2)
0 4 2 12 8
3 0 1

Each number in a matrix is called an element of the matrix. Matrix A has six ele-
ments arranged in two rows and three columns. Matrix B has 12 elements arranged
in four rows and three columns. If a matrix has m rows and n columns, it is called
an m  n matrix (read “m by n matrix”). The expression m  n is called the size
of the matrix, and the numbers m and n are called the dimensions of the matrix. It
is important to note that the number of rows is always given first. Referring to (2)
above, A is a 2  3 matrix and B is a 4  3 matrix. A matrix with n rows and n
columns is called a square matrix of order n. A matrix with only one column is
called a column matrix, and a matrix with only one row is called a row matrix.
These definitions are illustrated by the following:

3  3 4  1 1  4


3

 
0.5 0.2 1.0
2
0.0 0.3 0.5 2 1
2 0  23
1
0.7 0.0 0.2
0
Square matrix Column Row matrix
of order 3 matrix
 8-1 Systems of Linear Equations and Augmented Matrices 595

The position of an element in a matrix is the row and column containing the element.
This is usually denoted using double subscript notation aij, where i is the row and
j is the column containing the element aij, as illustrated below:

3 a11  1, a12  5, a13  3

16 
5
A
0 4 a21  6, a22  0, a23  4

Note that a12 is read “a sub one two,” not “a sub twelve.” The elements a11  1 and
a22  0 make up the principal diagonal of A. In general, the principal diagonal of
a matrix A consists of the elements a11, a22, a33, . . . .
Remark. Most graphing utilities are capable of storing and manipulating matrices.
Figure 3 shows matrix A displayed in the editing screen of a particular graphing cal-
culator. The size of the matrix is given at the top of the screen, and the position of
the currently selected element is given at the bottom. Notice that a comma is used in
the notation for the position. This is common practice on graphing utilities but not in
FIGURE 3 Matrix notation on a mathematical literature.
graphing utility.
The coefficients and constant terms in a system of linear equations can be used
to form several matrices of interest to our work. Related to the system

2x  3y  5
(3)
x  2y  3

are the following matrices:

Coefficient Constant Augmented coefficient


matrix matrix matrix
3 3
21  35 21 
5
2 2 3

The augmented coefficient matrix will be used in this section. The other matrices will
be used in later sections. The augmented coefficient matrix contains the essential parts
of the system—both the coefficients and the constants. The vertical bar is included
only as a visual aid to help us separate the coefficients from the constant terms. (Matri-
ces entered and displayed on a graphing calculator or computer will not display this
line.)
For ease of generalization to the larger systems in the following sections, we are
now going to change the notation for the variables in system (3) to a subscript form
(we would soon run out of letters, but we will not run out of subscripts). That is, in
place of x and y, we will use x1 and x2, respectively, and (3) will be written as

2x1  3x2  5
x1  2x2  3

In general, associated with each linear system of the form

a11x1  a12x2  k1
(4)
a21x1  a22x2  k2
596 8 Systems of Equations and Inequalities

where x1 and x2 are variables, is the augmented matrix of the system:

Column 1 (C1)
Column 2 (C2)
Column 3 (C3)

aa11

21 
a12 k1
a22 k2  Row 1 (R1)
Row 2 (R2)

This matrix contains the essential parts of system (4). Our objective is to learn how
to manipulate augmented matrices in such a way that a solution to system (4) will
result, if a solution exists.
In our earlier discussion of using elimination by addition, we said that two sys-
tems were equivalent if they had the same solution. And we used the operations in
Theorem 2 to transform a system into an equivalent system. Paralleling this approach,
we now say that two augmented matrices are row-equivalent, denoted by the sym-
bol  between the two matrices, if they are augmented matrices of equivalent sys-
tems of equations. And we use the operations listed in Theorem 3 below to transform
augmented matrices into row-equivalent matrices. Note that Theorem 3 is a direct
consequence of Theorem 2.

Theorem 3 Elementary Row Operations Producing Row-Equivalent Matrices

An augmented matrix is transformed into a row-equivalent matrix if any of the

following row operations is performed:

1. Two rows are interchanged (Ri ↔ Rj).

2. A row is multiplied by a nonzero constant (kRi → Ri).
3. A constant multiple of one row is added to another row (kRj  Ri → Ri).

[Note: The arrow means “replaces.”]

• Solving Linear The use of Theorem 3 in solving systems in the form of (3) is best illustrated by
Systems Using examples.
Augmented Matrices

EXAMPLE 6 Solving a System Using Augmented Matrix Methods

Solve, using augmented matrix methods:

3x1  4x2  1
(5)
x1  2x2  7

Solution We start by writing the augmented matrix corresponding to system (5):

 8-1 Systems of Linear Equations and Augmented Matrices 597

31 4
2  1
7 (6)

Our objective is to use row operations from Theorem 3 to try to transform matrix
(6) into the form

10 0 m
1 n  (7)

where m and n are real numbers. The solution to system (5) will then be obvious,
since matrix (7) will be the augmented matrix of the following system:

x1  m x1  0x2  m

x2  n 0x1  x2  n

We now proceed to use row operations to transform (6) into form (7).

Step 1. To get a 1 in the upper left corner, we interchange rows 1 and 2—

Theorem 3, part 1:

31 4
2  1
7 
R1 ↔ R2 13 2
4  7
1 Now you see why we
wanted Theorem 2, part 1.

Step 2. To get a 0 in the lower left corner, we multiply R1 by 3 and add to

R2—Theorem 3, part 3. This changes R2 but not R1. Some people find
it useful to write (3)R1 outside the matrix to help reduce errors in
arithmetic:

13
3
2
4
6

21
7
1  AFBFC

(3)R1  R2 → R2 10 2
10  7
20 

10 —
1
Step 3. To get a 1 in the second row, second column, we multiply R2 by
Theorem 3, part 2:

10 2 7
10 20  
10 R2 →
1
R2
10 2
7
1 2 
Step 4. To get a 0 in the first row, second column, we multiply R2 by 2 and
add the result to R1—Theorem 3, part 3. This changes R1 but not R2.

0 2 4

 
ABC
2 2R2  R1 → R1
  10 
1 7 0 3

0 1 2 1 2
We have accomplished our objective! The last matrix is the augmented matrix for the
system

x1  3
(8)
x2  2
598 8 Systems of Equations and Inequalities

Since system (8) is equivalent to the original system (5), we have solved system (5).
That is, x1  3 and x2  2.

Check 3x1  4x2  1 x1  2x2  7

3(3)  4(2) ‚ 1 3  2(2) ‚ 7
1⁄1 7⁄7

The above process is written more compactly as follows:

Step 1:
Need a 1 here 31 4
2  1
7  R1 ↔ R2

Step 2:
Need a 0 here
13
3
2
4
6
 7
1
21
 (3)R1  R2 → R2
AFBFC

Step 3:
Need a 1 here
10 2
10  7
20
4
 R → R2
1
10 2


0 2
ABC
2 2R2  R1 → R1
 
Step 4: 1 7

Need a 0 here 0 1 2

10 0
1  3
2 
Therefore, x1  3 and x2  2.

Matched Problem 6 Solve, using augmented matrix methods: 2x1  x2  7

x1  2x2  4

EXPLORE-DISCUSS 2 The summary at the end of Example 6 shows five augmented coefficient matrices.
Write the linear system that each matrix represents, solve each system graphically,
and discuss the relationship between these solutions.

EXAMPLE 7 Solving a System Using Augmented Matrix Methods

Solve, using augmented matrix methods: 2x1  3x2  7

3x1  4x2  2
 8-1 Systems of Linear Equations and Augmented Matrices 599


Solution
3
  R → R1
Step 1: 2 7 1
2 1

Need a 1 here 3 4 2

 32

7

 
Step 2: 1
2
Need a 0 here 3 4 2 (3)R1  R2 → R2
3 9
 21


2 2

 32 7

 
Step 3: 1
2
Need a 1 here 0 17
2 2
17
R → R2
2
17 2

 32


3
0 2

 32 7

 1
Step 4: 1 R  R1 → R1
3

2 2 2

Need a 0 here 0 1

10 0
1  2
1 
Thus, x1  2 and x2  1. You should check this solution in the original system.

Matched Problem 7 Solve, using augmented matrix methods: 5x1  2x2  12

2x1  3x2  1

EXAMPLE 8 Solving a System Using Augmented Matrix Methods

Solve, using augmented matrix methods: 2x1  x2  4

(9)
6x1  3x2  12

Solution
 2
6
1 4
3 12  
1
2 R1
1
3 R2
→ R1 ( This produces a 1 in the upper left corner.)
→ R2 ( This simplifies R2.)

 1
2
2
 12
1
1
 2
4
4
 2R1  R2 → R2 ( This produces a 0 in the lower left corner.)

01  12
0  2
0 
The last matrix corresponds to the system

x1  12x2  2 x1  12 x2  2

00 0x1  0x2  0

Thus, x1  12x2  2. Hence, for any real number t, if x2  t, then x1  12t  2. That
is, the solution set is described by

(12t  2, t) t a real number (10)

600 8 Systems of Equations and Inequalities

For example, if t  6, then (5, 6) is a particular solution; if t  2, then (1, 2) is
another particular solution; and so on. Geometrically, the graphs of the two original
equations coincide and there are infinitely many solutions.

In general, if we end up with a row of 0’s in an augmented matrix for

a two-equation–two-variable system, the system is dependent and there
are infinitely many solutions.

Check The following is a check that (10) provides a solution for system (9) for any real
number t:

2x1  x2  4 6x1  3x2  12

2(12t  2)  t ‚ 4 6(12t  2)  3t ‚ 12
t4t‚4 3t  12  3t ‚ 12
4⁄4 12 ⁄ 12

Matched Problem 8 Solve, using augmented matrix methods: 2x1  6x2  6

3x1  9x2  9

EXPLORE-DISCUSS 3 Most graphing utilities can perform row operations. Figure 4 shows the solution to
Example 8 on a particular graphing calculator. Consult your manual to see how to
perform row operations, and solve Matched Problem 8 on your graphing utility.

FIGURE 4 Performing row

operations on a graphing utility.

EXAMPLE 9 Solving a System Using Augmented Matrix Methods

Solve, using augmented matrix methods: 2x1  6x2  3

x1  3x2  2

Solution
21 6 3
3 2  R1 ↔ R2

12
2
3 2
6 3
6
 
4
(2)R1  R2 → R2
 8-1 Systems of Linear Equations and Augmented Matrices 601

10 3 2
0 7  R2 implies the contradiction: 0  7

This is the augmented matrix of the system

x1  3x2  2 x1  3x2  2

0  7 0x1  0x2  7

The second equation is not satisfied by any ordered pair of real numbers. Hence, the
original system is inconsistent and has no solution. Otherwise, we have proved that
0  7!

Thus, if we obtain all 0’s to the left of the vertical bar and a nonzero
number to the right of the bar in a row of an augmented matrix, then
the system is inconsistent and there are no solutions.

Matched Problem 9 Solve, using augmented matrix methods: 2x1  x2  3

4x1  2x2  1

Summary

For m, n, p real numbers: p  0:

Form 1: A Form 2: Infinitely Form 3: No

Unique Solution Many Solutions Solution
(Consistent and (Consistent and (Inconsistent)
Independent) Dependent)

10 0 m
1 n   10 
m n
0 0  10 
m n
0 p

The process of solving systems of equations described in this section is referred

to as Gauss–Jordan elimination. We will use this method to solve larger-scale sys-
tems in the next section, including systems where the number of equations and the
number of variables are not the same.

Answers to Matched Problems

1. y x  1, y  2
Check: xy3
5
xy3 1  (2) ‚ 3
3⁄3
x  2y  3
x 2y  3
1  2(2) ‚ 3
x
5 5 3 ⁄ 3
(1, 2)

5
602 8 Systems of Equations and Inequalities

2. (A) (3, 2), or x  3 and y  2 (B) No solution (C) Infinite number of solutions
3. (1.92, 4.23), or x  1.92 and y  4.23 4. (1, 3), or x  1 and y  3
5. 840 pounds of regular mix, 780 pounds of deluxe mix
6. x1  2, x2  3 7. x1  2, x2  1
8. The system is dependent. For t any real number, x2  t, x1  3t  3 is a solution.
9. Inconsistent—no solution

EXERCISE 8-1
A Solve Problems 11–14 using elimination by addition.
11. 2x  3y  1 12. 2m  n  10
Match each system in Problems 1–4 with one of the follow-
3x  y  7 m  2n  4
ing graphs, and use the graph to solve the system.
13. 4x  3y  15 14. 5x  2y  1
y y 3x  4y  5 2x  3y  11
5 5 Problems 15–24 refer to the following matrices:
2

 
8 0
3 2
 
0
A B  3 6 9
x x 4 1 6
5 5 5 5 4 2 0

5 5
C  3 2 0 D 47
(a) (b) 15. What is the size of A? Of C?
16. What is the size of B? Of D?
y y
17. Identify all row matrices.
5
18. Identify all column matrices.
x 19. Identify all square matrices.
5 5
x
5 5 20. How many additional rows would matrix A need to be a
square matrix?
5
21. For matrix A, find a12 and a23.
5
22. For matrix A, find a21 and a13.
(c) (d)
23. Find the elements on the principal diagonal of matrix B.
1. 2x  4y  8 2. x  y  3 24. Find the elements on the principal diagonal of matrix A.
x  2y  0 x  2y  0
Perform each of the row operations indicated in Problems
3. 2x  y  5 4. 4x  2y  10
25–36 on the following matrix:
3x  2y  3 2x  y  5
Solve Problems 5–10 by graphing.
5. x  y  7
xy3
6. x  y  2
xy4
14 3 2
6 8  
25. R1 ↔ R2 26. 12R2 → R2 27. 4R1 → R1
7. 3x  2y  12 8. 3x  y  2
28. 2R1 → R1 29. 2R2 → R2 30. 1R2 → R2
7x  2y  8 x  2y  10
31. (4)R1  R2 → R2 32. (12)R2  R1 → R1
9. 3u  5v  15 10. m  2n  4
6u  10v  30 2m  4n  8 33. (2)R1  R2 → R2 34. (3)R1  R2 → R2
 8-1 Systems of Linear Equations and Augmented Matrices 603

35. (1)R1  R2 → R2 36. 1R1  R2 → R2 Solve Problems 57–60 using augmented matrix methods.
Use a graphing utility to perform the row operations.
Solve Problems 37 and 38 using augmented matrix methods.
Write the linear system represented by each augmented 57. 0.8x1  2.88x2  4 58. 2.7x1  15.12x2  27
matrix in your solution, and solve each of these systems 1.25x1  4.34x2  5 3.25x1  18.52x2  33
graphically. Discuss the relationship between the solutions of 59. 4.8x1  40.32x2  295.2
these systems. 3.75x1  28.7x2  211.2
37. x1  x2  7 38. x1  x2  5 60. 5.7x1  8.55x2  35.91
x1  x2  1 x1  x2  3 4.5x1  5.73x2  76.17

B APPLICATIONS

Solve Problems 39–50 using augmented matrix methods: 61. Puzzle. A friend of yours came out of the post office having
39. x1  4x2  2 40. x1  3x2  5 spent $19.50 on 32¢ and 23¢ stamps. If she bought 75
2x1  x2  3 3x1  x2  5 stamps in all, how many of each type did she buy?

41. 3x1  x2  2 42. 2x1  x2  0 62. Puzzle. A parking meter contains only nickels and dimes
x1  2x2  10 x1  2x2  5 worth $6.05. If there are 89 coins in all, how many of each
type are there?
43. x1  2x2  4 44. 2x1  3x2  2
2x1  4x2  8 4x1  6x2  7 63. Investments. Bond A pays 6% compounded annually and
bond B pays 9% compounded annually. If a $200,000 in-
45. 2x1  x2  6 46. 3x1  x2  5 vestment in a combination of the two bonds returns
x1  x2  3 x1  3x2  5 $14,775 annually, how much is invested in each bond?
47. 3x1  6x2  9 48. 2x1  4x2  2 64. Investments. Past history indicates that mutual fund A will
2x1  4x2  6 3x1  6x2  3 earn 14.6% annually and mutual fund B will earn 9.8% an-
49. 4x1  2x2  2 50. 6x1  2x2  4 nually. How should an investment be divided between the
6x1  3x2  3 3x1  x2  2 two funds to produce an expected return of 11%?

In Problems 51–54 use an intersection routine on a graph- 65. Chemistry. A chemist has two solutions of sulfuric acid: a
ing utility to approximate the solution of each system to two 20% solution and an 80% solution. How much of each
decimal places. should be used to obtain 100 liters of a 62% solution?

51. 2x  3y  5 52. 7x  3y  20 66. Chemistry. A chemist has two solutions: one containing
3x  4y  13 5x  2y  8 40% alcohol and another containing 70% alcohol. How
much of each should be used to obtain 80 liters of a 49%
53. 3.5x  2.4y  0.1 54. 5.4x  4.2y  12.9 solution?
2.6x  1.7y  0.2 3.7x  6.4y  4.5
67. Nutrition. Animals in an experiment are to be kept on a
strict diet. Each animal is to receive, among other things, 54
grams of protein and 24 grams of fat. The laboratory tech-
C nician is able to purchase two food mixes of the following
compositions: Mix A has 15% protein and 10% fat; mix B
55. The coefficients of the three systems below are very simi-
has 30% protein and 5% fat. How many grams of each mix
lar. One might guess that the solution sets to the three sys-
should be used to obtain the right diet for a single animal?
tems would also be nearly identical. Develop evidence for
or against this guess by considering graphs of the systems 68. Nutrition+Plants. A fruit grower can use two types of
and solutions obtained using elimination by addition. fertilizer in his orange grove, brand A and brand B. Each
(A) 4x  5y  4 (B) 4x  5y  4 bag of brand A contains 9 pounds of nitrogen and 5 pounds
9x  11y  4 8x  11y  4 of phosphoric acid. Each bag of brand B contains 8 pounds
(C) 4x  5y  4 of nitrogen and 6 pounds of phosphoric acid. Tests indicate
8x  10y  4 that the grove needs 770 pounds of nitrogen and 490
pounds of phosphoric acid. How many bags of each brand
56. Repeat Problem 55 for the following systems.
should be used to provide the required amounts of nitrogen
(A) 5x  6y  10 (B) 5x  6y  10
and phosphoric acid?
11x  13y  20 10x  13y  20
(C) 5x  6y  10 69. Delivery Charges. United Express, a nationwide package
10x  12y  20 delivery service, charges a base price for overnight delivery
604 8 Systems of Equations and Inequalities

of packages weighing 1 pound or less and a surcharge for blends, robust and mild. A pound of the robust blend re-
each additional pound (or fraction thereof ). A customer is quires 12 ounces of Colombian beans and 4 ounces of
billed $27.75 for shipping a 5-pound package and $64.50 Brazilian beans. A pound of the mild blend requires 6
for shipping a 20-pound package. Find the base price and ounces of Colombian beans and 10 ounces of Brazilian
the surcharge for each additional pound. beans. Coffee is shipped in 132-pound burlap bags. The
company has 50 bags of Colombian beans and 40 bags of
70. Delivery Charges. Refer to Problem 69. Federated Ship-
Brazilian beans on hand. How many pounds of each blend
ping, a competing overnight delivery service, informs the
should it produce in order to use all the available beans?
customer in Problem 69 that it would ship the 5-pound
package for $29.95 and the 20-pound package for $59.20.
72. Resource Allocation. Refer to Problem 71.
(A) If Federated Shipping computes its cost in the same
(A) If the company decides to discontinue production of
manner as United Express, find the base price and the
the robust blend and only produce the mild blend, how
surcharge for Federated Shipping.
many pounds of the mild blend can it produce and how
(B) Devise a simple rule that the customer can use to
many beans of each type will it use? Are there any
choose the cheaper of the two services for each pack-
beans that are not used?
age shipped. Justify your answer.
(B) Repeat part A if the company decides to discontinue
71. Resource Allocation. A coffee manufacturer uses production of the mild blend and only produce the ro-
Colombian and Brazilian coffee beans to produce two bust blend.

SECTION 8-2 Gauss-Jordan Elimination

• Reduced Matrices
• Solving Systems by Gauss–Jordan Elimination
• Application

Now that you have had some experience with row operations on simple augmented
matrices, we will consider systems involving more than two variables. In addition,
we will not require that a system have the same number of equations as variables. It
turns out that the results for two-variable–two-equation linear systems, stated in The-
orem 1 in Section 8-1, actually hold for linear systems of any size.

Possible Solutions to a Linear System

It can be shown that any linear system must have exactly one solution, no solu-
tion, or an infinite number of solutions, regardless of the number of equations
or the number of variables in the system. The terms unique, consistent, incon-
sistent, dependent, and independent are used to describe these solutions, just as
they are for systems with two variables.

• Reduced Matrices In the last section we used row operations to transform the augmented coefficient
matrix for a system of two equations in two variables

aa11

21 
a12 k1
a22 k2  a11x1  a12x2  k1
a21x1  a22x2  k2