Math 1300: Section 4- 3 Gauss-Jordan Elimination
-
Upload
jason-aubrey -
Category
Documents
-
view
1.922 -
download
2
description
Transcript of Math 1300: Section 4- 3 Gauss-Jordan Elimination
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Math 1300 Finite MathematicsSection 4.3 Gauss-Jordan Elimination
Jason Aubrey
Department of MathematicsUniversity of Missouri
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
In the previous section, we used row operations to transformthe augmented coefficient matrix for a system of two equationsin two variables
[a11 a12a21 a22
β£β£β£β£k1k2
]a11x1 + a12x2 = k1
a21x1 + a22x2 = k2
into one of the following simplified forms:[1 00 1
β£β£β£β£mn] [
1 m0 0
β£β£β£β£n0] [
1 m0 0
β£β£β£β£np]
p 6= 0
We can classify the solutions based on the three simplifiedforms.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
In the previous section, we used row operations to transformthe augmented coefficient matrix for a system of two equationsin two variables
[a11 a12a21 a22
β£β£β£β£k1k2
]a11x1 + a12x2 = k1
a21x1 + a22x2 = k2
into one of the following simplified forms:[1 00 1
β£β£β£β£mn] [
1 m0 0
β£β£β£β£n0] [
1 m0 0
β£β£β£β£np]
p 6= 0
We can classify the solutions based on the three simplifiedforms.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
In the previous section, we used row operations to transformthe augmented coefficient matrix for a system of two equationsin two variables
[a11 a12a21 a22
β£β£β£β£k1k2
]a11x1 + a12x2 = k1
a21x1 + a22x2 = k2
into one of the following simplified forms:[1 00 1
β£β£β£β£mn] [
1 m0 0
β£β£β£β£n0] [
1 m0 0
β£β£β£β£np]
p 6= 0
We can classify the solutions based on the three simplifiedforms.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Summary
Form 1: A Unique Solution (Consistent and Independent)[1 00 1
β£β£β£β£mn]
Form 2: Infinitely Many Solutons (Consistent and Dependent)[1 m0 0
β£β£β£β£n0]
Form 3: No Solution (Inconsistent)[1 m0 0
β£β£β£β£np]
p 6= 0
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Summary
Form 1: A Unique Solution (Consistent and Independent)[1 00 1
β£β£β£β£mn]
Form 2: Infinitely Many Solutons (Consistent and Dependent)[1 m0 0
β£β£β£β£n0]
Form 3: No Solution (Inconsistent)[1 m0 0
β£β£β£β£np]
p 6= 0
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Summary
Form 1: A Unique Solution (Consistent and Independent)[1 00 1
β£β£β£β£mn]
Form 2: Infinitely Many Solutons (Consistent and Dependent)[1 m0 0
β£β£β£β£n0]
Form 3: No Solution (Inconsistent)[1 m0 0
β£β£β£β£np]
p 6= 0
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
DefinitionA matrix is said to be in reduced row echelon form, or, moresimply, in reduced form, if
Each row consisting entirely of zeros is below any rowhaving at least one nonzero element.The leftmost nonzero element in each row is 1.All other elements in the column containing the leftmost 1of a given row are zeros.The leftmost 1 in any row is to the right of the leftmost 1 inthe row above.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
DefinitionA matrix is said to be in reduced row echelon form, or, moresimply, in reduced form, if
Each row consisting entirely of zeros is below any rowhaving at least one nonzero element.
The leftmost nonzero element in each row is 1.All other elements in the column containing the leftmost 1of a given row are zeros.The leftmost 1 in any row is to the right of the leftmost 1 inthe row above.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
DefinitionA matrix is said to be in reduced row echelon form, or, moresimply, in reduced form, if
Each row consisting entirely of zeros is below any rowhaving at least one nonzero element.The leftmost nonzero element in each row is 1.
All other elements in the column containing the leftmost 1of a given row are zeros.The leftmost 1 in any row is to the right of the leftmost 1 inthe row above.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
DefinitionA matrix is said to be in reduced row echelon form, or, moresimply, in reduced form, if
Each row consisting entirely of zeros is below any rowhaving at least one nonzero element.The leftmost nonzero element in each row is 1.All other elements in the column containing the leftmost 1of a given row are zeros.
The leftmost 1 in any row is to the right of the leftmost 1 inthe row above.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
DefinitionA matrix is said to be in reduced row echelon form, or, moresimply, in reduced form, if
Each row consisting entirely of zeros is below any rowhaving at least one nonzero element.The leftmost nonzero element in each row is 1.All other elements in the column containing the leftmost 1of a given row are zeros.The leftmost 1 in any row is to the right of the leftmost 1 inthe row above.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]
is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]
is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Determine if each of the following matrices is inreduced row echelon form.
(a)[1 00 1
β£β£β£β£ 2β3
]is in reduced form.
(b)[1 20 1
β£β£β£β£ 2β3
]is not in reduced form.
(c)
1 0 00 1 00 0 1
β£β£β£β£β£β£2β13
is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
(d)
1 0 00 0 00 0 1
β£β£β£β£β£β£203
is not in reduced form.
(e)
0 1 00 0 30 0 0
β£β£β£β£β£β£2β10
is not in reduced form.
(f)
1 4 β10 0 10 0 0
β£β£β£β£β£β£310
is not in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination
3x1 + x2 β 2x3 = 2x1 β 2x2 + x3 = 3
2x1 β x2 β 3x3 = 3
3 1 β21 β2 12 β1 β3
β£β£β£β£β£β£233
R1βR2βββββ
1 β2 13 1 β22 β1 β3
β£β£β£β£β£β£323
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination
3x1 + x2 β 2x3 = 2x1 β 2x2 + x3 = 3
2x1 β x2 β 3x3 = 3
3 1 β21 β2 12 β1 β3
β£β£β£β£β£β£233
R1βR2βββββ
1 β2 13 1 β22 β1 β3
β£β£β£β£β£β£323
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination
3x1 + x2 β 2x3 = 2x1 β 2x2 + x3 = 3
2x1 β x2 β 3x3 = 3
3 1 β21 β2 12 β1 β3
β£β£β£β£β£β£233
R1βR2βββββ
1 β2 13 1 β22 β1 β3
β£β£β£β£β£β£323
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination
3x1 + x2 β 2x3 = 2x1 β 2x2 + x3 = 3
2x1 β x2 β 3x3 = 3
3 1 β21 β2 12 β1 β3
β£β£β£β£β£β£233
R1βR2βββββ
1 β2 13 1 β22 β1 β3
β£β£β£β£β£β£323
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
β3R1+R2βR2ββββββββββ
1 β2 10 7 β52 β1 β3
β£β£β£β£β£β£3β73
β2R1+R3βR3ββββββββββ
1 β2 10 7 β50 3 β5
β£β£β£β£β£β£3β7β3
β2R3+R2βR2ββββββββββ
1 β2 10 1 50 3 β5
β£β£β£β£β£β£3β1β3
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 120 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
2R2+R1βR1βββββββββ
1 0 110 1 50 3 β5
β£β£β£β£β£β£1β1β3
β3R2+R3βR3ββββββββββ
1 0 110 1 50 0 β20
β£β£β£β£β£β£1β10
β 1
20 R3βR3ββββββββ
1 0 110 1 50 0 1
β£β£β£β£β£β£1β10
β5R3+R2βR2ββββββββββ
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
1 0 110 1 00 0 1
β£β£β£β£β£β£1β10
β11R3+R1βR1βββββββββββ
1 0 00 1 00 0 1
β£β£β£β£β£β£1β10
The solution is therefore x1 = 1, x2 = β1 and x3 = 0.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
1 0 110 1 00 0 1
β£β£β£β£β£β£1β10
β11R3+R1βR1βββββββββββ
1 0 00 1 00 0 1
β£β£β£β£β£β£1β10
The solution is therefore x1 = 1, x2 = β1 and x3 = 0.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
1 0 110 1 00 0 1
β£β£β£β£β£β£1β10
β11R3+R1βR1βββββββββββ
1 0 00 1 00 0 1
β£β£β£β£β£β£1β10
The solution is therefore x1 = 1, x2 = β1 and x3 = 0.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
1 0 110 1 00 0 1
β£β£β£β£β£β£1β10
β11R3+R1βR1βββββββββββ
1 0 00 1 00 0 1
β£β£β£β£β£β£1β10
The solution is therefore x1 = 1, x2 = β1 and x3 = 0.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Definition (Gauss-Jordan Elimination)
1 Choose the leftmost nonzero column and use appropriaterow operations to get a 1 at the top.
2 Use multiples of the row containing the 1 from step 1 to getzeros in all remaining places in the column containing the1.
3 Repeat step 1 with the submatrix formed by (mentally)deleting the row used in step 2 and all rows above that row.
4 Repeat step 2 with the entire matrix, including the rowsdeleted mentally. Continue this process until the entirematrix is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Definition (Gauss-Jordan Elimination)1 Choose the leftmost nonzero column and use appropriate
row operations to get a 1 at the top.
2 Use multiples of the row containing the 1 from step 1 to getzeros in all remaining places in the column containing the1.
3 Repeat step 1 with the submatrix formed by (mentally)deleting the row used in step 2 and all rows above that row.
4 Repeat step 2 with the entire matrix, including the rowsdeleted mentally. Continue this process until the entirematrix is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Definition (Gauss-Jordan Elimination)1 Choose the leftmost nonzero column and use appropriate
row operations to get a 1 at the top.2 Use multiples of the row containing the 1 from step 1 to get
zeros in all remaining places in the column containing the1.
3 Repeat step 1 with the submatrix formed by (mentally)deleting the row used in step 2 and all rows above that row.
4 Repeat step 2 with the entire matrix, including the rowsdeleted mentally. Continue this process until the entirematrix is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Definition (Gauss-Jordan Elimination)1 Choose the leftmost nonzero column and use appropriate
row operations to get a 1 at the top.2 Use multiples of the row containing the 1 from step 1 to get
zeros in all remaining places in the column containing the1.
3 Repeat step 1 with the submatrix formed by (mentally)deleting the row used in step 2 and all rows above that row.
4 Repeat step 2 with the entire matrix, including the rowsdeleted mentally. Continue this process until the entirematrix is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Definition (Gauss-Jordan Elimination)1 Choose the leftmost nonzero column and use appropriate
row operations to get a 1 at the top.2 Use multiples of the row containing the 1 from step 1 to get
zeros in all remaining places in the column containing the1.
3 Repeat step 1 with the submatrix formed by (mentally)deleting the row used in step 2 and all rows above that row.
4 Repeat step 2 with the entire matrix, including the rowsdeleted mentally. Continue this process until the entirematrix is in reduced form.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]
12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]
3R1+R2βR2βββββββββ[1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ
[1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]
112 R2βR2βββββββ
[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ
[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]
β2R2+R1βR1ββββββββββ[1 0 10
120 1 β11
12
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ
[1 0 10
120 1 β11
12
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
2x1 + 4x2 β 2x3 = 2β3x1 + 6x2 β 8x3 = β4
[2 4 β2β3 6 β8
β£β£β£β£ 2β4
]12 R1βR1ββββββ
[1 2 β1β3 6 β8
β£β£β£β£ 1β4
]3R1+R2βR2βββββββββ[
1 2 β10 12 β11
β£β£β£β£ 1β1
]1
12 R2βR2βββββββ[1 2 β10 1 β11
12
β£β£β£β£ 1β 1
12
]β2R2+R1βR1ββββββββββ[
1 0 1012
0 1 β1112
β£β£β£β£ 1412β 1
12
]
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
This last matrix corresponds to the system of equations
x1 +56x3 = 7
6x2 β11
12x3 = β 112
So we set
x1 =76β 5
6t
x2 = β 112
+1112
t
x3 = t
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
This last matrix corresponds to the system of equations
x1 +56x3 = 7
6x2 β11
12x3 = β 112
So we set
x1 =76β 5
6t
x2 = β 112
+1112
t
x3 = t
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
This last matrix corresponds to the system of equations
x1 +56x3 = 7
6x2 β11
12x3 = β 112
So we set
x1 =76β 5
6t
x2 = β 112
+1112
t
x3 = t
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
This last matrix corresponds to the system of equations
x1 +56x3 = 7
6x2 β11
12x3 = β 112
So we set
x1 =76β 5
6t
x2 = β 112
+1112
t
x3 = t
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ 1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ 1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ 1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ 1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ
1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: Solve the system using Gauss-Jordan elimination:
4x1 β 2x2 + 2x3 = 5β6x1 + 3x2 β 3x3 = β2
10x1 β 5x2 β x3 = β19
This system has no solutions because,
4 β2 2β6 3 β310 β5 β1
β£β£β£β£β£β£5β2β19
14 R1βR1ββββββ
1 β12
12
β6 3 β310 β5 β1
β£β£β£β£β£β£54β2β19
6R1+R2βR2βββββββββ 1 β12
12
0 0 010 β5 β1
β£β£β£β£β£β£54
112β19
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: A fruit grower can use two types of fertilizer in anorange grove, brand A and brand B. Each bag of brand Acontains 8 pounds of nitrogen and 4 pounds of phosphoric acid.Each bag of brand B contains 7 pounds of nitrogen and 6pounds of phosphoric acid. Tests indicate that the grove needs720 pounds of nitrogen and 500 pounds of phosphoric acid.How many bags of each brand should be used to provide therequired amounts of nitrogen and phosphoric acid?
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We begin by organizing the data into a table:
Brand A Brand BNitrogen 8 lbs 7 lbs
Phosphoric Acid 4 lbs 6 lbs
Next, we assign variables for each of the unknowns.
x1 = # of bags of Brand Ax2 = # of bags of Brand B
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We begin by organizing the data into a table:
Brand A Brand BNitrogen 8 lbs 7 lbs
Phosphoric Acid 4 lbs 6 lbs
Next, we assign variables for each of the unknowns.
x1 = # of bags of Brand Ax2 = # of bags of Brand B
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We begin by organizing the data into a table:
Brand A Brand BNitrogen 8 lbs 7 lbs
Phosphoric Acid 4 lbs 6 lbs
Next, we assign variables for each of the unknowns.
x1 = # of bags of Brand Ax2 = # of bags of Brand B
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
]
18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]
β4R1+R2βR2ββββββββββ[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]
25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]
β 78 R2+R1βR1ββββββββββ
[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ
[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
We now set up our linear equations and solve.
8x1 + 7x2 = 7204x1 + 6x2 = 500
[8 74 6
β£β£β£β£720500
] 18 R1βR1ββββββ
[1 7
84 6
β£β£β£β£ 90500
]β4R1+R2βR2ββββββββββ
[1 7
80 5
2
β£β£β£β£ 90140
]25 R2βR2ββββββ
[1 7
80 1
β£β£β£β£9056
]β 7
8 R2+R1βR1ββββββββββ[1 00 1
β£β£β£β£4156
]
So, x1 = 41 and x2 = 56.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: A fruit grower can use two types of fertilizer in anorange grove, brand A and brand B. Each bag of brand Acontains 8 pounds of nitrogen and 4 pounds of phosphoric acid.Each bag of brand B contains 7 pounds of nitrogen and 6pounds of phosphoric acid. Tests indicate that the grove needs720 pounds of nitrogen and 500 pounds of phosphoric acid.How many bags of each brand should be used to provide therequired amounts of nitrogen and phosphoric acid?
Answer: The grower should use 41 bags of brand A and 56bags of brand B.
Jason Aubrey Math 1300 Finite Mathematics
university-logo
Reduced MatricesSolving Systems by Gauss-Jordan Elimination
Application
Example: A fruit grower can use two types of fertilizer in anorange grove, brand A and brand B. Each bag of brand Acontains 8 pounds of nitrogen and 4 pounds of phosphoric acid.Each bag of brand B contains 7 pounds of nitrogen and 6pounds of phosphoric acid. Tests indicate that the grove needs720 pounds of nitrogen and 500 pounds of phosphoric acid.How many bags of each brand should be used to provide therequired amounts of nitrogen and phosphoric acid?
Answer: The grower should use 41 bags of brand A and 56bags of brand B.
Jason Aubrey Math 1300 Finite Mathematics