12 - HPW 13 Ism 06 PDF

Chapter 6
Apply It 6.1
4. A42 is the entry in the 4th row and 2nd column,

namely 0.
1. There are 3 rows, one for each source. There are

two columns, one for each raw material. Thus,
the size of the matrix is 3 2. Alternatively, she
could use a 2 3 matrix.
5. A32 is the entry in the 3rd row and 2nd column,

namely 4.
6. A34 is the entry in the 3rd row and 4th column,
namely 0.
2. The first column consists of 1s each

representing the 1 hour needed for each phase of
project 1. The second column consists of 2s for
each phase of project 2 and so on. In general the
7. A44 is the entry in the 4th row and 4th column,

namely 0.
nth column will consist of 2n s, each

representing the 2n hours needed for each phase
of project n. The time-analysis matrix is as
follows.
1 2 4 8 16
1 2 4 8 16
1 2 4 8 16
8. A55 is the entry in the 5th row and 5th column.
But A has only 4 rows and 4 columns. Thus a55

does not exist.
9. The entries of the third row are the numbers
arranged horizontally three rows down from the
top of the matrix A: 5, 4, 1, 0
Problems 6.1
1. a.
b.
c.
The size is the number of rows by the

columns. Thus A is 2 3, B is 3 3, C is
3 2, D is 2 2, E is 4 4, F is 1 2, G is
3 1, H is 3 3, and J is 1 1.
A square matrix has the same number of
rows as columns. Thus the square matrices
are B, D, E, H, and J.
A row vector (or row matrix) has only one

row. Thus F and J are row vectors.
e.
A column vector (or column matrix) has

only one column. Thus G and J are column
vectors.
3 4 5
4 5 6
0 6 7
0 0 8
11. a.
A is 2 3 and Aij = i + 2 j.
1 + 2(1) 1 + 2(2) 1 + 2(3)
2 + 2(1) 2 + 2(2) 2 + 2(3)
1 3 5
=
0 2 4
An upper triangular matrix is a square

matrix where all entries below the main
diagonal are zeros. Thus H and J are upper
triangular. A lower triangular matrix is a
square matrix where all entries above the
main diagonal are zeros. Thus D and J are
lower triangular.
d.
10. 2
0
b.
C is 2 4 and Cij = (i + j )2 .
(1 + 1)2
2
(2 + 1)
4 9
=
9 16
12. a.
(1 + 2)2
(1 + 3)2
(2 + 2)2 (2 + 3)2
16 25
25 36
(1 + 4)2
(2 + 4)2
B is 2 2 and Bij = (1)i j (i 2 j 2 ).

(1)11 (12 12 ) (1)12 (12 22 )
2 1 2
2
2 2 2
2
(1) (2 1 ) (1) (2 2 )
0 3
=
3 0
2. A has 4 rows and 4 columns. Thus the order of A

is 4.
3. A21 is the entry in the 2nd row and 1st column,
namely 6.
187
Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 6: Matrix Algebra
b.
ISM: Introductory Mathematical Analysis
T 2
2 5 3 0
5
19. AT = 0 3 6 2 =
3
7 8 2 1
D is 2 3 and Dij = (1)i ( j 3 ).

(1)1 (13 ) (1)1 (23 ) (1)1 (33 )
2 3
2 3
2 3
(1) (1 ) (1) (2 ) (1) (3 )
1 8 27
=
1 8 27
2 1 0
2 1 0
T
20. A = 1 5 1 = 1 5 1
0 1 3
0 1 3
13. 12 10 = 120, so A has 120 entries. For a33 ,
i = 3 = j, so a33 = 1. Since 5 2, a52 = 0. For

a10, 10 , i = 10 = j, so a10, 10 = 1. Since 12 10,
A and C are diagonal matrices.
21. a.
a12, 10 = 0.
All are them are triangular matrices.
b.
14. The main diagonal is the diagonal extending
from the upper left corner to the lower right
corner.
a.
b.
2 1 0
2 1 0
22. A = 1 5 1 = 1 5 1
0 1 3
0 1 3
T
2, 5, 3, 1
2
x ,
0 7
3 8
6 2
2
1
Since AT = A, the matrix of Problem 20 is

symmetric.
y, 1
1 7
T
1 0 1
0 0
23. AT =
=
7 0 9
1 9
15. A zero matrix is a matrix in which all entries are

zeros.
a.
0
0
0
0
0
0
0
0
0
b.
0
0
0
0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0
0
0
0
1 7
1 0 1
=A
( A ) = 0 0 =
7 0 9
1
9
T T
24. Equating corresponding entries gives 3x = 9,

2y 1 = 6, z = 7, and 5w = 15. Thus x = 3,
7
y = , z = 7, and w = 3.
2
25. Equating corresponding entries gives 6 = 6,
2 = 2, x = 6, 7 = 7, 3y = 2, and 2z = 7. Thus
2
7
x = 6, y = , z = .
2
3
16. If A is 7 9, then AT is 9 7.
26. Equating entries in the 3rd row and 3rd column

gives 7 = 8, which is never true, so there is no
solution.
6 3
6 2
=
17. AT =
2 4
3 4
27. Equating corresponding entries gives 2x = y,

7 = 7, 7 = 7, and 2y = y. Now 2y = y yields y = 0.
Thus from 2x = y we get 2x = 0, so x = 0. The
solution is x = 0, y = 0.
2
4
T
18. AT = [ 2 4 6 8] =
6

8
28. [125 275

0.95
1.03
1.25
400]
188
29. a.
From J, the entry in row 3 (extreme) and

column 2 (white) is 1. Thus in January,
1 white extreme model was sold.
b.
From F, the entry in row 2 (deluxe) and

column 3 (blue) is 4. Thus in February,
4 blue deluxe models were sold.
c.
The entries in row 1 (regular) and column

4 (purple) give the number of purple regular
models sold. For J the entry is 0 and for F
the entry is 7. Thus more purple regular
models were sold in February.
d.
In January, there were

1 + 4 + 5 + 0 = 10 regular,
3 + 5 + 2 + 7 = 17 deluxe, and
4 + 1 + 3 + 2 = 10 extreme models sold. In
February, there were
2 + 5 + 7 + 7 = 21 regular,
2 + 4 + 4 + 6 = 16 deluxe, and
0 + 0 + 1 + 2 = 3 extreme models sold.
Thus, no model sold the same number of
units in both months.
In January, there were 1 + 3 + 4 = 8 red,
4 + 5 + 1 = 10 white, 5 + 2 + 3 = 10 blue,
and 0 + 7 + 2 = 9 purple models sold. In
February, there were 2 + 2 + 0 = 4 red,
5 + 4 + 0 = 9 white, 7 + 4 + 1 = 12 blue, and
7 + 6 + 2 = 15 purple models sold. Thus, no
color sold the same number of units in both
months.
e.
f.
g.
Section 6.2
31. By equating entries we find that x must satisfy
x 2 + 2000 x = 2001 and x 2 = x .

The second equation implies that x < 0. From the
first equation, x 2 + 2000 x 2001 = 0 ,
(x + 2001)(x 1) = 0, so x = 2001.
3 2
32.
1
4
5 6
3
33.
1
4
1 1
7 4
3 1
6 2
Apply It 6.2
120 80 110 140

3. T = J + F =
+
105 130 85 125

120 + 110 80 + 140 230 220
=
=
105 + 85 130 + 125 190 255

x1 40
248
4. 0.8 x2 30 = 2 319
x3 60
532
0.8 x1 40 496
0.8 x 30 = 638
2
0.8 x3 60 1064
In January a total of
3 + 5 + 2 = 7 = 17 deluxe models were sold.
In February a total of
2 + 4 + 4 + 6 = 16 deluxe models were sold.
Thus, more deluxe models were sold in
January.
0.8 x1 40 496
0.8 x 30 = 638
2
0.8 x3 60 1064
In January a total of 1 + 3 + 4 = 8 red

widgets were sold, while in February a total
of 2 + 2 + 0 = 4 red widgets were sold.
Thus, more red widgets were sold in
January.
Solve 0.8 x1 40 = 496 to get x1 = 670 .

Solve 0.8 x2 30 = 638 to get x2 = 835 .
Solve 0.8 x3 60 = 1064 to get x3 = 1405 .
Adding all entries in matrix J yields that a

total of 37 widgets were sold in January.
30. The sums of the entries in the columns are 680,

710, 1510, and 6690. The sum of the entries in
the rows are 680, 710, 1510, and 6690. The
amount an industry consumes is equal to the
amount of its output. Industry B has to increase
output by (0.20)(90) = 18 units and industry C
has to increase output by (0.20)(120) = 24 units.
All other producers have to increase it by
(0.20)(420) = 84 units.
189
Problems 6.2
2 + 2 0 + (3)
3 + 4
2 0 3 2 3 4
1. 1 4 0 + 1 6 5 = 1 + (1)
4+6
0 + 5
1 6 5 9 11 2
1 + 9 6 + 11 5 + (2)
4 3 1
= 2 10 5
10 5 3
2 + 7 + 2 7 + (4) + 7 11 4
2 7 7 4 2 7
2.
+
+
=
=
1 7 2 6 + (2) + 7
4 + 1 + 2 1 7
6 4 2
2 3 5 1 3 4
3. 5 9 9 0 = 4 9
9 2 3 2
6
4
1
6 2 4
4 2
1
2 10 12 = 12 2
4.
2
0 0
8 1 0
2
1 ( 2)
2
1 10
2
1 0
2
2 1 3
1 ( 12) = 1
5 6
2

0 4
1 8 0
2
1 6
2
5. 2[2 1 3] + 4[2 0 1] 0[2 3 1]

= [4 2 6] + [8 0 4] [0 0 0]
= [4 8 0 2 + 0 0 6 + 4 0]
= [4 2 10]
6.
[7
7 ] is a matrix and 66 is a number, so the sum is not defined.
1 2
7.
has size 2 2, and
3 4
7
has size 2 1. Thus the sum is not defined.
2
5 3
0 0 5 3 0 0 5 3
8.
+7
=
+
=
2 6
0 0 2 6 0 0 2 6
1 6 2 6(6) 6 7
6 1 12 36 42 6
2 6 7
9. 6
=
=
1 6 2 6 7
6 1 6 6 6(2) 42 6 36 12
7
1 1
6 9 1 1 18
2 0

3 2 6 = 2 0 6
10.
3 6
1 2 3 6 3

5 4 9 12
4 9
4
27 19 28
18 4 18
=
0
6 0

15 8 6
1 5 0
10 0 30 1 5 0 2 0 6 3 5 6
1
11. 2 7 0 + 0 5 0 = 2 7 0 + 0 1 0 = 2 8 0
5
4 6 10
5 20 25 4 6 10 1 4 5 5 10 15
190
Section 6.2
1 0 0 1 2 0 4 2 2 3
12. 3 0 1 0 3 0 2 1 3 21 9 = 0

1 0 0
0 0 1 0 0 1 0
3
= 0
0
= 12
9
0 0
3
3 0 3 3
0 3
0
0 0 9
3 0 9

0 3 0
12
6
72 30
3
0
4 2
23 10
1 1
12 6
69 30
3 3
2
2 1 4
13. 2C = 2
=
3 3 6 6
1 (5)
2 (6)
8 6 8 6
14. ( A B) =
=
=
3 2 3 (3)
1 0 1 0
0 0 2 0 2 0 0 0
15. 2(0) = 2
=
=
=0
0 0 2 0 2 0 0 0
2 (6) + (2) 1 (5) + (1) 6 5
16. A B + C =
=
3 2 + (3) 3 (3) + 3 2 3
2
4 2 18 15
1 6 5
22 17 66 51
17. 3(2A 3B) = 3 2

3
= 3
= 3
6 6 6 9
0 3 0 9
3 3 2 3
0 0
18. 0(2 A + 3B 5C ) =
0 0
19. 3(A C) is a 2 2 matrix and 6 is a number. Therefore 3(A C) + 6 is not defined.
1 2 + (6) 1 + (5) 2 + (8) 1 + (6) 6 5

2
20. A + (C + B) =
+
=
=
3
3
3 + (3) 3 + (1) 3 + 0 2 3
3 + 2
1
6 5 2
2 1
21. 2 B 3 A + 2C = 2
3
+ 2
2 3 3 3
3 3
3 4 2
12 10 6
=
4 6 9 9 6 6
18 13 4 2 22 15
=
+
=
3 6 6 11
9
5
7
6 3 12 10 6
22. 3C 2 B =
=
6 13 15
9 9 4
191
23.
24.
1
1
A + 3(2 B + 5C ) = A + 6 B + 15C
3
3
1 2
1
6 5
2 1
=
+6
+ 15
2
3
3 3 3
3 3
2
1
36 30 30 15
3 +
= 3
1 1 12 18 45 45
196 134
3
= 3
26
32
1
1
1
41 61
8 6 1
1
2
2 40 30
2
5
=
+
=
A 5( B + C ) =
3
13
3 5
3
3 3
1
0
0
2
2
2
2
2
2
4 4 12 12
25. 3( A + B) = 3
=
5 6 15 18
3 18 15 12 12
6
3 A + 3B =
+
=
9 9 6 9 15 18
Thus 3(A + B) = 3A + 3B.
5
10
26. (2 + 3) A = 5 A =
15 15
3 10
5
4 2 6
2 A + 3A =
+
=
6 6 9 9 15 15
Thus (2 + 3)A = 2A + 3A.
2k
27. k1 ( k2 A ) = k1 2
3k2
2k k
( k1k2 ) A = 3k1k2
k2 2k1k2
=
3k2 3k1k2
k1k2
3k1k2
k1k2
3k1k2
1 2
Thus k1 ( k2 A ) = ( k1k2 ) A.
2 1
6 5 2 1
28. k ( A 2 B + C ) = k
2
+
3
3
2 3 3 3
2
1 12 10 2 1
= k
+
+
3 3 4 6 3 3
2 + 12 2 1 + 10 1
=k
3 4 3 3 + 6 + 3
12 10
=k
4 6
12 k 10 k
=
4 k 6k
192
Section 6.2
2 1
6 5
2 1
2k
+k
kA 2kB + kC = k
3 3
2 3
3 3
k 12 k 10 k 2k k
2k
=
+
+
3k 3k 4 k 6 k 3k 3k
k + 10 k k
2k + 12k 2k
=
3
k
4
k
3
k
3k + 6k + 3k
12k 10 k
=
4k 6k
Thus k(A 2B + C) = kA 2kB + kC.
1 2 1 1 3 6 1 1 4 7
29. 3 A + D T = 3 0 1 + 2 0 = 0 3 + 2 0 = 2 3
7 0 1 2 21 0 1 2 20 2
T
0 3
0 3
1 3 1 0
=
30. ( B C ) =
=
4 1 1 2
3 3
3 3
T
8 3 3 1 5
1 4
1 1 2
31. 2 B T 3C T = 2
3
=
3 1
0 2 6 2 0 6 6 8
1 3 1 4 2 6 1 4 3 10
32. 2 B + B T = 2
+
=
+
=
4 1 3 1 8 2 3 1 11 3
1 2
T
1 2 1
1 3
33. A + DT B = 0 1 +
1 0 2
4 1
7 0
The computation is undefined, since B is not the same size as A and DT .
34.
D 2 AT
1 2 1
1 0 7
=
2
1 0 2
2 1 0
T
1 2 1 2 0 14
1 2 15
=
2
3 2
1 0 2 4 2 0
1 3
= 2 2
15 2
3
4
2
35. x y = 3
2
7

4
3x 4 y 6 3 x + 4 y 6

= =
=
2 x 7 y 12 2 x 7 y 12
Equating corresponding entries gives
3x + 4 y = 6
2 x 7 y = 12
193
2
x 10
39. 4 + 2 y = 24
6
4 z 14
2 + 2 x 10
4 + 2 y = 24
6 + 8 z 14
Multiply the first equation by 2 and the second

equation by 3 to get
6 x + 8 y = 12
6 x + 21 y = 36
Now add the two equations to get

29 y = 24
24
y=
29
Therefore
24 270
3x = 6 4 =
29 29
90
x=
29
90
24
The solution is x =
, y= .
29
29
2 + 2x = 10, 2x = 12, or x = 6.
4 + 2y = 24, 2y = 28, or y = 14.
6 + 8z = 14, 8z = 8, or z = 1.
Thus x = 6, y = 14, z = 1.
10
2
1
0
40. x 0 + 2 0 + y 2 =
6
2
6
5 2 x + 12 5 y
10
2x 2
2y
6
2 x + 12 5 y 2 x + 12 5 y
2 x 4 y 16
36.
=
5 x + 7 y 3
2 x 4 y 16
+
=
5 x 7 y 3
2
4 16
x + y =
5

7 3
2x 2 = 10, 2x = 12, or x = 6.
2y = 6 or y = 3.
2x + 12 5y = 2x + 12 5y, which is true for all
values of x and y. Thus x = 6, y = 3.
30 50 15 25
41. X + Y = 800 720 + 960 800
25 30 10
5
50 + 25 45
75
30 + 15
= 800 + 960 720 + 800 = 1760 1520

25 + 10
30 + 5 35
35
x
2
6
37. 3 3 = 4
y
4
2
3x + 6 24
=
3 y 12 8
3x + 6 = 24, 3x = 18, or x = 6.
4
3y 12 = 8, 3y = 4, or y = .
3
4
Thus x = 6, y = .
3
380 330 220 400

42. 2 B A = 2
460 320 750 450

2 380 2 330 2 220 400
=
2 460 2 320 2 750 450
x
2 4 x
=
38. 5 6
3

2 y 3 y
5 x 12 4 x
15 + 12 y = 3 y
760
=
920
360
=
470
4
5x 12 = 4x, 9x = 12, or x = .
3
5
15 + 12y = 3y, 9y = 15, or y = .
3
4
5
Thus x = , y = .
3
3
350 150
280 850
350 150
280 850
660 440 400 350 150
640 1500 450 280 850

310 290
360 650
43. P + 0.16 P
= [ p A pB pC pD ] + 0.16 [ p A pB pC pD ]
= [1.16 p A 1.16 pB 1.16 pC 1.16 pD ]
= 1.16 P
Thus P must be multiplied by 1.16.
194
Section 6.3
7. First, write the equations with the variable terms

on the left-hand side.
8
8
y + 5 x = 5
y + 1 x = 5
3
3
8
1 8
y
5
5
Let A =
, X = , and B = .
1
5
1
x
3
3
Then the pair of lines is equivalent to the matrix
1 8 y 8
5
5
equation AX = B or
= .
1
1 x 5
3
3
44. ( A B)T = [ A + (1) B]T [definition of subtraction]
= AT + [(1) B ]T [transpose of a sum]

= AT + (1) B T [transpose of a scalar multiple]
= AT B T [definition of subtraction]
15 4 26
45.
4 7 30
16 11 24
46.
16 3 36
10 22 12
47.
24 36 44
Problems 6.3
1. C11 = 1(0) + 3(2) + (2)(3) = 12
Apply It 6.3
5. Represent the value of each book by
[ 28 22 16] and the number of each book by
2. C21 = (2)(0) + (1)(2) + (1)(3) = 5
100
70 .

90
3. C32 = 0(2) + 4(4) + 3(1) = 19
The total value is given by the following matrix

product.
100
[ 28 22 16] 70 = [2800 + 1540 + 1440]
90
= [5780]
The total value is $5780.
5. C31 = 0(0) + 4(2) + 3(3) = 1
4. C33 = 0(3) + 4(2) + 3(1) = 11
6. C12 = 1(2) + 3(4) + (2)(1) = 8

7. A is 2 3 and B is 3 1, so AB is 2 1;
2 1 = 2 entries.
8. D is 4 3 and E is 3 2, so DE is 4 2;
4 2 = 8 entries.
6. The total cost is given by the matrix product PQ.

250
PQ = [ 26.25 34.75 28.50] 325
175
9. E is 3 2 and C is 2 5, so EC is 3 5;
3 5 = 15 entries.
10. D is 4 3 and B is 3 1, so DB is 4 1;
4 1 = 4 entries.
= [ 6562.5 + 11, 293.75 + 4987.5] = [22,843.75]

The total cost is $22,843.75.
11. F is 2 3 and B is 3 1, so FB is 2 1;
2 1 = 2 entries.
12. B is 3 1 and E is 3 2. Because the number of
columns of B does not equal the number of rows
of E, BE is not defined.
13. E is 3 2, E T is 2 3, and B is 3 1, so EE T B
is 3 1; 3 1 = 3 entries.
14. A is 2 3 and E is 3 2, so AE is 2 2. Thus
E(AE) is 3 2; 3 2 = 6 entries.
195
15. E is 3 2. F is 2 3 and B is 3 1, so FB is 2 1. Thus E(FB) is 3 1; 3 1 = 3 entries.

16. Both F and A are 2 3, so F + A is 2 3. Because B is 3 1, (F + A)B is 2 1; 2 1 = 2 entries.
1
0
17. I5 = 0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
1
1
0
0
18. I 6 =
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
2 4 4 0 2(4) + (4)(1) 2(0) + (4)(3) 12 12

19.
=
=
3(0) + 2(3) 10
6
3 2 1 3 3(4) + 2(1)
1 1
1(1) + 1(3) 1(2) + 1(4) 2 6
1 2
20. 0 4
= 0(1) + 4(3) 0(2) + 4(4) = 12 16
3 4
2 1
2(1) + 1(3) 2(2) + 1(4) 5 0
1
2 0 3 2(1) + 0(4) + 3(7) 23
21.
4 =
=
1 4 5 7 1(1) + 4(4) + 5(7) 50

0
1
22. [ 2 5 0 1] = [2(0) + 5(1) + 0(0) + 1(2)] = [3]
0

2
1 4 1 2 1
23. 0 0 2 0 1
2 1 1 1 1
1(2) + 4(0) + (1)1
= 0(2) + 0(0) + 2(1)
2(2) + 1(0) + 1(1)
0
1
2
1(1) + 4(1) + (1)(1) 1(0) + 4(1) + (1)(2) 1 4 2
0(1) + 0(1) + 2(1)
0(0) + 0(1) + 2(2) = 2 2 4
2(1) + 1(1) + 1(1)
2(0) + 1(1) + 1(2) 3 2 3
196
4 2 2 3 1 1
24. 3 10 0 0 0 0
1 0 2 0 1 0
4(3) + 2(0) + (2)(0)
= 3(3) + 10(0) + 0(0)
1(3) + 0(0) + 2(0)
12 2 4 2
= 9 3 3 0
3 3 1 2
Section 6.3
0
0
1
4(1) + 2(0) + (2)(1) 4(1) + 2(0) + (2)(0) 4(0) + 2(0) + (2)(1)
3(1) + 10(0) + 0(1)
3(1) + 10(0) + 0(0)
3(0) + 10(0) + 0(1)
1(1) + 0(0) + 2(0)
1(0) + 0(0) + 2(1)
1(1) + 0(0) + 2(1)
1 5 2 1
25. [1 2 5] 0 0 2
1
1 3
1 0
= [1 + 0 5 5 + 0 + 0 2 4 + 5 1 2 15]
= [4 5 1 18]
26. The first matrix is 1 2 and the second is 3 2, so the product is not defined.
1(1)
1(3) 0
1 3
1
1(0)
27. 4 [0 1 3] = 4(0) 4(1)
4(3) = 0
4 12

6
2
2(0) 2(1) 2(3) 0 2
0 1 1 0
28.

2 3 1 1
0(1) + 1(1)
=
2(1) + 3(1)
1 0 1 0 0 1 1 1 1
+
=
0 0 0 1 2 3 1 1 1
0(1) + 1(1) 0(1) + 1(1) 1 1 1
=
2(1) + 3(1) 2(1) + 3(1) 5 5 5
1
1 0 2
2 0 2
2
29. 3
+
1 1 2 3
5
3 1 1
1
2 0 2 2 0 4
= 3
+
3
3 1 1 2 2 4 5
2
4
6
2
4
6
1 2
1 2
4 0 6
12 0 18
= 3
3 4 = 15 3 9 3 4
5 1 3
5 6
5 6
12(1) + 0(3) + 18(5) 12(2) + 0(4) + 18(6) 78 84

=
=
15(1) + 3(3) + (9)(5) 15(2) + 3(4) + (9)(6) 21 12
197
1 1 1 0 1 0 0
30.
0 3 2 1 2 1 1
1(1) + (1)(2) 1(0) + (1)(1) 1(1) + (1)(2) 1(0) + (1)(1) 1(0) + (1)(1)
=
0(0) + 3(1)
0(1) + 3(2)
0(0) + 3(1)
0(0) + 3(1)
0(1) + 3(2)
= 3 1 3 1 1
6 3 6 3 3
1 2
1
1 2 2 0
1 2 2 + 0 + 3 4 + 0 + 0
31.
1 =

2

3 4 1 0 2 3 0 3 4 1 + 0 6 2 + 0 + 0
1 2 5 4 5 10 4 4 5 8
=
=
=
3 4 5 2 15 20 12 8 5 20
3 1 2 4 1 0 6 2
2 4 6 2 10 20 4 18
32. 2
5
=
5
=
2 0 6 2 0 1 4 0
6 2 4 0 30 10 34 10
0 0 1 x 0 x + 0 y + 1 z z
33. 0 1 0 y = 0 x + 1 y + 0 z = y
1 0 0 z 1 x + 0 y + 0 z x
a12 x1 a11 x1 + a12 x2

a
34. 11
=
a21 a22 x2 a21 x1 + a22 x2

x1
2 1 3 2 x1 + x2 + 3 x3
35.
x2 =
4 9 7 x 4 x1 + 9 x2 + 7 x3
3
2 3
2 x1 3x2
x
36. 0
1 1 = x2
x
2
1 2 2 x1 + x2
1
3
1
1
37. F DI = F D = 0
2
2
0 0 12

1 0 0
6

0 13 12
0
0
0 16

1 1 = 0 1 1
2 2
3
2

1 21 1 1 1
2
6
1 0 0 1 0 0 1 + 0 + 0 0 + 0 + 0 0 + 0 + 0 1 0 0
38. DD = 0 1 1 0 1 1 = 0 + 0 + 1 0 + 1 + 2 0 + 1 + 1 = 1 3 2
1 2 1 1 2 1 1 + 0 + 1 0 + 2 + 2 0 + 2 + 1 2 4 3
198
Section 6.3
1 1
3 0
1 2
2
39. 3 A 2 BC = 3
2 1 4 1 0 3
0
3
2 4
6
2
+
0
+
0
2
+
9
+
0
=
2
+
+
+
0
9
1
0
2
1
12
4
3 6 4 14 1 20
=
23
0 9 2 14 2
4 0 0
3 0
2
8 + 0 + 0 0 + 21 + 0 0 + 3 + 0
40. B( D + E ) =
0 7 1 =
1 4 1 1 2 4 4 + 0 + 1 0 28 + 2 0 4 + 4
21 3
8
=
5 26 0
1 0 0
3
3 0 0
2
2
1
41. 3I FE = 3I 0 6 0 0 6 0
3
3
0 0 1 0 0 3
3
1 3+ 0 + 0 0 + 0 + 0 0 + 0 + 0
3
2
1 6 + 0
0+0+0
0
0
0
= 3I
+
+
6
3
0 + 0 + 0 0 + 0 + 0 0 + 0 + 1 3
3
2 0 0 7
1 0 0 3 0 0 3
3
2
= 3I 0 1 0 = 0 3 0 0 23 0 = 0

3
0 0 1 0 0 3
0 0 23 0
0
7
3
7
3
1 0 0 1 0 0
1 1
3 0
2
42. CB( D I ) = 0 3
0 1 1 0 1 0
1 4 1

2 4
1 2 1 0 0 1
1(2) + 1(1) 1(3) + 1(4) 1(0) + 1(1) 0 0 0
= 0(2) + 3(1) 0(3) + 3(4) 0(0) + 3(1) 0 0 1
2(2) + 4(1) 2(3) + 4(4) 2(0) + 4(1) 1 2 2

3 7 1 0 0 0
= 3 12 3 0 0 1
0 10 4 1 2 0
3(0) 7(0) + 1(2)
3(0) 7(1) + 1(0)
3(0) 7(0) + 1(1)
= 3(0) 12(0) + 3(1) 3(0) 12(0) + 3(2) 3(0) 12(1) + 3(0)
0(0) 10(0) + 4(1) 0(0) 10(0) + 4(2) 0(0) 10(1) + 4(0)

1 2 7
= 3 6 12
4 8 10
199
1 0 0 1 1
1 + 0 + 0
43. ( DC ) A = 0 1 1 0 3 A = 0 + 0 + 2
1 2 1 2 4
1 + 0 + 2
2 + 3 1
1 1
1 + 0
1 2
= 2 7
= 2 + 0 4 + 21 = 2
0
3
1 11
1 + 0 2 + 33 1
1 + 0 + 0
0 + 3 + 4 A
1 + 6 + 4
5
17
31
1 1
3 0
2 + 0 + 0 2 + 9 + 0 1 2 2 7
2
44. A( BC ) = A
0 3 = A
3 1 7
1 + 0 + 2 1 12 + 4 0
1 4 1 2 4
2 2 7 + 14 0 21
=
=
0 + 3 0 21 3 21
45. Impossible: A is not a square matrix, so A2 is not defined.
1 0
1 1 0
1 1 0
=
46. AT A = 1 1
1 2 1
0
1
1
0 1 1
0 1
0 0
47. B 4 = 2 1
0 0
0 0
= 2 1
0 0
0 0
= 2 1
0 0
0 0
= 2 1
0 0
1 0 0 1
0 2 1 0 B 2
2 0 0 2
2 0 0 1
2 2 1 0 B
4 0 0 2
4 0 0 1
2 2 1 0
8 0 0 2
8
6
16
200
Section 6.3
0 2 0 0 2 0
48. A( B ) C = A 0 1 0 0 1 0 C
1 0 2 1 0 2
0 2 0
= A 0
1 0 C
2 2 4
0 2 0
1 1 0
=
1 0 C
0
0 1 1 2 2 4
1 0
0 3 0
=
2 1
2
1
4
0 1
T 2
6 3
=
4 5
1 0 0 1 0
1 1 0
0 1 0 2 1
49. ( AIC )T =
0 1 1

0 0 1 0 1
1
=
0
1
=
2
1
=
1
50. A
( 2C )
T
1 0
1 0
2 1
1 1

0 1
T
1
0
2
0
1 0
2 4 0
2 4 0
= 1 1
= 2 6 2
0
2
2
0 2 2
0 1
51.
( BA )
T
0 0 1 1 0
0 1
0 3 0
= 2 1 0 1 1 = 3 1 =
1 1 2
0 0 2 0 1
0
2
T
T 3 0
1 1 0
3 3 0
52. (3 A)T = 3
=
= 3 3
0
1 1
3 3
0
0 3
201
2
53. (2 I ) 2 2 I 2 = (2 I )2 2 I = 0
0
2 0 0 2 0 0 2
= 0 2 0 0 2 0 0
0 0 2 0 0 2 0
0 0 2 0 0
2 0 0 2 0
0 2 0 0 2
0 0 4 0 0 2 0 0 2 0 0
2 0 = 0 4 0 0 2 0 = 0 2 0
0 2 0 0 4 0 0 2 0 0 2
1 0 0
54. AT is 3 2, C T is 2 3, and B is 3 3, so AT C T B is 3 3 and ( AT C T B)0 = I = 0 1 0 .
0 0 1
1 1 0
55. A(I 0) = A(I) = AI. Since I is 3 3 and A has three columns, AI = A. Thus A( I 0) = A =
.
0 1 1
0 0 0
56. I 0 = I 0 = 0 = 0 0 0
0 0 0
T
1 0
1 1 0
2 1 ( AC )T
57. ( AC )( AC )T =
1 1
0
1
0
1
=
2
1
=
2
= 2
2
1 1
0 2
1 1
0 1
2
4
1
0
2
0
58. B 2 3B + 2 I
0 0 1 0 0 1
0
= 2 1 0 2 1 0 3 2
0 0 2 0 0 2
0
0 0 2 0 0 3 2
= 2 1 2 6 3 0 + 0
0 0 4 0 0 6 0
0 1
1 0 0
1 0 + 2 0 1 0
0 0 1
0 2
0 0
2 0
0 2
1 2 0 0 2 0
1
0 0
= 8 4 2 + 0 2 0 = 8 6 2
0 0 2 0 0 2 0 0 0
202
Section 6.3
1 1
62. E =
2 1
play/it/again/sam
16, 12, 1, 25/9, 20/1, 7, 1, 9, 14/19, 1, 13
1 1 16 28
2 1 12 = 44
1 1 1 26
2 1 25 = 27
1 1 9 29
2 1 20 = 38
1 1 1 8
2 1 7 = 9
1 1 1 10
2 1 9 = 11
1 1 14 33
2 1 19 = 47
1 1 1 14
2 1 13 = 15
The encoded message is 28, 44, 26, 27/29, 38/8, 9,
10, 11, 33/47, 14, 15.
59. AX = B
1
3
A=
x
X =
y
6
B=
5
The system is represented by
1 x 6
3
= .
2
y 5
60. AX = B
3 1 1
A = 1 1 1
5 1 2
x
X = y
z
2
B = 4
12
3 1 1 x 2
1 1 1 y = 4 .

5 1 2 z 12
55
63. [ 6 10 7] 150 = [6 55 + 10 150 + 7 35]
35
= [330 + 1500 + 245]
= [2075]
The value of the inventory is $2075.
61. AX = B
2 1 3
A = 5 1 2
3 2 2
r
X = s
t
9
B = 5
11
100
150
= [240, 000]
64. [ 200 300 500 250]
200
300
The total cost of the stocks is $240,000.
65. Q = [5 2 4]
5 20 16 7 17
R = 7 18 12 9 21
6 25 8 5 13
2500
1200
C = 800
150
1500

2 1 3 r 9
5 1 2 s = 5 .

3 2 2 t 11
203
5 2500 + 20 1200 + 16 800 + 7 150 + 17 1500

QRC = Q( RC ) = Q 7 2500 + 18 1200 + 12 800 + 9 150 + 211500
6 2500 + 25 1200 + 8 800 + 5 150 + 13 1500
75,850
= [5 2 4] 81,550
71, 650
= [5(75,850) + 2(81,550) + 4(71, 650)]
= [828,950]
The total cost of raw materials is $828,950.
66. a.
b.
3500 50
5 20 16 7 17 1500 50
RC = 7 18 12 9 21 1000 100
6 25 8 5 13 250 10
3500
0
17,500 + 30, 000 + 16, 000 + 1750 + 59,500 250 + 1000 + 1600 + 70 + 0
= 24,500 + 27, 000 + 12, 000 + 2250 + 73,500 350 + 900 + 1200 + 90 + 0
21, 000 + 37,500 + 8000 +1250 + 45,500
300 + 1250 + 800 + 50 + 0
124, 750 2920
= 139, 250 2540

113, 250 2400
124, 750 2920
QRC = Q( RC ) = [ 5 7 12] 139, 250 2540
113, 250 2400
= [ 623, 750 + 974, 750 + 1,359, 000 14, 600 + 17, 780 + 28,800]
= [ 2,957,500 61,180]
c.
67. a.
1
QRCZ = (QRC ) Z = [ 2,957,500 61,180] = [2,957,500 + 61,180] = [3,018,680]
1
Amount spent on goods:
10, 000
coal industry: DC P = [ 0 1 4] 20, 000 = [180, 000]
40, 000
10, 000
elec. industry: DE P = [ 20 0 8] 20, 000 = [520, 000]
40, 000
10, 000
steel industry: DS P = [30 5 0] 20, 000 = [400, 000]
40, 000
The coal industry spends $180,000, the electric industry spends $520,000, and the steel industry spends
$400,000.
204
Section 6.3
10,000
consumer 1: D1P = [3 2 5] 20, 000 = [270, 000]
40, 000
10, 000
consumer 2: D2 P = [ 0 17 1] 20, 000 = [380, 000]
40, 000
10, 000
consumer 3: D3 P = [ 4 6 12] 20, 000 = [640, 000]
40, 000
Consumer 1 pays $270,000, consumer 2 pays $380,000, and consumer 3 pays $640,000.
b.
From Example 3 of Sec. 6.2, the number of units sold of coal, electricity, and steel are 57, 31, and 30,
respectively. Thus the profit for coal is 10,000(57) 180,000 = $390,000, the profit for elec. is
20,000(31) 520,000 = $100,000, and the profit for steel is 40,000(30) 400,000 = $800,000.
c.
From (a), the total amount of money that is paid out by all the industries and consumers is
180,000 + 520,000 + 400,000 + 270,000 + 380,000 + 640,000 = $2,390,000.
d.
The proportion of the total amount in (c) paid out by the industries is
180, 000 + 520, 000 + 400,000 110
=
.
2,390, 000
239
The proportion of the total amount in (c) paid by consumers is
270, 000 + 380, 000 + 640, 000 129
=
.
2,390, 000
239
68. (A + B)(A B) = A(A B) + B(A B) [dist. prop.]
= A2 AB + BA B 2 [dist prop.]
= A2 BA + BA B 2 [AB = BA, given]
= A2 B 2
1 2 2 3 1(2) + (2)(1) 1(3) + 2

=
69.
3
1 2 1 2 1(2) + 2(1) 1(3) + 2
a 0 0
d 0
70. Let D1 = 0 b 0 and D2 = 0 e
0 0 c
0 0
a.
a
D1D2 = 0
0
d
D2 D1 = 0
0
0 0 d 0
b 0 0 e
0 c 0 0
0 0 a 0
e 0 0 b
0 f 0 0
( 32 ) = 0
( 32 ) 0
0
0
0
0 .
f
0 ad
0 = 0
f 0
0 ad
0 = 0
c 0
0 0
be 0
0 cf
0 0
be 0
0 cf
Both D1D2 and D2 D1 are diagonal matrices.

205
b.
From part (a), D1D2 = D2 D1 . Thus D1 and

D2 commute. [In fact, all n n diagonal
matrices commute.]
1 0 0 5
9 R +R
13
3
1
> 0 1 0 2
6
13 R 3 + R 2
0 0 1 1
Thus there should be 5 blocks of A, 2 blocks of
B, and 1 block of C suggested.
9.8
72.82
71.
51.32 36.32
9. Let x be the number of tablets of X, y be the

number of tablets of Y, and z be the number of
tablets of Z. The system is
40x + 10y + 10z = 180
20x + 10y + 50z = 200
10x + 30y + 20z = 190
Reduce the augmented coefficient matrix of the
system.
40 10 10 180
20 10 50 200
10 30 20 190
23.994 20.832 12.648

72.
7.44 168.64
26.164
64.08
15.606
73.
739.428 373.056
54.06
11.952
74.
86.496 278.648
Apply It 6.4
10 30 20 190
R1 R3
> 20 10 50 200
40 10 10 180
1 3 2 19
1 R
10 1
> 2 1 5 20
1 R
10 2
4 1 1 18
1 R
3
10
8. The corresponding system is

6 A + B + 3C = 35
3 A + 2 B + 3C = 22
A + 5B + 3C = 18

system.
6 1 3 35
3 2 3 22
1 5 3 18
3 2 19
1
2R1 + R 2
1 18
> 0 5
4R1 + R3
0 11 7 58
1 5 3 18
R1 R3
> 3 2 3 22
6 1 3 35
5
3 18
1
3R1 + R 2
> 0 13 6 32
6R1 + R 3
0 29 15 73
5
3 18
1
1 R
13
2
6
32
> 0
1
13
13
0 29 15 73
9
74
1 0
13
13
5R 2 + R1
6
32
> 0 1 13
13
29R 2 + R3
0 0 21 21
13
13
1 0 9 74
13 13
13
21 R3
6
32
> 0 1 13
13
0 0 1 1
3
2 19
1
18
1 15
> 0
5
0
11
7
58
13
41
1 0
5
5
3R 2 + R1
18
1
> 0 1 5
5
11R 2 + R3
0 0 46 92
5
5
13
41
1 0
5
5
5 R
46
3
> 0 1 15 18
5
0 0
1 2
15 R 2
1 0 0 3
13
R + R1
5 3
> 0 1 0 4
1R +R
2
5 3
0 0 1 2
She should take 3 tablets of X, 4 tablets of Y,
and 2 tablets of Z.
206
Section 6.4
10. Let a, b, c, and d be the number of bags of foods

A, B, C, and D, respectively. The corresponding
system is
5a + 5b + 10c + 5d = 10, 000
10a + 5b + 30c + 10d = 20, 000

5a + 15b + 10c + 25d = 20, 000
Problems 6.4
1. The first nonzero entry in row 2 is not to the
right of the first nonzero entry in row 1, hence
not reduced.
2. Reduced.

system.
5 5 10 5 10, 000
10 5 30 10 20, 000
5 15 10 25 20, 000
3. Reduced.
4. In row 2, the first nonzero entry is in column 2,
but not all other entries in column 2 are zeros,
hence not reduced.
2000
1 1 2 1
> 10 5 30 10 20, 000

5 15 10 25 20, 000
1
2000
1 1 2
10R1 + R 2
0
> 0 5 10 0
5R1 + R 3
0 10 0 20 10, 000
1
2000
1 1 2
15 R 2
0
> 0 1 2 0
0 10 0 20 10, 000
5. The first row consists entirely of zeros and is not

below each row containing a nonzero entry,
hence not reduced.
1R
5 1
6. The first nonzero entry of row 2 is to the left of

the first nonzero entry of row 1, hence not
reduced.
3
1 3 4R1 + R 2 1
7.
>
4
0
0
12
1 R
12
2
1
>
0
3R 2 + R1
>
1
2000
1 0 4
R 2 + R1
0
> 0 1 2 0
10R 2 + R 3
0 0 20 20 10, 000
0 0 4 0 2000
1 R
20 3
0
> 0 1 2 0
0 0
1 1 500
0
1 0 0 3
4R3 + R1
> 0 1 0 2 1000
2R 3 + R 2
0 0 1 1 500
This reduced matrix corresponds to the system
a 3d = 0
b + 2d = 1000
c + d = 500
1
1 0
0 1
0 3 0 2 R1 R 2 1 5 0 2

8.
1 5 0 2
0 3 0 2
1
R2 1 5 0
2
3
0 1 0 2
3
16
5R 2 + R1 1 0 0
3
0 1 0 23
2 4 6
1 2 3
R1 R3
9. 1 2 3
> 1 2 3
1 2 3
2 4 6
1 2 3
R1 + R 2
> 0 0 0
2R1 + R 3
0 0 0
Letting d = r, we get the general solution of the

system:
a = 3r
b = 2r + 1000
c = r + 500
d=r
Note that a, b, c, and d cannot be negative, given
the context, hence 0 r 500. One specific
solution is when r = 250, then a = 750, b = 500,
c = 250, and d = 250.
207
3
2
1 6
R1 R 2 >
10.
4
8
1 7
2
1
11.
1
1 6 2R + R
1
2
2
3
4R
+
R
1
3
>
4
8 R1 + R 4
1 7
1
0
6
1 R
15 15
2
>
32
13
1
1 7 2 3
3 R1 R 2 2 3 4 1
>
1 4 2 0
0
0
0 1 1 0
7
1 7 2 3 R1 + R 3
1
0 1 1 0
0
1
2R1 + R 4>
1 4 2 0
0 11
2 3 4 1
0 11
3 4
7 2
4 2
1 1
R4 R2
>
R3 + R 4
11R 2 + R 3 1
0
7R 2 + R1
>
0
0
5R 3 + R1
R 3 + R 2
4R 3 + R 4
>
0 5
3
1
1 0 17 R 3
>
0 7
3
0
4 2
0 0
1 0
0
0 0
6
7
3
7
73
72
1
0
0
1
0
3
0
4
3
0 5
0 5
0
0
72 R 4 0
>
0
1 6 6R + R
2
1
0
32R
+
R3
2
>
0 32 13R 2 + R 4
0 13
1
0
1 73
4 2
1
0
0
6
7
3
7
73
0 0
1 0
0
0 0
67 R 4 + R1
73 R 4 + R 2
3R
7 4
+ R3
0 0
2 0
12.
0 1
0 4
1
0
>
0
0
1
0
0
2
3 R1 R 2
>
0
R 2 0
>
0
0
0
0
0
1
2 0
0 0
0 1
0 4
1 0
3
1R
2 2 1 0 0
>
0
0 1
1
0 4
1 0 4R 2 + R 4 0
>
0 2
0
0
4 1
0
3
2
0
0
1
0
3
2
1 0
2
0 1
0
3
2
1 0
2 R 2 R 3 0 1
>
0
0 0
0 4
1
1R
2 3> 0
0
0
3
2
1 0
1
0 1
0
3
2
2
1
1
+ R1 0
>
0
R 3 + R 4
23 R 3
0 0
1 0
0 1
0 0
208
Section 6.4
2 7 50 1 3 10
13.
1 3 10 2 7 50
10
3 10 1 3
1
30
0 13 30 0 1 13
1 0 220
13
30
0 1 13
220
30
Thus x =
and y = .
13
13
1 0 2
1 3 11
1 3 11 1 3 11
5
14.
0 15 53
53
53
0
1
4
3
9
0 1 15

15
2
53
.
Thus x = , y =
5
15
4
1 1
1 1 4
1 1
4
3 1 4
3 1
3
3
3 3
3
15.
0 0 14
0 0 1
0 0
12 4 2
0 0 14
The last row indicates 0 = 1, which is never true, so there is no solution.
3 2 1 1 1 2
16.
1 2 3 1 3 2
1
3 1
1 2
0 4 10 4
0
3
1
2 3
1 25
1
1 2 3 1
1
3 2 1 1
1
1
1 0 2
,
5
1
0 1 2 1
x 2z = 1
which gives
.
5
y + 2 z = 1
5
Thus, x = 2r + 1, y = r 1, z = r, where r is any real number.
2
1 2 1
1 2 1 4
1 2 1 4
17.
0 1 1
3 0 2 5
0 6 1 7
6
1 0
4
7
0 1
2
3
1
6
5
3
7
6
x + 2 z = 5
3
3
.
which gives
7
1
y + 6 z = 6
2
5
1
7
Thus, x = r + , y = r + , z = r, where r is any real number.
3
3
6
6
2
1 1 0 13
1 3
1 3 2 1
1 3 2 1
2
18.
0 2 3 9
3 9
3
0
1
1
1
5
10
0
1
2
2
13
29
3
9
Thus x = r + , y = r , z = r, where r is any real number.
2
2
2
2
29
2
92
209
9
1 3 0 1 0
8
1 3 0
1 3 0
3
3
1 8 0 1
19. 2 2 3 0 8 3 0
8
5 1 1
0 14 1
0 14 1 0 0 17
4
17
From the third row, 0 = , which is never true, so there is no solution.
4
1 0 33
9
4
9 1 4
13
1 4 9 1
21 0 1 21
20. 3 1 6 0 13 21 0
1 13
13
14
1 1 2 0 5 7 0 5 7
0
0
13
14
The last row indicates that 0 = , which is never true. There is no solution.
13
1 3 0 2
1 3 0 2
1 0 0 2
21. 2 7 0 4 0 1 0 0 0 1 0 0
1 5 1 5
0 2 1 3
0 0 1 3
Thus, x = 2, y = 0, and z = 3.
7
1 1 1 7
1 1 1
1
22. 2 3 2 4 0 5 0 10 0
1 1 5 23
0 2 4 16
0
1 0 1 5 1 0 1 5
1
0 1 0 2 0 1 0 2 0
0 0 4 20 0 0 1 5
0
Thus x = 0, y = 2, z = 5.
2 0 4 8 1 0
1 2 2 14 1 2
23.
1 1 2 1 1 1

1 1 0 3
1
3
4
1 0 2
1
0
0
1 0 5
0 2 0 10
0
1 7 12
0
0
Thus x = 2, y = 5, z = 1.
7
0 2
4 16
0
2
5
1 1
1
2
0 0
1 0
0
4
4
1 0 2
2 14
0 2 0 10
0
2 1
1 0 5
1 0
1 7 12
0
2
4
1
0
0 5
0
0
0
7 7
0
4
1
0
0 5
0
1 1
0 0
0
0 2
0 2
0
0
0
0
1 0 3 1
1 0 3 1 1 0 3 1
1
3 2 11 1
0 2 2 4 0
0
1 1 2
24.
1 1 4
0
0
1
1 1 2 0
1 1 2
2 3 3 8
0 3 3 6 0 3 3 6
0
Thus x = 3r 1, y = r + 2, z = r, where r is any real number.
2
1 0 5
0 1 1
0 0 0
0 0
0 3 1
1 1 2
0 0 0
0 0 0
210
Section 6.4
1 1 1 1 1 0 1 1 1 1 1 0
1 1 1 1 1 0 0 2 0 0 0 0
25.
1 1 1 1 1 0 0 2 2 0 0 0
1 1 1 1 1 0 0 2 2 2 0 0
1 1 1 1 1 0 1 0 1 1 1 0
0 1 0 0 0 0 0 1 0 0 0 0
0 2 2 0 0 0 0 0 2 0 0 0
0 2 2 2 0 0 0 0 2 2 0 0
1 0 1 1 1 0 1 0 0 1 1 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 2 2 0 0 0 0 0 2 0 0
1 0 0 1 1 0 1 0 0 0 1 0
0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0 1 0 0
Thus, x1 = r , x2 = 0, x3 = 0, x4 = 0, and x5 = r , where r is any number.
1
1
1 1 1 1 0 1 1
1 1 1 1 0 0
0 0 2
26.
0 2 2
1 1 1 1 0 0
1 1 1 1 0 0 2 2 0
1
0
0
0
1
0
0
0
Thus,
1 0 1 0 0
1
0 0 0 1 1 0
1
2 0 0 0 1
2 0 0 0 0 2
1 0 1 0 0 0 0
0 0 0 1 0 0 0
1 0 0 0 1 0 0
1 0 0 0 0 1 0
x1 = 0, x2 = 0, x3 = 0, and x4 = 0.
0
1
0
0
0
1
0
0
0
1
2
0
0
0
1
0
0 1
1
1 1
0 0 2 2 0
0 0 0 2 2
0 0 0
0 2
0 1
0 0
0 0
0 0
0
1
0
0
0
1
0 0
1
1
0 2
0 1
0 0
0 0
0 0
1
1 1
1
1 0
0 2 2
0
0 2
0
0
0
0
0
0
0
0
27. Let x = federal tax and y = state tax. Then x = 0.25(312,000 y) and y = 0.10(312,000 x). Equivalently,
x + 0.25 y = 78, 000
0.10 x + y = 31, 200.

0.25 78, 000 1 0.25 78, 000
1 0.25 78, 000 1 0 72,000
1

1
31, 200 0 0.975 23, 400
1
24, 000 0 1 24, 000
0
0.10
Thus x = 72,000 and y = 24,000, so the federal tax is $72,000 and the state tax is $24,000.
28. x = no. of units of A to be sold and y = no. of units of B to be sold. Then x = 1.25y and 8x + 11y = 42,000.
Equivalently,
x 1.25 y = 0,
8 x + 11y = 42, 000.

0 1 1.25
0
0 1 0 2500
1 1.25
1 1.25

11
42, 000 0
21
42, 000
1
2000 0 1 2000
0
8
Thus x = 2500 and y = 2000, so 2500 units of A and 2000 units of B must be sold.
211
29. Let x = number of units of A produced, y = number of units of B produced, and z = number of units of C
produced. Then
no. of units: x + y + z = 11,000
total cost: 4x + 5y + 7z + 17,000 = 80,000
total profit: x + 2y + 3z = 25,000
Equivalently,
x + y + z = 11, 000
4 x + 5 y + 7 z = 63,000
x + 2 y + 3z = 25, 000
1 1 1 11, 000 1 1 1 11, 000

4 5 7 63, 000 0 1 3 19, 000
1 2 3 25, 000 0 1 2 14, 000

1 0 2 8, 000 1 0 2 8, 000
1 0 0 2000
0 1 3 19, 000 0 1 3 19, 000 0 1 0 4000

0 0 1 5, 000 0 0
0 0 1 5000
1 5, 000
Thus x = 2000, y = 4000, and z = 5000, so 2000 units of A, 4000 units of B and 5000 units of C should be
produced.
30. Let x = number of desks to be produced at the East Coast plant and y = number of desks to be produced at the
West Coast plant. Then x + y = 800 and 90x +20,000 = 95y + 18,000.
Equivalently,
x + y = 800
90 x 95 y = 2000.
1
800 1
1
800 1 1 800 1 0 400
1
90 95 2000 0 185 74, 000 0 1 400 0 1 400

x = 400 and y = 400
Thus the production order is 400 units at the East Coast plant and 400 units at the West Coast plant.
31. Let x = number of brand X pills, y = number of brand Y pills, and z = number of brand Z pills. Considering the
unit requirements gives the system
2 x + 1y + 1z = 10 (vitamin A)
3 x + 3 y + 0 z = 9 (vitamin D)
5 x + 4 y + 1z = 19 (vitamin E)
1 1
2 1 1 10
2
3 3 0 9 3 3
5 4 1 19
5 4
1
5
0 9 0
1 19
0
1
2
1
2
3
2
3
2
1
2
32
32
1
1 1
5 1 0 1 7
2
2
0 1 1 4 0 1 1 4
0 0 0 0 0 0 0 0
x = 7 r
Thus y = r 4 where r = 4, 5, 6, 7.
z = r
The only solutions for the problem are z = 4, x = 3, and y = 0; z = 5, x = 2, and y = 1; z = 6, x = 1, and y = 2; z = 7,
x = 0, and y = 3. Their respective costs (in cents) are 15, 23, 31, and 39.
212
Section 6.4
a.
The possible combinations are 3 of X, 4 of Z; 2 of X, 1 of Y, 5 of Z; 1 of X, 2 of Y, 6 of Z; 3 of Y, 7 of Z.
b.
The combination 3 of X, 4 of Z costs 15 cents a day.
c.
The least expensive combination is 3 of X, 4 of Z; the most expensive is 3 of Y, 7 of Z.
32. Let x, y, and z be the numbers of units of A, B, and C, respectively.

3 x + 1y + 2 z = 490 (machine I)
1x + 2 y + 1z = 310 (machine (II)

2 x + 4 y + 1z = 560 (machine III)
3 1 2 490 1 2 1 310
1 2 1 310 3 1 2 490
2 4 1 560 2 4 1 560
1 2 1 310
1 2 1 310
88
0 5 1 440 0 1 15
0 0 1 60
0 0 1 60
0
1
0
3
5
1
5
1
0 1
0 0
1 0
0 1
134 1 0 53 134

88 0 1 15 88

60 0 0 1 60

98
76
60
x = 98, y = 76, z = 60
Thus, 98 units of A, 76 units of B, and 60 units of C should be produced.
33. a.
Let s, d, and g represent the number of units of S, D, and G, respectively. Then

12 s + 20d + 32 g = 220 (stock A)
16 s + 12d + 28 g = 176 (stock B)

8s + 28d + 36 g = 264 (stock C)
12 20 32 220
16 12 28 176
8 28 36 264
1 7
2
R1 R3
> 4 3
3 5
( 14 ) R1>
( 14 ) R2
( 18 ) R3
3 5
4 3
7
1 2
8 55
7 44
9 33
33
7 44
8 55
9
2
7
9
1
33
2
2
4R1 + R 2
> 0 11 11 88
3R1 + R3
11
11
0 2 2 44
1 R
11
2
7
9
1
33
2
2
> 0
1
1
8
11
11
0 2 2 44
213
1 0 1 5
27 R 2 + R1
> 0 1 1 8
11 R + R
3
2 2
0 0 0 0
Thus s = 5 r, d = 8 r, and g = r, where r = 0, 1, 2, 3, 4, 5.
The six possible combinations are given by
COMBINATION
b.
Computing the cost of each combination, we find that they are 4700, 4600, 4500, 4400, 4300, and 4200
dollars, respectively. Buying 3 units of Deluxe and 5 units of Gold Star (s = 0, d = 3, g = 5) minimizes the
cost.
Apply It 6.5
11. Write the coefficient matrix and reduce.
1 3 4
5 3 4 1
5 5
6 8 7 5 R1> 6 8 7 6R1 + R 2>
3R1 + R3
3 1 2
3 1 2
3
1
5
0 22
5
0 4
5
4
5
11
5
25
3
4
1
1 0 1
5
5 3
2
5 R 2 + R1
1
1
0
1
> 0 1 2
2 4 R + R
2
3
5
0 4 2
0 0 0
5
5
The system has infinitely many solutions since there are two nonzero rows in the reduced coefficient matrix.
1
x+ z =0
2
1
y+ z =0
2
1
1
Let z = r, so x = r and y = r , where r is any real number.
2
2
5 R
22 2>
Problems 6.5
1 1 1 9 3 1 1 1 9 3 1 1 1 9 3 1 1 1 9 3
1. 2 3 2 15 12 0 1 4 33 18 0 1 4 33 18 0 1 4 33 18
2 1 2 5 8 0 1 4 23 14 0 0 8 56 32 0 0 1 7 4
1 1 0 2 1 1 0 0 7 1
0 1 0 5 2 0 1 0
5 2
0 0 1 7 4 0 0 1 7 4
Thus w = 1 + 7r, x = 2 5r, y = 4 7r, z = r (where r is any real number).
214
1 10 15 5 1 5
2
1
2. 1 5 2 15 10 2

1
1
6
12
9
1
1

1
1 5 2 15 10
0 11 6 15 15 0
0 6 4 3 19
0
1
0
1
0
1
0
0
1
0
Thus, w =
2
10
6
5
1
6
Section 6.5
15 10
15 5
12
9
2
15 10
6 15
15
11
11
11
4 3 19
90 35
1 0 52
35
11
11
11
11
15 0 1 6 15
15
11
11
11
11
119
57
119
0 0 1
11
8
8
147
2
0
27
0
119
1
8
51 147
21
27
57
119
, x= r , y= r+
, z = r (where r is any real number).
r
2
2
4
4
8
8
52
11
6
11
8
11
90
11
15
11
57
11
51
2
21
4
57
8
1 1 1 1 2
3 1 3 1 2
3
3
3
2 2 6 6 4
3.
2 1 3 2 2
2 1 3 2 2
1 3 7
2
3
3
1 3
7
2
1 1 1 1 2
1 1 1 1 2
3
3
3
1 0 0 1 0
3
3
3
0 1 3 4 2
16
8
4
0
4 3 3
0
1 3
4
2
1 1 4 2
0
0
0
0
0
0 1 1 4 2
0
3
3
3
3
3
3
0 0 0 0 0
2 6
8
4
0
2 6
8
4
0
Thus, w = s, x = 3r 4s + 2, y = r, z = s (where r and s are any real numbers).
5 1 1 1 0
5 1
5 1 1
1 1 0
1 1 0
0
1 0 1 2 1 0 1 1 3 0
1
1
3 0 0

4.
1 3 4 7 1 0 4 4 12 0
0 4 4 12 0 0
1 1 3 0 0
1 1
3 0
1 1
3 0 0
0
0
Thus, w = r 2s + 1, x = r 3s, y = r, z = s (where r and s are any real numbers).
3 1 1 5 1 3
1 1 5 1 3 1 1 5 1
3 1 3 1
0 0 2 4 4 0 0 1 2 2 0
9 1 1 11 0 0 2 4 4 0 0 1 2 2 0
6 1 4 4 0 0 3 6 6 0 0 1 2 2 0
Thus, w = 3r s + 3, y = 2s + 2, x = r, z = s (where r and s are any real numbers).
1
1
5.
3
2
2
3
0
0
1
0
0
0
1
1 2
0 0
0 0
3
2
0
0
0 1
1 1
0 0
0 0
3
0
0
0
215
2
4
1 1
2 4 1
1
1 1 1 2 4 1 1 1
1 2 2 7 0 1 0 2 1
1 0
2
1 0
0
6. 1 2 1 4 5 0
1 0
2
1 0
1 0
2
1 0

3 2 3 4 7 0 5 0 10 5
0 5 0 10 5 0
4 3 4 6 9 0 7 0 14 7
0 7 0 14 7 0

Thus, w = r + 3, x = 2s + 1, y = r, z = s (where r and s are any real numbers).
0
1
0
0
0
1
0
0
0
0
0
2
0
0
0
3
1
0
0
0
4 3 5 10 11 8 0 5 5 10 5 20
7.
1 5
0 3 6 2
1 5
0 3
6
2
1 5
0 3
6 2 1 5 0 3 6
2
0 5 5 10 5 20 0 1 1 2 1 4
2 0 4 2 4 2 1 0 2 1 2 1
0 1 1 2 1 4 0 1 1 2 1 4
Thus, x1 = 2r + s 2t + 1, x2 = r 2s + t + 4, x3 = r , x4 = s, x5 = t (where r, s, and t are any real numbers).
1 0
0
1
8.
2 2
1 2
1
1 0
0
0
1
0 2
3 10 15 10
3 2 2 2
0 2
1
1
4
1
1 0 3
0 1 1 2
0
0
0
0
0 0 1 4 7 8
0 0 0 7 16 19
0
72 33
18 17
Thus x1 = + r , x2 = r ,
7
7
7 7
3
1 2
1 2
0 3 2
0 3 0
1 1 0
0
1 0
0 0
x3 =
12
7
32
7
15
7
16
7
20 15
r,
7 7
1
3
1 0
0 1 1
0
0 0 1
8
3
0 0 2
12
7 1 0 0

38
0 1 0
7
20
0 0 1
7
0 0 0
19
7
19 16
x4 = r , and
7 7
1
0
4 7 8
1 2 3
0 33
72
7
7
17
18
0
7
7
15
20
0
7
7
16
19
1
7
7
1
x5 = r , where r is any real number.
9. The system is homogeneous with fewer equations than unknowns (2 < 3), so there are infinitely many solutions.
10. The system is homogeneous with fewer equations than unknowns (2 < 4), so there are infinitely many solutions.
5
5
3 4 1 5
1
1
1 0
11. 1 5 3 4 0 19 0
1 0 1 = A
4 1 4 1
0 21
0 21
0 0
A has k = 2 nonzero rows. Number of unknowns is n = 2. Thus k = n, so the system has the trivial solution only.
3
1
6
1 3 6
1 3
6
3 12
2
2
1 0 3
2
2
0 1 2 = A
0
13
1
2
12. 3 2 5 3 2 5 0 13
4
0 0 0
1 14
1 14
0 5 10
0 5 10
4
A has k = 2 nonzero rows. Number of unknowns is n = 3. Thus k < n, so the system has infinitely many solutions.
216
Section 6.5
1 1 1
1 1 1
1 1 1
1 0 1
13. 1 0 1 0 1 2 0
1 2 0 1 2 = A
1 2 5
0 3 6
0 3 6
0 0 0
A has k = 2 nonzero rows. Number of unknowns is n = 3. Thus k < n, so the system has infinitely many solutions.
1 2 2
1 2 2
3
3
3 2 2
1 0 0
1 0 0
3
3
2 2 2 2 2 0 23 23 0 1 1 0 1 0 = A
14. 2
0 4
0 0 1
0 0 1
5
5
0 4
5
0 4
A has k = 3 nonzero rows. Number of unknowns is n = 3. Thus k = n, so the system has the trivial solution only.
3
3 1 32 1
2
2 1 0
15.
0 1
5 7 5 7 0 29
2
The solution is x = 0, y = 0.
1 5
2 5
2 5
2
16.
0
0
8 20
0 0
5
The solution is x = r , y = r.
2
6
1 0
5
0 1 8
15
1 6 2
6 2
1 6 2
1
17.
0 1 8
2 3 4
0 15 8
15
6
8
The solution is x = r , y = r , z = r.
5
15
7
1
1
4
0 1
0
3
2
1
4 7
18.
2
2 3
7
4
7
4
1 0
1
0 1
1
1 1 0
1 1
1
1
19. 3 4 0 7 0
1 0 1
5 8
0 13
0 13 0 0
1 1
2
1 1 1
1
20. 1 1 2 1 1 2 0
1 1 1
2 1 1
0
1 0 0
1 0 0
1
0 1 1 0 1 1 0
0 0 3
0 0 1
0
The solution is x = 0, y = 0, z = 0.
1
2
1
0
1
0
1
1 1 1
1 1
1
1 0 1 1 0
1 1
1
1 0 2 1
0 2
0
0
217
1 1 1
1
1 1
1
0 7 14 0
1
2
0
21.
0 2 4 0 2 4
0
0 5 10 0 5 10
0
The solution is x = r, y = 2r, z = r.
0 1
1 2
0 0
0 0
7
7
1 1 7
1 1
1 1
1
1 1 1
0 2 8
0
0
1
4
22.
2 3 6
0 5 20
0 5 20
0
1 13
3
0 2 8
0 2 8
0
The solution is x = 3r, y = 4r, z = r.
0 3
1 4
0 0
0 0
4 1 1 1
4
1 1 1 4
1 1 1
1 1 0
0 0 1
0 1 1 4
5
1
23.
2
0 1 1 4 0 0 1
1 3 4
1
1 3 2 9
0 4 1 13 0 4 1 13
4
1
1 1 1
1 0 2 0
1 0 2 0
0
0
1 1
4
0 1 1 4
0 1 1 4
0
0 0 1
0 0 1 1
0 0
1
1 1
0
0 4 1 13
0 0 3 3
0 0 3 3
The solution is w = 2r, x = 3r, y = r, z = r.
7
7
1
1 1 2 7
1 1 2
1 1 2
0
1 2 1 1
0 3 3 6
0
1 1
2
24.
0
1 2 3 9
0
0
1 1
2
1 1
2
0
2 3 1 4
0 5 5 10
0 5 5 10
The solution is w = r 5s, x = r 2s, y = r, z = s.
2
1 0 3
0 1 1
0 0 0
0 0
0 1 5
1 1 2
0 0 0
0 0 0
Apply It 6.6
1 3 2 1.5 1 0
12.
2 4 1 0.5 0 1
Yes, they are inverses.
2 1.5 28 13 M
13.
= =
1 0.5 46 5 E
2 1.5 65 5 E
= =
1 0.5 90 20 T
2 1.5 61 1 A
= =
1 0.5 82 20 T
2 1.5 59 14 N
= =
1 0.5 88 15 O
2 1.5 57 15 O
= =
1 0.5 86 14 N
2 1.5 60 6 F
= =
1 0.5 84 18 R
218
Section 6.6
2 1.5 21 9 I
= =
1 0.5 34 4 D
2 1.5 76 1 A
= =
1 0.5 102 25 Y
The message is MEET AT NOON FRIDAY.
3 1 2 1
14. E I = 2 2 2 0
2 1 3 0
2 2 2
R1 R 2
> 3 1 2
2 1 3
2
3
1 1
E = 3
1
3
2
F I = 3
0 0
1 0
0 1
0 1 0
1 0 0
0 0 1
1R
2 1>
1
2R 2
> 0
1 0
1 1 1 0
2
R 2 R3
> 0 1 1 0 1 1
3
0 2 1 1 2 0
1
0
1 0
0 0
1 0
2 0 1
1
2
23
1
2
1
2
15. Let x be the number of shares of A, y be the

number of shares of B, and z be the number of
shares of C. We get the following equations from
the given conditions.
50x + 20y + 80z = 500,000
x = 2z
0.13(50x) + 0.15(20y) + 0.10(80z)
= 0.12(50x + 20y + 80z)
Simplify the first equation.
5x + 2y + 8z = 50,000
Simplify the second equation.
x 2z = 0
Simplify the third equation.
6.5x + 3y + 8z = 6x + 2.4y + 9.6z
0.5x + 0.6y 1.6z = 0
5x + 6y 16z = 0
Thus, we solve the following system of
equations.
x 2z = 0
5x + 6y 16z = 0
5x + 2y + 8z = 50,000
1
1 1 1 0
0
2
R 2
1 1 0
1 1
> 0
0 2 1 1 32
0
1 0 2 0 1
1
2
R 2 + R1
1 1
> 0 1 1 0
2R 2 + R 3
1 2
0 0 3 1
2
1 0 2
0 12
1
13 R3
> 0 1 1
0
1 1
1
1
2
0 0 1 3 6
3
5
6
16
1
2
1
2
0 0
1 0 3 2 0
1 0 2 0 1
1
0
1
2
1 0
12 R 2 + R1
> 0 1 0 3 2 0
R 2 + R3
0 0 0
1 2 1
F does not reduce to I so F is not invertible.
1 0
1 1 1 0
2
3R1 + R 2
> 0 2 1 1 32 0
2R1 + R3
0 1 1 0 1 1
16
1 1 1 1 0 0
2
2
3 2 3 0 1 0
4 3 4 0 0 1
3R1 + R 2
> 0
4R1 + R 3
0
1 1 1 0 1 0
2
1R
2 1> 3 1 2 1 0 0
2 1 3 0 0 1
2
1 0 0
3
2R3 + R1
> 0 1 0 13
R3 + R 2
0 0 1 1
3
13
5 1
6
3
1
2
6
3
1 2 1 0 0
2 3 0 1 0
3 4 0 0 1
16
13
13
2
3
219
The coefficient matrix is

1 0 2 1
A I = 5 6 16 0
5 2
8 0
1 0 2
5R1 + R 2
> 0 6 6
5R1 + R3
0 2 18
1
1 0 2
1R
6 2
5
> 0 1 1 6
0 2 18 5
1 0 2
A = 5 6 16 .
5 2
8
0 0
1 0
0 1
1 0 0
5 1 0
5 0 1
0 0
1 0
0 1
1 0 2
1
0 0
2R 2 + R3
1 0
> 0 1 1 56
6
0 0 20 10 1 1
3
3
1 0 2
1
0 0
1 R
20 3
1
> 0 1 1 56
0
6
1
1
0 0
1 16 60
20
2 1
1 0 0
3
30
2R3 + R1
3
> 0 1 0 1
20
R3 + R 2
0 0 1 1 1
6
60
A1
2 1
30
3
3
= 1
20
1 1
60
6
1
10
1
20
1
20
1
10
1
20
1
20
1
2 1
30 10 0
x 3
5000
y = 1
= 2500
3
1 0

20 20
z 1
50, 000 2500
1
1
60 20
6
They should buy 5000 shares of Company A, 2500 shares of Company B, and 2500 shares of Company C.
Problems 6.6
1 1
6 1 1 0
6
1.
7 1
7 1 0 1
1
0
6
0 1
0 1
6
1
6
1
6
7
6
0
0 1 1
1
1 0 1 1

7
1
0
1
0 1 7 6
6
6
1 1
The inverse is
.
7 6
220
Section 6.6
1
1 2 1 0
1 2
2 4 1 0
2
2
2.
3 6 0 1
1 2 0 13
0 0 12
The given matrix is not invertible.
1 1 1 0
2 2 1 0
2 2 1 0
2
3.
2 2 0 1
0 0 1 1
0
0
1 1

1 a 1 0 1 0 1 a
4.
1
0 1 0 1 0 1 0
1 a
The inverse is
.
1
0
1 0 0 1
0
1 0 0 1 0 0
5. 0 3 0 0 1 0 0 1 0 0 3
0 0 4 0 0 1
0 0 1 0
0
1
0
The inverse is 0 13
0
0
1
4
0 .
1
4
1 0 4
2 0 8 1 0 0
6. 1 4 0 0 1 0 1 4 0
2 1 0 0 0 1
2 1 0
1 0 4 1 0 0
1 0 4 1 0 0
0 0
2
2
0 1 0 0 4 4 2 1 0 0 1 1 81 14 0
0 0 1
0 1 8 1 0 1
0 1 8 1 0 1
1
2
1
1 0 4
1 0 4
0 0
2
1
1 0 0 1 1
0 1 1
8
4
0 0 9 9 1 1
0 0 1
8
4
4
0 1
9
9
2
1 .
The inverse is 0
9
9
1
1
1
9
8 36
1
2
1
8
1
8
0
1
4
1
36
1 0 0 0 1
0
9
0 0 1 0 0
9
1
0 0 1 1
19
8
36
1 2 0 1 3
1 2 3 1 0 0
4
1 2 3 1 0 0
1
1
7. 0 0 4 0 1 0 0 0 1 0 4 0 0 0 1 0
4
0
0
5
0
0
1
0 0 5 0 0 1
0 0 0 0 4
4
9
1
9
1
9
221
1 0 0 1 0
0
2
2 0 0 1 0 0
8. 0 0 0 0 1 0 0 0 1 0 0 14
0 0 4 0 0 1 0 0 0 0 1
0

9. The matrix is not square, so it is not invertible.
0 0 0 0 0 0
10. For any 3 3 matrix B, B 0 0 0 = 0 0 0 I .
0 0 0 0 0 0
Thus the matrix is not invertible.
1 2 3 1
11. 0 1 2 0
0 0 1 0
1 0 0
0 1 0
0 0 1
0
1
0
1
0
0
0
1 0 1 1 2 0
0 0 1 2 0
1 0
1
0 0 1 0 0 1
2
1
1 2
0
1
1
1 2
The inverse is 0
1 2 .
1
0 0
1 2 1 1 0 0
1 2 1 1 0 0
12. 0 1 4 0 1 0 0
1 4 0 1 0
1 1 2 0 0 1
0 3 3 1 0 1
1 0 9
1 2
1 0 9 1 2 0
0 1 4 0
1 0 0 1 4
0
1
1
1
0 0 15 1 3 1
0 0
1 15
5
2
5
4
The inverse is 15
1
15
15
1
5
1
5
2
1 0 0
0
5
0 0 1 0
15
1
1
0 0 1 15
15
15
1
5
1
5
3
5
4
15
1
15
3
5
4 .
15
1
15
222
Section 6.6
1 0 2 1 0 0
7 0 2 1 0 0
7 7
13. 0 1 0 0 1 0 0 1
0 0 1 0
3 0
1 0 0 1
1 0 0 1
3 0
1 0 2
7
0 1
0
1
0 0
7
1
7
0
3
7
1
The inverse is 0
3
1 0 0
0 0
1 0 0 1 0
1
0 1
0 0 7
0 2
1 0 .
0 7
3 1
2 3 1 1 0 0 1 2 2
0 1
14. 2 0 1 0 1 0 2

4 6 1 0 0 1 4 6 1
1 0
1 0 1
0 12 0
2
0 1 0 13 13 0 0 1
0 0 1 2 0 1
0 0
1 0 2
1 0 0 1 0 2
0 1 0 0 1 0 0 1 0
3 0 1
0 0 1 3 0 7
1
2
0
0
1
2
0
1
0 0 1 23

1 0 0
3
0 1
0
0

0 21
0 1

13 13 0 0

2 0 1 0

1
2
0
1
0
1
0
1
1 0 0
1 3
0 0
2
2
2
1 1 0 0
1 0 13 13 0
2 0 1
0 1 2 0 1
0
1
1
0 1 2
2
0 13 13 0
1
2 0 1
1
2
1
1 1
2
2
The inverse is 13 13 0 .
2 0 1
2 1 0 1 0 0 1 1 2 0 0
15. 4 1 5 0 1 0 4 1 5 0 1
1 1 2 0 0 1 2 1 0 1 0
1 1 2
1
1 1 2 0 0
0 3 3 0 1 4 0 1 1
0 3 4 1 0 2
0 3 4
1
1
1 0 1 0
3 1 0 1
3

0 1 1 0 13 43 0 1 1

0 0 1 1 1
2 0 0 1

5
1 2
3
3
4 10 .
The inverse is 1
3
3
1
1 2
1
0
0
1
0 0
0
1
3
1 0
4
3
5
1 0 0 1 2
13
3
3
10
4
4
3 .
0
3 0 1 0 1
3
0 0 1 1
1 1 2
1 2
1
3
1
3
223
1 2 3 1 0 0 1 2 3 1
16. 2
1 0 0 1 0 2
1 0 0

4
2
5
0
0
1
4
2
5 0

1
2
3
3 1 0 0
1 2
6
1 5
0 5 6 2 1 0 0
0
6
7
4
0
1
0 6 7
3
3
1
2
1 0
0 1 0
5
5
5
5

2
1 0 0 1 6
0 1 65
5
5
5

8
6
1
0
0
1
5 1
0 0
5
5
1 0 0 5 4 3
0 1 0 10 7 6
0 0 1 8 6 5
0 0
1 0
0 1
1 0 0
2 1 0
5 5
4 0 1
0
8 6 5
15
2
5
2
5
1
5
5 4 3
The inverse is 10 7 6 .
8 6 5
1 2 3 1 0 0 1 2 3 1 0 0
17. 1 3 5 0 1 0 0 1 2 1 1 0
1 5 12 0 0 1 0 3 9 1 0 1
1
1 0 0 11 3
1 0 1 3 2 0
3
3
1 0 1 3 2 0
3 23
0 1 2 1 1 0 0 1 2 1 1 0 0 1 0 73
2
1
0 0 3 2 3 1
2 1
1
0 0 1
0 0 1 3 1 3
3
3
1
11 3
3
3
The inverse is 73
3 32 .
1
2 1
3
3
2 1 3 1 0 0 2 1 3 1 0 0
18. 0 2 0 0 1 0 0 2 0 0 1 0
2 1 1 0 0 1 0 2 2 1 0 1
3
1 0 0
1 0
1 1
1 0 3 1
2
2
2
2
2
4
1
1
0
1 0 0 2 0 0 1 0 0 2 0
0
2 2 1 0 1 0 0 2 1 1 1
1 0 3 1
2 2
0 1 0 0
0 0 1 1
2
1
4
1
2
1
2
0 1 0 0 14 12

1
0 0 1 0
0
2

1
1
1
2
0 0 1
2
2

1 1
2
4
1
The inverse is 0
2
1
1
2
2
3
4
12
3
4
0 .
12
224
Section 6.6
x
2 3 3 27
19. X = 1 = A1B =
= x1 = 27, x2 = 38
1 5 7 38
x2
1 0 1 10 9
x1
1
20. X = = A B = 0 3 0 2 = 6 x1 = 9, x2 = 6, x3 = 16
x2
2 0 4 1 16
1
1 1 0 1 1 0 1 5
6 5 1 0 1 1 0 1 1 1 0
21.

1
1
0
1
6
5
1
0
0
1
1
6
0 1 1 6 0 1 1 6
x
1 5 2 17
1
=A B=
=
x = 17, y = 20
y
1 6 3 20
1 2
2 4 1 0
22.
1 3
1 3 0 1
3
x
1
10
=
=
A
B
y
1

10
1 2
0
0 5
0 1
1
2
1
2
1
2
1 0
0
0 1
1
52
1
5
23
52 5 10
= x = 23 , y = 1
1 2
1
10
10
10
5
1
3 1 1 0 1 13 13 0 1 13 13 0 1 3
23.
3 1 0 1 3 1 0 1 0 2 1 1 0 1
1
1 0 1
6
6
1
1
0 1 2 2
1
x
1
6
=
=
A
B
y
12
3
10
1
10
1
6 5
1
2 7
1
3
1
2
12
2
= x = 2, y = 1
1
1
1 0
1
1 1 1 0
1 1 1
0
6 1 1 0
1 0 1 1
6
6
6
6
6 6
24.
0 1 7 6
7
1
7 1 0 1
0
1
7
1
0
1
0
1
7
6
6
6

1 2 5
x
1
1
y = A B = 7 6 7 = 28 x = 5, y = 28
25. The coefficient matrix is not invertible. The method of reduction yields
2 6 2 1 3 1 1 3 1
.
3 9 3 3 9 3 0 0 0
Thus x = 3r + 1, y = r.
2 6 8 1 3 4 1 3 4
.
3 9 7 3 9 7 0 0 5
Second row indicates 0 = 5, which is never true, so there is no solution.
225
1 1 0 0
1 2 1 1 0 0 1 2
27. 3 0 1 0 1 0 0 6 2 3 1 0
1 1 1 0 0 1 0 3 0 1 0 1
1
1
0 0 1 0 3 0
1 2 1 1
3
1
1
1
1
1
1
0
1 3 2 6 0 0 1 3 2 6

0 1 0 0 1 1 1
0 3 0 1
2
2
1 0 0 1
6
1
0 1 0
3
1
0 0 1
2
13
0 13
12
1
1
2
1 1
1
2
3 4 0
x
6
y = A1 B = 1
1 2 = 1
0

3
3
z

1 1
1 1 2
2
2
Thus, x = 0, y = 1, z = 2.
1 1 1 1 0 0 1 1 1 1 0 0
28. 1 1 1 0 1 0 0 2 0 1 1 0
1 1 1 0 0 1 0 2 2 1 0 1
1 0
1 0
1 12
0 0
1 1 1 1
2
1
1
1
1
0
1 0 2 2 0 0 1 0 2 2 0
0 0 2 0 1 1
0 1
0 2 2 1
1
1 0 1 1
2
2
1
1
0 1 0 2 2
1
0 0 1 0
2
1
0 1 0 0 12
0
2

1
1
0 0 1 0 2 2
0

1 1
12 0 0 1 0
2
2

1

1
0
2 6 5
x
2

1
1
1
0 1 = 72
y = A B = 2 2

1 1 4 5
0
z
2
2
2
7
5
Thus, x = 5, y = , z = .
2
2
226
Section 6.6
1
1 1 0 0
1
1 1 1 1 0 0
1
1
29. 1 1 1 0 1 0 0
0 2 1 1 0 0 2
1 1 1 0 0 1
0 2 2 1 0 1
0 0
1
1
1
1
1 0 0
1 0 0
1
0
0
2
2
2
2
0 1
1 12 0 12 0 1 1 12
0 21 0
1
1
0
0
0 0 2 1 1
0 0 1 2 2
0
1
1

0
2
2 3 4
x
1
1 1 4 = 1
y = A B = 0
2
2
2

1
1
z
0 5 12
2 2
1
1
Thus, x = 4, y = , z = .
2
2
2 0 8 1 0 0
1 4 0
30. 1 4 0 0 1 0 2 0 8
2 1 0 0 0 1
2
1 0
1 4
1 4 0 0 1 0
0 8 8 1 2 0 0
1
0 9 0 0 2 1
0 9
0
1 1 1 1 0
1 1 0 0
2 1 0 1 0 1 1 2 0 12
2 1 1 0
0 0 2 1 1
0
1
0 0 12
0
2
1 1
1 0 0
2
2
0 1 12 12
0
0 1 0
1 0 0
0 0 1
0 0 1 0
1 18 14 0
0 0 2 1
1
1 0 4
1 0 4
0 0
2
1
1 0 0 1 1
0 1 1
8
4
0 0 9 9 1 1
0 0 1
8
4
1
4
0
9
9 8 0
x
y = A1 B = 0
2
1 36 = 9

9
9
z

1
1
91 9 1
8 36
Thus, x = 0, y = 9, z = 1.
1
2
1
8
1
8
0
1
4
1
36
1 0 0
0
0 0 1 0
0 0 1
19
0 19
2
0
9
1
8
1
36
4
9
1
9
91
7
1 0 0 1
1 3 3 7
1 3 3
1 3 3 7
2 1 1 4 0 5 5 10 0
1 1 2 0 1 1 2 .
0 0 0 1
1 1 1 4
0 2 2 3
0 2 2 3
The third row indicates that 0 = 1, which is never true, so there is no solution.
7
1 0 0 1
1 3 3 7
1 3 3
1 3 3 7
2 1 1 4 0 5 5 10 0
1 1 2 0 1 1 2 .
0 0 0 0
1 1 1 3
0 2 2 4
0 2 2 4
Thus, x = 1, y = r + 2, z = r.
227
1 0 2
1 1 0
33.
2 1 0
1 2 1
1 1 0 0 0
1 0 2
0 1 2
1 0 0
0 1 4
1 0 0 1 0
1 0 0 0 1
0 2 1
1 0
2 1 1 0 0 0
0 1
2 1 1 1 0 0
0 0
6 0 3 1 1 0
5 2 3 2 0 1
0 0
2 0
1
0
0 0
0 0 0
1
0
0
1 0 1
0 0
1 0 0
0
1 0
0 0
1
2
1
2
1
4
1
4
1
2
14
1 1 0 0 0
1 1 1 0 0
1 2 0 1 0
0 1 0 0 1
2 1 1
0
2 1 1 1
1
5
1
3
23
16
7
6
1
3
1
3
1
6
56
1 0
0
0 1
0

0 0
0
0 0
1
14
3
4
1
12
16
5
12
12
1
2
0
1
2
1
12
16
7
12
0 0
0 0
0 12 16 16 0
2 3
2
0 1
0 1
1
2
1
4
1
3
23
16
7
12
1
3
1
3
1
6
5
12
1
2
3 1
1 1
4
4
2 4 1
w
4
1
x
1 1 1
12
12
2 12 3
= A1 B = 4
=
y
1 1 1
12 2
0
6
6

2

z
7
5
1
1
12 7
12
12
2
4
Thus, w = 1, x = 3, y = 2, z = 7.
228
0 1 3 1 1 0
1 0 0 1
34. 1 0
1 0 0
1
2
2
1 1 0 0
0 0
1 0
0
1 0
0 1 3 1 1
5 1 2
0 0
1 1 0
0 0
1
0
0
0
1
0
0
Section 6.6
0 1 0
1 0 0 1
0 0 1 3 1 1 0
0 1 2 2 1 0 0
1 0 0
1 1 0 0
0 0 1 0
1 0
0
0 0 0 1 3 1
1
1 0 0 0
1 1 0
0 1 0 0
5 1 2
1
1 0 0 0
2
1
0 1
1 0
0
0 1 0 0
2 1
0
0 3
1 0
0
0
1 0 0 1 0 1
2
5
1 21 14 14
1
4
0
0
0
1
0
0
1
0
0
0
1
0
1
0
1
0
0
1 0
0 1
0
0
0 2
1
0 0
0 0
1
0
0 0
0 1
0
1 0
0
3 1
1
4
4
4
1
1
1
2
2
2
1
1 1
4
4
4
5
1
1
4 4
4
0
0
1
0
1
0
0
1
1 0 0 1
3 1 1 0
1 1 0 1
1 1 0 0
0 0 1 0
1 0
2
1
0 1 1 0
0 0 4 2
3 1
1
1
4
4
4 1 1
2
w
1
1
1
0
x
0
5
1
2
2
2
=
=A B= 1
1
1
1
4 6 1
2
y
4
4
1
z
5 4 3
1
1
2 4 4
4
Thus w = 1, x = 5, y = 1, z = 3.
1
35. I A =
0
4 2
1 1
0 5 2 4 2
1 1 2 1 1
1 0 1 1 0 1 1 1 0 1 1 1 0 1
0 1 4 2 1 0 4 2 1 0 0 6 1 4
1 0 1 1
1 1 0 1
6
3
1
2
1 2
0
1
0
1
6
3
6
3
1
1
6
=
(
I
A
)
Thus,
16
13
.
23
1 0 3 2 4
36. I A =
=
0 1 4 3 4
4 2 1 0 1 12
4 2 0 1 4 2
2
0
0 1
1
4
1
1
0 1 2
4
1 14
1 1 0
1 1
8
8
Thus ( I A) 1 =
1 1
4
4
1 1
2
0 4
1
4
1
1 0
0
8

0 1 1
14
4
18
14
229
0
0
1
0
1
0
0
1
0
0
0
1
0 1
0
3
0
1
1 5
37. Let x = number of model A and y = number of model B.

a.
The system is
x + y = 100 (painting)
1
2 x + y = 80 (polishing)
1 1
Let A = 1 .
2 1
1 0
1 1 1 0 1 1
1 1 1 0 1 0 2 2
1
1
1
2 1 0 1 0 2 2 1
0 1 1 2 0 1 1 2
x
1 100 2 2 100 40
=A =
=
y

80 1 2 80 60
Thus 40 of model A and 60 of model B can be produced.
b.
The system is
(widgets)
10 x + 7 y = 800
14
10
1130
+
=
(shims)
x
y
10 7
Let A =
.
14 10
1 7
10 7 1 0
10
14 10
14 10 0 1
1
0 1
1
10
1
0
1 7
1 0
0
5 72
10 10

0 1 7 5
0 1 7
1
5
5 7 800 45
x
1 800
2
A
=
=

=
y
1130
5 1130 50

7
Thus 45 of model A and 50 of model B can be produced.
1
a
38. 0
39. a.
0
1
b
(B
7
10
1
5
1
10
75
0 a 0 0
1 0 0
0 0 b 0 = 0 1 0 = I
1 0 0 c 0 0 1
c
1 1
) ( AB) = B ( A A) B = B
1
IB = B 1B = I
Since an invertible matrix has exactly one inverse, B 1 A1 is the inverse of AB.
b.
1 1 1 3 3 7
=
( AB)1 = B 1 A1 =
1 5 2 4 11 23
230
1
40. Left side: AT =
0
1 1
2
( AT ) 1 =
.
0 1
2
Section 6.6
1
. We find that
2
9.6x + 9.6y + 2.7z = 8.208x + 10.944y + 4.104z

1.392x 1.344y 1.404z = 0
1392x 1344y 1404z = 0
116x 112y 117z = 0
4y z = 0
Thus we solve the following system of equations.
6x + 8y + 3z = 50,000
116x 112y 117z = 0
4y z = 0
8
3
6
The coefficient matrix is A = 116 112 117 .
0
4
1
1 0
Right side: A1 = 1 1 , so
2 2
1 1
2
( A1 )T =
.
1
0
2
Thus ( AT ) 1 = ( A1 )T .
3
5
41. P T P =
4
5
T
P =P
42. a.
43
55
3 4
5 5
6
8
3 1 0 0
A I = 116 112 117 0 1 0

0
4
1 0 0 1
54 1 0
=
= I , so
3 0 1
4
1
1
3
2
> 116 112 117
4
1
0
1R
6 1
. Yes, P is orthogonal.
14 2 9
1 4
= 6
1 0
1
14 2 9
R1 A1 = [33 87 70] 6
1 4
1 0
1
= [10 21 19]
1
R2 A
R3 A
b.
14 2 9
1 4
= [57 133 20] 6
1 0
1
= [ 20 19 1]
14 2 9
1 4
= [ 38 90 33] 6
1 0
1
= [ 25 14 15]
Just say no.
43. Let x be the number of shares of D, y be the number

of shares of E, and z be the number of shares of F. We
get the following equations.
60x + 80y + 30z = 500,000
0.16(60x) + 0.12(80y) + 0.09(30z)
= 0.1368(60x + 80y + 30z)
z = 4y
6x + 8y + 3z = 50,000
0 0
0 1 0
0 0 1
1
6
4
1
1 0 0
1
3
2
6
116R1 + R 2
58 1 0
> 0 800
175
3
3
0
1
4
0 0 1
1
1
1 4
0
0
3
2
6
3 R
800
2
29
3
21
> 0 1 32
0
400
800
14 R3
1
0 1 1
0
0 4
4
4
1
1
1
0
0
3
2
6
R 2 + R3
29
3
21
> 0 1 32
0
400
800
0 0 29 29 3 1
32 400
800
4
4
1
1
1
0
0
3
2
6
32 R
29 3
29
3
21
> 0 1 32
0
400
800
3
8
2
0 0
1
25
725
29
19
3
4
1 4 0
3
150
1450
29
12 R 3 + R1
3
1
21
> 0 1 0 50
2900
116
21 R + R
32
3
2
3
8
0 0 1 2
725
29
25
231
3
1
1 0 0 1
29
10
290
+ R1
3
1
21
> 0 1 0 50
2900
116
3
8
0 0 1 2
725 29
25
3
1
1
29
290
x 10
50, 000 5000
y = 1 3
21 0 = 1000
50

2900
116
z 2
3
8 0 4000
25
725
29
They should buy 5000 shares of company D, 1000
shares of company E, and 4000 shares of company F.
4R
3 2
44. Let x be the number of shares of D, y be the number

of shares of E, and z be the number of shares of F.
We get the following conditions.
60x + 80y + 30z = 500,000
0.16(60x) + 0.12(80y) + 0.09(30z)
= 0.1452(60x + 80y + 30z)
z = 2y
6x + 8x + 3z = 50,000
9.6x + 9.6y + 2.7z = 8.712x + 11.616y + 4.356z
0.888x 2.016y 1.656z = 0
888x 2016y 1656z = 0
111x 252y 207z = 0
2y z = 0
Thus we solve the following system of equations.
6x + 8y + 3z = 50,000
111x 252y 207z = 0
2y z = 0
8
3
6
The coefficient matrix is A = 111 252 207 .

0
2
1
8
3 1 0 0
6
A I = 111 252 207 0 1 0
2
1 0 0 1
0
4
1
1
3
2
> 111 252 207
2
1
0
1R
6 1
R 2 + R3
> 0
1 4
3
32 R
37 3
> 0 1
0 0
1
1
400
0
0
0 12
1
4
1
1
0
0
3
2
6
37
21
1
1 32
0
800
400
37
1
1
0 37
32 800
400
2
1
1
0
0
2
6
37
21
1
0
32 800
400
16
1
2
1 25 925 37
12 R 3 + R1
>
21 R + R
32
3
2
1 4 0
3
0 1 0
0 0 1
1 R
400
2
>
12 R3
4
3
1
2
21
32
1
2
1
6
37
800
11
75
1
50
1
25
1
925
1
925
2
925
8
37
21
74
16
37
7
6
1 0 0 3
37
25
2775
+ R1
1
1
21
> 0 1 0 50
925
74
0 0 1 1 2 16
25
925
37
7
6
3
37
x 25 2775
50, 000 6000
y = 1 1
21 0 = 1000
50

925
74
z 1
16 0 2000
2
25
925
37
They should buy 6000 shares of company D,
1000 shares of company E, and 2000 shares of
company F.
4R
3 2
Problems 6.7
1 3
1. A = 3 4
14 0
300
D=
500
(I A)X = D
2 3 300
4
with a calculator
Reducing 3
1 500
14
1 0 1408.70
.
results in
0 1 852.17
Thus 1408.70 units of agriculture and
852.17 units of milling need to be produced.
0 0
0 1 0
0 0 1
1
6
4
1
1 0 0
1
3
2
6
111R1 + R 2
37 1 0
> 0 400 525
2
2
0
2
0 0 1
1
232
Section 6.7
1
1
1
10 3 4
1
1
1
2. A = 10
10
3
1 1 1
10 10 10
300
D = 200
500
(I A)X = D
9
10
1
Reducing 10
1
10
200
1200
4. A =
400
1200
600
D=
805
1290
X = ( I A)1 D =
1425
The total value of other production costs is
600
800
PA + PB =
(1290) +
(1425) = 1405
1200
1500
300
9
1 200 with a
10
3
9 500
1
10
10
1 0 0 736.39
calculator results in 0 1 0 563.29 .
0 0 1 699.96
Thus 736.39 units of coal, 563.29 units of steel,
and 699.96 units of railroad services need to be
produced.
3. A =
1
18
19
1
9
3
16
1
4
3
16
13
14
40
200
5. A =
120
200
a.
120
300
90
300
200
D=
300
812.5
X = ( I A)1 D =
1125
1
15
1
3
1
6
b.
40
D = 30

0
(I A)X = D
17
18
Reducing 19
1
9
500
1500
200
1500
64
D=
64
220
X = ( I A) 1 D =
280
15
100
25
6. A = 100
50
100
40
30 with a
1 0 0 55.13
calculator results in 0 1 0 57.15 .
0 0 1 20.21
Thus, to meet external demand, 55.13 units of
agriculture, 57.15 units of manufacturing, and
20.21 units of transportation are required.
3
16
3
4
3
16
1
15
13
5
6
a.
30
120
30
120
40
120
45
180
60
180
60
180
15
D = 10
35
134.29
X = ( I A) D = 162.25
234.35
1
b.
10
D = 10
10
68.59
X = ( I A) D = 84.50
108.69
1
233
100
1000
100
7. A = 1000
300
1000
500
D = 150
700
400
800
80
800
160
800
240
1200
480
1200
240
1200
400
1000
200
10. A = 1000
200
1000
300
D = 400
500
1559.81
X = ( I A) D = 1112.44
1738.04
200
1000
400
1000
100
1000
200
1000
100
1000
300
1000
Chapter 6 Review Problems
3 4
1 0 6 8 3 0
1. 2
3
5 1
2 4 10 2 6 12
8
3
=
16
10
3 1
2 1 15 5 6 3
2. 5
3
=
0
4
1 0 0 20 3 0
21 8
=
3 20
1301
X = ( I A) D = 1215
1188
1
400
1000
200
9. A = 1000
200
1000
250
D = 300
350
200
1000
400
1000
100
1000
200
1000
100
1000
300
1000
1382
X = ( I A) D = 1344
1301
400
1000
200
8. A = 1000
200
1000
300
D = 350
450
200
1000
400
1000
100
1000
1 7
1 + 0 0 + 42 2 + 7
1 0 2
3. 2 3
=
2 + 0 0 18 4 3
0
6
1
1 + 0 0 + 0 2 + 0
1 0
5
1 42
= 2 18 7
1
0 2
200
1000
100
1000
300
1000
2 3
4. [2 3 7] 0 1
5 2
= [2(2) + 3(0) + 7(5)
= [39 17]
1073
1
X = ( I A) D = 1016
952
2(3) + 3(1) + 7(2)]
2 3 2 3 1 8 2
5.
=
1 3 7 6 4 4 1
11
=
8
234
3 1 5
3 3 2
4
11
Chapter 6 Review
2 10 2 10
0 5
2 0
2 0 0 10
6.
+ 2
+
=
=
=
0 19 0
7 8
7 8 12 8
19
6 4
2
2 0
4 0 3
12 36
7. 3
= 3 =
[3 4]T = 3
2
1
6
1
4

22 66
2
T
2
1 0 1 1
1 0 1 4 1 4
1 3 0 1 0
8.
3 6 1 3 = 1 2 0 3 = 1 2 0 9 = 1 22
3

1 1 3 0
9. (2 A)T 3I 2 = 2 AT 3I = 2
1 2 0 3
2 2 3 0 1 2
=
1
2 4 0 3 2
2 2
10. A(2 I ) A0T = 2( AI ) A0 = 2 A 0 = 2 A =
2 4
3
1 0 1 0
1 0 1 0 2 0
11. B3 + I 5 =
+ 0 1 = 0 8 + 0 1 = 0 9
0
2
12. ( ABBA)T AT BT B T AT = AT B T B T AT AT B T B T AT = 0
5 x 15
13. =
7 x y
5x = 15, or x = 3
7x = y, 7 3 = y, or y = 21
2 + x 2 1 + 3 x 3 4
14.
=
4 + xy 2 + 3 y 3 y
2 + 3y = y, 2y = 2, or y = 1
1 + 3x = 4, 3x = 3, or x = 1
For these values of x and y, 2 + x 2 = 3 is true, and 4 + xy = 3 is true. Thus x = 1, y = 1.
4 1 4 1 0
1 4 1
15.
5 8 0 12 0 1 0 1
0 0 7 0 5 9 0 1 95 0 1 0
16.
0 5 9 0 0 7 0 0 1 0 0 1
235
1 0 1
5
1 2
5
5
3 1 2 1 2 5 1 2
13 0 1
13
17. 1 2 5 3 1 2 0 5 13 0
1
5
5
9
0 8 19
4 0 1 4 0 1 0 8 19
0 0
5
1 0 1
5
1 0 0
0 1 0
0 1 13
1
0 0 1
0 0
0 0 0 1 1 0 0 0
18. 0 0 0 0 0 0 0 1
1 0 0 0 0 0 0 0
2 5 0 2 5 0 1 52 0 1 0 0
19.
3 0 0 13 0 0
1 0 0 1 0
4
Thus x = 0, y = 0.
3
1 0
2 3
3 1 1
1 1 2 3 1 1 2
4
20.
5
0 1 5
3 1 1 5 0 4 5 4 0 1 4 1
4
3
5
Thus x = r + 2 , y = r 1 , z = r.
4
4
1 1 1
2
1 1 1 2 1
1 0 0 1
1 1 2
21. 3 2 4 7 0 5 10 10 0
1 2 2 0 1 2 2
2 0 3 6
0 0 3 6 0
0 0 0 6
2 1 2
Row three indicates that 0 = 6, which is never true, so there is no solution.
1 0 1
5
1
1 2
5
5
1
3 1 2 0 1 2 5 1 1 2
13
3 0 1
13
22. 1 2 5 1 3 1 2 0 0 5 13 3 0
1
5
5
5
9
0 8 19 4
4 0 1 0 4 0 1 0 0 8 19 4
0 0
5
1 0 1 1 1 0 0 1
5
5
9
3 0 1 0 5
0 1 13
5
5
9
4
4
0
0
1
0
0
1
9
9
1
5
4
Thus x = , y = , z = .
9
9
9
0
1 0 1 5 1
1 5 1 0 1 5
23.
0 1 1 1
3 9 0 1 0 6 3 1
2
6
1 0 3
2
1
0 1
2
5
6
16
3
2
=
1
2
5
6
16
236
15
3
5
4
5
Chapter 6 Review
0 1 1 0 1 0 0 1
1 0 1
24.
A =
1
0
0
1
0
1
1
0
1 0
3
1 3 2 1 0 0 1
25. 4
1 0 0 1 0 0 11
3 2 2 0 0 1 0 11
3 2
1 0 0 1 3
1
0 11 8 4 1 0 0 1

0 0
1 1 1 0 0
0
2
1 0 0
8 4 1 0
8 3 0 1
2 1
0 0
8
4
1
11 11 11 0
0 1 1 1
3 0
2 1
1 0
11
11
11
8
4 1 0 no inverse exists
0 1 11
11
11
0 0
0
1 1 1
1 0 0 1 0 0
5
5 0 0 1 0 0 5 0 0 1 0 0
1
1
26. 5 2 1 0 1 0 0 2 1 1 1 0 0 1 2 2 12 0
5 1 3 0 0 1 0 1 3 1 0 1 0 1 3 1 0 1
1 0 0 1
1
1 0 0 1
0
0
0
0
0
0
5
5
3 1 A1 = 2
3 1 .
1 0 0 1 0 2
0 1 12 12
2
5
5
5
5
5
5
1
1
1
1
2
1
1
2
0 0
0 0 1 5 5
2 1
5
2 2
5
5
5
2 1 3 1 0 0 1 0 2 0
27. 1 0 2 0 1 0 2 1 3 1

0 1 1 0 0 1 0 1 1 0
1 0 2
0
1 0 1 0
0 1 1
1 2 0 0 1
1
0 0
1 2
1 12 0 0
1 1
x
1
y = A B = 1 1
2

1
z
1
2
Thus x = 3, y = 2, z = 2.
1 0 1 0 2 0
1 0 1 0 2 0
1 0
0 0 0 1 1 1 2 0 0 1 1 1 2 0

0 1 0 1 1 0
0 1 0 0 2 1 2 1
0
1 1 1
1
1
0
1
2
2
1 12
1 12
1 2 3
1 1 = 2
2
1 4 2
2
28. We found A1 in Exercise 26, so

3
1
0
0 3
x
5
5

1
3 1 0 = 4
2
y = A B = 5
5
5 5
2 2 7
1 1
z
5
5
5
5
237
0 1 1 0
29. A2 = AA = 0 0 1 0
0 0 0 0
0 0 1 0
A3 = A2 A = 0 0 0 0
0 0 0 0
1 1 0
0 1 = 0

0 0 0
1 1 0
0 1 = 0

0 0 0
0 1
0 0
0 0
0 0
0 0 = 0
0 0
Since A3 = 0, every higher power of A is also 0, so A1000 = 0.

0 1 1 1 0 0
Looking at 0 0 1 0 1 0 , it is clear that there is no way of transforming the left side into I3 , since there
0 0 0 0 0 1
is no way to get a nonzero entry in the first column. Thus A does not have an inverse.
2 0
30. AT =
0 4
1
1 2 0
T
=
A
0 1
4
( )
1
2
A1 =
0
( )
A1
1
4
1
2
=
0
1
4
Thus ( AT ) 1 = ( A1 )T .
31. a.
Let x, y, and z represent the weekly doses of capsules of brand I, II, and III, respectively. Then
(vitamin A)
x + y + 4 z = 13
x + 2 y + 7 z = 22 (vitamin B)
x + 3 y + 10 z = 31 (vitamin C)
1 1 4 13
1 2 7 22 R1 + R 2>
R + R
1
3
1 3 10 31
1 0 1 4
R 2 + R1
> 0 1 3 9
2R 2 + R 3
0 0 0 0
1 1 4 13
0 1 3 9
0 2 6 18
Thus x = 4 r, y = 9 3r, and z = r, where r = 0, 1, 2, 3.

The four possible combinations are
Combination
238
Explore and ExtendChapter 6
b.
32. a.
7
10
T =
7

5
9
C = 8
10
Computing the cost of each combination, we

find that they are 83, 77, 71, and 65 cents,
respectively. Thus combination 4, namely
x = 1, y = 0, z = 3, minimizes weekly cost.
An ( A1 )n = An 1 ( AA1 )( A1 )n 1
= An 1 I ( A1 ) n 1
= An 2 ( AA1 )( A1 )n 2
= An 2 ( A 1 ) n 2
#
7
20 40 30 10
10
C T ( AT ) = C T 30 0 10 10
10 0 30 50 7
5
800
= C T 330
530
= AA1
=I
b.
ABA = ACA; so,

A1 ( ABA) = A1 ( ACA)
( A1 A) BA = ( A1 A)CA
IBA = ICA
BA = CA
800
= [9 8 10] 330 = [15,140]
530
The cost is $151.40.
( BA) A1 = (CA) A1
B( AA1 ) = C ( AA1 )
BI = CI
B=C
c.
2. To the linear system, add x1 + x2 + x3 + x4 = 52.

20 40 30 10
30 0 10 10
A=
10 0 30 50
1 1 1 1
1180
580
B=
1500
52
8
10
T = A 1 B =
14

20
Guest 1: 8 days; guest 2: 10 days;
guest 3: 14 days; guest 4: 20 days
AA = A A AA = A A , IA = I, A = I.
Thus A = I n .
215 87
33.
89 141
1
x 7.9 4.3 2.7 11.1 1.57

5.8 7.6 10.8 = 0.30
34. y = 3.4
z 4.5 6.2 7.4 15.9 0.95
Thus x = 1.57, y = 0.30, z = 0.95.
10
34
35. A =
15
34
20
39
;
14
39
10
D = ;
5
39.7
X = ( I A)1 D =
35.1
3. It is not possible. Different combinations of

lengths of stays can cost the same. For example,
guest 1 staying for
20 days and guest 3 staying for 17 days costs the
same as guest 1 staying for 15 days and guest 3
staying for 21 days (each costs $214.50).
Explore and ExtendChapter 6
20 40 30 10
1. A = 30 0 10 10
10 0 30 50
239

12 - HPW 13 Ism 06 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

12 - HPW 13 Ism 06 PDF

Uploaded by

Copyright:

Available Formats

Chapter 6

4. A42 is the entry in the 4th row and 2nd column,

1. There are 3 rows, one for each source. There are

5. A32 is the entry in the 3rd row and 2nd column,

2. The first column consists of 1s each

7. A44 is the entry in the 4th row and 4th column,

nth column will consist of 2n s, each

8. A55 is the entry in the 5th row and 5th column.

But A has only 4 rows and 4 columns. Thus a55

The size is the number of rows by the

A row vector (or row matrix) has only one

A column vector (or column matrix) has

An upper triangular matrix is a square

B is 2 2 and Bij = (1)i j (i 2 j 2 ).

2. A has 4 rows and 4 columns. Thus the order of A

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

Chapter 6: Matrix Algebra

ISM: Introductory Mathematical Analysis

D is 2 3 and Dij = (1)i ( j 3 ).

13. 12 10 = 120, so A has 120 entries. For a33 ,

i = 3 = j, so a33 = 1. Since 5 2, a52 = 0. For

A and C are diagonal matrices.

All are them are triangular matrices.

Since AT = A, the matrix of Problem 20 is

15. A zero matrix is a matrix in which all entries are

24. Equating corresponding entries gives 3x = 9,

26. Equating entries in the 3rd row and 3rd column

27. Equating corresponding entries gives 2x = y,

28. [125 275

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

ISM: Introductory Mathematical Analysis

From J, the entry in row 3 (extreme) and

From F, the entry in row 2 (deluxe) and

The entries in row 1 (regular) and column

In January, there were

31. By equating entries we find that x must satisfy

x 2 + 2000 x = 2001 and x 2 = x .

120 80 110 140

105 130 85 125

105 + 85 130 + 125 190 255

In January a total of 1 + 3 + 4 = 8 red

Solve 0.8 x1 40 = 496 to get x1 = 670 .

Adding all entries in matrix J yields that a

30. The sums of the entries in the columns are 680,

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

Chapter 6: Matrix Algebra

ISM: Introductory Mathematical Analysis

5. 2[2 1 3] + 4[2 0 1] 0[2 3 1]

7 ] is a matrix and 66 is a number, so the sum is not defined.

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

ISM: Introductory Mathematical Analysis

17. 3(2A 3B) = 3 2

1 2 + (6) 1 + (5) 2 + (8) 1 + (6) 6 5

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

Chapter 6: Matrix Algebra

ISM: Introductory Mathematical Analysis

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

ISM: Introductory Mathematical Analysis

Copyright 2011 Pearson Education, Inc. Publishing as Prentice Hall.

Chapter 6: Matrix Algebra

ISM: Introductory Mathematical Analysis

Multiply the first equation by 2 and the second

Now add the two equations to get