Matrices and Determinants Chapter Covers Systems of Equations, Operations, Inverses & Applications

C H A P T E R 8
Matrices and Determinants
Section 8.1 Matrices and Systems of Equations . . . . . . . . . . . . 719
Section 8.2 Operations with Matrices . . . . . . . . . . . . . . . . . . 737
Section 8.3 The Inverse of a Square Matrix . . . . . . . . . . . . . . 750
Section 8.4 The Determinant of a Square Matrix . . . . . . . . . . . . 765
Section 8.5 Applications of Matrices and Determinants . . . . . . . . 777
Review Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 790
Problem Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 810
Practice Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 816

C H A P T E R 8
Matrices and Determinants
Section 8.1 Matrices and Systems of Equations
■ You should be able to use elementary row operations to produce a row-echelon form (or reduced row-echelon
form) of a matrix.
1. Interchange two rows.
2. Multiply a row by a nonzero constant.
3. Add a multiple of one row to another row.
■ You should be able to use either Gaussian elimination with back-substitution or Gauss- Jordan elimination to
solve a system of linear equations.
Vocabulary Check
1. matrix 2. square 3. main diagonal
4. row; column 5. augmented 6. coefficient
7. row-equivalent 8. reduced row-echelon form 9. Gauss-Jordan elimination
1. Since the matrix has one row and 2. Since the matrix has one row and 3. Since the matrix has three rows and
two columns, its order is 1 2. four columns, its order is 1 4. one column, its order is 3 1.
4. Since the matrix has three rows and 5. Since the matrix has two rows and 6. Since the matrix has two rows and
four columns, its order is 3 4. two columns, its order is 2 2. three columns, its order is 2 3.

x 10y 2z 2
x4x 3y3y 512
7. 8. 7x 4y 22 9.
5x 9y 15 5x 3y 4z 0
2x y 6
3 5
4

7 4

22

1 3 12 5 9 15 1 10 2 2
5 3 4 0
2 1 0 6

x 8y 5z
19x
10. 8 11. 7x 5y z 13 12. 9x 2y 3z 20
7x 15z 38 8z 10 25y 11z 5
3x y 8z 20
5 3
197 1
8
13
90 252
20
5

1 8 5 8 0 10 11
7 0 15 38
3 1 8 20

2 0 5 12
5

1 2 7 7 0
13. 14. 15. 0 1 2 7
2 3 4 8 3 2
6 3 0 2
2xx 2y3y 74 7x8x 5y3y 20

2x 5z 12
y 2z 7
6x 3y 2
719
720 Chapter 8 Matrices and Determinants

9 12 3 0 0 6 2 1 5 25

4 5 1 18
16. 11 0 6 25 17.
2 18 5 2 10
18.
1 0 7 3 7
3 8 0 29
1 7 8 0 4 4 1 10 6 23
3 0 2 0 10 0 8 1 11 21

4x 5y z 18

9x 12y 3z 0 6x 2y z 5w 25
11x 6z 25
2x 18y 5z 2w 10 x 7z 3w 7
3x 8y 29
x 7y 8z 4 4x y 10z 6w 23
3x 2z 10 8y z 11w 21
19. 12 4
10
3
5 20. 34 6
3
8
6
1 8
3 R1 →
1
2R1 R2 → 0
4
2
3
1 14 2
3 6
3

1

1 1 4 2 4 8 3
21. 3 8 10 3 22. 1 1 3 2
2 1 12 6 2 6 4 9

1 3
1 2 R1 → 1 2 4

1 1 4 2
3R1 R2 → 0 5 2 6 1 1 3 2
2R1 R3 → 0 3 20 4 2 6 4 9

3
1

1 1 4 1 2 4 2
1
1
5 R2 → 0 1 25 6
5 R1 R2 → 0 3 7 2
0 3 20 4 2R1 R3 → 0 2 4 6
23
0 39 1 4 1 4
43 35
5 1 13
23. → 24. →
1 8 3 1 8 3 7 0 5
Add 5 times Row 2 to Row 1. Add 3 times Row 1 to Row 2.

0 1 5 5 1 3 7 6 1 2 3 2 1 2 3 2
25. 1 3 7 6 → 0 1 5 5 26. 2 5 1 7 → 0 9 7 11
4 5 1 3 0 7 27 27 5 4 7 6 0 6 8 4
Interchange Row 1 and Row 2. Then add 4 times the Add 2 times Row 1 to Row 2.
new Row 1 to Row 3. Add 5 times Row 1 to Row 3.

1 2 3
27. 2 1 4
3 1 1

1 2 3 1 2 3 1 2 3
(a) 0 5 10 (b) 0 5 10 (c) 0 5 10
3 1 1 0 5 10 0 0 0
1

1 2 3 1 0
(d) 0 1 2 (e) 0 1 2 This matrix is in reduced
0 0 0 0 0 0 row-echelon form.
Section 8.1 Matrices and Systems of Equations 721

7 1
0 2
28.
3 4
4 1

7 1 1 5 1 5
0 2 0 2 0 2
(a) (b) (c)
3 4 3 4 0 19
1 5 7 1 7 1

1 5 1 5 1 0
0 2 0 1 0 1 This matrix is
(d) (e) (f)
0 19 0 19 0 0 in reduced
0 34 0 34 0 0 row-echelon form.

1 0 0 0 1 3 0 0
29. 0 1 1 5 30. 0 0 1 8
0 0 0 0 0 0 0 0
This matrix is in reduced row-echelon form. This matrix is in reduced row-echelon form.

2 0 4 0 1 0 2 1
31. 0 1 3 6 32. 0 1 3 10
0 0 1 5 0 0 1 0
The first nonzero entries in Rows 1 and 2 are not 1. This matrix is in row-echelon form.
The matrix is not in row-echelon form.

1

1 1 0 5 1 2 3
33. 2 1 2 10 34. 3 7 5 14
3 6 7 14 2 1 3 8

1

1 1 0 5 1 2 3
2R1 R2 → 0 1 2 0 3R1 R2 → 0 1 2 5
3R1 R3 → 0 3 7 1 2R1 R3 → 0 3 5 14
1

1 1 0 5 1 2 3
0 1 2 0 0 1 2 5
3R2 R3 → 0 0 1 1 3R2 R3 → 0 0 1 1
1 1 3 7

1 1 1 0
35. 5 4 1 8 36. 3 10 1 23
6 8 18 0 4 10 2 24
1 1 3 7

1 1 1 0
5R1 R2 → 0 1 6 3 3R1 R2 → 0 1 1 2
6R1 R3 → 0 2 12 6 4R1 R3 → 0 2 2 4
1 1 3 7

1 1 1 0
0 1 6 3 0 1 1 2
2R2 R3→ 0 0 0 0 2R2 R3 → 0 0 0 0
37. Use the reduced row-echelon form feature of a 38. Use the reduced row-echelon form feature of a
graphing utility. graphing utility.

3 3 3 1 0 0 1 3 2 1 3 0
1 0 4 ⇒ 0 1 0 5 15 9 ⇒ 0 0 1
2 4 2 0 0 1 2 6 10 0 0 0
39. Use the reduced row-echelon form feature 40. Use the reduced row-echelon form feature of a
of a graphing utility. graphing utility.

1 2 3 5 1 2 0 0 2 3 1 2 1 0 0 0
1 2 4 9 0 0 1 0 4 2 5 8 0 1 0 0
⇒ ⇒
2 4 4 3 0 0 0 1 1 5 2 0 0 0 1 0
4 8 11 14 0 0 0 0 3 8 10 30 0 0 0 1
41. Use the reduced row-echelon form feature 42. Use the reduced row-echelon form feature of a
of a graphing utility. graphing utility.
31 10 1 0

5 1 12 0 3 16 5 1 2 4 1 0 0 2
⇒ ⇒
1 1 4 1 2 12 5 10 32 1 2 6

43. x 2y 4 44. x 5y 0 45. x y 2z 4
y 3 y 1 y z 2
x 23 4 z 2
x 51 0
y 2 2
x 2 x5
y0
Solution: 2, 3 Solution: 5, 1
x 0 22 4
x8
Solution: 8, 0, 2
6
0
1 0 3
10 0

46. x 2y 2z 1 47. 48.
1 4 1 10
y z 9
x3 x 6
z 3 y 10
y 4
y 3 9 Solution: 6, 10
Solution: 3, 4
y 12
x 212 23 1
x 31
Solution: 31, 12, 3
4

1 0 0 1 0 0 5
10 3
2xx 2yy 78
49. 0 1 0 50. 0 1 0 51.
0 0 1 4 0 0 1 0
x 4 x5
2
1 2 7
y 10
y 3 1 8
z0

z4
Solution: 5, 3, 0 2R1 R2 → 10 2
3
7
6
Solution: 4, 10, 4

13R2 → 10 2
1
7
2

x 2y 7
y2
y2
x 22 7 ⇒ x 3
Solution: 3, 2
2x2x 6y3y 167

53. 3x 2y 27
52.
x 3y 13
2 27
2
2 6
3
16
7 31 3 13

→ 0
2 6 16
13
R1 3 13
R1 R2 3 9 R2 2 27
1
→ 1
2 R1
→ 0 3
0 11
3 8 1 3 13
13 R2 1 3R1 R2 → 66

x 3y 8
y3
1
11 R2 → 10 3
1
13
6
y3 x 3yy 136
x 33 8 ⇒ x 1
y6
Solution: 1, 3 x 36 13 ⇒ x 5
Solution: 5, 6

54. x y 4 55. 2x 6y 22
2x 4y 34 x 2y 9

12 21
22

1 4 6
4 34 2 9
1R1 → 1 1 4 9
21
R1 2
12 R2 → 1 2 17 R2 6 22
9
10
1 4 2
→ 0
1
R1 R2 1 13 2R1 R2 → 10 40
9
10
1 4 2
→ 0
1
1R2 1 13
1
10 R2 → 1 4
x y 4
y 13
x 2yy 9
4
y 13 y 4
x 13 4 ⇒ x 9 x 24 9 ⇒ x 1
56.
2x5x 5y3y 57
57. x 2y 1.5
2x 4y 3.0
5 5
25 3 7 12 2
4
1.5
3.0
1
→ 1 1
5 R1
21 3 7 2R1 R2 →
1
0
2
0

1.5
6.0
1 1
1
2R1 R2 → 0 5 5 The system is inconsistent and there is no solution.
1 1

1
15 R2 → 0 1 1

x y 1
y 1
y 1
x 1 1 ⇒ x 2
Solution: 2, 1
58.
2xx 3y6y 105 59.

x 3z 2
3x y 2z 5
2x 2y z 4
3

1 5
2 10 3 2

6 1 0
3 3 1 2 5
0
1 5
2R1 R2 → 0 0 2 2 1 4
3 2

x 3y 5 1 0
3R1 R2 → 0 1 7 11
ya 2R1 R3 → 0 2 7 8
x 3a 5 3 2

1 0
Solution: 3a 5, a where a is a real number 0 1 7 11
2R2 R3 → 0 0 7 14
2

1 0 3
0 1 7 11
17R3 → 0 0 1 2

x 3z 2
y 7z 11
z 2
z2
y 72 11 ⇒ y 3
x 32 2 ⇒ x 4
Solution: 4, 3, 2

60. 2x y 3z 24
2y z 14
7x 5y 6
1

2 3 24
0 2 1 14
7 5 0 6
R3 3R1 → 1 2 9 66
0
7
2
5
1
0

14
6

2 9 66

1
0 2 1 14
7R1 R3 → 0 9 63 468
2 9 66

1
4R2 → 0 8 4 56
0 9 63 468
2 9 66

1
R3 R2 → 0 1 67 412

0 9 63 468 x 2y 9z 66
y 67z 412
2 9 66

1
z
0 1 67 412 6
9R2 R3 → 0 0 540 3240 z6
2 9 66 y 676 412 ⇒ y 10

1
R2 → 0 1 67 412
x 210 96 66 ⇒ x 8
540
1
R3 → 0 0 1 6
Solution: 8, 10, 6

x y z 14

61. 62. 2x 2y z 2
2x y z 21 x 3y z 28
3x 2y z 19 x y 14

1 1 14

1 2 2 1 2
2 1 1 21 1 3 1 28
3 2 1 19 1 1 0 14

R1 → 1 1

1 14 R2 1 3 1 28
2 1 1 21 R1 2 2 1 2
3 2 1 19 1 1 0 14

1

1 1 14 1 3 1 28
2R1 R2 → 0 1 1 7 R3 1 1 0 14
3R1 R3 → 0 5 2 23 R2 2 2 1 2

1

1 1 14 1 3 1 28
0 1 1 7 R1 R2 → 0 2 1 14
5R2 R3 → 0 0 3 12 2R1 R3 → 0 8 3 58

1

1 1 14 1 3 1 28
0 1 1 7 0 2 1 14
1
R
3 3 → 0 0 1 4 4R2 R3 → 0 0 1 2

x y z 14

1 3 1 28
y z 7 12 R2 → 0 1 12 7
z 4 0 0 1 2

z4 x 3y z 28
1
y 2z 7
y 4 7 ⇒ y 3
z 2
x 3 4 14 ⇒ x 7
z2
Solution: 7, 3, 4
2 2
1
y 7⇒y8
x 38 2 28 ⇒ x 6
Solution: 6, 8, 2

63. x 2y 3z 28
4y 2z 0
x y z 5

1 2 3 28
0 4 2 0
1 1 1 5

1 2 3 28
1
4 R2 →0 1 1
2 0
R1 R3 → 0 3 4 33

1 2 3 28
0 1 1
2 0
3R2 R3 → 0 0 11
2 33

1 2 3 28
0 1 1
2 0
2
11 R3 → 0 0 1 6

x 2y 3z 28 z6
y 12z 0
2 6
1
y 0 ⇒ y 3
z 6
x 23 36 28 ⇒ x 4
Solution: 4, 3, 6

x y 5z 3

64. 3x 2y z 15 65.
x y 2z 10 x 2z 1
x y 4z 14 2x y z 0
5 3

3 2 1 15 1 1
1 1 2 10 1 0 2 1
1 1 4 14 2 1 1 0
3

1 4 5

R3 1 14 1 1
1 1 2 10 R1 R2 → 0 1 3 2
R1 3 2 1 15 2R1 R3 → 0 3 9 6

1 1 4 14 5 3

1 1
R1 R2 → 0 0 2 4 R2 → 0 1 3 2
3R1 R3 → 0 1 13 27
0 3 9 6

1 4
1 14
1

R2 R1 → 1 0 2
R3 0 1 13 27 0 1 3 2
R2 0 0 2 4 3R2 R3 → 0 0 0 0

1 1 4 14
0 1 13 27 xy 2z3z 12
12R3 → 0 0 1 2
Let z a.

x y 4z 14
y 13z 27 y 3a 2 ⇒ y 3a 2
z 2 x 2a 1 ⇒ x 2a 1
z 2 Solution: 2a 1, 3a 2, a where a is any real number.
y 132 27 ⇒ y 1
x 1 42 14 ⇒ x 5
Solution: 5, 1, 2
3x 7y 6z 9w 26
66. 2x 3z 3 67. x 2y z 2w 8
4x 3y 7z 5
8x 9y 15z 9

13 2 1 2

8

2 0 3 3 7 6 9 26
4 3 7 5

1 2 1 2 8
8 9 15 9 3R1 R2 → 0 1 3 3 2

2 0 3 3 2R2 R1 → 5 4
2R1 R2 → 0 3 1 1 10 0
1 3 3
4
2
4R1 R3 → 0 9 3 3
xy 5z3z 4w 4

2 0 3 3 3w 2
0 3 1 1
Let w a and z b.
3R2 R3 → 0 0 0 0
y 3b 3a 2 ⇒ y 2 3b 3a

3 3
1
2 R1 → 1 0 2 2
x 5b 4a 4 ⇒ x 4 5b 4a
1
3R2 → 0 1 13 1
3
0 0 0 0 Solution: 4 5b 4a, 2 3b 3a, b, a
where a and b are real numbers
za
y 13a 13
x 32a 32
Solution: 2a 2, 3a 3, a where a is a real number
3 3 1 1

x y 22

68. 4x 12y 7z 20w 22 69.
3x 9y 5z 28w 30 3x 4y 4
4x 8y 32
7 20

4 12 22

3 9 5 28 30 1 1 22
3 4 4
R2 R1 → 2 8
3
1 3 8
4 8 32
9 5 28 30

R1 → 1 1 22
2 8

1 3 8 3 4 4
3R1 R2 → 0 0 1 52 54 4 8 32
2R2 R1 → 96
0
1 3 0 100

1 1 22
0 1 52 54 3R1 R2 → 0 7 62
wa 4R1 R3 → 0 4 56

z 52a 54 1 1 22
1
7 R2 → 0 1 62
7
yb 14R3 → 0 1 14
x 3b 96a 100

1 1 22
Solution: 3b 96a 100, b, 52a 54, a 0 1 62
7
where a and b are real numbers
R2 R3 → 0 0 160
7
The system is inconsistent and there is no solution.

70. x 2y 0
x y6
3x 2y 8

1 2 0
1 1 6
3 2 8

1 2 0
R1 R2 → 0 1 6
3R1 R3 → 0 8 8

1 2 0
0 1 6
8R2 R3 → 0 0 40
The system in inconsistent and there is no solution.
71. Use the reduced row-echelon form feature of a graphing utility.

3x 3y 12z 6

3 3 12 6 1 0 0 0
y 4z 2
x0
x y 4z 2 1 1 4 2
⇒
0 1 4 2 ⇒
2x 5y 20z 10 2 5 20 10 0 0 0 0
x 2y 8z 4 1 2 8 4 0 0 0 0
Let z a.
y 2 4a
x0
Solution: 0, 2 4a, a where a is any real number

2x 10y 2z 6
x 5y 2z 6
x 5y z 3
3x 15y 3z 9

2 10 2 6 1 5 0 0
1 5 2 6
⇒
0 0 1 3
1 5 1 3 0 0 0 0
3 15 3 9 0 0 0 0
x 5yz 30
z3
ya
x 5a 0 ⇒ x 5a
Solution: 5a, a, 3 where a is a real number

2x y z 2w 6 1 6

2 1 2 1 0 0 0 1
3x 4y w 1 3 4 0 1 1
⇒
0 1 0 0 0
x 5y 2z 6w 3 1 5 2 6 3 0 0 1 0 4
5x 2y z w 3 5 2 1 1 3 0 0 0 1 2
x1
y0
z4
w 2
Solution: 1, 0, 4, 2

x 2y 2z 4w 11
3x 6y 5z 12w 30
x 3y 3z 2w 5
6x y z w 9

1 2 2 4 11 1 0 0 0 1
3 6 5 12 30
⇒
0 1 0 0 1
1 3 3 2 5 0 0 1 0 3
6 1 1 1 9 0 0 0 1 1

x 1
y 1
z 3
w 1
w1
z3
y1
x 1

x yz w0

1 1 1 1 0 1 0 2 0 0
2x 3y z 2w 0 2 3 1 2 0 ⇒ 0 1 1 0 0
3x 5y z 0 3 5 1 0 0 0 0 0 1 0

x 2z 0
y z0
w0
Let z a. Then x 2a and y a.
Solution: 2a, a, a, 0 where a is a real number

76. x 2y z 3w 0
x y w0
y z 2w 0

1 2 1 3 0 1 0 0 2 0
1 1 0 1 0 ⇒ 0 1 0 1 0
0 1 1 2 0 0 0 1 1 0

x 2w 0
y w0
z w0
w a, z a, y a, x 2a
Solution: 2a, a, a, a where a is a real number

77. (a) x 2y z 6 (b) x y 2z 6
y 5z 16 y 3z 8
z 3 z 3
y 53 16 y 33 8
y1 y1
x 21 3 6 x 1 23 6
x 1 x 1
Solution: 1, 1, 3 Solution: 1, 1, 3
Both systems yield the same solution, namely 1, 1, 3.

78. (a) x 3y 4z 11 (b) x 4y 11
y z 4 y 3z 4
z 2 z 2
y 2 4 y 32 4
y 2 y 2
x 32 42 11 x 42 11
x 25 x 3
The systems do not yield the same solution.

79. (a) x 4y 5z 27 (b) x 6y z 15
y 7z 54 y 5z 42
z 8 z 8
y 78 54 y 58 42
y2 y2
x 42 58 27 x 62 8 15
x 5 x 19

80. (a) x 3y z 19 (b) x y 3z 15
y 6z 18 y 2z 14
z 4 z 4
y 64 18 y 24 14
y6 y6
x 36 4 19 x 6 34 15
x 3 x3

x 3y z 3

81. 82. I1 I2 I3 0
x 5y 5z 1 3I1 4I2 18
2x 6y 3z 8 I2 3I3 6

1 3 1 3 1 1 1 0
1 5 5 1 3 4 0 18
2 6 3 8 0 1 3 6

1 3 1 3 1 1 1 0
R1 R2 → 0 2 4 2 3R1 R2 → 0 7 3 18
2R1 R3 → 0 0 1 2 0 1 3 6

1 3 1 3 This is a matrix 1 1 1 0
1
2 R2 → 0 1 2 1 in row-echelon R3 0 1 3 6
0 0 1 2 form. R2 0 7 3 18

1 1 1 0
The row-echelon

3

1 3 4
2
form feature of a 0 1 3 6
0 1
7
4 3
2 graphing utility 7R2 R3 → 0 0 24 24
0 0 1 2 yields this form.

1 1 1 0
There are infinitely many matrices in row-echelon form 0 1 3 6
that correspond to the original system of equations. All such 1
24 R3 → 0 0 1 1
matrices will yield the same solution, namely 16, 5, 2.

I1 I2 I3 0
I2 3I3 6
I3 1
I3 1
I2 31 6 ⇒ I2 3
I1 3 1 0 ⇒ I1 2
4x2 A B C
83.
x 12x 1 x 1 x 1 x 12
4x2 Ax 12 Bx 1x 1 Cx 1
4x2 Ax2 2x 1 Bx2 1 Cx 1
4x2 A Bx2 2A Cx A B C
System of equations: AB 4
2A C0
ABC0

1 1 0 4 1 0 0 1
2 0 1 0 rref
→ 0 1 0 3
1 1 1 0 0 0 1 2
Thus, A 1, B 3, C 2.
4x2 1 3 2
So, .
x 12x 1 x 1 x 1 x 12
8x2 A B C
84. 85. x amount at 7%
x 12x 1 x 1 x 1 x 12
y amount at 8%,
8x2 Ax 12 Bx 1x 1 Cx 1
z amount at 10%
8x 2 Ax 2 2x 1 Bx 2 1 Cx 1 z 4x ⇒ 4x z 0
8x 2 A Bx 2 2A Cx A B C

x y z 1,500,000
System of equations: AB 8 0.07x 0.08y 0.10z 130,500
2A C0 4x z 0
ABC0

1 1 1 1,500,000
0.07 0.08 0.10 130,500

1 1 0 8 1 0 0 2
4
2 0 1 0 rref
→ 0 1 0 6
0 1 0
1 1

1 0 0 0 1 4 1 1 1 1,500,000
A 2, B 6, C 4
0.07R1 R2 → 0 0.01 0.03 25,500
4R1 R3 → 0 4 5 6,000,000
8x2 2 6 4

1 1 1 1,500,000
x 12x 1 x 1 x 1 x 12
100R2 → 0 1 3 2,550,000
0 4 5 6,000,000

1 1 1 1,500,000
0 1 3 2,550,000
4R2 R3 → 0 0 7 4,200,000

1 1 1 1,500,000
0 1 3 2,550,000
17 R3 → 0 0 1 600,000

x y z 1,500,000
y 3z 2,550,000
z 600,000
y 3600,000 2,550,000 ⇒ y 750,000
x 750,000 600,000 1,500,000 ⇒ x 150,000
Solution: $150,000 at 7%, $750,000 at 8%,
and $600,000 at 10%
86. x amount at 9%, y amount at 10%, 87. y ax2 bx c

z amount at 12%

a b c 8
x y z 500,000 4a 2b c 13
9a 3b c 20
0.09x 0.10y 0.12z 52,000

1 1 1 8
2.5x y 0
4 2 1 13

1 1 1 500,000 9 3 1 20
0.09 0.10 0.12 52,000

2.5 1 0 0 1 1 1 8
4R1 R2 → 0 2 3 19

1 1 1 500,000 9R1 R3 → 0 6 8 52
0.09R1 R2 → 0 0.01 0.03 7,000

1 1 1 8
2.5R1 R3 → 0 3.5 2.5 1,250,000
12R2 → 0 1
3
19
2 2

1 1 1 500,000 3R2 R3 → 0 0 1 5
100R2 → 0 1 3 700,000

ab c 8
2R3 → 0 7 5 2,500,000 3 19
b 2c 2
R2 R1 → 1 2 200,000

0 c 5
0 1 3 700,000 c5
7R2 R3 → 0 0 16 2,400,000 b 325 19
2 ⇒ b 2
2 200,000

1 0 a258 ⇒ a1
0 1 3 700,000
Equation of parabola: y x2 2x 5
1
16 R3 → 0 0 1 150,000

x 2z 200,000
y 3z 700,000
z 150,000
y 3150,000 700,000 ⇒ y 250,000
x 2150,000 200,000 ⇒ x 100,000
Solution: 100,000, 250,000, 150,000
Answer: $100,000 at 9%, $250,000 at 10%, $150,000 at 12%
88. f x ax2 bx c

f 1 a b c 9
f 2 4a 2b c 8
f 3 9a 3b c 5
9

ab c 9

1 1 1
4 2 1 8 b 32c 14
9 3 1 5 c 8

1 1 1 9 c8
4R1 R2 → 0 2 3 28 b 328 14 ⇒ b 2
9R1 R3 → 0 6 8 76 a 2 8 9 ⇒ a 1
9

1 1 1
Equation of parabola: y x2 2x 8
12R2 → 0 1 3
2 14
0 6 8 76

1 1 1 9
0 1 3
2 14
6R2 R3 → 0 0 1 8
89. (a) 0, 5.0, 15, 9.6, 30, 12.4 90. (a) f x at 2 bt c
y ax2 bx c f 7 49a 7b c 2.8

c 5 f 9 81a 9b c 3.3
225a 15b c 9.6 ⇒ 225a 15b 4.6
f 11 121a 11b c 5.3
900a 30b c 12.4 ⇒ 900a 30b 7.4

49a 7b c 2.8

225 15 4.6
81a 9b c 3.3
900 30 7.4
121a 11b c 5.3

2250 30
15 4.6

49 7 1 2.8
4R1 R2 → 11
81 9 1 3.3
121 11 1 5.3

1 1 23
225 R1 → 1 15 1125

1
30 R2 → 0 1 11
30
1
49 R1 → 1 1
7
1
49
2
35
81 9 1 3.3
1 23
a 15 b
b
1125
11
121 11 1 5.3

30 1 1 2
1 7 49 35
a 1125
1 11
15 30
23
⇒ a 250
1
0.004 81R1 R2 → 0 18
7 32
49 93
70
121R R → 0 44 72 113
70
Equation of parabola: y 0.004x2 0.367x 5. 1 3 7 49

(b) 18 1 1 2
1 7 49 35
7 16 31
18 R2 → 0 1 63 60
0 44
7 72
49 113
70
0 120

0 1 1 2
1 7 49 35
(c) The maximum height is approximately 13 feet and the 16 31
ball strikes the ground at approximately 104 feet. 0 1 63 60
8 49
44
7 R2 R3 → 0 0 63 30
(d) The maximum occurs at the vertex.
1 1 2
a 7b 49 c
b 0.367 35
x 45.875 16
2a 20.004 b 63 c 31
60
8
y 0.00445.8752 0.36745.875 5 63 c 49
30
13.418 feet c 49
30 638 1029
80 12.86
63 12.86 60 ⇒ b 2.75
b 16 31
The ball strikes the ground when y 0.
0.004x2 0.367x 5 0 a 172.75 49
1
12.86 352 ⇒ a 0.1875
By the Quadratic Formula and using the positive Equation of parabola: y 0.1875t2 2.75t 12.86
value for x we have x 103.793 feet.
(b) 28
(e) The values found in part (d) are more accurate, but
still very close to the estimates found in part (c).
7 18
0
(c) For 2003, t 13.

y 0.1875132 2.7513 12.86 8.8
When compared to the actual value of 6.3, this is not
very accurate.
(d) For 2008, t 18.
y 0.1875182 2.7518 12.86 24.11
The model estimates that in 2008, 24.11 million peo-
ple will participate in snowboarding. This indicates
that the number of participants will almost triple in 5
years which is probably not a reasonable estimate.

91. (a) x1 x3 600 1 0 1 0 0 0 0 600
x1 x2 x4 ⇒ x1 x2 x4 0 1 1 0 1 0 0 0 0
0 1 0 0 1 0 0 500
x2 x5 500 0 0 1 0 0 1 0 600
x3 x6 600 0 0 0 1 0 1 1 0
x4 x7 x6 ⇒ x4 x6 x7 0
0 0 0 0 1 0 1 500
x5 x7 500

1 0 1 0 0 0 0 600
R1 R2 → 0 1 1 1 0 0 0 600
R2 R3 → 0 0 1 1 1 0 0 100
R3 R4 → 0 0 0 1 1 1 0 500
R4 R5 → 0 0 0 0 1 0 1 500
R5 R6 → 0 0 0 0 0 0 0 0

1 0 1 0 0 0 0 600
R3 R2 → 0 1 0 0 1 0 0 500
R4 R3 → 0 0 1 0 0 1 0 600
R4 → 0 0 0 1 1 1 0 500
0 0 0 0 1 0 1 500
0 0 0 0 0 0 0 0

1 0 1 0 0 0 0 600
R2 → 0 1 0 0 1 0 0 500
R3 → 0 0 1 0 0 1 0 600
0 0 0 1 1 1 0 500
0 0 0 0 1 0 1 500
0 0 0 0 0 0 0 0

x1 x3 600
x2 x5 500
x3 x6 600
x4 x5 x6 500
x5 x7 500
Let x7 t and x6 s, then x5 500 t,
x4 500 s 500 t s t,
x3 600 s, x2 500 500 t t,
x1 600 600 s s.
Solution: s, t, 600 s, s t, 500 t, s, t
(b) s 0, t 0: x1 0, x2 0, x3 600, x4 0, x5 500, x6 0, x7 0
(c) s 0, t 500: x1 0, x2 500, x3 600, x4 500, x5 1000, x6 0, x7 500
92. (a) x1 x2 300 (b) When x2 200 and x3 50,

x1 x3 150 x4 ⇒ x1 x3 x4 150
x2 200 s t
x2 200 x3 x5 ⇒ x2 x3 x5 200
x4 x5 350 200 200 50 t ⇒ t 350.
x1 100, x2 200, x3 50, x4 0, x5 350

1 1 0 0 0 300
1 0 1 1 0 150 (c) When x2 150 and x3 0,
0 1 1 0 1 200
x2 200 s t
0 0 0 1 1 350
150 200 0 t ⇒ t 350.

1 1 0 0 0 300
R1 R2 → 0 1 1 1 0 150 x1 150, x2 150, x3 0, x4 0, x5 350
0 1 1 0 1 200
0 0 0 1 1 350

1 1 0 0 0 300
0 1 1 1 0 150
R2 R3 → 0 0 0 1 1 350
0 0 0 1 1 350

1 1 0 0 0 300
R2 → 0 1 1 1 0 150
R3 → 0 0 0 1 1 350
R3 R4 → 0 0 0 0 0 0

x1 x2 300
x2 x3 x4 150
x4 x5 350
Let x5 t.
x4 t 350 ⇒ x4 350 t
Let x3 s.
x2 s 350 t 150 ⇒ x2 200 s t
x1 200 s t 300 ⇒ x1 500 s t
Solution: x1 500 s t, x2 200 s t, x3 s, x4 350 t, x5 t,
where s and t are real numbers.
93. False. It is a 2 4 matrix.
94. False. The rows are in the wrong order. To change this 95. False. Gaussian elimination reduces a matrix until a row-
matrix to reduced row-echelon form, interchange Row 1 echelon form is obtained and Gauss-Jordan elimination
and Row 4, and interchange Row 2 and Row 3. reduces a matrix until a reduced row-echelon form is
obtained.
96. z a
y 4a 1
x 3a 2
One possible system is:
x y 7z 3a 2 4a 1 7a 1

x y 7z 1
x 2y 11z 3a 2 24a 1 11a 0 or x 2y 11z 0
2x y 10z 23a 2 4a 1 10a 3 2x y 10z 3
(Note that the coefficients of x, y, and z have been chosen so that the a-terms cancel.)
97. (a) In the row-echelon form of an augmented matrix (b) In the row-echelon form of an augmented matrix that corre-
that corresponds to an inconsistent system of linear sponds to a system with an infinite number of solutions, there
equations, there exists a row consisting of all zeros are fewer rows with nonzero entries than there are variables
except for the entry in the last column. and no row has the first non-zero value in the last column.
98. 1. Interchange two rows. 99. They are the same.

2. Multiply a row by a nonzero constant.
3. Add a multiple of one row to another row.
100. A matrix in row-echelon form is in reduced row-echelon form if every column that has a leading 1 has
zeros in every position above and below its leading 1.
2x2 4x 2x 4
101. f x ,x0 y
3x x2 3x
8
6
x 2 1 0 1 2 3 4 5 4
2
f x 1.6 1.5 undef. 1 0 undef. 4 3 x
−8 −6 2 4 6 8
Vertical asymptote: x 3 −4
−6
Horizontal asymptote: y 2 −8
Intercept: 2, 0
x2 2x 1 x 1x 1 x 1 y
102. f x
x2 1 x 1x 1 x 1 4
3
The graph has a vertical asymptote at x 1 and a discontinuity at x 1.
2
1
Since the degrees of the numerator and the denominator are the same, there
x
is a horizontal asymptote at y 1. −5 −4 −3 −2 −1 1 2 3
103. f x 2x1 104. gx 3x2
x 1 0 1 2 3 x 1 0 1 2 3 4
1 1
f x 1 1
1 2 4 y 27 9 3 1 3 9
4 2
y
Horizontal asymptote: y 0
Intercept: 0, 2
10
1
8
y 6
5 4
4 2
3 x
−2 2 4 6 8 10
2 −2
x
−2 −1 1 2 3 4
−1
Section 8.2 Operations with Matrices 737
105. hx lnx 1 y
4
3
x 1.5 2 3 4 5
2
1
hx 0.693 0 0.693 1.099 1.386 x
−2 −1 1 2 3 4 5 6
−1
Vertical asymptote: x 1 −2
−3
Intercept: 2, 0 −4
106. f x 3 ln x ⇒ y 3 ln x ⇒ e y3 x y
8
x 0.05 0.14 0.37 1 2.72 6
y 0 1 2 3 4 4
x
2 4 6 8 10
−2
Section 8.2 Operations with Matrices
■ A B if and only if they have the same order and aij bij.
■ You should be able to perform the operations of matrix addition, scalar multiplication, and matrix multiplication.
■ Some properties of matrix addition and scalar multiplication are:
(a) A B B A
(b) A B C A B C
(c) cdA cdA
(d) 1A A
(e) cA B cA cB
(f) c dA cA dA
■ You should remember that AB BA in general.
■ Some properties of matrix multiplication are:
(a) ABC ABC
(b) AB C AB AC
(c) A BC AC BC
(d) cAB cAB AcB
■ You should know that In, the identity matrix of order n, is an n n matrix consisting of ones on its main diagonal and
zeros elsewhere. If A is an n n matrix, then AIn InA A.
Vocabulary Check
1. equal 2. scalars 3. zero; O
4. identity 5. (a) (iii) (b) (iv) (c) (i) 6. (a) (ii) (b) (iv) (c) (i) (d) (iii)
(d) (v) (e) (ii)
1. x 4, y 22 2. x 13, y 12
3. 2x 1 5, 3x 6, 3y 5 4 4. x 2 2x 6 2y 18
x 2, y 3 4 x y9
2x 8 y 2 11
x 4 y9
1 1 12 1 1 2
2
1 2 3
5. (a) A B
1 1 8 21 1 8 1 7
1 1 12 1 1 1
2
1 2 0
(b) A B
1 1 8 21 1 8 3 9
1 31 31 3
2
1 3
(c) 3A 3
1 32 31 6 3
3 1 3 4 1 1
6
3 2 3 2
(d) 3A 2B 2
3 1 8 6 3 2 16 8 19
3 2 13 22 2
2
1 2 0
6. (a) A B
1 4 2 24 12 6 3
3 2 13 22
2
1 2 4 4
(b) A B
1 4 2 24 12 2 1
31 32
2
1 2 3 6
(c) 3A 3
1 32 31 6 3
3 2 36 64
6
3 6 9 10
(d) 3A 2B 2
3 4 2 68 34 2 1
1

6 1 4
7. A 2 4 , B 1 5
3 5 1 10
5 3

7 3 5 18
(a) A B 1 9 (b) A B 3 1 (c) 3A 6 12
2 15 4 5 9 15
3 16 11

18 2 8
(d) 3A 2B 6 12 2 10 8 2
9 15 2 20 11 5
3 22 13 14 2

1
2 1 1 2 4 4 5
8. (a) A B
1 4 3 1 2 1 3 1 1 42 4 0 2
3 22 1 3 14 3
1
2 1 1 2 4 0 4
(b) A B
1 4 3 1 2 1 3 1 1 4 2 2 2 6
32 31 31
1
2 1 1 6 3 3
(c) 3A 3
1 4 31 31 34 3 3 12
2 3 4 6 8 9 5
3
6 3 3 4 6 3 3 2
(d) 3A 2B 2
3 12 3 1 2 3 3 12 6 2 4 3 5 16
1 1
1
2 2 0 1 1 1 1 0
9. A , B
1 2 0 1 3 4 9 6 7
2
2
3 3 1 1
(a) A B
5 7 6 8
1
4
1 1 0 1
(b) A B
3 11 6 6
3
3
6 6 0 3
(c) 3A
3 6 0 3
3 2 4 1 2
3
6 6 0 3 2 2 2 0 4 3
(d) 3A 2B
3 6 0 3 6 8 18 12 14 9 5 24 12 11

1 4 0 3 5 1
3 2 2 2 4 7
10. (a) A B 5 4 1 10 9 1
0 8 6 3 2 4
4 1 0 0 1 2

1 3 4 5 01 4 9 1
32 2 4 27 5 6 5
5 10 4 9 1 1 15 5 2
03 8 2 6 4 3 10 10
4 0 1 1 02 4 0 2

1 4 0 3 5 1
3 2 2 2 4 7
(b) A B 5 4 1 10 9 1
0 8 6 3 2 4
4 1 0 0 1 2

1 3 4 5 0 1 2 1 1
32 2 4 2 7 1 2 9
5 10 4 9 1 1 5 13 0
03 8 2 6 4 3 6 2
4 0 1 1 0 2 4 2 2

1 4 0 3 12 0
3 2 2 9 6 6
(c) 3A 3 5 4 1 15 12 3
0 8 6 0 24 18
4 1 0 12 3 0

3 12 0 3 5 1
9 6 6 2 4 7
(d) 3A 2B 15 12 3 2 10 9 1
0 24 18 3 2 4
12 3 0 0 1 2

3 12 0 6 10 2 3 2 2
9 6 6 4 8 14 5 2 20
15 12 3 20 18 2 5 30 1
0 24 18 6 4 8 6 20 10
12 3 0 0 2 4 12 5 4
1
11. A 16 0
4
3
0, B
8
4 3
(a) A B is not possible. A and B do not have the same order.
(b) A B is not possible. A and B do not have the same order.
(c) 3A 3
18 0
12
9
0
(d) 3A 2B is not possible. A and B do not have the same order.
12. (a) A B is not possible. A and B do not have the same order.

3 9
(c) 3A 3 2 6
1 3
(d) 3A 2B is not possible. A and B do not have the same order.
5 7 10 0 1 8 8 7
53
10 8

0 7 1
13.
6 2 1 14 6 3 2 14 6 1 6 15 1
11 7 6 0 11 8 5 7 5

16
8 0 5 6
14.
0 3 1 2 1 1 3 2 0 1 1 2 2
15. 4 40 0
2
1
3

2
3
1
6
2
0 43
6 1
8
3
3

24
12
4
32
12
12
16. 2 5 0 14 9 12 5 14 4 18 0 9
1
2 4 6 18 2 6
2 19 9
1
4 14
2
19 9
2 7 2
3 6 4 6 8 8 8 8
17. 3 07 2

8
3
1 247 9 3
15
0
3

14 18

18
45
0
9

14 18

10
59
8
9

5 1 4 11 5 7 1 5

4 11 7 5
18. 1 2 1 16 3 4 9 1 2 1 16 3 9 4 1
9 3 0 13 6 1 9 3 06 13 1

4 11 2 4
2 1 16 6 3
9 3 6 12

2

1
4 11 3 3
1
2 1 1 2
9 3 1 2

1
11 23 11 31
4 3 3 3
2 1
1 3
1 2 1 2
9 1 3 2 8 1
3 17.143
1
3 2 5 0 2.143
19. 6
7
4 2 2 11.571 10.286
11 22 440

20. 55 22
14
19

13
20
6 495
495
1375
1.630 3.090 1.581 3.739

3.211 6.829
21. 1.004 4.914 5.256 8.335 4.252 13.249
0.055 3.889 9.768 4.251 9.713 0.362

6 20 14 15 31 19 132 168
22. 12 1 9 8 6 16 10 108 60
2 5 7 0 24 10 348 60
2 1 6 3 6 9

0 3 0 6
23. X 3 1 0 2 2 0 3 0 4 0 1 0
3 4 4 1 9 12 8 2 17 10
24. 2X 2A B
2 1 2 1 3
2 52

0 3 0 2
1
XA 2B 1 0 12 2 0 1 0 1 0 0 0
3 4 4 1 3 4 2 12 5 72

3 3
3 0 3 3

2 1 0 3 2 2
25. X 32A 12B 32 1 0 12 2 0 32 0 1 0 2

1
0
3 4 4 1 92 6 2 12 13 11
2 2
26. 2A 4B 2X
2 1 6 5

0 3 2 1 0 2
X A 2B 1 1 0 2 2 0 1 0 4 0 5 0
3 4 4 1 3 4 8 2 5 6
27. A is 3 2 and B is 3 3. AB is not possible. 28. A is 2 4, B is 2 2. AB is not possible.
29. A is 3 3, B is 3 2 ⇒ AB is 3 2.
02 13 01 01 14 06

0 1 0 2 1 3 4
4 0 2 3 4 42 03 21 41 04 26 10 16
8 1 7 1 6 82 13 71 81 14 76 26 46
30. A is 3 2, B is 2 2 ⇒ AB is 3 2.
1 1 19

3

1 2
AB 4 5 4 27
0 7
0 2 0 14
31. A is 3 3, B is 3 3 ⇒ AB is 3 3.
13 00 00 10 01 00 10 00 05

1 0 0 3 0 0
0 4 0 0 1 0 03 40 00 00 41 00 00 40 05
0 0 2 0 0 5 03 00 20 00 01 20 00 00 25

3 0 0
0 4 0
0 0 10
32. A is 3 3, B is 3 3 ⇒ AB is 3 3.
1

5 0 0 5 0 0 1 0 0
AB 0 8 0 0 18 0 0 1 0
1 7
0 0 7 0 0 2 0 0 2
33. A is 3 3, B is 3 3 ⇒ AB is 3 3.
06 08 50 011 016 50 04 04 50

0 0 5 6 11 4
0 0 3 8 16 4 06 08 30 011 016 30 04 04 30
0 0 4 0 0 0 06 08 40 011 016 40 04 04 40

0 0 0
0 0 0
0 0 0
3 1

5 6 1 2 41 7 7
34. A is 2 1, B is 1 4 ⇒ AB is 2 4. 35. 2 5 1 8 1 4 42 5 25
10 5 5 4 2 9 10 25 45
60 20

10 10 60
6 2 1 6
12 72 24 12 72
12

11 4 12 10 252 30
36. 14 10 12 5 12 298 452
6 2 9 15 16 217 180

3 1 6
3 6

8 8 151 25 48
24 15 14
37. 12 15 9 6 516 279 387
16 10 21
5 1 1 5 47 20 87
8 4 10
38. A is 3 3, B is 4 2. AB is not possible. 39. A is 2 4 and B is 2 4 ⇒ AB is not possible.
15 18 249 417

42
7

22 1
40. 4 12 124 104 284
8 16 24
8 22 232 176 520
1 12 21 11 28

14 12
2 0 15
41. (a) AB
2 8 42 21 41 28 6 12
1 21 14 22 12 2
12 14
2 2
(b) BA
8 2 11 84 12 82 31 14
11 24 12 22
14 14
2 2 9 6
(c) A2
2 2 41 24 42 22 12 12
1 20 13 20 13 3

1 3
2 0 0 3
42. (a) AB
4 3 10 43 10 43 12 12
1 02 01 01 04
3 1
0 0 2 0 0
(b) BA
3 4 32 31 31 34 3 15
1 1 22 11 21 14 6
1 1
2 2 3
(c) A2
4 4 12 41 11 44 6 15
1 3 31 13 33 11 10

31 13
0
43. (a) AB
3 1 11 33 13 31 10 0
3 1 13 31 11 33 10
13 31
0
(b) BA
1 3 33 11 31 13 10 0
1 1 33 11 31 13 6
31 31
8
(c) A2
3 3 13 31 11 33 6 8
1 11 13 13 11

1 3
1 1 3 4 2
44. (a) AB
1 1 11 13 13 11 2 4
1 11 31 11 31
3 1
1 3 1 4 2
(b) BA
1 1 31 11 31 11 2 4
1 1 11 11 11 11 2
1 1
1 1 0
(c) A2
1 1 11 11 11 11 2 0
71 71 72

7 7 7 14
45. (a) AB 8 1 1 2 81 81 82 8 8 16
1 11 11 12 1 1 2

7
(b) BA 1 1 2 8 17 18 21 13
1
(c) A2 is not possible.

2
46. (a) AB 3 2 1 3 32 23 10 12
0
23 22 21

2 6 4 2
(b) BA 3 3 2 1 33 32 31 9 6 3
0 03 02 01 0 0 0
(c) The number of columns of A does not equal the number of rows of A; the multiplication is not possible.
47. 30 1
2 21 0
2 12
0
4

1
4
2
412
0
4

5 8
4 16

0 3
48. 3 1
6 5
2
1
0
1 3 3 1600 2
51 14
1 04
63 53 11
13 23 01
4 1
9

2
3
2 9
27 6
6 27

4 0 2 3 2 3
2 2 4

0 2 0 2 10
49. 0 1 3 5 3 4
4 1 2 4 1 2 3 14
1 2 0 3 1 1

3 3
1 1
50. 5 6 7 1 8 9 4 2
5 5
7 7

34 32 12 6
14 12 4 2

54 52 20 10
74 72 28 14
1
2 x 0 1 x 10
1 x1 4 2 3 x1 5
51. (a) 52. (a)
1 2 4 2
1

1 4 R2 1 4 10
(b) (b)
2 1 0 R1 2 3 5
R2 R1 →
2
1 0 4 1 4 10
1 0 2R1 R2 → 0 5 15

10
0 4 1 4 10
2R1 R2 → 1 8 15R2 → 0 1 3
4R2 R1 → 1
X 48 15 R2 → 0
0
1
2
3
2
X 3
4 13
26 3 4
xx 36 x
1 9 x1
53. (a) 54. (a)
1 2 1 3 2 12

(b) 26 3
1
4
36 (b)
R1 1
R2 4
3
9
12
13

20
3 4
3R1 R2 → 8 48 1
4R1 R2 → 0
3
3
12
35
12R1 → 3

0 3
1 2

2 1 12
18R2 → 1 6 13 R2 → 0 1 35
3
32R2 R1 → 7
10 0
1 6 3R2 R1 → 1
0 0
1
23
35
3

X 76 X
23
35
3
2

1 3 x1 9 1 1 3 x1 9
55. (a) A 1 3 1 x2 6 56. (a) 1 2 0 x2 6
2 5 5 x3 17 1 1 1 x3 5

2 1 1 3 9

1 3 9
(b) 1 3 1 6 (b) 1 2 0 6
2 5 5 17 1 1 1 5

1 1 3 9

1 2 3 9
R1 R2 → 0 1 2 3 R1 R2 → 0 3 3 15
2R2 R3 → 0 1 1 1 R1 R3 → 0 2 4 14

1 1 3 9

2R2 R1 → 1 0 7 15
0 1 2 3
1
3 R2 → 0 1 1 5
R2 R3 → 0 0 1 2 12R3 → 0 1 2 7

3
1 1 9

7R3 R1 → 1 0 0 1
2R3 R2 → 0 1 0 1 0 1 1 5
0 0 1 2 R2 R3 → 0 0 1 2

R2 R1 → 1 0 2 4

1
X 1 0 1 1 5
2 R3 → 0 0 1 2

2R3 R1 → 1 0 0 0
R3 R2 → 0 1 0 3
0 0 1 2

0
X 3
2
1

1 5 2 x1 20 1 4 x1 17
57. (a) 3 1 1 x2 8 58. (a) 1 3 0 x2 11
0 2 5 x3 16 0 6 5 x3 40

5 20 1

1 2 1 4 17
(b) 3 1 1 8 (b) 1 3 0 11
0 2 5 16 0 6 5 40

1 5 2 20

1 1 4 17
3R1 R2 → 0 14 5 52 R1 R2 → 0 4 4 28
0 2 5 16 0
6 5 40

1 5 2 20

1

1 4 17
R3 R2 → 0 12 0 36
0 2 5 16
1
4 R2 → 0 1 1 7
0
6 5 40

1 5 2 20

1

1 4 17
1
12 R2 → 0 1 0 3
0 2 5 16 0 1 1 7
6R2 R3 → 0 0 1 2

5R2 R1 → 1 0 2 5
R2 R1 → 1

0 1 0 3 0 3 10
2R2 R3 → 0 0 5 10 0 1 1 7
R3 → 0 0 1 2

1 0 2 5
3R3 R1 → 1

0 1 0 3 0 0 4
1
5 R3 → 0 0 1 2 R3 R2 → 0 1 0 5
0 0 1 2

2R3 R1 → 1 0 0 1
0 1 0 3

4
0 0 1 2 X 5

1 2
X 3
2
35 40
70 50 25 84 60 30 100 90 70 30 110 99 77 33
59. 1.2 60. 1.10
100 70 42 120 84 20 60 60 44 22 66 66
61. (a) Farmer’s Fruit Fruit

Market Stand Farm
A 100
125 100
175
75 Apples
125 Peaches
Each entry represents the number of bushels of each type of crop that are shipped to each outlet.
(b) B 3.50 6.00
Each entry represents the profit per bushel for each type of crop.
(c) BA 3.50 6.00 125

100
100 75
175 125
$1037.50 $1400.00 $1012.50
The entries in the matrix represent the profits for both crops at each of the three outlets.

5,000 4,000
62. BA $39.50 $44.50 $56.50 6,000 10,000 $916,500 $885,500
8,000 5,000
The entries represent the costs of the three models of the product at the two warehouses.

840 1100

3 2 2 3 0 1200 1350 $15,770 $18,300
63. ST 0 2 3 4 3 1450 1650 $26,500 $29,250
4 2 1 3 2 2650 3000 $21,260 $24,150
3050 3200
The entries represent the wholesale and retail inventory values of the inventories at the three outlets.

0.6 0.1 0.1 0.6 0.1 0.1 0.40 0.15 0.15
64. P2 0.2 0.7 0.1 0.2 0.7 0.1 0.28 0.53 0.17
0.2 0.2 0.8 0.2 0.2 0.8 0.32 0.32 0.68
The P2 matrix gives the proportion of the voting population that changed parties or remained
loyal to their party from the first election to the third.

0.40 0.15 0.15 0.6 0.1 0.1 0.300 0.175 0.175
65. P3 P2P 0.28 0.53 0.17 0.2 0.7 0.1 0.308 0.433 0.217
0.32 0.32 0.68 0.2 0.2 0.8 0.392 0.392 0.608

0.300 0.175 0.175 0.6 0.1 0.1 0.250 0.188 0.188
P4 P3P 0.308 0.433 0.217 0.2 0.7 0.1 0.315 0.377 0.248
0.392 0.392 0.608 0.2 0.2 0.8 0.435 0.435 0.565

0.250 0.188 0.188 0.6 0.1 0.1 0.225 0.194 0.194
P5 P4P 0.315 0.377 0.248 0.2 0.7 0.1 0.314 0.345 0.267
0.435 0.435 0.565 0.2 0.2 0.8 0.461 0.461 0.539

0.213 0.197 0.197
P6 0.311 0.326 0.280
0.477 0.477 0.523
—CONTINUED—
65. —CONTINUED—

0.206 0.198 0.198
P7 0.308 0.316 0.288
0.486 0.486 0.514

0.203 0.199 0.199
P8 0.305 0.309 0.292
0.492 0.492 0.508
As P is raised to higher and higher powers, the resulting matrices appear to be approaching the matrix

0.2 0.2 0.2
0.3 0.3 0.3 .
0.5 0.5 0.5

1 0.5 0.2 12 10 $18.10 $15.40
66. ST 1.6 1.0 0.2 9 8 $29.80 $25.40
2.5 2.0 1.4 8 7 $59.20 $50.80
This represents the labor cost for each boat size at each plant.
Sales Profit

40 64 52 2.65 0.65 447 115 Friday
67. (a) AB 60 82 76 2.85 0.70 624.50 161 Saturday
76 96 84 3.05 0.85 731.20 188 Sunday
The entries in Column 1 represent the total sales of the three kinds of milk for Friday, Saturday, and Sunday.
The entries in Column 2 represent each days’ total profit.
(b) Total profit for the weekend: 115 161 188 $464
Sales ($) Profit

580 840 320 1.95 0.32 3541 616 87
68. (a) AB 560 420 160 2.05 0.36 2297 394.4 89
860 1020 540 2.15 0.40 4929 858.4 93
The first column of AB gives the amount of sales for each octane. The second column gives the profit made
by each octane.
(b) The store’s profit for the weekend is $616 $394.40 $858.40 $1868.80.
Bicycled Jogged Walked

69. (a) B [2 0.5 3] 20-minute time periods
120-pound 150-pound

109 136 person person
(b) BA 2 0.5 3 127 159 [473.5 588.5] Calories burned
64 79
The first entry represents the total calories burned by the 120-pound person and the second entry represents
the total calories burned by the 150-pound person.
70. (a) Individual Family

costs costs

694.32 1725.36 Comprehensive plan
A 451.8 1187.76 HMO standard plan
489.48 1248.12 HMO plus plan

B 463.1 1217.45 HMO standard plan
499.27 1273.08 HMO plus plan
—CONTINUED—
70. —CONTINUED—
(b) Change in Change in
individual family
costs cost

694.32 1725.36 683.91 1699.48 10.41 25.88 Comprehensive plan
A B 451.8 1187.76 463.1 1217.45 11.3 29.69 HMO standard plan
489.48 1248.12 499.27 1273.08 9.79 24.96 HMO plus plan
Employees choosing the comprehensive plan have a decrease in cost while those choosing
the other two have an increased cost.
(c) Dividing each entry of matrix A by 12 yields

57.86 143.78 56.99 141.62
1 1
12 A 37.65 98.98 , 12 B 38.59 101.45 .
40.79 104.01 41.61 106.09
(d) If the costs increase by 4% next year, then the new cost matrix would be:

722.09 1794.37
A 0.04A 469.87 1235.27
509.06 1298.05
Monthly Monthly
individual family
cost cost

12 A 0.04A 39.16
1
102.94 HMO standard plan
42.42 108.17 HMO plus plan
71. True. 72. False. For most matrices, AB BA.

The sum of two matrices of different orders is undefined.
For 73–80, A is of order 2 3, B is of order 2 3, C is of order 3 2 and D is of order 2 2.
73. A 2C is not possible. A and C are not of the same order. 74. B 3C is not possible. B and C are not of the same order.
75. AB is not possible. The number of columns of A does not 76. BC is possible. The resulting order is 2 2.
equal the number of rows of B.
77. BC D is possible. The resulting order is 2 2. 78. CB D is not possible. The order of CB is 3 3, but the
order of D is 2 2.
79. DA 3B is possible. The resulting order is 2 3. 80. BC DA is possible. The resulting order is 2 3.
1
81. AC 0
0 1
1 2
2

3
3

2
2
3
3 82. AB 34 3
411
1

0
0
0
0
AB O and neither A nor B is O.
1 2
1 0 2 3 2 3
BC
0 3 2 3
Thus, AC BC even though A B.
83. The product of two diagonal matrices of the same order is a diagonal matrix whose entries
are the products of the corresponding diagonal entries of A and B.
ii 00 i0 0i 1

0 0
i 0 i 0 0
84. (a) A2 and i 2 1
i i 0i i0 00 ii 0 1
1 1i 00 10 0i i
0
0 i 0 0
A3 A2A and i 3 i
0 1 i 0i 10 00 1i 0 i
i ii 00 i0 0i
0
0 i 0 1 0
A4 A3A and i 4 1
0 i i 0i i0 00 ii 0 1
i
i
0
(b) B
0
i i 00 ii 0i i0
i i
0 0 1 0
B2 I, the identity matrix
0 0 i0 0i ii 00 0 1
85. 3x2 20x 32 0 86. 8x2 10x 3 0

3x 4x 8 0 2x 34x 1 0
3x 4 0 or x 8 0 2x 3 0 ⇒ x 23
1
x 43 or x 8 4x 1 0 ⇒ x 4
4
Solutions: 3, 8 Solutions: 14, 32
87. 4x3 10x2 3x 0 88. 3x 3 22 x2 45x 0

x4x2 10x 3 0 x3x2 22x 45 0
x 0 or 4x 2 10x 3 0 xx 93x 5 0
10 ±
102 443 10 ±
148 x0
x
24 8
x 9 0 ⇒ x 9
5 ±
37
by the Quadratic Formula 3x 5 0 ⇒ x 53
4
Solutions: 0, 9, 53
5 ±
37
Solutions: 0,
4
89. 3x3 12x2 5x 20 0 90. 2x 3 5x2 12x 30 0

3x2x 4 5x 4 0 x22x 5 62x 5 0
x 43x2 5 0 2x 5x2 6 0
x 4 0 or 3x2 5 0 5
2x 5 0 ⇒ x
5 2
x4 x2
3 x2 6 0 ⇒ x2 6 ⇒ x ±
6
x±
35 ±
15
3
i x ±
6
5

15 Solutions: , ±
6
Solutions: 4, ± i 2
3
x 4y 9
91. Eq.1
5x 8y 39 Eq.2 4
2
5x 20y 45 5Eq.1 −4 −2 2

x
5x 8y 39 (7, − 12 )
−4
12y 6 Add equations.
y 12
−8
x 4 12 9 ⇒ x 7 − 10
Solution: 7, 2
1
8x 3y 17 y
92. Equation 1
6x 7y 27 Equation 2 7
6
48x 18y 102 6Eq.1 5
48x 56y 216 8Eq.2 (−1, 3)
38y 114 Add equations. 2

1
y3 x
−4 −3 −1 1 2 3 4
8x 33 17 ⇒ x 1
Solution: 1, 3
x 2y 5 y
93. Equation 1
3x y 8 Equation 2 4
2
x 2y 5
x
6x 2y 16 2Eq.2 −4 −2 6 8
−2
7x 21 Add equations. (3, −1)
−4
x 3
−6
3 2y 5 ⇒ y 1 −8
Solution: 3, 1
6x 13y
y
94. 11 Equation 1
9x 5y 41 Equation 2 8
6
18x 39y 33 3Eq.1
4
18x 10y 82 2Eq.2 (4, 1)
2
49y 49 Add equations.
x
y 1 −4 −2 2 4 6 8
−2
6x 131 11 ⇒ x 4 −4
Solution: 4, 1
Section 8.3 The Inverse of a Square Matrix
■ You should know that the inverse of an n n matrix A is the n n matrix A1, if is exists, such that AA1 A1A I,
where I is the n n identity matrix.
■ You should be able to find the inverse, if it exists, of a square matrix.
(a) Write the n 2n matrix that consists of the given matrix A on the left and the n n identity matrix I on the right
to obtain A I. Note that we separate the matrices A and I by a dotted line. We call this process adjoining the
matrices A and I.
(b) If possible, row reduce A to I using elementary row operations on the entire matrix A I. The result will be
the matrix I A1. If this is not possible, then A is not invertible.
(c) Check your work by multiplying to see that AA1 I A1A.
b
c
a b 1 d
■ The inverse of A is A1 if ad cb 0.
d ad bc c a
■ You should be able to use inverse matrices to solve systems of linear equations if the coefficient matrix is
square and invertible.
Vocabulary Check
1. square 2. inverse 3. nonsingular; singular 4. A1B
Section 8.3 The Inverse of a Square Matrix 751
1 65 2 2
25 53
1 1 0
1. AB
3 2 15 15 5 6 0 1
1 65 33
53 25
1 1 0
BA
2 3 10 10 5 6 0 1
1 21 11
1 1
1 2 1 1 0
2. AB
2 1 2 2 1 2 0 1
1 21 2 2
1 1
2 1 1 1 0
BA
1 2 11 1 2 0 1

2 1 2 3 11
3 6 6
1 2 1 0
3. AB
4 3
2 2
1 32 0 1
2 3

2 1 4 4
0
1 2 1 0
BA 3

12 3 3
2 2 32
2
3 4 1

3 1 3
1 25 1
15
2 0
1 5 5 5 5 1 0
4. AB
3 25 1
5
6
5 6
5
2
5 3
5
1

3 1 3 2 3 3
1 1 5 5 5 5

5 5 1 0
BA 3
25 1
5
2 3 2
5 52 2
5 5
0 1
2 34 33 2 68 66 4 51 55

2 17 11 1 1 2 1 0 0
5. AB 1 11 7 2 4 3 1 22 21 1 44 42 2 33 35 0 1 0
0 3 2 3 6 5 66 12 12 9 10 0 0 1
21 17 11 6 11 7 4

1 1 2 2 17 11 1 0 0
BA 2 4 3 1 11 7 4 4 34 44 9 22 28 6 0 1 0
3 6 5 0 3 2 66 51 66 15 33 42 10 0 0 1

2 14 54 6 11 35
1 3 4 1 5 4 4
5 2

4 1 1 2 1 0 0
1
1 11
1 1
6. AB 1 2 4 4 4 2 2 1 1 2 4 32 11
2 7 0 1 0
0 1 1 14 1
7
0 0 1
14 14 11 7
4 11 4 4

12 3
4 21 12 2 32 52 4 32

1 2 1 5 1 0 0
1
11 1 11 5 11
BA 4 1 4 1 2 4 1 1 4 2 4 4 4 4 0 1 0
14 1
7
4 0 1 1 11 14 2 74 54 4 74 0 0 1
1 1 1

2 0 1 1 2
3 0 0 1 4 9 5 6
7. AB
1 1 2 1 0 1 1 1
4 1 1 0 3 5 3 3
2 3 415 2 1 3 2 1 3

1 0 0 0
0 65 0 0 0 1 0 0

143 2 9 2 5 1523 1623 0 0 1 0
0 891 4 5 1 4 6 1 0 0 0 1
—CONTINUED—
7. —CONTINUED—
1 1 1

2 2 0 1 1
4 9 5 6 3 0 0 1
BA
0 1 1 1 1 1 2 1
3 5 3 3 4 1 1 0
2 6 1 4 1 2 1 1 2 1

0 1 0 0 0
8 27 5 24 5 6 4 10 6 4 9 5 0 1 0 0

314 0 21 0 0 0 1 0
6 15 3 12 0 363 353 0 0 0 1
2 0 3 3 2

0 1 1
1 1 3 0 12 14 5 10
8. AB
2 1 0 2 5 6 2 4
0 1 3 1 3 4 1 3
65 66 2 2 44

3 12 15
6 12 6
12 15 3
3 14 18
6 14 8
14 18 4
156
2 5 2
5 6 1
2 10 12
4 10 6
10 12 3

1 0 0 0
0 1 0 0

0 0 1 0
0 0 0 1
3 3 2 2

1 0 1 0
12 14 5 10 1 1 3 0
BA
5 6 2 4 2 1 0 2
3 4 1 3 0 1 3 1
632 312 3 9 6 2 2

24 14 10
10 6 4
642
14 5 10
624
413
12 42 30
5 18 12
3 12 9
10 10
4 4
2 3

1 0 0 0
0 1 0 0

0 0 1 0
0 0 0 1
2 4 5 883 10 16 6 6 6

2 3 3
1
9. AB 3 1 1 0 4 8 3 13 4 4 5 8 33
0 1 4 1 2 0 4 4 8 8 3

3 0 0 1 0 0
AB 13 0 3 0 0 1 0
0 0 3 0 0 1
4 5 2 85 8 5 3 12 12

3 2 3 1 0 0
BA 13 4 8 3 1 1
1
0 3 88 8 8 3 12 12 0 1 0
1 2 0 0 1 4 2 2 22 3 0 0 1

1 1 0 1 3 1 1 3
1 1 1 1 0 3 1 2 3
10. AB 3
1 1 2 0 0 1 1 0
0 1 1 1 3 2 1 0
33 3 1 1 2 1 2 1 33
13
3
3
3
3
3
3
111
1 1 2
112
121
1 2 2
2 1 1
3 3
33
3

1 0 0 0
0 1 0 0

0 0 1 0
0 0 0 1

3 1 1 3 1 1 0 1
3 1 2 3 1 1 1 0
BA 13
0 1 1 0 1 1 2 0
3 2 1 0 0 1 1 1

311 3 1 1 3 123 33
1 312 3 1 2 3 1 4 3 33
3
11 1 1 12 0
321 3 2 1 2 2 3

1 0 0 0
0 1 0 0

0 0 1 0
0 0 0 1
I 0

3
2 0 1 0 1 2 1 0
11. A 12. A I
3 0 1 7 0 1

1
1
→ 1

R 0 0 1 2 1 0

2 1 2
I A1
1
3 R2 → 0 1 0 1
3
3R1 R2 → 0 1 3 1
2R2 R1 → 1 2

1 0 7
A1
2 0 I A1
0 1
3
0 1 3 1
2
3
7
A1
1
I 2
2 7

1 1 0 33 1 0
13. A
3 0 1
14. A I
4 19 0 1
2 2R2 R1 → 1 5
0
1 1 0 1 2
2R1 R2 → 1 2 1 4 19 0 1
2R2 R1 → 3
10 0
1 2
2
1
I A1 1
4R1 R2 → 0
5
1
1
4
2
7
3
2
2
5R2 R1 → 19 33
A1
0
1 0
1
1 4 7
I A1
19 33
A1 4 7
1
I 2
1 1 0
I 1
A 11 1 1 0
15.
16. A
1 0 1 0 0 1
R2 R1 → 1 10R2 R1 →
2 1
1 0 1 1 1 1 10
1 0 1 0 0 1

1 1 1 1 10
0
1 0 1 .
I .. A1 R1 R2 → 0
2R1 R2 → 1 2 1 1 1 11

A1
1 1

R2 R1 → 1
0
0
1
0
1
1
11
I A1
2 1
1
1
0
A1
11
I 4

1
2 4 1 0 2 3 1 0
17. A 18. A I
8 0 1 4 0 1

2R1 R2 → 20 4
0
1
2
0
1 R2 1
R1 2
4
3
0
1
1
0
The two zeros in the second row imply that the

1 4 0 1
inverse does not exist. 2R1 R2 → 0 5 1 2
1
15R2 → 0 4
1

0
15 2
5
1

4R2 R1 → 1 0 4
35

5
I A1
0 1 15 2
5
3
1
4
A1 15
2
2

5
3
2 7 1 A has no inverse because A has no inverse because it
19. A 20. A 6 15
9 2 it is not square. is not square.
0 1
1 0 0

1 1 1
21. A I 3 5 4 0 1 0
3 6 5 0 0 1
1 0 0

1 1 1
3R1 R2 → 0 2 1 3 1 0
3R1 R3 → 0 3 2 3 0 1
1 0 0

1 1 1
1
2 R2 → 0 1 1
2 32 1
2 0
0 3 2 3 0 1

R2 R1 → 1 0 1
2 5
2 12 0
0 1
1
2 23 1
2 0
3R2 R3 → 0 0
1
2 3
2 2 3
1
R3 R1 → 1 1 1 1

0 0
R3 R2 → 0 1 0 3 2 1
0 0 1
2 32 32 1
1 1 1

1 0 0
0 1 0 3 2 1 I A1
2R3 → 0 0 1 3 3 2
1

1 1
A1 3 2 1
3 3 2

1 2 2 1 0 0
22. A I 3 7 9 0 1 0
1 4 7 0 0 1

1 2 2 1 0 0
3R1 R2 → 0 1 3 3 1 0
R1 R3 → 0 2 5 1 0 1
2R2 R1 → 1 4 2

0 7 0
0 1 3 3 1 0
2R2 R3 → 0 0 1 5 2 1
4R3 R1 → 1 13

0 0 6 4
3R3 R2 → 0 1 0 12 5 3 I A1
0 0 1 5 2 1
13

6 4
A1 12 5 3
5 2 1
1

1 0 0 0 0
23. A I 3 4 0 0 1 0
2 5 5 0 0 1
1

1 0 0 0 0
3R1 R2 → 0 4 0 3 1 0
2R1 R3 → 0 5 5 2 0 1
1

1 0 0 0 0
0 4 0 3 1 0
5
4R2 R3 → 0 0 5 74 54 1
1

1 0 0 0 0
4
3 1
1
4 R2 → 0 1 0 4 0 I A1
1
R
5 3
→ 0 0 1 207 14 1
5

1 0 0
34 1
A1
4 0
7
14 1
20 5

1 0 0 1 0 0 1 0 0 1 0 0
24. A I 3 0 0 0 1 0 3R1 R2 → 0 0 0 3 1 0
2 5 5 0 0 1 2R1 R3 → 0 5 5 2 0 1
Since the first three entries of row 2 are all zeros, the inverse of A does not exist.
8

0 0 0 1 0 0 0
0 1 0 0 0 1 0 0
25. A I
0 0 4 0 0 0 1 0
0 0 0 5 0 0 0 1
18R1 → 1 18

0 0 0 0 0 0
0 1 0 0 0 1 0 0
I A1

1 1
R
4 3 → 0 0 1 0 0 0 4 0
1
5R4 → 0 0 0 1 0 0 0 1
5
18

0 0 0
0 1 0 0
A1 1
0 0 4 0
0 0 0 15
2

1 3 0 1 0 0 0
0 2 4 6 0 1 0 0
26. A I
0 0 2 1 0 0 1 0
0 0 0 5 0 0 0 1
2

1 3 0 1 0 0 0
1
2 R2→ 0 1 2 3 0 1
2 0 0
0 0 2 1 0 0 1 0
1
R
5 4 → 0 0 0 1 0 0 0 1
5
3R2 R1 → 1 8 9 32

0 1 0 0
R3 R2 → 0 1 0 4 0 1
2 1 0
R4 R3 → 0 0 2 0 0 0 1 15
0 0 0 1 0 0 0 1
5

4R3 R1 → 1 0 0 9 1 32 4
4
5
4R4 R2 → 0 1 0 0 0 1
2 1 45
12R3 → 0 0 1 0 0 0 12 1
10
0 0 0 1 0 0 0 1
5

9R4 R1 → 1 0 0 0 1 32 4 13
5
1
45
0
0
1
0
0
1
0
0
0
0 0
2 1
12 1
10
I A1
0 0 0 1 0 0 0 1
5
10 15 40

26
1 0 5 10 8
A1 10
0 0 5 1
0 0 0 2
2 1

7

1 10 5
27. A 3 7 10 28. A 5 1 4
5 7 15 3 2 2
175 37 13

10 4

27
A1 95 20 7 A1 2 1 5
14 3 1 13 5 35

1 1 2 3 2 2
29. A 3 1 0 30. A 2 2 2
2 0 3 4 4 3

3 1.5 1

3 2 1.5 1 1 0
1
A1 2 9 7 6 4.5 3.5 3 A1 7 8.5 1
2 2 2 1 1 1 8 10 1

3 1
12

56 1 11
4 4 3 6
31. A 1 0 32 32. 0 2
3 2
1
0 1 2 1 12 2
5

12 5 9 A1 does not exist.
A1 4 2 4
8 4 6

0.3

0.1 0.2 0.3 0.6 0
33. A 0.3 0.2 0.2 34. A 0.7 1 0.2
0.5 0.4 0.4 1 0 0.9

4 0 1.81 3.75 0 1.25

0 2 0.90
A1 5
22 11 11 10 5 5 A1 3.4583 1 1.375
11
22 6 8 10 2.72 3.63 4.16 0 2.5
7

1 0 3 0 4 8 14
0 2 0 4 2 5 4 6
35. A 36. A
1 0 3 0 0 2 1 7
0 2 0 4 3 6 5 10
10 29

A1 does not exist. 27 4
16 5 2 18
A1
17 4 2 20
7 2 1 8
2 1 2

1

0 1 0 1
0 2 0 1 3 5 2 3
37. A 38. A
2 0 1 0 2 5 2 5
0 1 0 1 1 4 4 11
24 2

1 0 1 0 7 1
0 1 0 1 10 3 0 1
A1 A1
2 0 1 0 29 7 3 2
0 1 0 2 12 3 1 1
b
c 8
a b 1 d 7 12
39. A , A1 40. A
d ad bc c a 5
2 ad bc 75 128 35 96 61
2
5
A
3

5
1 5 12 61 12

61
ad bc 53 22 19 A1 8 7
61 8 7 61 61

3 2

1 3 2 19 19
A1
19 2 5 2
19 5
19
12
42 6

3
41. A 42. A
3 5 2
ad bc 43 26 0 ad bc 122 35 24 15 9
Since ad bc 0, A1 does not exist.

2
1 2 3 9 13
A1
9 5 12

59 43

7
2 34 14 9
4
43. A 1 4 44. A 5 8
5 5 3 9
ad bc 72
45
43
15
10
28

3

20 20
59
ad bc 41
89
94
53
143
36

4 3 4 3 16 15 8
94 32 81
1 5 4 20 5 4 59 59 36 9 143 143
A1 A1
5920 15 7
2
59 15 7
2
4
59
70
59
143 53 14
60 9
143 143
3 3
y 2 10 0 y 2 3 3
x 2 5 5 x 2 0 6
45. 46.
1 1
3 8 3 7
y 2 2 6 y 2 2 4
x 2 4 x 2 1
47. 48.
1 1
1 1 1

x 1 1 0 3 x 1 1 1
49. y 3 2 1 5 8 50. y 3 2 1 2 7
z 3 3 2 2 11 z 3 3 2 0 9
24 2

24 2 32

x1 7 1 0 2 x 7 1 1
x2 10 3 0 1 1 1 y 10 3 0 1 2 13
51. 52.
x3 29 7 3 2 1 0 z 29 7 3 2 0 37
x4 12 3 1 1 2 0 w 12 3 1 1 3 15
Solution: 2, 1, 0, 0 Solution: 32, 13, 37, 15
5 30
3 4 18 12
53. A 54. A
3 24
4 24 12

1 3 1
A1 A1
9 20 5 3 432 360 30 18

1
4 2 1 22 12

x 1 3 2 x 1 24 13 1 36 2

y 11 5 3 4 11 22 2 y 72 30 18 23 72 24 1
3
Solution: 2, 2 Solution: 1 1

2, 3
0.4 0.6
1
0.8 0.2
55. A 56. A
2 4 1.4
4 0.8

1 1 1.4 0.6
A1 A1
1.6 1.6 2 0.4 0.28 0.6 1 0.2
A1 does not exist.
y 0.32 8.8
x 1 1.4 0.6 2.4
1 0.2
This implies that there is no unique solution; that is,
either the system is inconsistent or there are infinitely 1 1.92

6
many solutions.
0.32 0.64 2
Find the reduced row-echelon form of the matrix Solution: 6, 2
corresponding to the system.

0.42 0.8
4
1.6
5
2.5R1 → 2 4
12 4 5
2 4
2R1 R2 → 10 0 13
The given system is inconsistent and there is no solution.

5
14
3
8 6 1
57. A 3 3 58. A 4 7
2 4 3 2

3
38 3
38 1

1 4 4 1 2 1 72 1
A1 3 9 43 A1
16 16 32 14 32 14 2
1
3 35 4
12 3 3
4 5
6
xy 2
1

7
1 2 4 12 2
2
1
3
12

8
x
y

19 43
1 20
5 51

12 19
19
95
12
10
6 6
1

4 1
59. A 2 2 3
5 2 6
Find A1.

4 1 1 1 0 0
A I 2 2 3 0 1 0
5 2 6 0 0 1

R1 5 2 6 0 0 1
2 2 3 0 1 0
R3 4 1 1 1 0 0

R3 R1 → 1 1 5 1 0 1
2 2 3 0 1 0
4 1 1 1 0 0

1 1 5 1 0 1
2R1 R2 → 0 4 7 2 1 2
4R1 R3 → 0 3 19 5 0 4

1 1 5 1 0 1
R3 R2 → 0 1 12 3 1 2
0 3 19 5 0 4

R2 R1 → 1 0 17 4 1 3
0 1 12 3 1 2
3R2 R3 → 0 0 55 14 3 10

1 0 17 4 1 3
0 1 12 3 1 2
1
55 R3 → 0 0 1 14
55
3
55
2
11

17R3 R1 → 1 0 0 18
55
4
55
1
11
12R3 R2 → 0 1 0 3
55
19
55
2
11 I A1
0 0 1 14
55
3
55
2
11
4 5

18
1
A1 55 3 19 10
14 3 10
4 5 5 55 1

x 18
1 1
y 55 3 19 10 10 55 165 3
z 14 3 10 1 110 2
Solution: 1, 3, 2

2 3

4 3 5 2
60. A 2 2 5 61. A 2 2 3
8 5 2 1 7 8
A1 does not exist. This implies that there is no unique
21

19 16
1 solution; that is, either the system is inconsistent or the
A1 44 32 14
82 system has infinitely many solutions. Use a graphing utility
26 4 12 to find the reduced row-echelon form of the matrix
21 19 16 2 corresponding to the system.

x 410 5
1 1
y 44 32 14 16 656

8 5 3 2 2
82 82
z 26 4 12 4 164 2 2 2 3 3
Solution: 5, 8, 2
1 7 8 4

1 5
0 16 13
16
0 1 19
16 11
16
0 0 0 0
5 13

x 16 z 16
y 19
16 z
11
16
5
a 13 19 11
Let z a. Then x 16 16 and y 16 a 16 .
Solution: 165 a 1316, 1916a 1116, a where a is a real number
2

2 3 5 3 1
62. A 3 5 9 63. A 4 1 3
5 9 17 1 5 1
A1 does not exist. This implies that there is no unique 0.2

0.56 0.12
solution; that is, either the system is inconsistent or A1 0.04 0.08 0.2
the system has infinitely many solutions. Use a graphing
0.76 0.52 0.2
utility to find the reduced row-echelon form of the
0.2 29 7

matrix corresponding to the system. x 0.56 0.12
y 0.04 0.08 0.2 37

2 3 5 4 3
3 5 9 7 z 0.76 0.52 0.2 24 2
5 9 17 13 Solution: 7, 3, 2

1 0 2 1
0 1 3 2
0 0 0 0
xy 2z3z 12

Let z a. Then x 2a 1 and y 3a 2.
Solution: 2a 1, 3a 2, a where a is a real number
3

7 0 2
8 10

7
2 1 0 1
64. A 12 3 5 65. A
4 0 1 2
15 9 2
1 1 0 1
0.034 0.004

0.066 1

0 0 1
A1 0.086 0.117 0.139 1 5 0 3
0.133 0.029 0.094 A1
2 4 1 2
0.034 0.004 151 1 4

x 0.066 10 0 1
y 0.086 0.117 0.139 86 3 1

x 0 0 1 41 5
z 0.133 0.029 0.094 187 5 y 1 5 0 3 13 0

Solution: 10, 3, 5 z 2 4 1 2 12 2
w 1 4 0 1 8 3

2 5 0 1
1 4 2 2
66. A
2 2 5 1
1 0 0 3
0.352

0.338 0.141 0.394
0.042 0.164 0.066 0.117
A1
0.141 0.230 0.108 0.164
0.113 0.117 0.047 0.202
0.352

x 0.338 0.141 0.394 11 6.21
y 0.042 0.164 0.066 0.117 7 0.77

z 0.141 0.230 0.108 0.164 3 2.67
w 0.113 0.117 0.047 0.202 1 2.40
Solution: 6.21, 0.77, 2.67, 2.40

1 1 1
67. A 0.065 0.07 0.09
0 2 1

1 1 1 1 0 0
A I 0.065 0.07 0.09 0 1 0
0 2 1 0 0 1
1

1 1 1 0 0
200R2 → 13 14 18 0 200 0
0 2 1 0 0 1
1 0 0

1 1 1
13R1 R2 → 0 1 5 13 200 0
0 2 1 0 0 1

R2 R1 → 1 0 4 14 200 0
0 1 5 13 200 0
2R2 R3 → 0 0 11 26 400 1

1 0 4 14 200 0
0 1 5 13 200 0
1
11 R3 → 0 0 1 2611
400
11 1
11

4R3 R1 → 1 0 0 11 11 11
50
600
4
5R3 R2 → 0 1 0 13
11
200
11 11 I
5
A1
0 0 1 26
11
400
11 11
1
50 600 4

10,000 7000
1
X A1B 11 13 200 5 705 1000
26 400 1 0 2000
Solution: $7000 in AAA-rated bonds, $1000 in A-rated bonds, $2000 in B-rated bonds

1 1 1
68. A 0.065 0.07 0.09
0 2 1

1 1 1 1 0 0
A I 0.065 0.07 0.09 0 1 0
0 2 1 0 0 1

1 1 1 1 0 0
200R2 → 13 14 18 0 200 0
0 2 1 0 0 1

1 1 1 1 0 0
13R1 R2 → 0 1 5 13 200 0
0 2 1 0 0 1
R2 R1 → 1 4 200

0 14 0
0 1 5 13 200 0
2R2 R3 → 0 0 11 26 400 1

1 0 4 14 200 0
0 1 5 13 200 0
1
11 R3 → 0 0 1 26
11
400
11
1
11

4R3 R1 → 1 0 0 50
11 600
11
4
11
5R3 R2 → 0 1 0 13
11
200
11
5
11 I A1
0 0 1 26
11
400
11
1
11
600 4 10,000

50 4000
1
X A1B 13 200 5 760 2000
11
26 400 1 0 4000
Solution: $4000 in AAA-rated bonds, $2000 in A-rated bonds, $4000 in B-rated bonds.
69. Use the inverse matrix A1 from Exercise 67.

50 600 4

12,000 9000
1
X A1B 11 13 200 5 835 1000
26 400 1 0 2000
Solution: $9000 in AAA-rated bonds, $1000 in A-rated bonds, $2000 in B-rated bonds
70. Use the inverse matrix A1 from Exercise 69.

600 4 500,000

50 200,000
1
X A1B 13 200 5 38,000 100,000
11
26 400 1 0 200,000
Solution: $200,000 in AAA-rated bonds, $100,000 in A-rated bonds, and $200,000 in B-rated bonds.
4

2 0 4 I1 5 4 24 2
1
71. (a) A 0 1 4 (b) I2 14 4 6 8 23 3
1 1 1 I3 1 2 2 0 5

2 0 4 1 0 0 Solution:
A I 0 1 4 0 1 0
I1 2 amperes, I2 3 amperes, I3 5 amperes
1 1 1 0 0 1

R1 1 1 1 0 0 1
0 1 4 0 1 0
R3 2 0 4 1 0 0

1 1 1 0 0 1
0 1 4 0 1 0
2R1 R3 → 0 2 6 1 0 2

R2 R1 → 1 0 5 0 1 1
0 1 4 0 1 0
2R2 R3 → 0 0 14 1 2 2

1 0 5 0 1 1
0 1 4 0 1 0
1
R
14 3 → 0 0 1 1
14
1
7 17

5R3 R1 → 1 0 0 5
14 27
2
7
4R3 R2 → 0 1 0 27
3
7
4
7 I A1
0 0 1 1
14
1
7 17
4

5 4
1
A1 14 4 6 8
1 2 2
4 3

I1 5 4 14
1
I2 14 4 6 8 28 8
I3 1 2 2 0 5
Solution: I1 3 amperes, I2 8 amperes, I3 5 amperes
x 7 9 11 27;
251
98 251
72. (a) n 3; 98 561.2
273
27 1
i
(b) 24
; 24
98
1
98
i1
251 1 5068
8 8
n
y 182.7 187.2 191.3 561.2; 251

24 561.2 8 5068

9
2.15
i
167.7
i1

n 98 561.2 18 5068
x
i1
i
2 49 81 121 251
b 167.7, a 2.15
n
x y 7182.7 9187.2 11191.3 5068

i1
i i
The least squares regression line is y 2.15t 167.7.
(c) For 2003, t 13; y 2.1513 167.7 195.65.
System:
3b 27a 561.2
27b 251a 5068 This projects about 196 million licensed drivers in 2003.
(e) 2.15t 167.7 208 (d) The projected value is very close to the actual value.
2.15t 40.3
t 18.7
Since t 18 represents 2008, the model projects that
the number of licensed drivers will reach 208 million
during 2008.
73. True. If B is the inverse of A, then AB I BA. 74. True. If A and B are both square matrices and AB In, it
can be shown that BA In .
b b
c ad bc
c c
a b 1 d 1 a b d
75. AA1
d a ad bc c d a
ad bc

1 0 1 0

ad bc 0 ad bc 0 1
b ad bc
c
1 d a b 1 0 1 0
A1A
ad bc c a d ad bc 0 ad bc 0 1

1 0
a11

a 0
76. (a) Given A 11 , A1 1 . (b) In general, the inverse of a matrix in the form of A is
0 a22
0 a22 1 0 0 ... 0
a11

1 0 0 1
0 a22 0 ... 0

a11 0 0 a11
1
Given A 0 a22 0 , A1 0 a22 0 . 1
0 0 a33 1 0 0 a33 . . . 0
0 0 a33 .. .. .. ..
. . . ... .
... 1
0 0 0 ann

77. x 7 ≥ 2
78. 2x 1 < 3 79. 3x2 315
x 7 ≤ 2 or x 7 ≥ 2 3 < 2x 1 < 3 ln 3x2 ln 315
x ≤ 9 or x ≥ 5 2 < 2x < 4 x
ln 3 ln 315
1 < x < 2 2
x
− 10 − 9 − 8 − 7 −6 − 5 − 4
2 ln 315
x x 10.472
−2 −1 0 1 2 3 4 ln 3
80. 2000ex5 400 81. log2 x 2 4.5 82. ln x lnx 1 0

1 log2 x 6.5 lnxx 1 0
ex5
5 x2 6.5
90.510 elnxx1 e0
1
ln ex5 ln xx 1 1
5
x2 x 1 0
x 1
ln
5 5 1 ± 1 41
x
2
1
x 5 ln 8.047 1 ± 5
5 x
2
Choose the positive value only:
1 5
x 1.618
2
83. Answers will vary.

Section 8.4 The Determinant of a Square Matrix 765
Section 8.4 The Determinant of a Square Matrix
■ You should be able to determine the determinant of a matrix of order 2 2 by using the difference of the products
of the diagonals.
■ You should be able to use expansion by cofactors to find the determinant of a matrix of order 3 3 or greater.
■ The determinant of a triangular matrix equals the product of the entries on the main diagonal.
Vocabulary Check
1. determinant 2. minor 3. cofactor 4. expanding by cofactors
1. 5 2. 8 3.

2
3
1
4
24 13 8 3 5
4.

3
5
1
2
32 51 11 5.

5
6
2
3
53 26 15 12 27
6.

2
4
2
3
23 42 14 7.

7
3
0
0
70 03 0
8.

4
0
3
0
40 03 0 9.

2
0
6
3
23 60 6
10.
2
6
3
9
29 63 0 11.
3
6
2
1
31 26 3 12 9
12.
4
2
7
5
45 27 34 13.

9
7
0
8
98 07 72 0 72
12 1
0 6
2 3 3 6 6 2
3
14. 02 36 18 15.
1 1 1 1 11
3 2 6
1
3
6

2 4 0.3 0.2 0.2
23 13 143 10
3 3
16. 9 17. 0.2 0.2 0.2 0.002
1 13
0.4 0.4 0.3

0.1
18. 0.3
0.5
0.2
0.2
0.4
0.3

0.2 0.022
0.4 0.9
19. 0.1
2.2
0.7
0.3
4.2
0
1.3 4.842
6.1
0.1
20. 7.5
0.3
0.1
6.2
0.6
4.3

0.7 11.217
1.2

1 4 2 2 3 1
21. 3 6 6 0 22. 0 5 2 20
2 1 4 0 0 2
2 3
3 4 11 0
23. 24.
5 2
(a) M11 5 (b) C11 M11 5 (a) M11 2 (b) C11 M11 2
M12 2 C12 M12 2 M12 3 C12 M12 3
M21 4 C21 M21 4 M21 0 C21 M21 0
M22 3 C22 M22 3 M22 11 C22 M22 11
6
2
3 1 5
25. 26.
4 7 2
(a) M11 4 (b) C11 M11 4 (a) M11 2 (b) C11 M11 2
M12 2 C12 M12 2 M12 7 C12 M12 7
M21 1 C21 M21 1 M21 5 C21 M21 5
M22 3 C22 M22 3 M22 6 C22 M22 6
1

4 0 2 1 0
27. 3 2 1 28. 3 2 5
1 1 1 4 6 4
(a) M11
2
1
1
1
2 1 3 (a) M11
2
6
5
4
8 30 38
M12
3
1
1
1
3 1 4 M12

3
4
5
4 12 20 8
M13
3
1
2
1
321 M13

3
4
2
6
18 8 26
M21
0
1 2
1
0 2 2 M21

1
6
0
4 4 0 4
M22
4
1
2
1
422 M22

1
4
0
4404
M23
4
1
0
1
4 0 4 M23

1
4
1
6
6 4 2
M31
0
2
2
1
0 4 4 M31

1
2
0
5 5 0 5
M32
4
3
2
1
4 6 10 M32

1
3
0
5505
M33
4
3 0
2
808 M33

1
3
1
2
2 3 5
(b) C11 1 2M

11 3 (b) C11 1 2M
11 38
C12 1 3M
12 4 C12 1 3M
12 8
C13 14M13 1 C13 14M13 26
C21 13M21 2 C21 13M21 4
C22 14M22 2 C22 14M22 4
C23 15M23 4 C23 15M23 2
C31 14M31 4 C31 14M31 5
C32 15M32 10 C32 15M32 5
C33 16M33 8 C33 16M33 5
2 2

3 8 9 4
29. 3 2 6 30. 7 6 0
1 3 6 6 7 6
(a) M11

2
3
6
6
12 18 30 (a) M11

6
7
0
6
36
M12

3
1
6
6
18 6 12 M12

7
6
0
6
42
M13

3
1
2
3
9 2 11 M13

7
6
6
7
85
M21

2
3
8
6
12 24 36 M21

9
7
4
6
82
M22

3
1
8
6
18 8 26 M22

2
6
4
6
12
M23

3
1
2
3
927 M23

2
6
9
7
68
M31

2
2
8
6
12 16 4 M31

9
6
4
0
24
M32

3
3
8
6
18 24 42 M32

2
7
4
0
28
M33

3
3
2
2
6 6 12 M33

2
7
9
6
51
(b) C11 12M11 30 (b) C11 12M11 36

C12 13M12 12 C12 13M12 42
C13 14M13 11 C13 14M13 85
C21 13M21 36 C21 13M21 82
C22 14M22 26 C22 14M22 12
C23 15M23 7 C23 15M23 68
C31 14M31 4 C31 14M31 24
C32 15M32 42 C32 15M32 28
C33 16M33 12 C33 16M33 51

3 2 1
5 6 4 6 4 5
31. (a) 4 5 6 3 2 323 28 22 75
3 1 2 1 2 3
3

2 1

3 2 1
4 6 3 1 3 1
(b) 4 5 6 2 5 3 28 55 322 75
2 1 2 1 4 6
2 3 1

3 4 2
4 2 3 2 3 4
32. (a) 6 3 1 6 3 1 618 316 5 151
7 8 4 8 4 7
4 7 8

3 4 2
6 3 3 4 3 4
(b) 6 3 1 2 8 254 5 833 151
4 7 4 7 6 3
4 7 8

5 0 3
0 3 5 3 5 0
33. (a) 0 12 4 0 12 4 018 1218 430 96
6 3 1 3 1 6

1 6 3

5 0 3
0 4 5 3 5 3
(b) 0 12 4 0 12 6 04 1218 620 96
1 3 1 3 0 4
1 6 3

10 5 5
5 5 10 5 10 5
34. (a) 30 0 10 0 10 050 1050 150 650
0 10 30 10 30 0
0 10 1

10 5 5
0 10 5 5 5 5
(b) 30 0 10 10 30 0 10100 3055 050 650
10 1 10 1 0 10
0 10 1

6 0 3 5
0 3 5 6 3 5 6 0 5 6 0 3
4 13 6 8
35. (a) 4 0 7 4 13 1 7 4 6 1 0 4 8 1 0 7
1 0 7 4
6 0 2 8 0 2 8 6 2 8 6 0
8 6 0 2

4282 13298 6174 8234 170

6 0 3 5
4 6 8 6 3 5 6 3 5 6 3 5
4 13 6 8
(b) 0 1 7 4 13 1 7 4 04 6 8 6 4 6 8
1 0 7 4
8 0 2 8 0 2 8 0 2 1 7 4
8 6 0 2
0 13298 0 6674 170

10 8 3 7
8 3 7 10 3 7 10 8 7 10 8 3
36. (a) 4 0 5 6
00 5 6 3 4 5 6 2 4 0 6 7 4 0 5
0 3 2 7
0 3 2 1 3 2 1 0 2 1 0 3
1 0 3 2
064 33 2112 7136 1167

10 8 3 7
0 5 6 8 3 7 8 3 7 8 3 7
(b) 4 0 5 6
10 3 2 7 43 2 7 00 5 6 1 0 5 6
0 3 2 7
0 3 2 0 3 2 0 3 2 3 2 7
1 0 3 2
1024 4245 064 1427 1167
37. Expand along Column 1.

2 1 0
2 1 1 0 1 0
4 2 1 2 4 4 20 41 41 0
2 1 2 1 2 1
4 2 1
38. Expand along Row 3.

2 2 3
2 3 2 3 2 2
1 1 0 0 1 4
1 0 1 0 1 1
0 1 4
03 13 40 3

6 3 7
3 7 6 7 6 3
0 0 0 0 0 0 0
6 3 4 3 4 6
4 6 3

1 2 5
40. Expand along Column 3. 4 133 9 (Upper triangular)

41. 0 3
0 0 3

1 1 2
3 1 1 1 1 1
3 1 0 2 0 3
2 0 2 0 3 1
2 0 3
22 02 32 2
42. Expand along Row 1. 43. Expand along Column 3.

1 0 0 1 4 2
1 0 4 0 4 1 3 2 1 4
4 1 0 1 0 0 3 2 0 2 3
1 5 5 5 5 1 1 4 3 2
5 1 5 1 4 3
15 020 01 5 214 310 58

2 1 3
1 3 2 3 2 1
1 4 4 1 0 2 116 05 29 2
4 4 1 4 1 4
1 0 2

2 4 6

45. 0 3 1 235 30 (Upper triangular) 46. Expand along Row 1.

0 0 5 3 0 0
11 0 7 0 7 11
7 11 0 3 0 0
2 2 1 2 1 2
1 2 2
322 014 03 66


2 6 6 2
2 7 6 2 6 2
2 7 3 6
61 5 1 31 5 1 620 316 168
1 5 0 1
3 7 7 3 7 7
3 7 0 7


3 6 5 4
6 5 4 3 6 4
2 0 6 0
2 1 2 2 61 1 2 263 63 108
1 1 2 2
3 1 1 0 3 1
0 3 1 1


5 3 0 6
6 4 12 3 0 6
4 6 4 12
52 3 4 42 3 4 50 40 0
0 2 3 4
1 2 2 1 2 2
0 1 2 2

1 4 3 2
5 6 2 1
0
0 0 0 0
3 2 1 5
51. Expand along Column 2, then along Column 4.

3 2 4 1 5
2 1 3 2
2 0 1 3 2 1 0 4
1 0 4 0
1 0 0 4 0 2 22 6 2 1 4103 412
6 2 1 0
6 0 2 1 0 3 5 1
3 5 1 0
3 0 5 1 0


5 2 0 0 2
1 4 3 2
0 1 4 3 2 2 6 3
0 2 6 3
0 0 2 6 3 5 513 4 1 520 100
0 3 4 1
0 0 3 4 1 0 0 2
0 0 0 2
0 0 0 0 2

3 8 7 5 8 0 7 0 14
53. 0 5 4 126 54. 9 7 4 223 55. 2 5 4 0
8 1 6 8 7 1 6 2 12

1 1 8 4 0 3 8 2
3 0 0
2 6 0 4 8 1 1 6
56. 2 5 0 105 57. 336 58. 7441
2 0 2 6 4 6 0 9
12 5 7
0 2 8 0 7 0 0 14

3 2 4 3 1 2 0 0 0 0
1 0 2 1 0 0 3 0 0 0
59. 5 1 0 3 2 410 60. 0 0 1 0 0 48
4 7 8 0 0 0 0 0 2 0
1 2 3 0 2 0 0 0 0 4
61. (a)
1
0
0
3
3 62. (a) A 2
4
1
2
0
(b)

2
0
0
1
2
(b) B
1
0
2
1
1
1 2 2 2 5
0 0
0 2 0 0 1 1 2
(c) (c) AB
0 3 1 0 3 4 2 1 4 10
(d)

2
0
0
36
(d) AB
2
4
5
10
0

63. (a)
4
3
0
2
8 64. (a) A
5
3
4
1
17
(b)
1
2
1
2
0 (b) B
0
1
6
2
6
(c) 43 0
2 1
2
1
2

4

1
4
1 (c) AB 3
5 4
1 1
0 6
2

4
1
22
20
(d)
4
1
4
1
0
(d) AB 4
1
22
20
102
0
65. (a) 3
1
2
2
1 21
3
66. (a) A 1
2

2
3
0

4 23

0 4 1 0 1

3 2 0 3 0 1
(b) 1
3
1
1
2 19
1
(b) B 0 2 1 1
2 1 1

0 1 2 3 2 0 7 1 4 0 3

3 2 0 1
(c) 3 2 1 1 1 2 8 9 3 (c) AB 1 3 4 0 2 1
3

0 4 1 3 1 1 7 9
2 0 1 2 1 1
7 1 4
9

4 1
(d) 8 9 3 399
5 10 6
7 3 9
4 1 1

9 4 1

(d) AB 5 10 6 23
4 1 1

1 2 1 2 0 1
67. (a) 1 0 1 2 68. (a) A 1 1 2 0
0 1 0 3 1 0

1 0 0 2 1 4
(b) 0 2 0 6
(b) B 0 1 3 7
0 0 3 3 2 1
1 1 1 2 1 7 4

2 1 0 0 1 4 3 2 0 4 9
(c) 1 0 1 0 2 0 1 0 3 (c) AB 1 1 2 0 1 3 8 6 3
0 1 0 0 0 3 0 2 0 3 1 0 3 2 1 6 2 15

4
1 4 3 7 9
(d) 1 0 3 12
(d) AB 8 6 3 0
0 2 0 6 2 15
69.

w
y
x
z
wz xy 70.
w
y
cx
cz
cwz cxy cwz xy

y
w
z
x
xy wz wz xy c
w
y
x
z
cwz xy
Thus,
w
y
x
z

y
w
z
x
.

So,
w
y
cx
cz
c
w
y
x
z
.
71.
w
y
x
z
wz xy 72.
w
cw
x
cx
cxw cxw 0

w
y
x cw
z cy
wz cy yx cw wz xy So,
w
cw
x
cx
0.

Thus,
w
y
x
z

w
y
x cw
z cy
.

1 x x2
y y2 x x2 x x2
73. 1 y y2
z z2 z z2 y y2
1 z z2
yz2 y2z xz2 x2z xy2 x2y
yz2 xz2 y2z x2z xy y x
z2 y x z y2 x2 xy y x
z2 y x z y x y x xy y x
y xz2 z y x xy
y xz2 zy zx xy
y xz2 zx zy xy
y xzz x yz x
y xz xz y

ab a a
ab a a a a a
74. a ab a a b a a
a ab a ab ab a
a a ab
a ba b2 a2 aaa b a2 aa2 aa b
a b3 a2a b a2a b a3 a3 a2a b
a b3 3a2a b 2a3
a3 3a2b 3ab2 b3 3a3 3a2b 2a3
3ab2 b3 b23a b
75.
x1
3
2
x2
0
76.
x2
3
xx 2 31 0

1
x
0
x 1x 2 6 0
x2 3x 4 0 x2 2x 3 0
x 1x 4 0 x 1x 3 0
x 1 or x 4 x 1 or x 3
77.
x3
1
2
x2
0
78.

x4
7
2
x5
0
x 3x 2 2 0 x 4x 5 72 0

x2 5x 4 0 x2 x 6 0
x 1x 4 0 x 2x 3 0
x 1 or x 4 x 2 or x 3
79.

4u
1
1
2v
8uv 1 80.
3x2 3y2
1 1
3x2 3y2 3x2 3y2
81.
e2x
2e2x
e3x
3e3x
3e5x 2e5x e5x
82.

ex
ex
xex
1 xex
1 xe2x xe2x e2x xe2x xe2x e2x

x ln x
x x ln x
83. 1 1 1 ln x 84. x1 ln x x ln x
x 1 1 ln x
x x ln x x ln x x
85. True. If an entire row is zero, then each cofactor 86. True. If a square matrix has two columns that are equal,
in the expansion is multiplied by zero. then elementary column operations can be used to create a
column with all zeros.
4
2
1 3 0
87. Let A and B .
4 3 5
A 1
2
3
4
10, B
4

3 0
5
20, A B 10
AB
3
1
3
9
, AB
3
1 3
9 30

Thus, A B A B . Your answer may differ, depending on how you choose A and B.

4 5 6
88. (a) 7 8 9 0
10 11 12

33 34 35 5 4 3
36 37 38 0 2 1 0 0

39 40 41 1 2 3
19 20 21 22 57 58 59 60
23 24 25 26 61 62 63 64
0 0
27 28 29 30 65 66 67 68
31 32 33 34 69 70 71 72
For an n n matrix n > 2 with consecutive integer entries, the determinant appears to be 0.

x x1 x2
x4 x5 x3 x5 x3 x4
(b) x 3 x4 x5 x x 1 x 2
x7 x8 x6 x8 x6 x7
x6 x7 x8
xx 4x 8 x 7 x 5 x 1x 3x 8
x 6x 5 x 2x 3x 7 x 6x 4
xx 12x 32 x2 12x 35 x 1x2 11x 24
2
x2 11x 30 x 2x2 10x 21 x2 10x 24

3x x 16 x 23
3x 6x 6 3x 6 0
89. A square matrix is a square array of numbers. The determinant of a square matrix is a real number.

x11 x12 x13
90. Let A x21 x22 x23 and A 5.
x31 x32 x33

2x11 2x12 2x13
2A 2x21 2x22 2x23
2x31 2x32 2x33
2A 2x11 2x2232

2x 2x23
2x33 2x
2x12 21
2x31
2x23
2x33 2x
2x13 21
2x31
2x22
2x32
2x114x22 x33 4x32 x23 x124x21 x33 4x31 x23 x134x21 x32 4x31 x22
8x11x22 x33 x32 x23 x12x21 x33 x31 x23 x13x21 x32 x31 x22
8A
So, 2A 8A 85 40.

1
91. (a) 7
3
2
4

5 115

1
(b) 2
3
2

4
0 40

6 1 2 1 6 2
1 4 3 1 6 2
7 5 2 115 2 2 0 40
6 2 1 1 3 4
Column 2 and Column 3 were interchanged. Row 1 and Row 3 were interchanged.
3 3
92. (a) Multiplying Row 1 of the matrix 15 2
by 5 and adding it to Row 2 gives the matrix
1
0 17
.
1
5
3
2
17
1
0 3
17

5 4 2 1 10 6
(b) Multiplying Row 2 of the matrix 2 3 4 by 2 and adding it to Row 1 gives the matrix 2 3 4 .

7 6 3 7 6 3
5 4 2 1 10 6
2 3 4 11 2 3 4
7 6 3 7 6 3

1 2 1 1 8 3
93. (a) A 12 2
3
,B
5
2 10
3 (b) A 3 3 2 , B 3 12 6
7 1 3 7 4 9
B 5
2
10
3
35
B
1 8
3 12
3

6 300
1 2

7 4 9
5A 5 35
2 3
1 2 1
Row 1 was multiplied by 5.
12 A 12 3 3 2 300
B 5A 7 1 3
Column 2 was multiplied by 4 and Column 3 was
multiplied by 3.
B 43A 12A

94. (a) A

7 0
, A 74 0 28

0 4
1 0 0
(b) A 0 5
0 , A 152 10

0 0 2
2 0 0 0
0 2 0 0
(c) A
0 0 1 0
0 0 0 3

Using cofactors and a11, A 2 C11 0 C12 0 C13 0 C14.
C11
2
0
0
0
1
0
0
0
3
A 2C11 22 1 3 2 6 12
In each case, the determinant of the matrix is the product of the diagonal entries. From this, one would
conjecture that the determinant of a diagonal matrix is the product of the diagonal entries.
95. f x x3 2x 96. gx

3 x
Since f is a polynomial, the domain is all real numbers x. An odd root of a number is defined for all real numbers.
Domain: all real numbers x
3
97. hx 16 x2 98. Ax
36 x2
16 x2 ≥ 0
36 x2 0 ⇒ x2 36 ⇒ x ± 6
4 x4 x ≥ 0
Domain: all real numbers x ± 6
Critical numbers: x ± 4
Test intervals: , 4, 4, 4, 4,
Test: Is 16 x2 ≥ 0?
Solution: 4, 4
Domain of h: 4 ≤ x ≤ 4
99. gt lnt 1 100. f s 625e0.5S

t1 > 0 The exponential function y Aex is defined for all
real numbers.
t > 1
Domain: all real numbers
Domain: all real numbers t > 1

101. xy ≤ 8 y 102. y
x ≥ 3 12
2
2x y < 5 x
−4 −2 2
4
x
−8 −4 4 8 12
−4
−6
4 5 8
I 8 I
1 1 0 1 0
103. A 104. A
1 0 1 3 6 0 1

40
R2 3 6 0 1
2R1 R2 →
1
1
1
2
0
1 R1 5 8 1 0

1 1
R2 R1 → 4 1 1 →
3 R1
0 1 2 0 3
0 1 2 1 5 8 1 0

1 1 1 1
4R1 → 1 0 1 2 0

4 4 3
I A1
0 1 2 1 5R1 R2 → 0 2 1 5
3

1 1

1
4 4 1 2 0 3
A1
2 1 1
2 R2 → 0 1 1
2
5
6

2R2 R1 → 1 0 1 43
I A1
0 1 1
2
5
6

1 43
A1 1 5
2 6

7 2 9 1 0 0
105. A I 2 4 6 0 1 0
3 5 2 0 0 1

4R2 R1 → 1 14 15 1 4 0
2 4 6 0 1 0
3 5 2 0 0 1

1 14 15 1 4 0
2R1 R2 → 0 24 24 2 7 0
3R1 R3 → 0 47 47 3 12 1

1 14 15 1 4 0
0 24 24 2 7 0
47
24R2 R3 → 0 0 0 11
12
41
24 1
The zeros in Row 3 imply that the inverse does not exist.
6

2 0 1 0 0
106. A I 1 3 2 0 1 0
2 0 1 0 0 1
2

R2 1 3 0 1 0
R1 6 2 0 1 0 0
2 0 1 0 0 1

1 3 2 0 1 0
R3 2 0 1 0 0 1
R2 6 2 0 1 0 0
2

1 3 0 1 0
2R1 R2 → 0 6 3 0 2 1
6R1 R3 → 0 20 12 1 6 0

1 3 2 0 1 0
1
6 R2 → 0 1 12 0 1
3
1
6
0 20 12 1 6 0
—CONTINUED—
Section 8.5 Applications of Matrices and Determinants 777
106. —CONTINUED—

1 3 2 0 1 0
0 1
1
2 0
1
3
1
6
20R2 R3 → 0 0 2 1 23 10
3

1 3 2 0 1 0
0 1 12 0 1
3
1
6
12 R3 → 0 0 1 12 1
3
5
3

3R2 R1 → 1 0 12 0 0 12
0 1 12 0
1
3
1
6
0 0 1 12 1
3
5
3

1
14
1 1
2 R3 R1 → 1 0 0 6 3
1
2 R3 R2 → 0 1 0 14 1
2 1 I A1
0 0 1 12 1
3
5
3

1 1 1
4 6 3
1 1
A1 4 2 1
12
1 5
3 3
Section 8.5 Applications of Matrices and Determinants
■ You should be able to use Cramer’s Rule to solve a system of linear equations.
■ Now you should be able to solve a system of linear equations by graphing, substitution, elimination, elementary row
operations on an augmented matrix, using the inverse matrix, or Cramer’s Rule.
■ You should be able to find the area of a triangle with vertices x1, y1, x2, y2, and x3, y3.

x1 y1 1
Area ± 12 x2 y2 1
x3 y3 1
The ± symbol indicates that the appropriate sign should be chosen so that the area is positive.
■ You should be able to test to see if three points, x1, y1, x2, y2, and x3, y3, are collinear.

x1 y1 1
x2 y2 1 0, if and only if they are collinear.
x3 y3 1
■ You should be able to find the equation of the line through x1, y1 and x2, y2 by evaluating.

x y 1
x1 y1 1 0
x2 y2 1
■ You should be able to encode and decode messages by using an invertible n n matrix.
Vocabulary Check
1. Cramer’s Rule 2. colinear

x1
3. A ± 12 x2
x3 y1
y2
y3
1
1
1
4. cryptogram 5. uncoded; coded

1. 3x 4y 2
5x 3y 4
2. 4x 7y 47
x 6y 27
2
4
22
47 7
27 6 93

4 3
x 3

x 2 4 7 31
3 4 11
5 3 1 6
3
2

4 47
1 27 155

5 4 22 y 5

y 2 4 7 31
3 4 11
1 6
5 3
Solution: 3, 5
Solution: 2, 2

3. 3x 2y 2
13x6x 5y3y 7617
4.
6x 4y 4
Since
3
6
2
4
0, Cramer’s Rule does not apply.

17
76
5
3 329

x 7
6 5 47
The system is inconsistent in this case and has no solution.
13 3

6 17
13 76 235

y 5
6 5 47
13 3
Solution: 7, 5
0.4x 0.8y 1.6

4.6x
2.4x 1.3y 14.63
5. 6.
0.2x 0.3y 2.2 0.5y 11.51
1.6 0.8
2.2 0.3 1.28 32
14.63 1.3
11.51 0.5 7.648 8

x x
0.4 0.8 0.28 7 2.4 1.3 4.78 5
0.2 0.3 4.6 0.5

0.4 1.6

1.20 30
2.4 14.63
4.6 11.51 39.674 83

0.2 2.2 y

y 2.4 1.3 4.78 10
0.4 0.8 0.28 7
4.6 0.5
0.2 0.3
Solution: 32 30
,
7 7
Solution: 85, 10
83

7. 4x y z 5 4 1 1
2x 2y 3z 10, D 2 2 3 55
5x 2y 6z 1 5 2 6

5 1 1 4 5 1 4 1 5
10 2 3 2 10 3 2 2 10
1 2 6 55 5 1 6 165 5 2 1 110
x 1, y 3, z 2
55 55 55 55 55 55
Solution: 1, 3, 2

4x 2y 3z 2

8. 9. x 2y 3z 3 1 2 3
2x 2y 5z 16 2x y z 6, D 2 1 1 10
8x 5y 2z 4 3x 3y 2z 11 3 3 2
4
D 2

2
2
5
3
5 82
2 3
6
11 3
2
1
3
1
2 20

8 x 2

10 10
2 2 3
16 2 5 1 3 3
4 5 2 401 2 6 1
x 5 3 11 2 10
82 82 y 1

10 10
4 2 3
1 2 3
2 16 5
2 1 6
8 4 2 656
y 8 3 3 11 10
82 82 z 1

10 10
4 2 2
Solution: 2, 1, 1
2 2 16
8 5 4 164
z 2
82 82
Solution: 5, 8, 2

3x 3y 5z 1

10. 5x 4y z 14 11. 3 3 5
x 2y 2z 10 3x 5y 9z 2, D 3 5 9 4
3x y z 1 5x 9y 17z 4 5 9 17

4

5 1 1 3 5
D 1 2 2 33 2 5 9
3 1 1 4 9 17

x 0
4

14 4 1
10 2 2 3 1 5
1 1 1 0 3 2 9
x 0
33 33 5 4 17 1

y
4 2

5 14 1
1 10 2 3 3 1
3 1 1 99 3 5 2
y 3
33 33 5 9 4 1

z
4 2
5 4 14
1
0, 2, 2
2 10 1 1
Solution:
3 1 1 66
z 2
33 33
Solution: 0, 3, 2

12. x 2y z 7 1 2 1
2x 2y 2z 8, D 2 2 2 18
x 3y 4z 8 1

3 4
7 2 1 1 7 1 1 2 7
8 2 2 2 8 2 2 2 8
8 3 4 1 8 4 1 3 8
x 3, y 1, z 2
18 18 18
Solution: 3, 1, 2

13. 2x y 2z 6 2 1 2
x 2y 3z 0 D 1 2 3 18
3x 2y z 6 3 2 1
x
6
0
6
1 2
2 3
2 1
18
1, y
2
1
3
6 2
0 3
6 1
18
2, z
2
1
3
1
2
2
18
6
0
6 1
Solution: 1, 2, 1

14. 2x 3y 5z 4 15. Vertices: 0, 0, 3, 1, 1, 5

3x 5y 9z 7

0 0 1
5x 9y 17z 13 1 13 1

Area 3 1 1 7 square units
2 21 5
2 3 5 1 5 1
D 3 5 9 0
5 9 17
Cramer’s Rule does not apply.
16. Vertices: 0, 0, 4, 5, 5, 2

0 0 1
1 14 5 33
Area 4 5 1 square units
2 25 2 2
5 2 1
17. Vertices: 2, 3, 2, 3, 0, 4

2 3 1
3 3

1 1 1 1 1
Area 2 3 1 2 2 14 14 14 square units
2 2 4 1 4 1 2
0 4 1
18. Vertices: 2, 1, 1, 6, 3, 1

2 1 1

1 1 6 1 1 1 1 6 1 31
Area 1 6 1 2 14 2 19 square units
2 2 1 1 3 1 3 1 2 2
3 1 1
0, 2
, 2, 0
, 4, 3
1 5
19. Vertices:

1
0 1
1 5 5
1 2 1 1 0 1 3 15 33
5
Area 2 0 1 2 1 2 square units
2 2 24 1 4 3 2 4 2 8
4 3 1
20. Vertices: 4, 5, 6, 10, 6, 1

4 5 1
1 5 4 4 5

1 1 1
Area 6 10 1 6 1 55 square units
2 2 10 1 6 1 6 10
6 1 1
21. Vertices: 2, 4, 2, 3, 1, 5

2 4 1
2 2
1 213 6 14 2 square units
1 1 2 3 4 4 1 5
Area 2 3 1
2 2 5 1 5 2 3
1 5 1
22. Vertices: 0, 2, 1, 4, 3, 5

0 2 1
1 1 1

2 8 17 2 square units
1 1 4 1 25
Area 1 4 1 2
2 2 3 1 3 5
3 5 1
23. Vertices: 3, 5, 2, 6, 3, 5

3 5 1
3 3
228 0 28 28 square units
1 1 2 6 5 5 1
Area 2 6 1
2 2 3 5 3 5 2 6
3 5 1
24. Vertices: 2, 4, 1, 5, 3, 2

2 4 1

1 1 5 1 4 1 4 1 1 23
Area 1 5 1 2 3 14 6 3 square units
2 2 2 1 2 1 5 1 2 2
3 2 1

5 1 1 4 2 1
1 1
25. 4± 0 2 1 26. 4 ± 3 5 1
2 2
2 y 1 1 y 1
± 8 5
2
y 1
1
2
1
2
1
1
±8

3
1
5
y

4
1
2
y

4
3
2
5
± 8 52 y 21 ± 8 3y 5 4y 2 20 6
± 8 5y 8 ± 8 3y 5 4y 2 20 6
8±8 ± 8 y 11
y
5
y 11 ± 8
16
y or y 0 y 19 or y 3
5
27. 6±
1
2

2
1
8
3
1
y
1
1
1 28. 6±
1
2

1
5
3
0
3
y
1
1
1
± 12
1
8
1
y

2
8
± 12 y 8 2y 24 5
3
y

2
1
3
1 ± 12

3
y
1
1

5
3
3
y
± 12 3 y 5y 9
± 12 3y 21 ± 12 4y 12
21 ± 12 12 ± 12
y 7 ± 4 y 3 ± 3
3 4
y 3 or y 11 y 6 or y 0
29. Vertices: 0, 25, 10, 0, 28, 5 30. Vertices: 0, 30, 85, 0, 20, 50

0 25 1 0 30 1
1 1
Area 10 0 1 250 square miles Area 85 0 1 3100 square feet
2 2
28 5 1 20 50 1
31. Points: 3, 1, 0, 3, 12, 5

3 1 1
3 1 1 1
0 3 1 3 12 38 122 0
5 1 3 1
12 5 1
The points are collinear.
32. Points: 3, 5, 6, 1, 10, 2

3 5 1
6 1 3 5 3 5
6 1 1 2 44 27 15 0
10 2 10 2 6 1
10 2 1
The points are not collinear.
33. Points: 2, 12 , 4, 4, 6, 3

2 12 1
4 4 2 12 2 12
4 4 1 12 3 6 3 0
6 3 6 3 4 4
6 3 1
34. Points: 0, 1, 4, 2, 2, 2

5

0 1 1
4 1 4 2
4 2 1 5 6 6 0
5 2 1 2
2 2 1 2
35. Points: 0, 2, 1, 2.4, 1, 1.6

0 2 1
1 1 1 2.4
1 2.4 1 2 22 4 0
1 1 1 1.6
1 1.6 1
36. Points: 2, 3, 3, 3.5, 1, 2

2 3 1
3 3.5 2 3 2 3 1
3 3.5 1 9.5 7 2 0
1 2 1 2 3 3.5 2
1 2 1

2 5 1 6 2 1
37. 4 y 1 0 38. 5 y 1 0
5 2 1 3 5 1
2
y
2
1
1
5
4
5
1
1

4
5
y
2
0

5
3
y
5

6
3
2
5

6
5
2
y0
2 y 2 51 8 5y 0 25 3y 24 6y 10 0

3y 9 0 3y 9
y 3 y3
39. Points: 0, 0, 5, 3

x y 1
x y
Equation: 0 0 1 5y 3x 0 ⇒ 3x 5y 0
5 3
5 3 1
40. Points: 0, 0, 2, 2

x y 1
x y
Equation: 0 0 1 2x 2y 0 or x y 0
2 2
2 2 1
41. Points: 4, 3, 2, 1

x y 1
3 1 4 1 4 3
Equation: 4 3 1 x y 2x 6y 10 0 ⇒ x 3y 5 0
1 1 2 1 2 1
2 1 1
42. Points: 10, 7, 2, 7

Equation:

x y 1
10 7 x y x y
10 7 1 70 14 7x 2y 7x 10y 0 or 7x 6y 28 0
2 7 2 7 10 7
2 7 1
43. Points: 2, 3, 2, 1

1 5

x y 1 1 1
1 3 1 2 1 2 3
Equation: 2 3 1 x y 5 5 2x 3y 8 0
5 1 1 2 1 2 1
2 1 1
44. Points: 23, 4, 6, 12

x y 1 2
4 x y x y
16 12x 6y 4x 23 y 0 or 3x 2y 6 0
2
Equation: 3 4 1 3 2
6 12 6 12 3 4
6 12 1
45. The uncoded row matrices are the rows of the 7 3 matrix on the left.

T R O 20 18 15 52 10 27
U B L 21 2 12 49 3 34

E I 5 0 9 1 1 0 49 13 27
N R 14 0 18 1 0 1 94 22 54
I V E 9 22 5 6 2 3 1 1 7
R C 18 0 3 0 12 9
I T Y 9 20 25 121 41 55
Solution: 52 10 27 49 3 34 49 13 27 94 22 54 1 1 7 0 12 9 121 41 55

4 2 1
46. 16 12 5 3 3 1 43 6 9
3 2 1

4 2 1
1 19 5 3 3 1 38 45 13
3 2 1

4 2 1
0 19 5 3 3 1 42 47 14
3 3 1

4 2 1
14 4 0 3 3 1 44 16 10
3 1 1

4 2 1
13 15 14 3 3 1 49 9 12
3 2 1

4 2 1
5 25 0 3 3 1 55 65 20
3 2 1
Solution: Uncoded 1 3 matrices: 16 12 5, 1 19 5, 0 19 5, 14 4 0, 13 15 14, 5 25 0
Encoded 1 3 matrices: 43 6 9, 38 45 13, 42 47 14,
44 16 10, 49 9 12, 55 65 20
Encoded message: 43 6 9 38 45 13 42 47 14
44 16 10 49 9 12 55 65 20
1 2 2
In Exercises 47–50, use the matrix A
[ 3
1
7
4
9 .
7
]
47. C A L L __ A T __ N O O N
[3 1 12] [12 0 1] [20 0 14] [15 15 14]
3 1 12 A 6 35 69
12 0 1 A 11 20 17
20 0 14 A 6 16 58
15 15 14 A 46 79 67
Cryptogram: 6 35 69 11 20 17 6 16 58 46 79 67
48. I C E B E R G __ D E A D __ A H E A D
9 3 5 2 5 18 7 0 4 5 1 4 0 1 8 5 1 4

1 2 2
9 3 5 3 7 9 13 19 10
1 4 7

1 2 2
2 5 18 3 7 9 1 33 77
1 4 7

1 2 2
7 0 4 3 7 9 3 2 14
1 4 7
—CONTINUED—
48. —CONTINUED—

1 2 2
5 1 4 3 7 9 4 1 9
1 4 7

1 2 2
0 1 8 3 7 9 5 25 47
1 4 7

1 2 2
5 1 4 3 7 9 4 1 9
1 4 7
Cryptogram: 13 19 10 1 33 77 3 2 14
4 1 9 5 25 47 4 1 9
49. H A P P Y __ B I R T H DA Y __
[8 1 16] [16 25 0] [2 9 18] [20 8 4] [1 25 0]
18 21 16 A 5 41 87
16 25 10 A 91 207 257
12 29 18 A 11 5 241
20 28 14 A 40 80 84
11 25 10 A 76 177 227
Cryptogram: 5 41 87 91 207 257 11 5 41 40 80 84 76 177 227
50. O P E R A T I O N _ O V E R L O A D
15 16 5 18 1 20 9 15 14 0 15 22 5 18 12 15 1 4

1 2 2
15 16 5 3 7 9 58 122 139
1 4 7

1 2 2
18 1 20 3 7 9 1 37 95
1 4 7

1 2 2
9 15 14 3 7 9 40 67 55
1 4 7

1 2 2
0 15 22 3 7 9 23 17 19
1 4 7

1 2 2
5 18 12 3 7 9 47 88 88
1 4 7

1 2 2
15 1 4 3 7 9 14 21 11
1 4 7
Cryptogram: 58 122 139 1 37 95 40 67 55 23 17 19 47 88 88 14 21 11
1
5
3
1 2 2
51. A1
5 3 1

11 21 8 1 H A
64 112 16 16 P P
25 50 25 0 Y __
53
2
29 53 14 5 N E Message: HAPPY NEW YEAR
1
23 46 23 0 W __
40 75 25 5 Y E
55 92 1 18 A R
3
7 5
2
52. A1
3
7 5 2
2
136 58 18 B R
3
7 5 15
2
173 72 14 O N
120 3
51
7 5
2
3 15 C O
95 38 3

7 5
2
19 0 S __
3
7 5 23
2
178 73 9 W I Message: BRONCOS WIN SUPER BOWL
3
7 5 14
2
70 28 0 N __
3
7 5
2
242 101 19 21 S U
3
7 5
2
115 47 16 5 P E
3
7 5 18
2
90 36 0 R __
3
7 5 2
2
115 49 15 B O
3
7 5 23
2
199 82 12 W L

1 1 0 1 2 3 1
53. A1 1 0 1 3 3 1
6 2 3 2 4 1

9 1 9 3 12 1 C L A
38 19 19 19 19 0 S S __

2 3 1
28 9 19 9 19 0 I S __ Message: CLASS IS CANCELED
3 3 1
80 25 41 3 1 14 C A N
2 4 1
64 21 31 3 5 12 C E L
9 5 4 5 4 0 E D __
8

11 2
54. A1 4 1 3
8 1 6
8

11 2
112 140 83 4 1 3 8 1 22 H A V
8 1 6
8

11 2
19 25 13 4 1 3 5 0 1 E __ A
8 1 6
8

11 2
72 76 61 4 1 3 0 7 18 __ G R Message: HAVE A GREAT WEEKEND
8 1 6
8

11 2
95 118 71 4 1 3 5 1 20 E A T
8 1 6
8

11 2
20 21 38 4 1 3 0 23 5 __ W E
8 1 6
8

11 2
35 23 36 4 1 3 5 11 5 E K E
8 1 6
8

11 2
42 48 32 4 1 3 14 4 0 N D __
8 1 6
1 13

1 2 2 6 4
55. A1 3 7 9 12 5 3
1 4 7 5 2 1
17 15

20 19 5 14 S E N
13

6 4
12 56 104 4 0 16 D __ P
12 5 3
1 25 65 12 1 14 L A N Message: SEND PLANES
5 2 1
62 143 181 5 19 0 E S __
13

6 4
56. 13 9 59 12 5 3 18 5 20 R E T
5 2 1
13

6 4
61 112 106 12 5 3 21 18 14 U R N
5 2 1
13

6 4
17 73 131 12 5 3 0 1 20 __ A T Message: RETURN AT DAWN
5 2 1
13

6 4
11 24 29 12 5 3 0 4 1 __ D A
5 2 1
13

6 4
65 144 172 12 5 3 23 14 0 W N __
5 2 1
57. Let A be the 2 2 matrix needed to decode the message.

18 18

0 18 R
A
1 16 15 14 O N

18 18 1 135
8
15
1
1 2
15
0 18 0 18
A 1 1
1 16 14 270 15
15 14 1 1
8 21 13 5 M E
15 10 5 20 E T
13 13 0 13 __ M

5 10 5 0 E __
1 2

5 25 20 15 T O
Message: MEET ME TONIGHT RON
5 19 1 1 14 9 N I
1 6 7 8 G H
20 40 20 0 T __
18 18 0 18 __ R
1 16 15 14 O N
n n n
58. (a) n 3;
i1
xi 0 1 2 3;
i1
xi2 02 12 22 5; x
i1
i
3 03 13 23 9;
n n
x
i1
i
4 04 14 24 17; y 8965 9176 9406 27,547
i1
i
x y 08965 19176 29406 27,988

i1
i i
x
i1
2
i yi 028965 129176 229406 46,800

3c 3b 5a 27,547
System: 3c 5b 9a 27,988
5c 9b 17a 46,800
3
(b) D 3
3
5
5
9 4

5 9 17
27,547 3 5
27,988 5 9
46,800 9 17 35,860
c 8965

4 4
3 27,547 5
3 27,988 9
5 46,800 17 806
b 201.5

4 4
3 3 27,547
3 5 27,988
5 9 46,800 38
a 9.5
4 4
The least squares regression parabola is y 9.5t2 201.5t 8965.
(c) 12,000
0 8
8,000
(d) The intersection of the regression parabola and the line y 10,000 is about t 4.3, so the number of
cases waiting to be tried will reach 10,000 in about 2004.
59. False. In Cramer’s Rule, the denominator is the 60. True. If the determinant of the coefficient matrix is zero,
determinant of the coefficient matrix. the solution of the system would result in division by zero
which is undefined.
61. False. If the determinant of the coefficient matrix 62. Answers will vary. To solve a system of linear equations
is zero, the system has either no solution or infinitely you can use graphing, substitution, elimination, elementary
many solutions. row operations on an augmented matrix (Gaussian
elimination with back–substitution or Gauss-Jordan
elimination), the inverse of a matrix, or Cramer’s Rule.

63. x 7y 22
5x y 26
Equation 1
Equation 2
64.
2x3x 12y8y 1611 Equation 1
Equation 2
5x 35y 110 5Eq.1
4x 24y 32
9x 24y 33 3Eq.1
5x y 26 2Eq.2
34y 136 Add equations. 13x 65 Add equations.
y 4 x 65
13 5
x 74 22
x 6 35 8y 11 ⇒ 8y 4 ⇒ y 21

65. x 3y 5z 14 66. 5x y z 7
4x 2y z 1 2x 3y z 5
5x 3y 2z 11 4x 10y 5z 37

25 5 2
1 3 87

5 1
1 1

5 1 87 29
A1 4 2 1 A1 2 3 1
2 7 1
29 29 29
5 3 2 4 10 5 32 18
87 29 13
87
1

9 7

1 x 7 2
13 27 19 y A1 5 2
72
22 18 10 z 37 5

x 14 1 Solution: 2, 2, 5
y A1 1 0
z 11 3
Solution: 1, 0, 3
67. Objective function: z 6x 4y 68. Objective function: z 6x 7y

Constraints: x ≥ 0 y Constraints: x ≥ 0 y
16
y ≥ 0 y ≥ 0
6
(0, 5) 12
x 6y ≤ 30 (6, 4) 4x 3y ≥ 24
4 (0, 8)
8
6x y ≤ 40 x 3y ≥ 15
2 (3, 4)
4
(203 , 0( Since the region is unbounded,
(0, 0) (15, 0)
x there is no maximum value of x
2 4 6 4 8 12
the objective function. To find
the minimum value, check the
At 0, 0: z 60 40 0 vertices.
At 0, 5: z 60 45 20 At 0, 8 : z 60 78 56
At 6, 4: z 66 44 52 At 3, 4 : z 63 74 46
At 20
3, 0: z 6 20
3 40 40 At 15, 0 : z 6(15 70 90
The minimum value of 0 occurs at 0, 0. The minimum value of 46 occurs at 3, 4.
The maximum value of 52 occurs at 6, 4.
Review Exercises for Chapter 8

4
1
2
3 0 6
1. 0 2. 3. 3
7 1 4
5
Order: 1 1
Since the matrix has two rows and
Order: 3 1
four columns, its order is 2 4.
4. 6 5 0

2 8 5. 3x 10y 15 6. 8x 7y 4z 12
Since the matrix has one row and 5x 4y 22 3x 5y 2z 20
five columns, its order is 1 5. . 5x 3y 3z 26
3 10 .. 15
.
4 .. 22 7

5 8 4 12
3 5 2 20
5 3 3 26
9

5 1 7 13 16 7 3 2
7. 4 2 0 10 8. 1 21 8 5 12
9 4 2 3 4 10 4 3 1

5x y 7z 9

13x 16y 7z 3w 2
4x 2y 10 x 21y 8z 5w 12
9x 4y 2z 3 4x 10y 4z 3w 1

0 1 1 4 8 16
9. 1 2 3 10. 3 1 2
2 2 2 2 10 12
1

4 R1 →

R1 1 2 3 1 2 4
R2 0 1 1 3 1 2
2 2 2 12R3 → 1 5 6

1 2 3 1 2 4
0 1 1 3R1 R2→ 0 7 10
2R1 R3 → 0 2 4 R1 R3→ 0 7 10

1 2 3 1 2 4
0 1 1 0 7 10
2R2 R3 → 0 0 2 R2 R3→ 0 0 0

1 2 3 1 2 4
0 1 1 17R2 → 0 1 10
7
12R3 → 0 0 1 0 0 0

1 2 3 9 ⇒ x 2y 3z 9

11. 0 1 2 2 ⇒ y 2z 2 12. x 3y 9z 4
0 0 1 0 ⇒ z0 y z 10
z 2
y 20 2 ⇒ y 2
y 2 10
x 22 30 9 ⇒ x 5
y8
Solution: 5, 2, 0
x 38 92 4
x 38
Solution: 38, 8, 2
Review Exercises for Chapter 8 791

1 5 4 1 ⇒ x 5y 4z 1

13. 0 1 2 3 ⇒ y 2z 3 14. x 8y 2
0 0 1 4 ⇒ z4 y z 7
z 1
y 24 3 ⇒ y 5
y 1 7
x 55 44 1 ⇒ x 40
y 6
Solution: 40, 5, 4
x 86 2
x 50
Solution: 50, 6, 1
5
15. 15 4
1
2
22 16. 3
2
7
2
1
4R2 R1 → 86
11
1
8 2 R1 → 1 52 1
1 22
3 7 1
86

1 8

1 52 1
R1 R2 → 0 9 108
3R1 R2 → 0 1
2
86 2

1 8

1
9 R2 → 0 1 12 1 52 1
2R3 → 0 1 4
x 8yy 86
12
x
5
2y 1
y 12 y 4
x 812 86 ⇒ x 10 y 4
2 4
5
Solution: 10, 12 x 1 ⇒ x 9
Solution: 9, 4
0.1 0.13 0.1

0.3 0.4
0.2 0.07
17. 18.
0.2 0.3 0.25 0.5 0.01
10R1 → 3 1 1.3 5R1 → 1 0.5
10R2 → 2 3 2.5 2R1 R2 → 0 0.3
0.35
0.15
0.5

1 0.35
R2 R1 → 1
2 2
3
1.2
2.5 1
0.3 R2 → 0 1 0.5
2R1 R → 0
2
1 2
7

1.2
4.9 x 0.5yy 0.35
0.5
y 0.5

17R2 → 10 2
1
1.2
0.7 x 0.50.5 0.35 ⇒ x 0.6
Solution: 0.6, 0.5 35, 12

x 2y 1.2
y 0.7
y 0.7
x 20.7 1.2 ⇒ x 0.2
Solution: 0.2, 0.7 15, 10
7


2 3 1 10 2 3 3 3
19. 2 3 3 22 20. 6 6 12 13
4 2 3 2 12 9 1 2

2 3 1 10 2 3 3 3
R1 R2 → 0 6 4 12 3R1 R2 → 0 3 3 4
2R1 R3 → 0 8 1 22 6R1 R3 → 0 9 19 16
R2 R1 → 2

1 3 1
2 R1 → 1 2 2 5 0 6 7
1
6R2 → 0 1
2
3 2 0 3 3 4
0 8 1 22 3R2 R3 → 0 0 28 28

1 3
2
1
2 5 1
2 R1 → 1 0 3 7
2
0 1 2
3 2 13 R2 → 0 1 1 43
8R2 R3 → 0 0
19
3 38 1
28 R3 → 0 0 1 1

3 1
x 3z 7

1 2 2 5 2
0 1 2
3 2 y z 43

3
19 R3 → 0 0 1 6 z 1
z 6
z1
y 236 2 ⇒ y 2
y 1 43 ⇒ y 13
2 2 2 6
3 1
x 5 ⇒ x5
x 31 72 ⇒ x 12
Solution: 5, 2, 6
Solution: 12, 13, 1

2 1 2 4 1 2 6 1
21. 2 2 0 5 22. 2 5 15 4
2 1 6 2 3 1 3 6

1 2 6 1

2 1 2 4
R1 R2 → 0 1 2 1 2R1 R2 → 0 1 3 2
R1 R3 → 0 2 4 2
3R1 R3 → 0 5 15 9

R2 R1 → 2 1 2 6 1

0 4 3
0 1 2 1
0 1 3 2
2R2 R3 → 0 0 0 0
5R2 R3 → 0 0 0 1
Because the last row consists of all zeros except for

1
2 R1 → 1 0 2 3
2 the last entry, the system is inconsistent and there is
0 1 2 1 no solution.
0 0 0 0
Let z a, then:
y 2a 1 ⇒ y 2a 1
x 2a 32 ⇒ x 2a 23
Solution: 2a 2, 2a 1, a where a is any real number
3

3

2 1 1 0 6 1 2 0 1
23.
0 2 3 1 9 0 3 3 0 0
3 3 2 2 11 24.
4 4 1 2 0
1 0 1 3 14 2 0 1 0 3

R4 R1 1 3 8
1 0
3

1 2 0 1
0 2 3 1 9 1
3R2 → 0 1 1 0 0
3 3 2 2 11
1 0 1 3 14
4R1 R3 → 0 4 1 2 12
2R1 R4 → 0 4 1 2 3

1 1 0 3 8
3

1 2 0 1
0 2 3 1 9
3R1 R3 → 0 0 2 7 13 0 1 1 0 0
R1 R4 → 0 1 1 6 22 0 4 1 2 12
R3 R4 → 0 0 0 0 9

1 1 0 3 8
3R4 R2 → 0 1 0 19 57 Because the last row consists of all zeros except for the
0 0 2 7 13 last entry, the system is inconsistent and there is no
0 1 1 6 22 solution.

1 1 0 3 8
0 1 0 19 57
0 0 2 7 13
R2 R4 → 0 0 1 13 35

1 1 0 3 8
0 1 0 19 57
R4 0 0 1 13 35
R3 0 0 2 7 13

1 1 0 3 8
0 1 0 19 57
0 0 1 13 35
2R3 R4 → 0 0 0 19 57

1 1 0 3 8
0 1 0 19 57
0 0 1 13 35
1
R
19 4 → 0 0 0 1 3
w3
z 133 35 ⇒ z 4
y 193 57 ⇒ y 0
x 0 33 8 ⇒ x 1
1

R2 R1 → 1 1 1

1 2 1 0
25. 2 3 1 2 0 1 1 0
5 4 2 4 9R2 R3 → 0 0 3 9

R1 → 1 1 2 1

1 0 1 1
2 3 1 2 0 1 1 0
5 4 2 4 1
R
3 3 → 0 0 1 3
1 2 1

R3 R1 → 1

1 0 0 2
2R1 R2 → 0 5 5 0 R3 R2 → 0 1 0 3
5R1 R3 → 0 9 12 9 0 0 1 3
x 2, y 3, z 3

1 1 2 1
1
5 R2 → 0 1 1 0
Solution: 2, 3, 3
0 9 12 9

2 1 9 8

26. 4x 4y 4z 5 27. 1 3 4 15
4x 2y 8z 1 5 2 1 17
5x 3y 8z 6

R2 R1 → 1 4 13 23
1 3 15

4 4 4 5 4
4 2 8 1 5 2 1 17
5 3 8 6

1 4 13 23
1

5

4 R1 → 1 1 1 4 R1 R2 → 0 7 17 38
4 2 8 1 5R1 R3 → 0 22 66 132
5 3 8 6

1 4 13 23

1 1 1 5
4 R3 0 22 66 132
4R1 R2 → 0 6 12 4
R2 0 7 17 38

1 4 13 23
5R1 R3 → 0 2 3 14 1
22 R2 → 0 1 3 6

1 1 1 5
4 0 7 17 38
16R2 → 0 1 2 2

3 1 4 13 23
0 2 3 14 0 1 3 6
7R2 R3 → 0 0 4 4

R2 R1 → 1 0 1 7
12

1 4 13 23
0 1 2 2
3
0 1 3 6
2R2 R3 → 0 0 7 13
12 14R3 → 0 0 1 1

1 7

1 0 12 4R2 R1 → 1 0 1 1
0 1 2 2
3
0 1 3 6
0 0 1 1
1
7 R3 → 0 0 1 13
84

R3 R1 → 1 0 0 2

R3 R1 → 1 0 0 31
42 3R3 R2 → 0 1 0 3
2R3 R2 → 0 1 0 5
14 0 0 1 1
0 0 1 13
84 x 2, y 3, z 1
31
x 42 Solution: 2, 3, 1
5
y 14
13
z 84
Solution: 3142, 145 , 13

84

28. 3x y 7z 20 1 1 4 8
5x 2y z 34
x y 4z 8
1
3 R2

→ 0
0 2
1 19
3
5

2
4

3 20

1 7 7
R2 R1 → 1 0 6
5 2 1 34
3
1 1 4 8 0 1 19
3 2
2R2 R3 → 0 0 23
0

R3 1 1 4 8 3

5 2 1 34 1 0 7
3 6
R1 3 1 7 20
0 1 19
2
3

1R1 → 1 4
1 8 3
23 R3 → 0 0 1 0
5 2 1 34
73R3 R1 → 1

3 1 7 20 0 0 6
0 1 0 2

1 1 4 8
5R1 R2 → 0 3 19 6
19
3 R3 R2 → 0 0 1 0
3R1 R3 → 0 2 5 4 x 6, y 2, z 0
Solution: 6, 2, 0

3 1 5 2 44 1 0 0 0 2
1 6 4 1 1
⇒
0 1 0 0 6
5 1 1 3 15 0 0 1 0 10
0 4 1 8 58 0 0 0 1 3
x 2, y 6, z 10, w 3
Solution: 2, 6, 10, 3
30. Use the reduced row-echelon form feature of the graphing utility.

4 12 2 20 1 0 0 0
1 6 4 12
⇒
0 1 0 0
1 6 1 8 0 0 1 0
2 10 2 10 0 0 0 1
The system is inconsistent and there is no solution.
1 1

0 0
1 1

x 12
31. ⇒ x 12 and y 7 32. x 5 8 5 ⇒ x 8, y 0
y 9 7 9
4 y 4 0
9 5 9 x 10 5

x3 4 4y 5x 1 4 44 4 2 4
33. 0 3 2 0 3 2 34. 0 3 7 4 0 3 7 2y
2 y5 6x 2 16 6 6 1 1 0 1
2x 1 1 0

x 3 5x 1 6 12x
4y 44
y 5 16
x 1 and y 11
4 2y

2 x 10 x 12, y 2
6x 6
2 3 1
23
10 8
35. (a) A B
5 12 8 15 13
2 3 5 12
23
10
(b) A B
5 12 8 9 3
2 8
3
2 8
(c) 4A 4
5 12 20
2 3 2 9 7
3
2 10 2 30 28
(d) A 3B 3
5 12 8 3 5 36 24 39 29

5 4 4 12 54 4 12 9 16
36. (a) A B 7 2 20 40 7 20 2 40 13 42
11 2 15 30 11 15 2 30 26 32

5 4 4 12 54 4 12 1 8
(b) A B 7 2 20 40 7 20 2 40 27 38
11 2 15 30 11 15 2 30 4 28

5 4 20 16
(c) 4A 4 7 2 28 8
11 2 44 8

5 4 4 12 5 4 12 36 17 40
(d) A 3B 7 2 3 20 40 7 2 60 120 53 122
11 2 15 30 11 2 45 90 56 92

5 4 0 3 5 7
37. (a) A B 7 2 4 12 3 14
11 2 20 40 31 42

5 4 0 3 5 1
(b) A B 7 2 4 12 11 10
11 2 20 40 9 38

5 4 20 16
(c) 4A 4 7 2 28 8
11 2 44 8

5 4 0 3 5 4 0 9 5 13
(d) A 3B 7 2 3 4 12 7 2 12 36 5 38
11 2 20 40 11 2 60 120 71 122
38. (a) A B is not possible. A and B do not have the same order.
(c) 4A 46 5 7 24 20 28
(d) A 3B is not possible. A and B do not have the same order.
10 20 7 10 3 20 17 17
39. 17 3
5

14 3

1 14 53

13 2
40. Since the matrices are not of the same order, the operation cannot be performed.
2 4

1 2 7 1 56 8 54 4
41. 2 5 4 8 1 2 10 8 8 16 2 24
6 0 1 4 12 0 8 32 4 32
1 2 4 8 8

8 8 0 1 10 0 20
42. 2 4 12 5 3 1 1 2 4 12 15 5 5
0 6 0 6 12 8 0 6 0 30 60 40
8 10 10 8 20

2 1 12
2 15 4 5 12 5 13 1 17
0 30 6 60 0 40 30 54 40
2 2 3 6 24 12 18 48 18 3

1
8 5 4 24 15
43. 3 6
3 1 2 7 6 3 9 3 12 42 36 15 51 33
2 8 4

2 0 4 6 0 1 2
44. 5 7 2 4 6 11 11 54 45. X 3A 2B 3 1 5 2 2 1
8 2 1 3 44 2 3 2 4 4
14 4

7 17
17 2


4 16 16 3 06

0 1 2 0 3 6
1 1 1 1
46. X 4A 3B 4 1 5 3 2 1 4 20 6 3 46 20 3
6 6 6 6
3 2 4 4 12 8 12 12 12 12 8 12

13
6 1

13 6
1 1
2 17 3 17
6
6
0 20 10
0 3

4

1 2 0
1 1
47. X B 2A 2 1 2 1 5
3 3
4 4 3 2

2
3

9 2 3
1
4 11 43 11
3
3
10 0 10
0
3

4 0 1 2 8 0 5 10 8 5 0 10
1 1 1 1
48. X 2A 5B 2 1 5 5 2 1 2 10 10 5 2 10 10 5
3 3 3 3
3 2 4 4 6 4 20 20 6 20 4 20

13 10

13 10 3 3
1
12 15 4 5
3
26 16 26
3 16
3
49. A and B are both 2 2 so AB exists.

2 23 212 210 28
3
30
23
10 4
AB
5 12 8 33 512 310 58 51 70
50. Not possible because the number of columns of A does not equal the number of rows of B.
51. Since A is 3 2 and B is 2 2 , AB exists.

54 420 512 440

5 4 100 220

4 12
AB 7 2 74 220 712 240 12 4
20 40
11 2 114 220 1112 240 84 212

1
52. AB 6 5 7 4 61 54 78 30
8
16 24 12 20 18 20

1 2
2

6 8
53. 5 4 56 44 52 40 58 40
4 0 0
6 0 66 04 62 00 68 00
14 2

8
14 10 40
36 12 48
54. Not possible because the number of columns of the first matrix does not equal the number
of rows of the second matrix.

6 4
16 52 68 14 50 60

1 5 6
55. 2 0
2 4 0 26 42 08 24 40 00
8 0
20
44 4

8
3 14 13 33 12 31 22

1 3 2 4 2
56. 0 2 4 0 3 1 0 23 21 42
0 0 3 0 0 2 0 0 32

4 6 3
0 6 10
0 0 6
46 42 24 8
6 6 66
4
57. 2
62 36 12
2

1
58. 4 2 6 0 3 42 20 62 41 23 60
2 0
4 10
2
6 3
6 3
2 1 4 2 4 2 1 2 6
59.
0 1 0 4 0 5
22 13 26 15
62 0 66 0
12
1 17

36
1 3 01 35 00 33

4 1 5
12 11 25
1 0 3 1 0 3
60. 3
2 2 3 6 10 23
3 9
12 15
3

6 11 6
315 311 39 36
1215 611 129 66
12
246
9

144
14 22

4 1 22 1 1
5 2

3 6 3 10 13 24
61. 11 7 19 41 80 62. 5 2
2 2 2 4 2 2 20 4
12 3 42 66 66 3 2

80 70 90 40 96 84 108 48
63. 0.95A 0.95 80 120 140
40 100 80

76 114 133
38 95 76 64. 1.2A 1.2 50
90
30 80
60 100
20 60
50 108
36 96
72 120
24
60

8200 7400
65. BA 10.25 14.50 17.75 6500 9800 $274,150 $303,150
5400 4800
The merchandise shipped to warehouse 1 is worth $274,150, and the merchandise shipped to
warehouse 2 is worth $303,150.
66. (a) T 120 80 20

0.07 0.095
(b) TC 120 80 20 0.10 0.08 22 22.8
0.28 0.25
Your cost with company A is $22.00. Your cost with company B is $22.80.
4 1 2 1 42 17 41 14

67. AB 7 2 7 4
72 27 71 24
0
1 0
I
1
2 1 4 1 24 17 21 12
BA 7 4 7 2
74 47 71 42
10 0
1
I
1 2
115 11
1 1 0
68. AB I
2 5 0 1
2 1
11 115
1 1 0
BA I
5 2 0 1
0 2 3

1 1 1
69. AB 1 0 1 3 3 1
6 2 3 2 4 1
12 13 02 13 13 04 11 11 01

12 03 12
62 23 32
13 03 14
63 23 34
11 01 11
61 21 31

1 0 0
0 1 0 I
0 0 1

2 3 1 1 1 0
BA 3 3 1 1 0 1
2 4 1 6 2 3
21 31 16 21 30 12 20 31 13

31 31 16
21 41 16
31 30 12
21 40 12
30 31 13
20 41 13

1 0 0
0 1 0 I
0 0 1

1
0 2 1

1 1 2 1 0 0
1
70. AB 1 0 1 3 1 2 0 1 0 I
8 4 2 2 2 12 0 0 1

1
2 1

2 1 1 0 1 0 0
1
BA 3 1 2 1 0 1 0 1 0 I
2 2 12 8 4 2 0 0 1
6 3
I 2
5
71. A I 5
5
4
1
0
0
1 72. A
3
1
0
0
1
16 R1 → 56 16 2R2 R1 → 1
51 4 0
0
1 2 1
3
1
0
2
1

56 16
1 0 1
2R1 R2 → 0 1

1
2
2
3
5R1 R2 → 0 16 56 1
1

1 56 16 0 R2 R1 → 1
6R2 → 0 1 5 6 0 0
1
3
2
5
3 I A1

23
5
R1 → 1 5

6 R2 0 4 5
I A1 A1
0 1 5 6 3
5
A1 45 6

1 2 2 1 0 0
73. A I 3 7 9 0 1 0
1 4 7 0 0 1
R1 → 1

2 2 1 0 0
3 7 9 0 1 0
1 4 7 0 0 1

1 2 2 1 0 0
3R1 R2 → 0 1 3 3 1 0
R1 R3 → 0 2 5 1 0 1
2R2 R1 → 1

0 4 7 2 0
0 1 3 3 1 0
2R2 R3 → 0 0 1 5 2 1
4R3 R1 → 1

0 0 13 6 4
3R3 R2 → 0 1 0 12 5 3 I A1
R3 → 0 0 1 5 2 1

13 6 4
A1 12 5 3
5 2 1

0 2 1 1 0 0
74. A I 5 2 3 0 1 0
7 3 4 0 0 1

R3 7 3 4 0 0 1
5 2 3 0 1 0
R1 0 2 1 1 0 0

R2 R1 → 2 1 1 0 1 1
5 2 3 0 1 0
0 2 1 1 0 0

2 1 1 0 1 1
5R1 2R2 → 0 1 1 0 7 5
0 2 1 1 0 0

R2 R1 → 2 0 2 0 6 4
0 1 1 0 7 5
2R2 R3 → 0 0 1 1 14 10
1

→ 1
2 R1 0 1 0 3 2
0 1 1 0 7 5
R3 → 0 0 1 1 14 10

R3 R1 → 1 0 0 1 11 8
R3 R2 → 0 1 0 1 7 5 I A1
0 0 1 1 14 10

1 11 8
A1 1 7 5
1 14 10

1
1 12

2 0 3 1 2 1 4 6
75. 1 1 1 1
2 3
2
56 76. A 2 3 1
2 2 1 0
2 1 1 18 16
3 3
A1 does not exist.

3 6 11 7

1 3 1 6 1 2 2 8 0 2 8
4 4 2 6 1 2 2 1 4 2 0 2
77. 29
78. A
3 4 1 2 7 15 2 19
2
1 2 1 4
1 2 1 2 5 1 4 1 1
52
3
1 2 2

2.5 3 7 2

3 6 5.5 3.5
1
4 4.5 11 3
1 2 2 1 A
14.5 16 40 12
7 15 14.5 9.5
1 1 3 1
1 2.5 2.5 1.5
7
8 2
2
79. A
2 2 1

1 2 1 2 1
A1
72 28 8 7 2 8 7 4 72
7
10 4
80. A
3
ad bc 103 47 2

3
4 4 2
1

3 1 3 2
A1
103 47 7 10 2 7 10 72 5

12 20 4
3 5
2
81. A 82. A
3
10 6 45 83
A1
126
1 6
2010 10
3 3 20
1
2
1 6
3
3 10 20
12 ad bc 43
38
52
54
2 2 4

8
52 23 58
1 3
20
2 3
A1 4

34 1 3
1
10
1
6
4 5 5 16
9x5x 2yy 2413

83. x 4y 8 84.
2x 7y 5
1 1
y 9 24 9 24 3
1
y 5 2 15
x 4 1 8 7 4 8 x 5 13 2 1 13 2
2 7 2 5
Solution: 2, 3
7288 415
5 11

36
Solution: 36, 11
19x4x 2y9y 1047

85. 3x 10y 8 86.
5x 17y 13
xy 35 138 17

10 2
10
1
138 y 19 47
10 1 x 4
17 5 3 9
1758810
13 6 92 1
313 1
10 2

19
2 2 47

1

87. 3x 2y z 6 88. x 4y 2z 12
x y 2z 1 2x 9y 5z 25
5x y z 7 x 5y 4z 10

1 1 1 x 1 4 2 1 12

x 3 2 1 1 6 6
y 1 1 2 1 3
8
73 1 y 2 9 5 25
3
z 5 1 1 7 7 7 z 1 5 4 10
2 3 53

11 6 2 12 2

16 11 17 3 2 1 25 4

2
36 831 737 1 1 1 1 10 3
26 71 57 2 Solution: 2, 4, 3

3 3
Solution: 2, 1, 2

89. 2x y 2z 13
x 4y z 11
y z 0

2 59 1
1 13

x 1 2 1 13 9
1
y 1 4 1 11 9 29 0 11
z 0 1 1 0 19
2
1 0
9

913 911 10
5 1
6
9 13 2911 00
1
1
1913 2911 10 1
Solution: 6, 1, 1


90. 3x y 5z 14
x y 6z 8
8x 4y z 44

25 19 11
6 6

x 3 1 5 1 14 6 14 3
8 6 37
49 23
y 1 1 6 6 6 8 5
z 8 4 1 44 3 2 2
13 44 0
3
Solution: 3, 5, 0
3x 4y 5
91. x 2y 1
5
1 2 1 1 3
y 3
x 1 2 1
3
4 2 12 5 1
Solution: 3, 1
6x 2y 18
92. x 3y 23
1 0.15
xy 61 18 0.1 18 56
3 23 23
2 0.3 0.05
x 5, y 6
Solution: 5, 6)

93. 3x 3y 4z 2
y z 1
4x 3y 4z 1

x 3 3 4 1 2 1 0 1 2 1
y 0 1 1 1 4 4 3 1 1
z 4 3 4 1 4 3 3 1 2
Solution: 1, 1, 2

94. x 3y 2z 8
2x 7y 3z 19
x y 3z 3

x 1 3 2 1 8 18 7 5 8 4
y 2 7 3 19 3 1 1 19 2
z 1 1 3 3 5 2 1 3 1
x 4, y 2, z 1
Solution: 4, 2, 1
95.

8
2
5
4
8452 42 96.

9
7
11
4
94 117 41
97.

50
10
30
5
505 3010 550 98.

14 24
12 15
1415 2412 78
1
7 5
2 3 6
99. 100.
4 4
(a) M11 4 (b) C11 M11 4 (a) M11 4 (b) C11 M11 4
M12 5 C12 M12 5
M12 7 C12 M12 7
M21 6 C21 M21 6
M21 1 C21 M21 1 M22 3 C22 M22 3
M22 2 C22 M22 2
1

3 2 8 3 4
101. 2 5 0 102. 6 5 9
1 8 6 4 1 2
(a) M11

5
8
0
6
30 (a) M11

5
1
9
2
19

M12

2
1
0
6
12 M12
6
4
9
2
24
M13

2
1
5
8
21 M13
6
4
5
1
26
M21

2
8
1
6
20
M21

3
1
4
2
2
M22

3
1
1
6
19
M22
8
4
4
2
32
M23

3
1
2
8
22 M23
8
4
3
1
20
M31

2
5
1
0
5
M31

3
5
4
9
47

M32
3
2
1
0
2 M32

8
6
4
9
96

M33
(b) C11 M11 30

3
2
2
5
19 M33

8
6
3
5
22
(b) C11 M11 19

C12 M12 12 C12 M12 24
C13 M13 21 C13 M13 26
C21 M21 20 C21 M21 2
C22 M22 19 C22 M22 32
C23 M23 22 C23 M23 20
C31 M31 5 C31 M31 47
C32 M32 2 C32 M32 96
C33 M33 19 C33 M33 22
103. Expand using Column 2.

2 4 1
6 2 2 1
6 0 2 4 3
5 4 6 2
5 3 4
434 32 130

104. Expand using Row 3.

4 7 1
7 1 4 1 4 7
2 3 4 5 1 1
3 4 2 4 2 3
5 1 1
525 18 26 117


3 0 4 0
8 1 2 0 8 2
0 8 1 2
31 8 2 4 6 1 2
6 1 8 2
3 4 1 0 3 1
0 3 4 1
388 8 11 6 24 24 40 68 6 0
3128 5 56 412
279

106. Expand using Row 1, then use Row 3 of each 3 3 matrix.

5 6 0 0
1 1 2 0 1 2
0 1 1 2
5 4 5 1 6 3 5 1
3 4 5 1
6 0 3 1 0 3
1 6 0 3
561 10 35 4 61 10 30 3
554 3 69 9
255
11x 3y 23
107. 5x 2y 6
6
23 2
3
28 5
11 23
6

49

x 4, y 7
5 2 7 5 2 7
11 3 11 3
Solution: 4, 7

108. 3x 8y 7
9x 5y 37
7 8
37 5 261 3
9 7
37 174

x 3, y 2
3 8 87 3 8 87
9 5 9 5
Solution: 3, 2

109. 2x 3y 5z 11
4x y z 3
x 4y 6z 15

2 3 5
1 1 3 5 3 5
D 4 1 1 212 413 114
4 6 4 6 1 1
1 4 6
22 42 2 14

11 3 5
x
3
15
1
4
14
1
6

1112

1
4
1
6
313
4
14

3 5
6
1514
3
1 5
1
112 32 152 14
1

14 14
2 11 5
y
4
1
3
15
14
1
6

212

3
15
1
6
413

11
15
14
5
6
114
11
3 5
1
233 49 126 56
4
14 14

2 3 11
z
4
1
1
4
14
3
15

212
1
4
3
15
413
3
4
14
11
15
114
3
1 11
3
2(27) 41 120 70
5
14 14
Solution: 1, 4, 5

110. 5x 2y z 15 5 2 1
3x 3y z 7, D 3 3 1 65
2x y 7z 3 2 1 7
x 15
7
3
2
3
1
65
Solution: 6, 8, 1
1
1
7 390
65
6, y
5
3
2
15 1
7 1
3 7
65

520
65
8, z 5
3
2
2 15
3 7
1 3
65

65
65
1
111. 1, 0, 5, 0, 5, 8
1 0 1

1 1 0 1 5 0 1 1
Area 5 0 1 1 1 8 40 32 16 square units
2 2 8 1 5 8 2 2
5 8 1
112. 4, 0, 4, 0, 0, 6 113. 1, 4, 2, 3, 0, 5

4 0 1 1 4 1
1 1 1
Area 4 0 1 48 24 square units Area 2 3 1
2 2 2
0 6 1 0 5 1

1
2 5

1
2
1
1

1
2
4
3
1
53 5 10 square units
2
114. 32, 1, 4, 12 , 4, 2 115. 1, 7, 3, 9, 3, 15

3
2 1 1 1 7 1

1 1 25 25
Area 4 12 1 square units 3 9 1 0
2 2 4 8
4 2 1 3 15 1
116. Points: 0, 5, 2, 6, 8, 1 117. 4, 0, 4, 4
0 5
2 6
8 1
1

1
1
2 6
8 1

0 5
8 1

0 5
2 6
x
4
4
y
0
4
1
1 0
1
50 40 10 0
1

4
4
0
4
1
x
4
y
4
1
x
4
16 4x 4y 4y 0
y
0
0
4x 8y 16 0
x 2y 4 0
118. 2, 5, 6, 1 119. 52, 3, 72, 1

x y 1 x y 1
2 5 1 0 52 3 1 0
6 1 1 7
1 1
2

6x 4y 32 0 5
2 3 x y x y
1 7 1 7 1 5 0
3x 2y 16 0 2 1 2 1 2 3
13 x 2y 3x 2y 0
7 5
2x 6y 13 0
120. 0.8, 0.2, 0.7, 3.2

x y 1
0.8 0.2 1 0
0.7 3.2 1
3x 1.5y 2.7 0 Multiply both sides by 10
3.
10x 5y 90
121. L O O K __ O U T __ B E L O W __
[12 15 15] [11 0 15] [21 20 0] [2 5 12] [15 23 0]
2

2 0
A 3 0 3
6 2 3

2 2 0
12 15 15 3 0 3 21 6 0
6 2 3
2

2 0
11 0 15 3 0 3 68 8 45
6 2 3

2 2 0
21 20 0 3 0 3 102 42 60
6 2 3

2 2 0
2 5 12 3 0 3 53 20 21
6 2 3

2 2 0
15 23 0 3 0 3 99 30 69
6 2 3
Cryptogram: 21 6 0 68 8 45 102
42 60 53 20 21 99 30 69
122. R E T U R N __ T 0 __ B A S E __
18 5 20 21 18 14 0 20 15 0 2 1 19 5 0

2 1 0
A 6 6 2
3 2 1
18 5 20 A 66 28 10
21 18 14 A 24 59 22
0 20 15 A 75 90 25
0 2 1 A 9 10 3
19 5 0 A 8 11 10
Cryptogram: 66 28 10 24 59 22 75 90 25 9 10 3 8 11 10
1 3

2
123. A1 2 1 0
4 2 5
1 3

2
5 11 2 2 1 0 19 5 5 S E E
4 2 5

1 2 3
370 265 225 2 1 0 0 25 15 __ Y O
4 2 5

1 2 3
57 48 33 2 1 0 21 0 6 U __ F
4 2 5
1 3

2
32 15 20 2 1 0 18 9 4 R I D
4 2 5

1 2 3
245 171 147 2 1 0 1 25 0 A Y __
4 2 5
Message: SEE YOU FRIDAY

1 2 3
124. A1 2 1 0
4 2 5
145 105 92 13 1 25 M A Y
264 188 160 0 20 8 __ T H
23 16 15 5 0 6 E __ F

129 84 78 1 2 3 15 18 3 O R C
9 8 5 2 1 0 5 0 2 E __ B
159 118 100 4 2 5 5 0 23 E __ W
219 152 133 9 20 8 I T H
370 265 225 0 25 15 __ Y O
105 84 63 21 0 0 U __ __
Message: MAY THE FORCE BE WITH YOU
125. False. The matrix must be square.
126. True. Expand along Row 3.

a11 a12 a13
a a13 a a13 a a12
a21 a22 a23 a31 c1 12 a32 c2 11 a33 c3 11
a22 a23 a21 a23 a21 a22
a31 c1 a32 c2 a33 c3
a31
a12
a22
a13
a23
a
a32 11
a21
a13
a23
a
a33 11
a21
a12
a22

c1
a12
a22
a13
a23
a
c2 11
a21
a13
a23
a
c3 11
a21
a12
a22

a11 a12 a13 a11 a12 a13
a21 a22 a23 a21 a22 a23
a31 a32 a33 c1 c2 c3
Note: Expand each of these matrices along Row 3 to see the previous step.
127. The matrix must be square and its determinant nonzero to have an inverse.
128. If A is a square matrix, the cofactor Cij of the entry aij is 129. No. Each matrix is in row-echelon form, but the third
1ijMi j , where Mij is the determinant obtained by matrix cannot be achieved from the first or second
deleting the ith row and jth column of A. The determinant matrix with elementary row operations. Also, the first
of A is the sum of the entries of any row or column of A two matrices describe a system of equations with one
multiplied by their respective cofactors. solution. The third matrix describes a system with
infinitely many solutions.
130. The part of the matrix corresponding to the coefficients

of the system reduces to a matrix in which the number
of rows with nonzero entries is the same as the number
131.

2
3
5
8
0

2 8 15 0
of variables.
16 6 2 15 0
2 6 31 0
6 ± 36 431

2
3 ± 210
Problem Solving for Chapter 8
1
01 11
2 3
1. A T
0 4 2
11
4 2
1
2 3
(a) AT
2 3 AAT
1 4 2
y y y
(2, 4)
4 4 4
(− 2, 3)
3 (−4, 2) 3 3
(3, 2)
2 2 2
1 1 1
(1, 1) (− 1, 1)
x x x
− 4 −3 − 2 − 1 1 2 3 4 −4 −3 −2 −1 1 2 3 4 −4 −3 −2 −1 1 2 3 4
−2 −2 −2 (−1, − 1)
(− 3, −2)
−3 −3 −3
−4 −4 (− 2, −4) −4
Original Triangle AT Triangle AAT Triangle

The transformation A interchanges the x and y coordinates and then takes the negative of the x coordinate.
A represents a counterclockwise rotation by 90.
(b) A1AAT A1AAT IAT AT
A1AT A1AT IT T
A1 10 1
0
A1 represents a clockwise rotation by 90.
Problem Solving for Chapter 8 811
2. (a) 2000 (b) Change in Percent of Population

0–17 18–64 65+ from 2000 to 2015

4.64% 11.79% 2.62% Northeast 0–17 18–64 65+

5.91% 14.03% 2.94% Midwest 0.58% 0.80% 0.01% Northeast
9.09% 22.11% 4.42% South 0.79% 0.80% 0.32% Midwest
1.75% 3.98% 0.72% Mountain 0.73% 0.14% 1.21% South
4.30% 9.96% 1.74% Pacific 0.06% 0.09% 0.33% Mountain
0.51% 0.78% 0.38% Pacific
2015
0–17 18–64 65+ (c) All regions show growth in the 65+ age bracket,

4.06% 10.99% 2.63% Northeast especially the South. The South, Mountain and Pacific
5.12% 13.23% 3.26% Midwest regions show growth in the 18–64 age bracket. Only the
8.36% 22.25% 5.63% South Pacific region shows growth in the 0–17 age bracket.
1.69% 4.07% 1.05% Mountain
4.81% 10.74% 2.12% Pacific
0 0 1 1

1 0 1 0 1 0 2 3 2 3 1 0
3. (a) A2 A (c) A2 A
0 0 0 0 2 2 0 1
A is idempotent. A is not idempotent.
01 01 21 21

1 1 1 0 3 3 7 12
(b) A2 A (d) A2 A
0 0 0 1 2 2 4 7
A is not idempotent. A is not idempotent.
2
1 2
4. A
1
21 21
2 2 1 2 1 0
(a) A2 2A 5I 2 5
1 1 2 1 0 1
3
2 4

4 5 0

4 3 4 2 0 5
0
0 0
0
0
1 2 1 1 2

1
(b) A1
1 4 2 1 5 2 1
2
20 5112
1 1 0 1 2
2 I A
5 5 2 2 1 1
1
Thus, A1 2 I A.
5
(c) A2 2A 5I 0
A2 2A 5I
A 2IA 5I
1
A 2IA I
5
1
2I AA I
5
1
Thus, A1 2 I A.
5

0.70 0.15 0.15 25,000 28,750 0.70 0.15 0.15 28,750 30,813
5. (a) 0.20 0.80 0.15 30,000 35,750 (b) 0.20 0.80 0.15 35,750 39,675
0.10 0.05 0.70 45,000 35,500 0.10 0.05 0.70 35,500 29,513
Gold Cable Company: 28,750 households Gold Cable Company: 30,813 households
Galaxy Cable Company: 35,750 households Galaxy Cable Company: 39,675 households
Nonsubscribers: 35,500 households Nonsubscribers: 29,513 households

0.70 0.15 0.15 30,812.5 31,947 (d) Both cable companies are increasing the number of
(c) 0.20 0.80 0.15 39,675 42,329 subscribers, while the number of nonsubscribers is
0.10 0.05 0.70 29,512.5 25,724 decreasing each year.
Gold Cable Company: 31,947 households

Galaxy Cable Company: 42,329 households
Nonsubscribers: 25,724 households
3 x
2
3 x 1
6. A ⇒ A1
3 9 2x 2 3

x

3
9 2x 9 2x

3 x
If A A1, then .
2 3 2 3
9 2x 9 2x
3
Equating the first entry in Row 1 yields 3 ⇒ 3 27 6x ⇒ x 4.
9 2x
Now check x 4 in the other entries:
4
9 24
4 ✓
2
9 24
2 ✓
3
9 24
3 ✓
Thus, x 4.
7. If A 24 x
3
is singular then 8. From Exercise 3 we have the singular matrix
ad bc 12 2x 0. A 10 0
0
where A2 A.
Thus, x 6.
Also, A 10 1
0has this property.
9. a bb cc a a2b a2c ab2 ac2 b2c bc2

1
a
a2
1
b
b2
1
c2
b
c 2
b
c
c2
a
2
a
c
c2
a
2
a
b
b2
bc2 b2c ac2 a2c ab2 a2b
1
Thus, a
a2
1
b
b2
1
c a bb cc a.
c2
10. a bb cc aa b c a3b a3c ab3 ac3 b3c bc3

1
a
a3
1
b
b3
1
c3
b
c 3
b
c
c3
a
3
a
c
c3
a
3
a
b
b3
bc3 b3c ac3 a3c ab3 a3b
1
Thus, a
a3
1
b
b3
1
c a bb cc aa b c.
c3

x
11. 1
0
0
x
1
c
b x
a
x
1
b
a
c
1
0
x
1
xax b c1 0 ax2 bx c

x 0 0 d

x 0 c 1 x 0
1 1
12.
0
x
1
0
x
c
b
x 1 x b d 0 1 x xax2 bx c d
0 x
1
0 1 a 0 0 1
0 0 1 a
From Exercise 11
ax3 bx2 cx d
13. 4S 4N 184
6F 146

S
2N 4F 104

4 184 0
1 146 6
4 4 0
0 104 4 896
D 1 0 6 64 N 14
64 64

0 2 4
4 4 184
184 4 0
1 0 146
146 0 6
0 2 104 1216
104 2 4 2048 F 19
S 32 64 64
64 64
Element Atomic mass
Sulfur 32
Nitrogen 14
Fluoride 19
14. Let x cost of a transformer, y cost per foot of wire, z cost of a light.
x 25y 5z 20
x 50y 15z 35
x 100y 20z 50

1 25 5 20 1 0 0 10
1 50 15 35 rref
→ 0 1 0 0.2
1 100 20 50 0 0 1 1
By using the matrix capabilities of a graphing calculator to reduce the augmented matrix to
reduced row-echelon form, we have the following costs:
Transformer $10.00
Foot of wire $ 0.20
Light $ 1.00

3 0
1 2

1
15. A , B 1 2
2 0 1
1 1

1 2
3

1 1
AT 1 0 , BT
0 2 1
2 1
5
AB 52 4
1
, ABT 24 1

1 2
3 5

1 1 2
BTAT 1 0
0 2 1 4 1
2 1
Thus, ABT BTAT.

1 6 4

1 2 2 11 11 11
7 2 5
16. A 1 1 3 ⇒ A1 11 11 11
1 1 4 2
11 1
11
3
11
23 13 34 0 18 5
31 34 63 13 5 13
25 17 61 2 5 18
24 14 37 0 19 5

1 6 4
41 17 8 11 11 11 16 20 5
7 2 5
20 29 40 11 11 11 13 2 5
38 56 116 2 1 3 18 0 20
11 11 11
13 11 1 8 5 0
22 3 6 5 12 5
41 53 85 22 5 14
28 32 16 20 8 0
0 18 5 13 5 13 2 5 18 0
__ R E M E M B E R __
19 5 16 20 5 13 2 5 18 0
S E P T E M B E R __
20 8 5 0 5 12 5 22 5 14 20 8 0
T H E __ E L E V E N T H __
REMEMBER SEPTEMBER THE ELEVENTH

45 35 10 15 J O
17. (a) 45 35 wy x
z
10 15 38 30 8 14 H N
18 18 0 18 — R
y
w x 30
38 30 8 14 35 5 20 E T
z 60 2
81
1
1 21 18 U R
(b)
45w 35y 10 42 28 3 14 0 N —
75 55 20 15 T O
45x 35z 15
2 2 0 2 — B
38w 30y 8 22 21 1 19 A S
15 10 5 0 E —
38x 30z 14
JOHN RETURN TO BASE
45w 35y 10
38w 30y 8
⇒ w 1, y 1
38x 30z 14
45x 35z 15
⇒ x 2, z 3
2
A1 11 3

6 4 1
3
18. A 0
1
2
1
3
2
19. Let A 35 5
, then A 0.

6

1 7 5 2 4
16
A1
16
3 11
8
98
Let A 3 1 2 , then A 0.
16 16 5 8 3
18 18
3

4 3 7 5 1
6 4 0 2
A 16 and A 1
1 Let A
5 8 6 7
, then A 0.
16
9 11 4 16
1
Conjecture: A1 A Conjecture: If A is an n n matrix, each of whose rows

add up to zero, then A 0 .
20. (a) Answers will vary.

0 4 1
00
3
A , B 0 0 7
0
0 0 0
(b) A2 0 so An 0 for n an integer ≥ 2.

0 0 28
B2 0 0 0
0 0 0
B3 0 so Bn 0 for n an integer ≥ 3.
(c) A4 0 if A is 4 4.
(d) Conjecture: If A is n n, then An 0.
Chapter 8 Practice Test
1. Put the matrix in reduced row-echelon form.
2
3
1 4
5 9
For Exercises 2–4, use matrices to solve the system of equations.
2. 3x 5y 13 2x 3y 3 2x y 3z 5
2x 5y 11

3. 4.
3x 2y 8 2x y 3z 0
3x 2y 1 3x y 3z 3

1 6

1 4 5
5. Multiply 0 7 .
2 0 3
1 2
2
4
9 1 6
6. Given A and B , find 3A 5B.
8 3 5
7. Find f A.
7
3 0
f x x2 7x 8, A
1
8. True or false:
A BA 3B A2 4AB 3B2 where A and B are matrices.
(Assume that A2, AB, and B2 exist.)
For Exercises 9–10, find the inverse of the matrix, if it exists.

1 1 1

1 2
9. 10. 3 6 5
3 5
6 10 8
11. Use an inverse matrix to solve the systems.

(a) 3x 2y 4 (b) 3x 2y 3
3x 5y 1 3x 5y 2
For Exercises 12–14, find the determinant of the matrix.

1 4 2 3
1

1 3
1 2

6 0 1 0
12. 13. 5 9 0 14.
3 4 3 5 1 1
6 2 5
2 0 6 1
Practice Test for Chapter 8 817

6 4 3 0 6
0 5 1 4 8
15. Evaluate 0 0 2 7 3 . 16. Use a determinant to find the area of the triangle with
0 0 0 9 2 vertices 0, 7, 5, 0, and 3, 9.
0 0 0 0 1
17. Find the equation of the line through 2, 7 and 1, 4.
For Exercises 18–20, use Cramer’s Rule to find the indicated value.
18. Find x. 19. Find z. 20. Find y.
2x 5y 11 45.9x 105.6y 19.85

6x 7y 4 3x z1 721.4x 29.1y 33.77
y 4z 3
xy 2

Matrices and Determinants Chapter Covers Systems of Equations, Operations, Inverses & Applications

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Matrices and Determinants Chapter Covers Systems of Equations, Operations, Inverses & Applications

Caricato da

Copyright:

Formati disponibili

C H A P T E R 8

Matrices and Determinants

Section 8.1 Matrices and Systems of Equations . . . . . . . . . . . . 719

Section 8.2 Operations with Matrices . . . . . . . . . . . . . . . . . . 737

Section 8.3 The Inverse of a Square Matrix . . . . . . . . . . . . . . 750

Section 8.4 The Determinant of a Square Matrix . . . . . . . . . . . . 765

Section 8.5 Applications of Matrices and Determinants . . . . . . . . 777

Review Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 790

Problem Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 810

Practice Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 816

2xx 2y3y 74 7x8x 5y3y 20

31 10 1 0

2x2x 6y3y 167

Solution: 9, 13 Solution: 1, 4

The system is inconsistent and there is no solution.

71. Use the reduced row-echelon form feature of a graphing utility.

72. Use the reduced row-echelon form feature of a graphing utility.

73. Use the reduced row-echelon form feature of a graphing utility.

74. Use the reduced row-echelon form feature of a graphing utility.

75. Use the reduced row-echelon form feature of a graphing utility.

86. x amount at 9%, y amount at 10%, 87. y ax2 bx c

88. f x ax2 bx c

(c) For 2003, t 13.

92. (a) x1 x2 300 (b) When x2 200 and x3 50,

x1 100, x2 200, x3 50, x4 0, x5 350

93. False. It is a 2 4 matrix.

98. 1. Interchange two rows. 99. They are the same.

103. f x 2x1 104. gx 3x2

105. hx lnx 1 y

106. f x 3 ln x ⇒ y 3 ln x ⇒ e y3 x y

Section 8.2 Operations with Matrices

3 22 13 14 2

11 7 6 0 11 8 5 7 5

11 22 440

25. X 32A 12B 32 1 0 12 2 0 32 0 1 0 2

27. A is 3 2 and B is 3 3. AB is not possible. 28. A is 2 4, B is 2 2. AB is not possible.

38. A is 3 3, B is 4 2. AB is not possible. 39. A is 2 4 and B is 2 4 ⇒ AB is not possible.

15 18 249 417

1 12 21 11 28

1 20 13 20 13 3

1 3 31 13 33 11 10

1 11 13 13 11

71 71 72

61. (a) Farmer’s Fruit Fruit

(c) BA 3.50 6.00 125

Sales ($) Profit

Bicycled Jogged Walked

70. (a) Individual Family

71. True. 72. False. For most matrices, AB  BA.

For 73–80, A is of order 2 3, B is of order 2 3, C is of order 3 2 and D is of order 2 2.

ii 00 i0 0i 1

85. 3x2 20x 32 0 86. 8x2 10x 3 0

87. 4x3 10x2 3x 0 88. 3x 3 22 x2 45x 0

89. 3x3 12x2 5x 20 0 90. 2x 3 5x2 12x 30 0

5x 20y 45 5Eq.1 −4 −2 2

48x 18y 102 6Eq.1 5

48x 56y 216 8Eq.2 (−1, 3)

38y 114 Add equations. 2

Solution: 3, 1

Section 8.3 The Inverse of a Square Matrix

Solution: 2, 2 Solution: 1 1

Solution: 4, 8 Solution: 12, 10

Solution: 9, 13 Solution: 1, 4

88. f x ax2 bx c

103. f x 2x1 104. gx 3x2

(c) BA 3.50 6.00 125

71. True. 72. False. For most matrices, AB BA.

80. 2000ex5 400 81. log2 x 2 4.5 82. ln x lnx 1 0

x2 11x 30 x 2x2 10x 21 x2 10x 24

95. f x x3 2x 96. gx

0.4x 0.8y 1.6

16. Vertices: 0, 0, 4, 5, 5, 2

17. Vertices: 2, 3, 2, 3, 0, 4

18. Vertices: 2, 1, 1, 6, 3, 1

20. Vertices: 4, 5, 6, 10, 6, 1

21. Vertices: 2, 4, 2, 3, 1, 5

22. Vertices: 0, 2, 1, 4, 3, 5

23. Vertices: 3, 5, 2, 6, 3, 5

24. Vertices: 2, 4, 1, 5, 3, 2

31. Points: 3, 1, 0, 3, 12, 5

32. Points: 3, 5, 6, 1, 10, 2

33. Points: 2, 12 , 4, 4, 6, 3

34. Points: 0, 1, 4, 2, 2, 2

35. Points: 0, 2, 1, 2.4, 1, 1.6

36. Points: 2, 3, 3, 3.5, 1, 2

2 y 2 51 8 5y 0 25 3y 24 6y 10 0

39. Points: 0, 0, 5, 3

40. Points: 0, 0, 2, 2

41. Points: 4, 3, 2, 1

42. Points: 10, 7, 2, 7

43. Points: 2, 3, 2, 1

44. Points: 23, 4, 6, 12

x y 08965 19176 29406 27,988

Solution: 6, 4 Solution: 5, 12

Solution: 3142, 145 , 13

16 24 12 20 18 20

3 14 13 33 12 31 22

1 3 01 35 00 33

4 1 2 1 42 17 41 14

9x5x 2yy 2413

Solution: 36, 11

19x4x 2y9y 1047

26 71 57 2 Solution: 2, 4, 3