CH 02

Finite Mathematics: An Applied Approach by Michael Sullivan
Copyright 2011 by John Wiley & Sons. All rights reserved.

CHAPTER
2
Systems of Linear Equations
Section 2.1 p1
2.1 Systems of Linear Equations:
Substitution; Elimination
Section 2.1 p2
In this chapter we take up the problem of solving systems
of linear equations containing two or more variables.
As the section titles suggest, there are various ways to do
this.
The method of substitution for solving equations in several
unknowns goes back to ancient times.
The method of elimination, though it had existed for centuries,
was put into systematic order by Karl Friedrich Gauss
(17771855) and by Camille Jordan (18381922).
This method led to the matrix method (GaussJordan
method) that is now used for solving large systems by
computer.
2.1 Systems of Linear Equations: Substitution; Elimination
Section 2.1 p3
In general, a system of linear equations is a collection of
two or more linear equations, each containing one or more
variables.
A solution of a system of linear equations consists of values
of the variables that are solutions of each equation of the
system.
To solve a system of linear equations means to find all
solutions of the system.
Section 2.1 p4
Definition

If a system of equations has at least one solution, it is said to
be consistent;
if it has no solution, it is said to be inconsistent.
If a consistent system of equations has exactly one solution,
the equations of the system are said to be independent;
if it has an infinite number of solutions, the equations are
called dependent.

Section 2.1 p5
Two Linear Equations Containing Two Variables
1. If the lines are parallel, then the system of equations has
no solution, because the lines never intersect. The system is
inconsistent.
2. If the lines intersect, then the system of equations has one
solution, given by the point of intersection. The system is
consistent and the equations are independent.
3. If the lines are coincident, then the system of equations
has infinitely many solutions, represented by the totality of
points on the line. The system is consistent and the
equations are dependent.

Section 2.1 p6
A system of equations is either
(I) Inconsistent with no solution
or
(II) Consistent with
(a) One solution (equations are independent)
or
(b) Infinitely many solutions (equations are dependent)

Figure 1 illustrates these conclusions. (See next slide.)

Section 2.1 p7
FIGURE 1a

Parallel lines;
system has no
solution and is
inconsistent
Section 2.1 p8
FIGURE 1b

Intersecting lines; system
has one solution and is
consistent; the equations
are independent
Section 2.1 p9
FIGURE 1c

Coincident lines; system has
infinitely many solutions
and is consistent; the
equations are dependent
Section 2.1 p10

To obtain the exact solution, we use algebraic methods.
The first algebraic method we take up is the method of
substitution.

Section 2.1 p11
Steps for Solving by Substitution
STEP 1 Pick one of the equations and solve for one of the
variables in terms of the remaining variables.
STEP 2 Substitute the result in the remaining equations.
STEP 3 If one equation in one variable results, solve this
equation. Otherwise, repeat Steps 1 and 2 until a single
equation with one variable remains.
STEP 4 Find the values of the remaining variables by back-
substitution.
STEP 5 Check the solution found.
Section 2.1 p12
Solve Systems of Equations by Elimination
A second method for solving a system of linear equations is
the method of elimination.
The idea behind the method of elimination is to replace the
original system of equations by an equivalent system so
that adding two of the equations eliminates a variable.
However, we may also interchange any two equations of
the system and/or replace any equation in the system by the
sum (or difference) of that equation and a nonzero multiple
of any other equation in the system.
Section 2.1 p13
Rules for Obtaining an Equivalent System of Equations
1 Interchange any two equations in the system.
2 Multiply (or divide) each side of an equation by the same
nonzero constant.
3 Replace any equation in the system by the sum (or
difference) of that equation and a nonzero multiple of any
other equation in the system.
Section 2.1 p14
Steps for Solving by Elimination
STEP 1 Select two equations from the system and replace
them by two equivalent equations that, when added,
eliminate at least one variable.
STEP 2 If there are additional equations in the original
system, pair off each one with one of the equations selected
in Step 1 and eliminate the same variable from them.
STEP 3 Continue Steps 1 and 2 on successive systems until
one equation containing one variable remains.
STEP 4 Solve for this variable and back-substitute in
previous equations until all the variables have been found.
STEP 5 Check the solution found.
Section 2.1 p15
Just as with a system of two linear equations containing two
variables, a system of three linear equations containing
three variables has either
(1) exactly one solution (a consistent system with
independent equations),
or
(2) no solution (an inconsistent system),
or
(3) infinitely many solutions (a consistent system with
dependent equations).
Section 2.1 p16
We can view the problem of solving a system of three linear
equations containing three variables as a geometry
problem.
The graph of each equation in such a system is a plane in
space.
A system of three linear equations containing three
variables represents three planes in space.
Figure 6 (next 3 slides) illustrates some of the possibilities.
Section 2.1 p17
FIGURE 6

(a) Consistent system; one solution
Section 2.1 p18
FIGURE 6

(b) Consistent system; infinite number of solutions
Section 2.1 p19
FIGURE 6

(c) Inconsistent system; no solution
Section 2.1 p20
Typically, when solving a system of three linear equations
containing three variables, we use the method of
elimination.
Recall that the idea behind the method of elimination is to
form equivalent equations so that adding two of the
equations eliminates a variable.

Section 2.1 p21
Applied Problems Involving Systems of
Equations
In economics, the supply equation is used to determine the
amount of a product that a company is willing to make
available for sale at a given price.
The demand equation is the amount of a product that
consumers are willing to purchase at a given price.
Section 2.1 p22
Supply and Demand Equations
The equilibrium price or market price of a product is the
price at which quantity supplied equals quantity
demanded.
That is, the equilibrium price is the price for which S = D,
where S is the quantity supplied and D is the quantity
demanded.
The equilibrium quantity is the amount demanded (or
supplied) at the equilibrium price.
Section 2.1 p23
2.2 Systems of Linear Equations:
Gaussian Elimination
Section 2.2 p24
The systematic approach of the method of elimination for
solving a system of linear equations provides another
method of solution that involves a simplified notation
using a matrix.
2.2 Systems of Linear Equations: Gaussian Elimination
Section 2.2 p25
A matrix is defined as a rectangular array of numbers,
enclosed by brackets.
The numbers are referred to as the entries of the matrix.
A matrix is further identified by naming its rows and
columns.
Some examples of matrices are
Section 2.2 p26

When a matrix is used to represent a system of linear
equations, it is called the augmented matrix of the system.
For example,
Section 2.2 p27
System of Equations Augmented Matrix

Here it is understood that column 1 contains the coefficients
of the variable x, column 2 contains the coefficients of the
variable y, and column 3 contains the numbers to the right
of the equal sign.
(continued on next slide)
Section 2.2 p28
(continued)
Each row of the matrix represents an equation of the
system.
Although not required, it has become customary to place a
vertical bar in the matrix as a reminder of the equal sign.
We shall follow the practice of using x and y to denote the
variables for systems containing two variables. We will use
x, y, and z for systems containing three variables; we will
use subscripted variables for systems containing four or
more variables.
In writing the augmented matrix of a system, the variables
of each equation must be on the left side of the equal sign
and the constants on the right side. A variable that does not
appear in an equation has a coefficient of 0.
Row operations on a matrix are used to solve systems of
equations when the system is written as an augmented matrix.
There are three basic row operations.
Section 2.2 p29
Row Operations
1 Interchange any two rows.
2 Replace a row by a nonzero multiple of that row.
3 Replace a row by the sum of that row and a constant
nonzero multiple of some other row.
These three row operations correspond to the three rules given earlier for
obtaining an equivalent system of equations. When a row operation is
performed on a matrix, the resulting matrix represents a system of
equations equivalent to the system represented by the original matrix.
Section 2.2 p30
Solve a System of Linear Equations Using Matrices
(Gaussian elimination)
To solve a system of linear equations using matrices, we use
row operations on the augmented matrix of the system to
obtain a matrix that is in row echelon form.
Row Echelon Form
A matrix is in row echelon form when
1. The entry in row 1, column 1 is a 1, and 0s appear below
it.
2. The first nonzero entry in each row after the first row is a
1, 0s appear below it, and it appears to the right of the
first nonzero entry in any row above.
3. Any rows that contain all 0s to the left of the vertical bar
appear at the bottom.
Section 2.2 p31
Definition
For example, for a system of two linear equations
containing two variables the augmented matrix is in row
echelon form if it is in one of the forms

where a, b, and c are real numbers.
Section 2.2 p32
Solving a System of Linear Equations Using
Gaussian Elimination
STEP 1 Write the augmented matrix that represents the
system.
STEP 2 Perform row operations that place the entry 1 in row
1, column 1.
STEP 3 Perform row operations that leave the entry 1 in row
1, column 1 unchanged, while causing 0s to appear below it
in column 1.
(STEPS 4-6 continued on next slide.)
Section 2.2 p33
STEP 4 Perform row operations that place the entry 1 in row 2,
column 2, but leave the entries in column 1 unchanged. If it is
impossible to place a 1 in row 2, column 2, then proceed to place
a 1 in row 2, column 3. Once a 1 is in place, perform row
operations to place 0s below it.
STEP 5 Now repeat Step 4, placing a 1 in the next row, but one
column to the right, while leaving all entries in columns to the
left unchanged. Continue until the bottom row or the vertical bar
is reached. (If any rows are obtained that contain only 0s on the
left side of the vertical bar, place such rows at the bottom of the
matrix.)
STEP 6 The matrix that results is the row echelon form of the
augmented matrix. Analyze the system of equations
corresponding to it to solve the original system.
Section 2.2 p34
Sometimes it is advantageous to write a matrix in reduced
row echelon form. In this form, row operations are used to
obtain entries that are 0 above (as well as below) the leading
1 in a row.
Section 2.2 p35
2.3 Systems of m Linear
Equations Containing n Variables
Section 2.3 p36
System of m Linear Equations Containing n Variables
A system of m linear equations containing n variables x
1
, x
2
, ,
x
n
is of the form

where a
ij
and b
i
are real numbers, i = 1, 2, , m, j = 1, 2, , n.

Section 2.2 p37
Definition
2.3 Systems of m Linear Equations Containing n Variables
11 1 12 2 1 1
21 1 22 2 2 2
31 1 32 2 3 3
1 1 2 2
1 1 2 2
n n
n n
n n
i i in n i
m m mn n m
a x a x a x b
a x a x a x b
a x a x a x b
a x a x a x b
a x a x a x b
+ + + =
+ + + =
+ + + =
+ + + =
+ + + =

System of m Linear Equations Containing n Variables
(continued)

A solution of a system of m linear equations containing n
variables x
1
, x
2
, , x
n
is any ordered set (x
1
, x
2
, , x
n
) of real
numbers for which each of the m linear equations of the system is
satisfied.
Section 2.2 p38
Definition
Reduced Row Echelon Form
A system of m linear equations containing n variables will
have either no solution, one solution, or infinitely many
solutions.
We can determine which of these possibilities occurs and, if
solutions exist, find them, by performing row operations on
the augmented matrix of the system until we arrive at the
reduced row echelon form of the augmented matrix.
Section 2.3 p39
Conditions for the Reduced Row Echelon Form of
a Matrix
1. The first nonzero entry in each row is 1 and it has 0s
above it and below it.
2. The leftmost 1 in any row is to the right of the leftmost 1
in the row above.
3. Any rows that contain all 0s to the left of the vertical bar
appear at the bottom.
Section 2.3 p40
Steps for Solving a System of m Linear Equations
Containing n Variables
STEP 1 Write the augmented matrix.
STEP 2 Find the reduced row echelon form of the
augmented matrix.
STEP 3 Analyze this matrix to determine if the system has
no solution, one solution, or infinitely many solutions.
Section 2.3 p41
SUMMARY
Select the best answer
for each of the following
multiple choice questions.
Section 2.MC p42
2.Extra Multiple Choice Questions
1. Solve the system of equations.

Section 2.MC p43
2 3 1
5 2 7
x y
x y
+ =
A. 1, 1
B. 1, 1
C. 1, 1
D. 1, 1
x y
x y
x y
x y
= =
= =
= =
= =
2. The row echelon form of a system of linear
equations is given. Find the solution.

A. Consistent; x = 1, y = 2, z = 3
B. Consistent; infinite number of
solutions
C. Inconsistent
D. Consistent; x = 3, y = 2, z = 0
Section 2.MC p44
1 2 3 1
0 1 4 2
0 0 0 3
| |
|
|
|
\ .
3. Solve the system of equations.

Section 2.MC p45
+ =
+ =
+ =
2 6
2 3 13
3 2 3 16
x y z
x y z
x y z
A. ( 1, 2, 3)
B. ( 1, 2, 3)
C. ( 1, 2, 3)
D. (1, 2, 3)


4. Find a general solution for this system of
equations

Section 2.MC p46
5 3 19 3
2 8 3
x y z
x y z
+ =
+ =
5 12 5 12
A. 2 21 B. 2 21
5 12 5 12
C. 2 21 D. 2 21
x z x z
y z y z
z z z z
x z x z
y z y z
z z z z
= + =

= + =

= =

= + = +

= + = +

= =

Answers for the Multiple Choice Questions
1. D. x = 1, y = 1
2. C. Inconsistent
3. A. (1, 2, 3)
4. D. infinite number of solutions
Section 2.MC p47

CH 02

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

CH 02

Hochgeladen von

Copyright:

Verfügbare Formate

Finite Mathematics: An Applied Approach by Michael Sullivan

Copyright 2011 by John Wiley & Sons. All rights reserved.

Finite Mathematics: An Applied Approach by Michael Sullivan

Finite Mathematics: An Applied Approach by Michael Sullivan

Das könnte Ihnen auch gefallen