Chapter 3: Matrices

Exercises 3.1 _______________________________________________________________________________

1. Matrix B has 3 rows.  1  1 0  2 2  3  0 2 5
2. Matrix E is 2  3 . 17. A – F   3  1 2  0 1  1    4 2 0 
3. A, F, and Z have the same order as G.  4  2 0  3 3  4   2 3 7 

 4 2   0 0 0   2 1 5  2 1 5
4. –D   
 3 5  18. Z  G  0 0 0    1 0 1   1 0 1
T

0 0 0   1 4 0   1 4 0 
 1 2 3
5. – F   1 0 1 1 0 2   1 3 4 2 3 2
 2 3 4  19. A  A   3 2 1    0
T
2 0    3 4 1 
6. Matrix D is 2  2 . The zero matrix of that order  4 0 3   2 1 3   2 1 6 
 1 0 2   1 1 2 
0 0 
is  20. A  F   3 2
T
1   2 0 3
.
0 0   4 0 3  3 1 4 
7. A, C, D, F, G, and Z are square.  2 1 0 
 1 1 3 0    5 2 2 
8.  B   4 2 1 1 7 1 1
 3 2 0 1 21. Because the orders are different, D – G is
undefined.
9. a23  1
22. Because the orders are different, B + F is
10. b24  1 undefined.

 1 3 4 1 1 3 0   3 3 9 0
11. A   0 2 0 
T 23. 3B  3   4 2 1 1   12 6 3 3 
 2 1 3  3 2 0 1   9 6 0 3 

 1 1 2   4 2  16 8 
24. 4 D  4    
12. F   2 0 3
T
 3 5  12 20 
 3 1 4   20 12  8 4   28 16 
25. 4C  2 D     
0 0 0   4 8   6 10  10 18 
13. A+(–A)  0 0 0   40 24  12 6   28 18
26. 8C  3D     
0 0 0   8 16   9 15  1 1 
14. If a3 j  0, then j = 2 since the only element that 27. Because the orders are different, 2 A  3B is
is 0 in the 3rd row is in the 2nd column. undefined.

5  4 3  2   9 5  4 8 12   6 3 3 
15. C + D    

 1  3 2  5  4 7 
28. 4 F  3G   4 0 4    3 0 12 
 8 12 16  15 3 0 
 1+1 0+2 -2+3  2 2 1 
10 11 15 
16. A+F =  3–1 2+0 1+1   2 2 2 
  1 0 16 
 4+2 0–3 3–4   6 3 1
 23 9 16 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 142
 Chapter 3: Matrices

 x 1 0  3 1 0 3 x  8 x  20 12  4 z  20
29.  0 y z    0 2 3 5 x  20 4 z  8
 w 2 1  4 2 1 x  4 z  2
By setting corresponding elements equal we 12 y   6   6 3w   4w   14
have x = 3, y = 2, z = 3, w = 4.
12 y  6  6 3w  4 w  14
0 x 1 0 4 1 12 y  0 7 w  14
30.  3 y y    3 1 y  y0 w2
 z 0 2   1 0 w
 74 79 14 20 93 
By setting corresponding elements equal we 35. a. A 
have w = 2, x = 4, y = 1, and z = 1.  27 21 23 15 70 
 253 214 69 8 19 
 x 3 2 x  1  2 x  4 z 7  B 
31.     20 17 20 1 3 
y 4 4y   1 w  1 3 y  1
2x – 4 = x or x = 4, z = 3, y = 1, 327 293 83 28 112 
b. A + B   
w + 1 = 4 or w = 3.  47 38 43 16 73 
 x y x  3   2 x  1 1 w 179 135 55 12 74 
32.   c. B – A   
 5  y 4   7 4 3 14 67 
z 4 4y   x
Setting corresponding elements equal gives the The absolute values of the negative entries
following: tell us how many more endangered or
x  2 x  1 y  1 x  3  w z  x threatened species are in the United States.
1 x 1 3  w z  1
1341.3 148.7 93.3 
4w  73.8 69.4 69.2 
36. a. B  
 3 x 3 y   4 x 2 y  14 4  y   1.56 2.16 3.05
33.      
3 y 3 z   6 y 8 z  18 15   19.6 41.8 20.9 
Setting corresponding elements equal gives the 1211.5 192.4 165.5 
following:  80.8 79.0 78.4 
3x  4 x  14 3y  2 y  4  y A
 1.88 1.68 1.95
7 x  14 2y  4  
 8.3 12.5 10.2 
x2 y2
 129.8 43.7 72.2 
3 y  6 y  18 3z  8 z  15  7 9.6 9.2 
9 y  18 5 z  15 b. C  A  B  
 0.32 0.48 1.1 
y2 z  3  
 11.3 29.3 10.7 
 3 x 12   8 x 4 z   20 20  c. The negative entries in row 3 indicate that
34.     the infant mortality rates of all three
12 y 3w  6 4 w  6 14  countries are projected to be reduced, which
Setting corresponding elements equal gives the is a positive change for the countries.
following:

11041.7 8978.4 6461 

 8739.8 9159.6 6877.3
37. a. Capital Expenditures  Gross Operating Costs = 
 9798.1 9086.7 6448.4 
 
 9696.6 8926.7 6109.5 
b. Air pollution (R4, C1)

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 143
 Chapter 3: Matrices

 475 796 388 686 5613

 492 849 374 41 6029 
38. a. M F 
 500 909 379 842 6644 
 
 502 932 425 1671 7357 
M  F represents the projected differences of male and female populations for different ages and years.

b. The female population is projected to be greater than the male population for ages 18 – 64 in 2015 and for
those over age 64 in all years 2015 – 2030.
825 580 1560   75 20 140 
39. a. A B    b. B  A  
810 650 350   10 50 50 

40. Table form.

Democrats Republicans Independents Not Registered
843 257 135 92 Approve
426 451 127 64 Disapprove
751 92 38 44 No opinion
 843 257 135 92 
A 3  4 matrix representing this information is  426 451 127 64  .
 751 92 38 44 

41. a. M F M F 43. All answers are in quadrillion BTUs.

 78.6 82.9   74.0 79.8  0.41 0.18 0.33 
 80.2 84.1   76.1 81.3 a. E  M   1.49 0.09 1.56 
 
A   81.7 85.2  B   78.0 82.8  13.29 12.05 12.56 
    This represents the U.S. balance of trade for
 83.2 86.4   79.8 84.1
 84.5   81.4 various energy types for selected years.
87.4  85.3
 3.09 3.13 3.07 
b. M F b. 121 C   2.16 2.23 2.27 
 2.90 3.06 3.18 
 4.6 3.1
 4.1 2.8 This represents the average monthly U.S.
  consumption of various energy types for
A  B  3.7 2.4  selected years.
 
3.4 2.3  37.45 37.36 36.54 
 3.1 2.1 c. C  E  M   24.37 26.86 28.84 
c. The life expectancy difference is greatest in  21.53 24.68 25.63 
2020.
This represents the total U.S. production of
various energy types for selected years.
1755.1 1034.8 4550.1 564.3
42. a. E
 5053 2979 13, 099 1624  44. a.
b. 120, 000 180, 000   78, 000 117, 000 
0.65  75, 000 45, 000    48, 750 29, 250 
1862.2 1097.9 4827.7 598.7  105, 000 174, 000   68, 250 113,100 
1.061E  
5361 3161 13898 1723  b.  24, 000 216, 000 
 15, 000 54, 000  (This is 20% of the
  first column and
 21, 000 208,800  120% of the second.)

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 144
 Chapter 3: Matrices

 92.40 168 420 21  0 1 0 1 0

 84 168 84 0  0 0 0 0 1 
 
45. a. 1.05 A  117.60 294 189 0  48. a. A  0 1 0 0 1
   
 63 294 84 42  1 0 1 0 1
 84 0 420 21  0 1 0 0 0 
 96.80 176 440 22 
 88 176 88 0  0 0 1 0 1
 0
b. 1.10 A  123.20 308 198 0   0 0 0 0 
  b. B  0 1 0 0 1
 66 308 88 44 
 
 88 0 440 22  0 1 0 0 1
0 0 0 0 0 

50, 000 52, 000 24, 000 

0 1 1 1 1
46. a. 0.80  30, 000 104, 000 10, 000  0
 0 0 0 1
16, 000 40, 000 240, 000 
c. A  B  0 2 0 0 2
 40, 000 41, 600 19, 200   
1 1 1 0 2
  24, 000 83, 200 8000  0 1 0 0 0 
12,800 32, 000 192, 000 
b. They paid 100% of the debts due in Sum in Row 1 = 4, Row 2 = 1, Row 3 = 4,
30 days and 50% of the debts due in 60 days. Row 4 = 5, Row 5 = 1.
Player 4 is the top-ranked player.
01 1 0  50  30 30  45  80 75 
1 49. a. A B   
 0 1 1  
36  22 44  62  58 106 
47. a.
00 0 1
 
01 1 0 80  96 75  52 
b. A+B +C   
0 1 1 1   58  81 106  37 
1 0 1 1  176 127 
b.    
0 1 0 1  139 143
 
1 1 1 0  50 – 40 30 – 26  10 4
c. A– D   
 0 2 2 1 36 – 29 44 – 42   7 2 
2 0 2 2  30 – 40 45 – 26   10 19 
c. A  B    d. B –D =  
0 1 0 2  22 – 29 62 – 42   7 20 
  Shortage; take from inventory.
 1 2 2 0 
Sum in Row 1 = 5, Row 2 = 6, Row 3 = 3,
Row 4 = 5. Person 2 is the most active. 50. 1 2 3 4 5 6
WHN 1  23 23 15 26 20 34 
WHN 2  24 23 16 28 21 33 
WHN 3 18 17 15 18 17 22 

51. a. 3,4,5,6
b. 1

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 145
 Chapter 3: Matrices

52. Subtract 0.01 from each entry in column 2 and column 5.

Subtract 0.02 from each entry in column 7.
1.00 0.94 0.95 0.95 0.94 0.85 0.83 0.85 0.85
0.85 0.99 0.95 0.95 0.94 0.95 0.83 0.85 0.85

0.85 0.84 1.00 0.95 0.94 0.95 0.93 0.85 0.85
 
0.85 0.84 0.85 1.00 0.94 0.95 0.93 0.95 0.85
New E  0.85 0.84 0.85 0.85 0.99 0.95 0.93 0.95 0.95
 
0.95 0.84 0.85 0.85 0.84 1.00 0.93 0.95 0.95
0.95 0.94 0.85 0.85 0.84 0.85 0.98 0.95 0.95
 
0.95 0.94 0.95 0.85 0.84 0.85 0.83 1.00 0.95
 
0.95 0.94 0.95 0.95 0.84 0.85 0.83 0.85 1.00 

53. For each row: (C1 + C2 + C3 + C4) ÷ 4 = average efficiency

W1: 0.9625 W2: 0.9375 W3: 0.9125
W4: 0.8875 W5: 0.85 W6: 0.875
W7: 0.90 W8: 0.925 W9: 0.95
W5 is least efficient. He works best at center 5.

54. Work Centers 1 2 3 4 5 6 7 8 9

[0.88 0.90 0.92 0.94 0.96 0.93 0.91 0.89 0.87]
Number 5; Number 9

Exercises 3.2 _______________________________________________________________________________

 4 5 3   4 2 
5. CD    
1. 1 2 3   5  1 4  2  5  3  6  [32] 1 2   3 5 
 6   20  9 10  15
 
(not 32)  4  6 2  10 
 29 25
 0 
10 12 
2.  2 0 3  1   2  0  0 1  3(3)  [9]
4 2  5 3 
 3 6. DC   
3 5  1 2 
3 5
3. 1 2    1  3  2  4 1  5  2  6  20  2 12  4 
4 6  
15  5 9  10 
 11 17 
 22 16 
1 2   
4.  3 0      3  1  0  4 3  2  0  5  20 19 
4 5 Note CD  DC
 3 6
 4 2  1 0 4
7. DE   
 3 5  5 1 0 
 4  10 0  2 16  0 

3  25 0  5 12  0 
14 2 16 
 
 28 5 12 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 146
 Chapter 3: Matrices

5 3   1 0 1 3
8. CF    
1 2   2 1 3 4 
5  6 0  3 5  9 15  12 

 1  4 0  2 1  6 3  8
11 3 4 3
 
 5 2 5 5

 1 0 2   1 1 3 0  1  0  6 1  0  4 3  0  0 0  0  2   7 5 3 2 
9. AB   3 2 1   4 2 1 1    3  8  3 3  4  2 9  2  0 0  2  1   14 9 11 3 
 4 0 3   3 2 0 1   4  0  9 4  0  6 12  0  0 0  0  3  13 10 12 3 

10. EC is undefined.

11. BA is undefined.
1 4 3
  2  1  0  3  0 4  0  1  3 3  0  0  3
 1 0 1 3  1 2
12. FBT       2 6 6 
 2 1 3 4   3 1 0   2  1  9  0 8  2  3  4 6  2  0  4   
  10 5 0 
0 1 1

1 1 3 0
1 0 4   1  0  12 1  0  8 3  0  0 0  0  4  13 9 3 4 
13. EB     4 2 1 1     
5 1 0   3 2 0 1   5  4  0 5  2  0 15  1  0 0  1  0   9 7 16 1 
 

14. BE is undefined.

1 3 4 
1 0 4   1  0  8 3  0  4 4  0  12  9 7 16 
15. EA   T
 0 2 0    

5 1 0    5  0  0 15  2  0 20  0  0  5 17 20 
 2 1 3 

1 0 2  1 5   1  0  8 5  0  0  9 5 
16. AE   3 2 1   0 1    3  0  4 15  2  0    7 17 
T

 4 0 3   4 0   4  0  12 20  0  0  16 20 

1 0 2  1 0 2   1  0  8 0  0  0 2  0  6   9 0 8 
17. A   3 2 1   3 2 1    3  6  4 0  4  0 6  2  3  13 4 11
2

 4 0 3   4 0 3   4  0  12 0  0  0 8  0  9  16 0 17 

1 0 2  1 0 2  1 0 2   9 0 8  1 0 2 
18. A   3 2 1   3
3
2 1   3 2 1   13 4 11  3 2 1 
 4 0 3   4 0 3   4 0 3  16 0 17   4 0 17 
 9  0  32 0  0  0 18  0  24   41 0 42 
 13  12  44 0  8  0 26  4  33   69 8 63 
 16  0  68 0  0  0 32  0  51 84 0 83 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 147
 Chapter 3: Matrices

5 3   5 3  5 3   5 3   25  3 15  6 
19. C 3           
1 2   1 2  1 2   1 2   5  2 3  4 
5 3   28 21 140  21 105  21 161 126 
    
1 2   7 7   28  14 21  14   42 35 

20. F 2 is undefined.

 1 0 2  1 3 4  5 5 10 
21. AAT   3 2 1  0 2 0    5 14 15
 4 0 3  2 1 3 10 15 25
 5 5 10  1 3 4   1 0 2   26 6 17 

( AA )   5 14 15
T T  A A   0
T
2 0   3 2 1   6 4 2 
10 15 25  2 1 3  4 0 3  17 2 14 
No, they are not equal.
 5 3   4 2   1 0 4   29 25 1 0 4  154 25 116 
22. (CD )E         
 1 2   3 5   5 1 0  10 12  5 1 0   70 12 40 
5 3    4 2  1 0 4   5 3  14 2 16  154 25 116 
C (DE )          
1 2    3 5  5 1 0   1 2   28 5 12   70 12 40 
They are equal.

23. No. See problems 5 and 7

24. Yes. In general, (kA)(B) = k(AB).

 2 5 4   1 2 1  2  25  28 4  40  44 2  10  12   55 88 0 
25. AB   1 4 3  5 8 2    1  20  21 2  32  33 1  8  9    42 67 0 
 1 3 2   7 11 3  1  15  14 2  24  22 1  6  6   28 44 1

 1 2 1  2 5 4   2  2  1 5  8  3 4  6  2   1 0 0 
  
26. BA   5 8 2   1 4 3   10  8  2 25  32  6 20  24  4    0 1 0 
 
 7 11 –3  1 3 2   14  11  3 35  44  9 28  33  6   6 18 11

3 0 4   4 4 8 12  0  12 12  0  12 24  0  24  0 0 0 

27. CD   1 7 1  1 1 2    4  7  3 473 8  14  6   0 0 0 
3 0 4   3 3 6  12  0  12 12  0  12 24  0  24  0 0 0 

 4 4 8 3 0 4  12  4  24 0  28  0 16  4  32   8 28 20 

28. DC   1 1 2   1 7 1   3  1  6 0  7  0 4  1  8   2 7 5
 3 3 6  3 0 4   9  3  18 0  21  0 12  3  24   6 21 15

0 1 2  0 1 2  0  0  0 0  0  0 0  4  0  0 0 4 
29. F  0 0 4  0 0 4   0  0  0 0  0  0 0  0  0   0 0 0 
2

0 0 0  0 0 0  0  0  0 0  0  0 0  0  0  0 0 0 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 148
 Chapter 3: Matrices

0 0 4  0 1 2  0  0  0 0  0  0 0  0  0  0 0 0 
F  0 0 0  0 0 4   0  0  0 0  0  0 0  0  0   0 0 0 
3

0 0 0  0 0 0  0  0  0 0  0  0 0  0  0  0 0 0 

0 0 0
30. AZ  0 0 0   Z
0 0 0 

31. AI = A See Example 6.

32. IA = A

33. Z(CI) = ZC = Z (ZC)I = ZI = Z

Product of zero matrix and A is the zero matrix.

34. IFZ = Z

35. Problem 27 shows that a product can be “zero” and neither of the factors is zero.

36. Yes, it is true that multiplication by the zero matrix gives a result of a zero matrix, provided the multiplication is
defined.

1 1
37. a. We will use AB and BA.
ad  bc ad  bc
 a b   d b   ad  bc  ab  ba   ad  bc 0 
AB     c    cd  dc bc  ad    0
 c d  a     ad  bc 
 d b   a b   ad  bc bd  bd   ad  bc 0 
BA        
 c a   c d    ac  ac bc  ad   0 ad  bc 
1 1 1 0 
AB  BA   .
ad  bc ad  bc 0 1 
b. For B to exist, we must have

 1 2
 0 1
 1 0 1 3   
38. F    and F T

 2  1 3  4    1 3 
 
 3 4 
a. yes
b. F F T is 2  2 ; F T F is 4  4
c. No, because F F T and F T F have different dimensions.

39.  1 2 1  2   2  2  2   2 
 3 4 2   1   6  4  4    2 
      
 2 0 1  2   4  0  2   2 
These values are the solution.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 149
 Chapter 3: Matrices

40.  3 1 0  2  6  2  0  4
 2 2 1  2    4  4  1   9 
      
 1 1 2   1  2  2  2   2 
These values are the solution.

41.
1 1 2  1  1  2  2  5
 4 0 1   2    4  0  1  5
      
 2 1 1  1   2  2  1 5
These values are the solution.

42.
1 0 2   2   2  0  2   4   0 
3 1 0   1    6  1  0    7    7 
        
1 2 1   1   2  2  1   5   3 
 x  2 1 0 2   x   0  .
So,  y    1  is not a solution of 3 1 0   y    7 
   
 z   1  1 2 1   z   3 

 0 0 0 0 10 
 10 5 
 0.1 0.0 0.1 0.1 0.2   0 5 10 
 0.1 0.2 0.1  3 3 
 0.1 0.1  20 35 
 10 15   20 
43.  0.1 0.1 0.1 0.2 0.1   3 3 
 
 0.1 0.2 0.1 0.1 0.1   20 5 
 0 5  10 
 0.1 0.0 0.0 0.0 0.0   3 3 
 20 20 
 10 10  20 
3 3 
1 0 0 0 0  1 0 0 0 0
0 1 0 0.002 0  0 1 0 0 0 

 0 0 0.999 0.002 0   0 0 1 0 0
   
0 0 0 0.998 0  0 0 0 1 0
0 0 0 0 1  0 0 0 0 1 
The graphing calculator should show 1’s on the main diagonal and 0’s everywhere else (1 may be 0.9999 or
0.998 and 0 may be 0.002 or -0.002).

 3 15 9 15 6   2 3 0 1 3 12 0 0 0 0 
 3 9 3 9 6   1 0 2 3 1  0 12 0 0 0 
1  1  
44.  1 17 3 23 4   0 1 0 2 3   0 0 12 0 0 
12    12  
 0 12 0 12 0   1 0 2 2 1  0 0 0 12 0 
 1 5 3 5 2  1 0 0 0 3  0 0 0 0 12 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 150
 Chapter 3: Matrices

1 0 0 0 0
0 1 0 0 0 

 0 0 1 0 0
 
0 0 0 1 0
 0 0 0 0 1 

45.
0.88 0  36, 000 42, 000    31, 680 36,960 
 0 0.85  50, 000 56, 000   42,500 47, 600 
    
The product is the price the dealer pays for the cars.

46. Revenue =  200 40 50 30 Given matrix 

 40 63 18 
 85 56 42 
 200 40 50 30    11,910 16, 040 5,920
6 18 8 
 
 7 10 8 
So, the revenue is as follows:
Atlanta: $11,910,000
Chicago $16,040,000
New York: $ 5,920,000

 86.86 91.25 95.37  91.1 0 0 

47. a. A   27.57  
29.82 32.05  and B   0 86.0 0 
 6.36 6.45 6.60   0 0 82.5
 7913 7848 7868 
b. AB   2512 2565 2644 
579.4 554.7 544.5
c. The 1-1 entry is the trillions of BTUs used in single-family households in 2015. The 2-3 entry is the
trillions of BTUs predicted to be used in multi-family households in 2025.
d. Using AB as stored in a calculator, 1 1 1 AB  11, 004.0 10,966.7 11, 056.7 . Left to right, each
entry gives the trillions of BTUs of delivered energy consumed by all households in 2015, 2020, and 2025.

0.162 0.047   9,371, 700 438,134, 000 

0.119 0.086   6,884,150 801, 692, 000 
  57,850, 000 0  
48. AB  0.066 0.065      3,818,100 605,930, 000 
  0 9,322, 000, 000   
 0.298 0.582  17, 239,300 5, 425, 404, 000 
0.202 0.215   11, 685, 700 2, 004, 230, 000 

0.8 0.2 
49. a.  0.5 0.5     0.55 0.45 After 5 years, M has 55% and S has 45% of the population.
 0.3 0.7 
b. 10 years:  PD  D  PD 2 ; 15 years: PD 3
c. 60% in M and 40% in S. The population proportions are stable.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 151
 Chapter 3: Matrices

0.20 0 0  12.5 250   2.500 50.00 


50. a. GA   0 0.07 0  11.8 215   0.826 15.05 
 0 0 0   9.8 190   0 0 
1.20 0 0   15 300 
b.  I  G  A   0 1.07 0  A  12.626 230.05
  
 0 0 1   9.8 190 

W a s t e blank n o t blank w a n t blank n o t

51.
23 1 19 20 5 27 14 15 20 27 23 1 14 20 27 14 15 20

 5 9   23 19 5 14 20 23 14 27 15  124 275 268 205 343 124 250 261 255

 6 11  1 20 27 15 27 1 20 14 20   149 334 327 249 417 149 304 316 310 
    
So 124, 149, 275, 334, 268, 327, 205, 249, 343, 417, 124, 149, 250, 304, 261, 316, 255, 310 is the message
sent.

52. T o blank b e blank o r blank n o t blank t o blank b e

20 15 27 2 5 27 15 18 27 14 15 20 27 20 15 27 2 5
 5 9   20 27 5 15 27 15 27 15 2   235 153 268 237 261 255 315 318 55 
 6 11 15 2 27 18 14 20 20 27 5    285 184 327 288 316 310 382 387 67 
    
Thus, 235, 285, 153, 184, 268, 327, 237, 288, 261, 316, 255, 310, 315, 382, 318, 387, 55, 67 is sent.

 22 30 
3 2
 1
   23.3 33.25 
53. a. B   14 5
 ; D  12 20  ; BD  
4
Houston needs 23,300 gallons of black crude and
4
3

3
18.7 27.75
 8 11 
5 4

18,700 gallons of gold. Gulfport needs 32,250 gallons of black and 27,750 gallons of gold.
b. PBD  56.574 82.415 ; Houston’s cost = $56,574; Gulfport’s cost = $82,415

1200 1500 1500 2000 

8.50 5.50 12.00     22,800 24, 250 23, 050 37, 250 
54. a. 6.00 4.00 15.00  1200 1000 1000 1500   19,500 20,500 19, 000 33, 000  $22,800
   500 500 400 1000   
 
1
 1200 1500 1500 2000    
 8.50 5.50 12.00     1
b.    1200 1000 1000 1500   1
 6.00 4.00 15.00   500 500 400 1000  
   
1
1

 22,800 24, 250 23, 050 37, 250  1 107,350 
   
19,500 20,500 19, 000 33, 000  1  92, 000 

1
CDT represents the total costs for Labor and Materials for the entire year.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 152
 Chapter 3: Matrices

 0.7 8.5 10.2 1.1 5.6 3.6  1.11 0 0 0 0 0

 0.5 0.2 6.1 1.3 0.2 1.0   0 0.95 0 0 0 0 
 
 2.2 0.4 8.8 1.2 1.2 4.8  0 0 1.11 0 0 0
55. a. B    b.A 
 251.8 63.4 81.6 35.2 54.3 144.2   0 0 0 1.11 0 0
 30.0 1.0 1.0 1.0 1.0 1.0   0 0 0 0 0.95 0
   
 788.9 0 0 0 0 0   0 0 0 0 0 0.95

 0.7 8.5 10.2 1.1 5.6 3.6  1.20 0 0 0 0 0

56.  0.5 0.2 6.1 1.3 0.2  
1.0   0 1.03 0 0 0 0 

 2.2 0.4 8.8 1.2 1.2 4.8  0 0 1.05 0 0 0
  
 251.8 63.4 81.6 35.2 54.3 144.2   0 0 0 1.20 0 0
 30.0 1.0 1.0 1.0 1.0 1.0   0 0 0 0 1.05 0
  
 788.9 0 0 0 0 0   0 0 0 0 0 0.97 
 0.840 8.755 10.710 1.320 5.880 3.492 
 0.600 0.206 6.405 1.560 0.210 0.970 

 2.640 0.412 9.240 1.440 1.260 4.656 
 
302.160 65.302 85.680 42.240 57.015 139.874 
 36.000 1.030 1.050 1.200 1.050 0.970 
 
 946.68 0 0 0 0 0 

Exercises 3.3 __________________________________________________________________

1.  1 2 1 7 
3 1 2 0  3R1  R2  R2

 4 2 2 1 
 1 2 1 7 
 0 7 5 21
 
 4 2 2 1
 1 2 1 7 
 3 1 2 0
2.  1 2 1 7   
3 1 2 0    0 10 6 29 

 4 2 2 
1 4R1  R3  R3

3.  1 3 4 2 
 2 0 2 1
 
 1 2 1 1

4.  1 2 2 3
 1 2 0 4 
 
 0 1 1 1

1
5. x = 2, y  , z = –5
2

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 153
 Chapter 3: Matrices

1
6. x = –8, y = 1, z 
3

7. 1 1 2 1  1 1 2 1  R2  R1  R1
0 3 1 7  R3  R2  R2 0 1 5 7 
  
 0 2 4 0   0 2 4 0  2 R2  R3  R3
1 0 3 8 1 0 3 8 3R3  R1  R1  1 0 0 5
0 1 5 7  
0 1 5 7  5 R3  R2  R2
0 1 0 2 
   
 0 0 14 14  R3  R3
1
14
 0 0 1 1 0 0 1 1
Solution: x  5, y  2, z  1

8.  1 5 2 6  R2  R3  1 5 2 6  5 R2  R1  R1
0 2 3 9  0 1 3 0 
    
0 1 3 0  0 2 3 9  2 R2  R3  R3
 1 0 13 6   1 0 13 6  13R3  R1  R1  1 0 0 19 
0 1 3 0  
0 1 3 0  3R3  R2  R2 0 1 0 3
   
 0 0 9 9  19 R3  R3  0 0 1 1  0 0 1 1
Solution: x = 19, y = –3, z = 1

9. 1 2 5 4   1 2 5 4  R2  R3  1 2 5 4  2 R2  R1  R1
2 2 
4 2  2R1  R2  R2 0 6 6 6  0 1 3 7 
    
 0 1 3 7  0 1 3 7  0 6 6 6  6 R2  R3  R3
1 0 11 18 1 0 11 18 11R3  R1  R1  1 0 0 4
0 1 3 7   0 1 3 
7  3R3  R2  R2 0 1 0 1
  
0 0 24 48  24 R3  R3 0 0 1 2   0 0 1 2 
1

Solution: x  4, y  1, z  2

10.  1 1 1 3  1 1 1 3 R2  R3
3 2 4 5 3R  R  R 0 5 1 4 
  1 2 2  
 1 2 1 4   R1  R3  R3  0 1 0 1
 1 1 1 3  R2  R1  R1 1 0 1 2   R3  R1  R1 1 0 0 1
0 1 0 1 0 1  0 1 0 1
 1 0     
 0 5 1 4  5 R2  R3  R3 0 0 1 1  0 0 1 1
Solution: x = 1, y = 1, z = 1

11.  1 1 1 0   1 1 1 0   R2 +R1  R1
1 2 
3 5  R1  R2  R2 0 4 5
  1 
 2 1 13 17  2 R1  R3  R3 0 3 11 17  3R2 +R3 R3
 1 0 5 5 5 R3  R1  R1 1 0 0 15
  0 0 13
 0 1 4 5 4 R3  R2  R2  1
 0 0 1 2    0 0 1 2 
Solution: x  15, y  13, z  2

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 154
 Chapter 3: Matrices

12.  1 2 1 3   1 2 1 3 2 R2  R1  R1
 2 5 2 
7  2R1  R2  R2 0 1 0 1
  
 1 1 5 12  R1  R3  R3  0 3 4 9  3R2  R3  R3
 1 0 1 1  1 0 1 1 R3  R1  R1  1 0 0 2 
0 1 0 1 
0 1 0 1  0 1 0 1
  
0 0 4 12  R3  R3
1
4
 0 0 1 3 0 0 1 3
Solution: x  2, y  1, z  3

13.  2 6 12 6  1
2
R1  R1  1 3 6 3 
 3 10 20 5  3 10 20 5 3R1  R2  R2
    
 2 0 17 4   2 0 17 4  2 R1  R3  R3
 1 3 6 3   1 3 6 3 3R2  R1  R1
0 1 2 4   R2  R2
0 1 2 4  
  
0 6 5 10  0 6 5 10  6 R2 +R3  R3
1 0 0 15  1 0 0 15   1 0 0 15
0 1 2 4    0 1 2 4  2 R  R  R 0 1 0 0 
   3 2 2  
0 0 17 34   R3  R3
1
17
0 0 1 2  0 0 1 2 
Solution: x  15, y  0, z  2

14.  3 6 9 3  13 R1  R1  1 2 3 1   1 2 3 1 2 R2  R1  R1

 1 1 2 0   1 1 2 0   R  R  R 0 1 5 1
     1 2 2  
 5 5 7 63 5 5 7 63 5R1  R3  R3 0 15 22 68 15 R2  R3  R3
 1 0 7 1  1 0 7 1 7 R3  R1  R1  1 0 0 8
 0 1 5 1  0 1 5 1 5 R3  R2  R2 0 1 0 6 
     
 0 0 53 53 1
53
R3  R3 0 0 
1 1  0 0 1 1
Solution: x  8, y  6, z  1

15. 1 2 3 1 2    1 2 3 1 2  
1 3 1 1 7   R1  R2  R2 0 1 2 2 5
    1R2  R2
1 1 0 0 2   R1  R3  R3 0 1 3 1 0 
   
1 0 1 1 2   R1  R4  R4 0 2 2 0 4 
 1 2 3 1 2  2 R2  R1  R1 1 0 7 5 8
0 5  0 5
 1 2 2  1 2 2 
0 1 3 1 0   R2  R3  R3 0 0 5 3 5  15 R3  R3
   
 0 2 2 0 4  2 R2  R4  R4  0 0 6 4 6 
1 0 7 5 8 7 R3  R1  R1 1 0 0 4 / 5 1 Now take 52 R4 1 0 0 0 1
0 1 2 2 5 2 R3  R2  R2 0 1 0 4 / 5 3 0 1 0 0 3 
  and get 0's 
0 0 1 3/5 1  0 0 1 3 / 5 1 in column 4; 0 0 1 0 1
     
 0 0 6 4 6  6 R3  R4  R4  0 0 0 2 / 5 0  Result is  0 0 0 1 0 
Solution: x  1, y  3, z  1, w  0

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 155
 Chapter 3: Matrices

16.  1 4 6 3 3   1 4 6 3 3
 1 1 0 2 5 0 5 6 5 8 R2  R4
   R1  R2  R2  
1 0 1 1 1  R1  R3  R3 0 4 7 4 2  
   
0 1 1 1 0  0 1 1 1 0 
 1 4 6 3 3 4 R2  R1  R1 1 0 10 7 3
0 1 1 1 0   0 1 0 
  1 1 
 0 4 7 4 2  4 R2  R3  R3 0 0 11 8 2  1
R3  R3
    11

 0 5 6 5 8 5R2  R4  R4  0 0 11 10 8

1 0 10 7 3 10 R3  R1  R1 1 0 0 3 /11 13 /11
0 1 1 1 0   R3  R2  R2 0 1 0 3 /11 2 /11 
 
0 0 1 8 /11 2 /11  0 0 1 8 /11 2 /11
   
 00 11 10 8 11R3  R4  R4  0 0 0 2 6  1
2
R4  R4
 1 0 0 3 /11 13 /11  113 R4  R1  R1 1 0 0 0 2
 0 1 0 3 /11 2 /11 0 1
  11 R4  R2  R2 1 0 0
3
 
 0 0 1 8 /11 2 /11  8 R  R  R 0 0 1 0 2
  11 4 3 3
 
 0 0 0 1 3   0 0 0 1 3
Solution: x  2, y  1, z  2, w  3

17. There is no solution since the last row of the reduced matrix says 0 x  0 y  0 z  1 , which is not possible.

18. There is no solution since the last row of the reduced matrix says 0 x  0 y  0 z  1 , which is not possible.

2 11
19. a. From first row: x  z
3 3
1 1
From second row: y  z  
3 3
11 2 11  2 z 1 1 1  z
General solution: x   z  , y  z for any real number z.
3 3 3 3 3 3
11 1 13 2
b. Many possibilities, including x  , y   , z  0 and x  , y   , z  1
3 3 3 3

2 7 1 2
20. From first row: x  z From second row: y  z  
3 3 3 3
2 7 1 2
General solution: x   z  , y  z  for any real number z.
3 3 3 3

21. If the bottom row of the reduced matrix has all zeros on the left side of the augment and a number other than
zero on the right side, the system has no solutions.

22. Solve for x and y in terms of z. These solutions will be valid for any real value of z.

23.  1 1 1 0    1 1 1 0
 2 1 1 0  2 R  R  R  0 3 3 0  
  1 2 2  
 1 2 2 0  R1  R3  R3  0 3 3 0  R2  R3  R3

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 156
 Chapter 3: Matrices

 1 1 1 0   1 1 1 0  R2  R1  R1  1 0 0 0
 0 3 3 0   1 R  R 0 1 1 0   0 1 1 0 
  3 2 2    
 0 0 0 0  0 0 0 0  0 0 0 0 
General solution: x  0, y   z

24.  2 1 3 0  R1  R2 1 2 2 0 
1 2 2 0   2 1 3 0  2 R1  R2  R2
  
1 3 1 0   1 3 1 0   R1  R3  R3
1 2 2 0  1 2 2 0 2 R2  R1  R1 1 0 8 / 5 0 
0 
5 1 0   5 R2  R2
1 0 1 1/ 5 0   0 1 1/ 5 0 
   
 0 5 1 0  0 5 1 0  5R2  R3  R3 0 0 0 0 
8 1
General solution: x   z , y   z
5 5

25.  3 2 1 0  R1  R2 1 1 2 2 
1 1 2 2   3 2 1 
0  3R1  R2  R2
 
 2 1 1 1  2 1 1 1 2 R1  R3  R3
1 1 2 2  1 1 2 2
0 1 5 6   0 1 5 6  No Solution
 
0 1 5 5  R2  R3  R3 0 0 0 1

26.  1 3 2 2   1 3 2 2 
 2 1 2 1 2 R1  R2  R2 0 7 6 3
  
 3 2 0 1 3R1  R3  R3 0 7 6 5  R2  R3  R3
1 3 2 2
0 7 6 3 Notice Row 3, we can already see that there is no solution to this system.

0 0 0 2 

27.  1 3 3 7   1 3 3 7
 1 2 1 2   R  R  R  5 4 9  
  1 2 2 0
3 2 4 5 3R1  R3  R3 0 11 5 16  2 R2  R3  R3
 1 3 3 7  1 3 7
3 3R2  R1  R1
0 5 4 9  R2  R3 0 
   1 3 2 

0 1 3 2  0 5 4 9  5 R2  R3  R3
 1 0 12 13 1 0 12 13 12 R3  R1  R1  1 0 0 1
0 1 3 2  
0 1 3 2  3R3  R2  R2 0 1 0 1
   
0 0 19 19   19 R3  R3
1 0 0 1 1  0 0 1 1
Solution: x  1, y  1, z  1

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 157
 Chapter 3: Matrices

28.  2 1 1 2  R1  R3  1 1 1 1   1 1 1 1
 1 1 2 3  1 1 2 3  R  R  R  0 2 3 2  R  R
     1 2 2   2 3

 1 1 1 1  2 1 1 2  2 R1  R3  R3  0 1 1 0 
 1 1 1 1  1 1 1 1  R2  R1  R1  1 0 0 1   1 0 0 1
 0 1 1 0   R  R 0 1 1 0    0 1 0 2
  2 2   0 1 1 0  R3  R2  R2  
 0 2 3 2    0 2 3 2  2 R2  R3  R3 0 0 1 2  0 0 1 2 
Solution: x  1, y  2, z  2

29.  2 –5 1 –9  R1  R2  1 4 6 2  1 4 6 2 
 1 4 6 2    2 5 
1 9  2 R1  R2  R2 0 13 13 13
  13 R2  R2
1
  
 3 4 2 10   3 4 2 10  3R1  R3  R3 0 16 16 16 
1 4 6 2 4 R2  R1  R1  1 0 2 2 
0 1 1 1  0 1 1 1
  
0 16 16 16  16 R2  R3  R3 0 0 0 0 
General solution: x  2 z  2, y  z  1

30.  2 1 1 2  R1  R3  1 1 2 3 
 3 1 6 7   3 1 6 7  3R  R  R
     1 2 2

 1 1 2 3  2 1 1 2  2 R1  R3  R3
 1 1 2 3  1 1 2 3 R2  R1  R1  1 0 1 1
0 4 12 16  R  R 0 1 3 4    0 1 3 4 
  2 3    
0 1 3 4   0 4 12 16  4 R2  R3  R3  0 0 0 0 
General solution: x  z  1, y  3z  4

31. 1 1 1 3   1 1 1 3 
1 1 1 4   R  R  R 0 2 0 1 1
  1 2 2   2 2  R2
 R
 1 1 1 3   R2  R1  R1  1 0 1 7 / 2
 0 1 0 1/ 2   0 1 0 1/ 2 
    
7 1
General Solution: x  z, y , z z
2 2

32. 3 2 1 3 R1  R2  1 1 1 2  
 1 1 1 2  3 2 1 3 3R  R  R
     1 2 2

 1 1 1 2    1 1 1 2  R2  R1  R1  1 0  15 7
5
 0 5 4 3 1 R  R  0 1 54  53   
  5 2 2   0 1
4
5
 
3
5

7 1 3 4
General Solution: x   z , y    z
5 5 5 5

33.  3 2 5 14   R2  R1  R1  1 1 1 6 
 2 3 4 8  2 3 4 8 2 R  R  R
     1 2 2

 1 1 1 6  1 1 1 6   R2  R1  R1 1 0 7
5
26
5 
 0 5 2 4   R2  R2
1 0 1  2 4   
  5  5 5   0 1  2
5
4
5 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 158
 Chapter 3: Matrices

26 7 4 2
General Solution: x   z, y   z
5 5 5 5

34.  1 4 1 4    1 4 1 4  
 2 5 5 9  2 R1  R2  R2 0 3 7 1
 
1
3
R2  R2
 1 4 1 4  1 0 
4 R2  R1  R1 25
3
 
16
3
0 1  73  13   
0 1   
7 1
  3 3

16 25 1 7
General Solution: x    z , y    z
3 3 3 3

35.  0.6 0.1 0.4 10  10 R1  R1 6 1 4 100    6 1 4 100 

 0.4 0.7 0.2 26     
  10 R2  R2  4 7 2 260  2 R1  3R2  R2  0 19 14 580 
 0.2 0.6 0.5 20  10 R3  R3  2 6 5 200   R2  2 R3  R3  0 19 12 660 
 6 1 4 100    6 1 4 100  191 R3  R1  R1
  0 19 14 580  7 R  R  R  0 19 0 1140   1 R  R
  3 2 2   19 2 2

R2  R3  R3  0 0 2 80  1
2 3
R  R3

 0 0 1 40 
 
 6 0 4 40   16  4 R3  R1   R1  1 0 0 20 
 0 1 0 60   0 1 0 60  General solution: x1  20, x2  60, x3  40
   
 0 0 1 40   0 0 1 40 

36.  0.1 0.1 0.3 17  10 R1  R1  1 1 3 170   1 1 3 170  

0.2 0.3  
 0.1 9  10 R2  R2  2 3 1 90  2 R1  R2  R2 0 5 7 430  R2  R3  R3
 0.3 0.2 0.5 5  10 R2  R2  3 2 5 50  3R2  2 R3  R3 0 5 13 370 
 1 1 3 170   1 1 3 170  R2  R1  R1  1 0  85 84 
0 5 7  
 430  5 R2  R2 0
 1
1 75 86   0 1 7
5
86 
0 0 6 60   16 R3  R3 0 0 1 10   0 0 1 10 
8
5
R3  R1  R1 1 0 0 100 
 R3  R2  R2
7 0 1 0 100 
5 
 0 0 1 10 
General solution: x  100, y  100, z  10

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 159
 Chapter 3: Matrices

37.  1 3 2 2 3  1 3 2 2 3
1 1 3 0 4   R1  R2  R2
0 2 1 2 1 *See note
 
2 0 2 3 4 2 R1  R3  R3 0 6 2 7 2  –3R4  R3  R3
   
 1 3 0 0 1  R1  R4  R4 0 6 2 2 2  
1 3 2 2 3 1 3 2 2 3 2 R4  R1  R1
 0 2  1   0 2  1
 1 2  1 2 2 R4  R2  R2
 0 12 4 1 4   R3  R3  0 6 2 2 2  2 R4  R3  R3
   
 0 6 2 2 2  then R3  R4  0 12 4 1 4  
 1 27 10 0 11   1 27 10 0 11 
 0 26 7 0 
7  3R2  R2 0 
78 21 0 21  R3  R2  R2
 
 0 30 10 0 10   0 60 20 0 20 
   
 0 12 4 1 4  2 R3  R3  0 12 4 1 4 
 1 27 10 0 11 10 R2  R1  R1  1 153 0 0 1 
0 18 1 0 1  0 
18 1 0 1  300 R3  R3
1
 
 0 60 20 0 20  20 R2 +R3  R3  0 300 0 0 0  then R2  R3
   
 0 12 4 1 4  4 R2  R4  R4  0 60 0 1 0 
 1 153 0 0 1 153R2  R1  R1  1 0 0 0 1
0 1 0 0 0   0 1 0 0 0 
  
0 18 1 0 1 18 R2  R3  R3  0 0 1 0 1
   
 0 60 0 1 0  60 R2  R4  R4  0 0 0 1 0 
Solution: x1  1, x2  0, x3  1, x4  0
*Note: The author’s step by step method always works. However, it is often necessary to introduce fractions.
This problem has been worked “backwards” to illustrate an alternate method and avoid fractions.

38.  1 1 1 2 1  1 1 1 2 1 
 1 0 3 
0 2   R1  R2  R2 0 1 4 2 
1  R2  R2
 
 1 3 0 1 2   R1  R3  R3 0 4 1 1 3
   
0 1 4 1 0  0 1 4 1 0 
1 1 1 2 1  R2  R1  R1  1 0 3 0 2 
0 2 1   0 1 4 2 1
 1 4   
 0 4 1 1 3 4 R2  R3  R3  0 0 15 7 7  15 R3  R3
1
   
 0 1 4 1 0   R2  R4  R4  0 0 8 1 1
1 0 3 0 2  3R3  R1  R1 1 0 0 7/5 3 / 5
 1 4 R3  R2  R2 0 13 /15 
0 1 4 2  1 0 2 /15
0 0 1 7 /15 7 /15  0 0 1 7 /15 7 /15
   
 0 0 8 1 1 8 R3  R4  R4  0 0 0 41/15 41/15 15
41
R4  R4
1 00 7/5 3 / 5  R4  R1  R1
7
5 1 0 0 0 2
0 0 2 /15 13 /15 0 0 1
 1  R4  R2  R2
2
15  1 0
0 0 1 7 /15 7 /15  157 R4  R3  R3 0 0 1 0 0
   
 0 00 1 1   0 0 0 1 1
Solution: x1  2, x2  1, x3  0, x4  1

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 160
 Chapter 3: Matrices

39.  1 2 1 1 3   1 2 1 1 3 2R2  R1  R1 1 0 11 1 13

1 
1 2   R1  R2  R2 0 1 5 0 5 0 5 0 5
 3 4    1
2 5 2 2 1 2 R1  R3  R3 0 1 4 0 5  R2  R3  R3 0 0 1 0 0 
     
 2 3 6 2 3 2 R1  R4  R4 0 1 4 0 3 R2  R4  R4 0 0 1 0 8
The last two rows state that x3  0 and x3  8. Thus, there is no solution.

40. 1 2 3 4 2  1 2 3 4 2 1 2 3 4 2
1 2   R1  R2  R2 0 1 1 0  R2  R4 0 0 4 2 
 2 4 3  0  2 1
2
R2  R2
2 4 6 8 4  2 R1  R3  R3 0 0 0 0 0  0 0 0 0 0 
     
1 4 3 0 4   R1  R4  R4 0 2 0 4 2  0 0 1 1 0  R3  R4
1 3 4 2  2 R2  R1  R1
2 1 0 3 8 0  3R3  R1  R1 1 0 0 11 0 
0 0 2 1
1  0 1 0 2 1 0 1 0 2 1
    
0 1 1 0 
0 0 0 1 1 0  0 0 1 1 0 
     
 0 0 0 0 
0  0 0 0 0 0   0 0 0 0 0 
General solution: x1  11x4 , x2  2 x4  1, x3  x4

41.  1 3 4 1 1
2   1 3 4 1 2 1
 1 1 2   
 1 3 R1  R2  R2
0 0 4 6 2 2 2  R2  R3
1 2 3 1 0
4 R1  R3  R3 0 1 1 2 2 1
   
2 2 2 0 2 4  2 R1  R4  R4 0 4 6 2 2 2 
1 3 4 1 2 1 3R2  R1  R1 1 0 1 5 8 2  
0 2 2     
 1 1 1  0 1 1 2 2 1
0 4 6 2 2 2  4 R2  R3  R3 0 0 2 6 10 6 
1
R  R3
2 3
   
 0 4 6 2 2 2  4 R2  R4  R4  0 0 2 6 10 6  R4  R3  R4
 1 0 1 5 8 2   R3  R1  R1 1 0 0 2 3 1
 0 1 1 2 2   
 1  R3  R2  R2  0 1 0 5 7 4 
 0 0 1 3 5 3   0 0 1 3 5 3
   
0 0 0 0 0 0 0 0 0 0 0 0
There are infinitely many solutions.
General solution: x1  1  2 x4  3x5 , x2  4  5 x4  7 x5 , x3  3  3 x4  5 x5

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 161
 Chapter 3: Matrices

42.  2 1 1 3 7  R1  R2
3  1 1 1 2 2 0 
1 1 1   2 1 1 3 3 7  2 R1  R2  R2
 2
2 0   
 2 1 1 1 3
1  2 1 1 1 1 3 2 R1  R3  R3
   
 4 1 3 1
1 1  4 1 3 1 1 1 4 R1  R4  R4
1 1 1 2 2 0 1 1 1 2 2 0   R2  R1  R1
 0 3 1 1 1 7  0 3 
   R3  R2  1 3 3 3
 0 1 3 3 3 3   0 3 1 1 1 7  3R2  R3  R3
   
 0 5 7 7 7 1  0 5 7 7 7 1 5R2  R4  R4
 1 0 2 1 1 3  1 0 2 1 1 3 2 R3  R1  R1
 0 1 3 3 3 3 0 1 3 3 3 3 3R3  R2  R2
  1
R  R 
0 0 8 8 8 16  8 3 3
0 0 1 1 1 2 
   R3  R4  R4  
0 0 8 8 8 16  0 0 0 0 0 0
 1 0 0 1 1 1
 0 1 0 0 0 3
 
0 0 1 1 1 2 
 
0 0 0 0 0 0 
There are infinitely many solutions.
General Solution: x1  1  x4  x5 , x2  3, x3  2  x4  x5

 b1 c1 
 b1 c1  1 
a c1  1
R1  R1  1 
a1 
b1 a1 a1
43.  1 a1
a1  
 a2 b2 c2  
  a2 R1  R2  R2  b2 a1  b1a2 c2 a1  c1a2 
 a2 b2 c2  0 
 a1 a1 
 b2 c1  c2 b1 
 1 0
a1b2  a2 b1 
b1 a1
  R2  R1  R1   Thus, x  b2 c1  c2 b1 .
a1 b2 a1  b1a2
 b2 a1  b1a2 c2 a1  c1a2  a1b2  a2 b1
 0 
 a1 a1 
Fractions and messy computations cannot always be avoided.

 b1 c1 
a c1  1
R1  R1  1 
a1 
b1
44.  1 a1
a1
 a2 b2 c2  
  a2 R1  R2  R2
 a2 b2 c2 
 b1 c1   b1 c1 
1   1 
 y  a2 c1  a1c2
a1 a1 a1 a1
  a1 
 a2 b1  b2 a1 a2 c1  c2 a1  R2  R2  a2 c1  c2 a1  a2 b1  a1b2
0  a2 b1  b2 a1 0 1 
 a1 a1   a2 b1  b2 a1 

45. Let x = cups of Beef. Let y = cups of Sirloin Burger.

Fat: 2.5x + 7y = 61, Cholesterol: 15x + 15y = 150 or x + y = 10
 2.5 7 61  1 0 2
Row reducing 
1 1 10  gives  0 1 8 . They should use 2 cups of beef and 8 cups of Sirloin Burger.
   

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 162
 Chapter 3: Matrices

46. Let x = number of $75 tickets sold, y = number of $110 tickets sold. Then we see
x  y  3500  1 1 3500   1 0 2250 
. Row Reducing the matrix   gives   . So they
75 x  110 y  1.25  245, 000  75 110 306, 250   0 1 1250 
should sell 2250 tickets at $75 and 1250 tickets at $110.

47. a. Let x  12% investment amount, y  10% investment amount, and z  8% investment amount.
x y  z  235, 000 Total investment
0.12 x  0.10 y  0.08 z  22,500 Investment income
2x  z0 2x  z
 1 1 1 235, 000    1 1 1 235, 000  
0.12 0.10 0.08 22,500  100 R  R 12 10 8 2, 250, 000  12 R  R  R
  2 2   1 2 2

 2 0 1 0    2 0 1 0  2 R1  R3  R3
 1 1 1 235, 000   1 1 235, 000   R2  R1  R1
1
0 2 4 570, 000   1 R  R 0 1 285, 000 
2 
  2 2 2 
0 2 3 470, 000   0 2 3 470, 000  2 R2  R3  R3
 1 0 1 50, 000  R3  R1  R1  1 0 0 50, 000 
0 1 2 285, 000  2 R  R  R 0 1 0 85, 000 
  3 2 2 

0 0 1 100, 000   0 0 1 100, 000 

Invest $50,000 at 12%, $85,000 at 10% and $100,000 at 8%.
b. Income: 0.12  50, 000   $6000 , 0.10  85, 000   $8,500 , and 0.08 100, 000   $8, 000

48. Let x  amount loaned at 6% , y  amount loaned at 7% , and z  amount loaned at 8% .

x y z  1, 200, 000 Total loan
0.06 x  0.07 y  0.08 z  88, 000 Loan Income
x y z0 x y  z
 1 1 1 1, 200, 000    1 1 1 1, 200, 000  
0.06 0.07 0.08   
88, 000  100 R2  R2 6 7 8 8,800, 000  6R1  R2  R2

 1 1 1 0    1 1 1 0   R1  R3  R3
 1 1 1 1, 200, 000   R2  R1  R1  1 0 1 400, 000  R3  R1  R1  1 0 0 200, 000 
0 1 2 1, 600, 000      
   0 1 2 1, 600, 000  2 R3  R2  R2 0 1 0 400, 000 
0 0 2 1, 200, 000   12 R3  R3 0 0 1 600, 000   0 0 1 600, 000 
$200,000 was lent at 6%, $400,000 was lent at 7%, and $600,000 was lent at 8%.

49. AP  number of cars rented from Metropolis Airport

DT  number of cars rented from downtown
CA  number of cars rented from City Airport
AP  DT  CA  2200 AP  DT  CA  2200
AP  0.9 AP  0.1DT  0.1CA  0.1AP  0.1DT  0.1CA  0
DT  0.05 AP  0.8 DT  0.05CA 0.05 AP  0.2 DT  0.05CA  0

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 163
 Chapter 3: Matrices

 1 1 1 2200   1 1 1 2200   1 1 1 2200 

 0.1 0.10 0.10  
0  10 R2  R2  1 1 1 
0  R1  R2  R2 0 2 2 2200 
 
0.05 0.20 0.05 0  100 R3  R3  5 20 5 0  5R1  R3  R3 0 25 0 11, 000 
 1 1 1 2200   R2  R1  R1 1 0 0 1100   1 0 0 1100 
1 
R  R2 0 1 1 1100   0 1 1 1100  
 0 1 1 1100 
2 2    
  
0 25 0 11, 000  25 R2  R3  R3 0 0 25 16,500  1
R  R3  0 0 1 660 
25 3

 1 0 0 1100 

 R3  R2  R2 0 1 0 440 
 AP  1100, DT  440, CA  660
 0 0 1 660 

50.  0.1 0.3 0.6 53  10 R1  R1 1 3 6530 

 0 0.04 0.05 4.5 100 R2  R2 0 4 5450  
 
0.02 0.02 0.12 8.6  100 R3  R3  2 2 12 860  2R1  R3  R3
 1 3 6 530  1 3 6 530  3R3  R1  R1
0 4 5 450   0 4 5 450  4 R3  R2  R2
  
0 4 0 200   4 R3  R3
1  0 1 0 50  
1 0 6 380   1 0 6 380  6R2  R1  R1 1 0 0 80 
 0 0 5 250  1 R  R 0 0 1 50   0 0 1 50 
  5 2 2   
 0 1 0 50  0 1 0 50  0 1 0 50 
So, 80 gm of I and 50 gm of II and III are required.

51. Let x = ounces of AF, y = ounces of FP, z = ounces of NMG

We start directly with the augmented matrix.

Calories  50 108 127 443 501 R1  R1  1 2.16 2.54 8.86 

Fat  0 0.1 5.5 5.7  10 R2  R2  0
 1 55 57  
Carbohydrates  22 25.7 18 113.4    22 25.7 18 113.4  22R1  R3  R3
1 2.16 2.54 8.86  2.16 R2  R1  R1  1 0 116.26 114.26 
0 1 55 57   0 1 55 57  
 
0 21.82 37.88 81.52  21.82 R2  R3  R3 0 0 1162.22 1162.22  1
1162.22
R3  R3
 1 0 116.26 114.26  116.26 R3  R1  R1 1 0 0 2 
0 1 55 57  55 R3  R2  R2
0 1 0 2
  
0 0 1 1  0 0 1 1 
Use 2 ounces of AF, 2 ounces of FP, and 1 ounce of NMG.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 164
 Chapter 3: Matrices

52. x  # portfolio I 2 x  4 y  7 z  21
y= # portfolio II x  2 y  3 z  10
z  # portfolio III 3 y  3z  9
2 4 7 21 1 2 3 10   1 2 3 10 
1 R1  R2 R  R3
 2 3 10  2
 4 7 21 2 R1  R2  R2 0
 0 1 1  2
 
 0 3 3 9   0 3 3 9  1
R  R3
3 3
0 1 1 3 
1 2 3 10  2R2  R1  R1 1 0 1 4   R3  R1  R1 1 0 0 3  3 portfolio I
0 1 1 3   0 1 1 3   R3  R2  R2 0 1 0 2  2 portfolio II
  
0 0 1 1  0 0 1 1   0 0 1 1  1 portfolio III

53. x  # porfolio I 2 x  4 y  2 z  12  2 4 2 12  R1  R2
y= #portfolio II x  2 y  2 z  6  1 2 2 6 
 
z # portfolio III 3 y  3z  6  0 3 3 6 
1 2 2 6   1 2 2 6  1 2 2 6  2R2  R1  R1
2    0 0 1 0 
4 2 12  2 R1  R2  R2 0 0 2 0   2 R2  R2 
1
  
 0 3 3 6  0 3 3 6  13 R3  R3 0 1 1 2   R2  R3  R3
1 2 0 6  1 2 0 6  2R2  R1  R1 1 0 0 2  2 units each
0 0 1 0  R2  R3 0 1 0 2  0 1 0 2  of portfolio I
      

0 1 0 2  0 0 1 0  0 0 1 0  and portfolio II.

54. A = number of ounces of A A=C

B = number of ounces of B B = 0.2A
C = number of ounces of C 0.05A + 0.15B + 0.12C = 1.00
 1 0 1 0   1 0 1 0 
 0.20 1 
0 0  0.2 R1  R2  R2  1 0.2 0  
 0
 0.05 0.15 0.12 1 0.05 R1  R3  R3 0 0.15 0.17 1 0.15R2  R3  R3
1 0 1 0  1 0 1 0  R3  R1  R1 1 0 0 5
0 1 0.2 0    0 1 0 1
   0 1 0.2 0  0.2 R3  R2  R2  
0 0 0.2 1 1
R  R3
0.2 3
0 0 1 5  0 0 1 5
So, 5 oz. of A, 1 oz. of B, and 5 oz. of C should be in the meal.

55. 0.1S  3.4 M  2.2 B  12.1 iron needed  0.1 3.4 2.2 12.1 10 R1  R1
8.5S  22 M  10 B  97 protein needed 8.5 22 10 97  
 
1S  20 M  12 B  70 carbohydrates needed  1 20 12 70 
 1 34 22 121  1 34 22 121 
8.5 22 10 97  8.5R  R  R 0 267 177 931.5 19 R  R  R
  1 2 2   3 2 2

 1 20 12 70   R1  R3  R3 0 14 10 51

 1 34 22 121 34 R2  R1  R1  1 0 464 1396 
0 1 13 37.5   0 1 13 37.5 
 
0 14 10 51 14 R2  R3  R3 0 0 192 576   192 R3  R3
1

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 165
 Chapter 3: Matrices

 1 0 464 1396  464 R3  R1  R1 1 0 0 4 1 0 0 4

0 1 13 37.5 13R  R  R 0 1 0 1.5  R2  R2 0 1 0 1.5
  3 2 2     
0 0 1 3  0 0 1 3 0 0 1 3
4 glasses of milk, 1.5 quarter-pound servings of meat, and 3 2-slice servings of bread. Note that this is 3 / 8
pounds of meat and 6 slices of bread.

56.  10 8 20 6000   10 8 20 6000  R1  R2

 10 20 40 11, 000   1 2 4 1100 
 
1
10
R2  R2   
100 20 200 36,900  1
R3  R3 10 2 20 3690 
10

 1 2 4 1100   1 2 4 1100  
10 8 20 6000  10 R1  R2  R2 0 12 20 5000   R  R  R
    3 2 2

10 2 20 3690  10 R1  R3  R3 0 18 20 7310 

1 2 4 1100   1 2 4 1100  2 R2  R1  R1
0 6 
0 2310  6 R2  R2  385 
0 1 0
1

0 18 20 7310  0 18 20 7310  18 R2  R3  R3
1 0 4 330   1 0 4 330  4R3  R1  R1  1 0 0 254 
0 1 0 385  
0 1 0 385   0 1 0 385
     
0 0 20 380   201 R3  R3 0 0 1 19   0 0 1 19 
Type I: 254 units, Type II: 385 units, Type III: 19 units

57. x = Type I bags; y = Type II bags; z = Type III bags; w = Type IV bags
 5 5 10 5 10, 000 
1
R  R1
5 1 1 1 2 1 2000  
10 5 30 10 20, 000  1
R  R2
2 
1 6 2 4000  2R1  R2  R2
  5 2 
 5 15 10 25 20, 000   1 3 2 5 4000   R1  R3  R3
1
R
5 3
R3

1 1 2 1 2000  R2  R1  R1 1 0 4 1 2000  
0 1 2 0 0   0 1 2 0 0   R2  R2
 
0 2 0 4 2000  2 R2  R3  R3 0 0 4 4 2000  1
4
R3  R3
1 0 4 1 2000  4 R3  R1  R1 0 0 3
1 0
0 1 2 0 0  2 R3  R2  R2
0
1 0 2 1000 
 
0 0 1 1 500   0
0 1 1 500 
Solution: x = 3w, y = 1000 – 2w, z = 500 – w, where w is any non-negative amount  500 .

58. a. 200  x4  100  x1 A: In = Out

x1  300  x2  200 B: In = Out
200  x2  x3  100 C: In = Out
x3  500  x4  800 D: In = Out
b. Now, rearrange all 4 equations and put the results into matrix form.
 1 0 0 1 100   1 0 0 1 100 
 1 1 0 0 100   
  1R1  R2  R2  0 1 0 1 200  R2  R3  R3
 0 1 1 0 100    0 1 1 0 100  
   
 0 0 1 1 300   0 0 1 1 300 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 166
 Chapter 3: Matrices

 1 0 0 1 100   1 0 0 1 100 
 0 1 0 1 200   0 1 0 1 200  x1  x4  100
  R3  R4  R4   x  x  200
 0 0 1 1 300    0 0 1 1 300  2 4

    x  x4  300
 0 0 1 1 300   0 0 0 0 0  3
c. one person counting the cars between D and A

59. Nutrient Species

x1 x2 x3
A 1 2 2 5100 units
B 1 0 3 6900 units
C 2 2 5 12,000 units

1 2 2 5100    1 2 2 5100  R2  R1  R1  1 0 3 6900 

1 0 3 
6900   R1  R2  R2 0 2 1 1800   0 2 1 1800 
    
 2 2 5 12, 000  2 R1  R3  R3 0 2 1 1800   R2  R3  R3 0 0 0 0 
Species x1  6900  3 x3 and species x2  900  12 x3 , with any amount of x3 between 1800 and 2300.

60. In thousands of gallons

A: 500  x1  x2 x1  x2  500
B: x1  50  x4  x5 x1 x 4
x 5
 50
C: x2  50  x3 x2  x3  50
D: x3  x4  200 x3  x4  200
E: x5  200 x5  200
1 1 0 0 0 500  1 1 0 0 0 500 
1 0 0 1 1 50  Interchange rows 0 1 1 0 0 50  
 
0 1 1 0 0 50   0 0 1 1 0 200 
   
0 0 1 1 0 200  for simplicity 1 0 0 1 1 50   R1  R4  R4
0 0 0 0 1 200  0 0 0 0 1 200 
1 1 0 0 0 500   R2  R1  R1  1 0 1 0 0 450   R3  R1  R1
0 1 1 0 0 50   0 1 1 0 0 50  R3  R2  R2
 
0 0 1 1 0 200  0 0 1 1 0 200  
   
0 1 0 1 1 450  R2  R4  R4 0 0 1 1 1 400  R3  R4  R4
0 0 0 0 1 200  0 0 0 0 1 200 
 1 0 0 1 0 250   1 0 0 1 0 250 
0 1 0 1 0 250   0 1 0 1 0 250 
   
0 0 1 1 0 200  0 0 1 1 0 200 
   
0 0 0 0 1 200  0 0 0 0 1 200 
0 0 0 0 1 200  R4  R5  R5 0 0 0 0 0 0 
Solution: x1  250  x4 , x2  250  x4 , x3  200  x4 , x5  200 with x4  200.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 167
 Chapter 3: Matrices

61. a. Let x  computer shares , y  utility shares , and z  retail shares .

30 x  44 y  26 z  392, 000 Total Cost
6 x  6 y  2.4 z  0.15  392, 000  Total Growth
30 44 26 392, 000   1 1 0.4 9,800  
 6 6 2.4 58,800  R1  6 R2 30 44 26 392, 000  30 R  R  R
1

    1 2 2

 1 1 0.4 9,800   1 1 0.4 9,800   1 0 0.6 2,800 

 0 14 14 98, 000  1 R  R  0 1  R2  R1  R1 
  14 2 2  1 7, 000  0 1 1 7, 000 
General solution: x  2,800  0.6 z and y  7000  z
b. If z  1000 , then x  3400 and y  6000 . So 3400 shares computer stock and 6000 shares utility stock.
c. If they buy no shares of retail stock ( z  0 ), then x  2,800 and y  7000 . So, the minimum number of
shares of computer stock is 2,800 and they would also buy 7,000 shares of utility stock.
d. The maximum number of computer shares depends on the maximum value of z. y  7000  z , so z cannot
be greater than 7000. If z  7000 , then x  2800  0.6  7000   7000 and y  0 . So they would
purchase 7,000 computer shares and 7,000 retail shares.

62. a. Let x  8% investment , y  7% investment , and z  10% investment .

x  y  z  220, 000 Total Investment
0.08 x  0.07 y  0.10 z  16, 600 Interest Earned
 1 1 1 220, 000   1 1 1 220, 000  
 0.08 0.07 0.10 16, 600  100 R  R 8 7 10 1, 660, 000  8 R  R  R
  2 2   1 2 2

 1 1 1 220, 000  R1  R2  R2  1 0 3 120, 000 

 0 1 2 100, 000   R2  R2  
   0 1 2 100, 000 
General solution: x  120, 000  3 z and y  100, 000  2 z .
b. If z  10, 000 , then x  90, 000 and y  120, 000 . So $90,000 at 8% and $120,000 at 7%.
If z  30, 000 , then x  30, 000 and y  160, 000 . So $30,000 at 8% and $160,000 at 7%
c. The minimum amount invested at 7% is when z  0 , so y  100, 000 and x  120, 000. This means that
$120,000 would be invested at 8% and $100,000 would be invested at 7% (with none at 10%).
d. The maximum amount invested at 7% is when z is maximized. Looking at the equation for x, we see that
the maximum value for z is z  40, 000. When z  40, 000, x  0 and y  180, 000 . This means that
$180,000 would be invested at 7% and $40,000 would be invested at 10% (with none at 8%).

63. x  units of Portfolio I 2 x  4 y  2 z  16 common stock blocks  2 4 2 16  R1  R2

y  units of Portfolio II x  2 y  z  8 municipal bond blocks  1 2 1 8 
 
z  units of Portfolio III 3 y  3z  6 preferred stock blocks  0 3 3 6 
 1 2 1 8  1 2 1 8  2 R3  R1  R1  1 0 1 4 
 2 4 2 16  2 R  R  R 0 0 0 0   0 0 0 0 
  1 2 2   
 0 3 3 6  1
3 3
R  R3 0 1 1 2  0 1 1 2 
Thus, x  z  4 and y   z  2 . Note that z = 0, 1, 2 only.
Possible Offerings I II III
4 2 0
5 1 1
6 0 2

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 168
 Chapter 3: Matrices

Exercises 3.4 _______________________________________________________________________________

1. The product is the 3  3 identity matrix. 11.  3 0 0 1 0 0  13 R1  R1
0 3 2 0 1 0  13 R2  R2
 2 4 12   1 2 4 
1 0 0 1 0 0 1 
2. C   0 6 12  D   2 1 4 
6 1 0 0 3 0 0 2
1
 1 2 3  1 0 2     R  R2  R2
0 1 23 0 13 0  3 3
1 0 0
0 
0 1 0 0 1
CD  0 1 0  So, C and D are inverses.
1 0 0 1
0 0  13 0 0 
0 0 1  
3
  
0 1 0 0 1
3
 32  A1 : 0 13  32 
0 0 1 0 0 1 0 0 1 
3. 1 2 1  0 1/ 3 1  1 0 0 
0 0 3 1/ 2 0 1/ 2   0 1 0  3 0 0   13 0 0 
   
1 0 1  0 1/ 3 0  0 0 1  A A  0 3
1
2  0 13  32 
Yes, B = A–1.
0 0 1  0 0 1 
1 0 0
 3 2 3 1/ 3 1/ 3 0   0 1 0 
 
D   3 2 3 C   0  0 1 
4. 0 0 1 
0 2 0  1/ 3 1/ 3 2 / 3
1 0 0  12.  4 0 8 1 0 0  14 R1  R1
0 3 0 0 1 0  13 R2  R2
CD  0 1 0  . So C and D are not inverses. 
0 0 1   0 0 1 0 0 1 
1 0 2 14 0 0 
1  2 7   2 7    2 R3  R1  R1
5. A 1   0 1 0 0 13 0 
(4)(2)  7(1)  1 4   1 4  0 0 1 0 0 1


1 0 0 14 0 2   14 0 2 
1  9 5  9 5    
6. A 1   0 1 0 0 13 0  A1 : 0 13 0 
4(9)  5(7)  7 4   7 4 
0 0 1 0 0 1 0 0 1 
7. ad – bc = 2(2) – (–4)(–1) = 0, so no inverse
exists.  4 0 8   14 0 2 
 
8. ad – bc = 3(4) – 12(1) = 0, so no inverse exists. A A1   0 3 0  0 13 0 
 0 0 1  0 0 1 
1  1 7   1/10 7 /10 
9. A 1  
4(1)  7(2)  2 4   1/ 5 2 / 5 1 0 0 
 0 1 0 
1 1 4  1 / 2 2  0 0 1 
10. A1  
6(1)  (4)(1) 1 6  1 / 2 3 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 169
 Chapter 3: Matrices

13. 0 1 0 1 0 0  R1  R2
1 1 0 0 1 0 
  
0 1 1 0 0 1 
1 1 0 0 1 0   R2  R1  R1
0 1 0 1 0 0  
 
0 1 1 0 0 1   R2  R3  R3
 1 0 0 1 1 0 
0 1 0 1 0 0
 
0 0 1 1 0 1
 1 1 0 
Inverse =  1 0 0 
 1 0 1
14. 0 2 1 1 0 0  R1  R3 1 1 1 0 0 1 
3 0 1 0 1 0 3 0 1 0 1 0  3R1  R2  R2
   
1 1 1 0 0 1  0 2 1 1 0 0 
1 1 1 0 0 1 1 1 1
1 0 0 
0 3 2 R  R3
 0 1 3 2 0
 2 1 1 0 0  1
2
R2  R2

0 2 1 1 0 0  0 3 2 0 1 3
1 1 1 0 0 1  R2  R1  R1 1 1 1/ 2 1/ 2 0 1 
0 1 1/ 2 1/ 2 0 0   0 1 1/ 2 1/ 2 0 0  
 
0 3 2 
0 1 3 3R2  R3  R3 0 0 1/ 2 3 / 2 1 3 2 R3  R3
 1 0 1/ 2 1/ 2 0 1  R3  R1  R1 1 1 2   1 1 2 
1
2 1 0 0
0 1 1/ 2 1/ 2 0 0   1 R  R  R 0 1 0 2 1 3 Inverse =  2 1 3
  2 3 2 2  
0 0 1 3 2 6   0 0 1 3 2 6   3 2 6 

15. 3 1 2 1 0 0  R1  R3 1 1 1 0 0 1 
1 2 3 0 1 0  1 
2 3 0 1 0   R1  R2  R2
   
1 1 1 0 0 1  3 1 2 1 0 0  3R1  R3  R3
1 1 1 0 0 1  R2  R1  R1 1 0 1 0 1 2  
0 1 2 0 1  1  0 1 2 0 1 1
  
0 2 1 1 0 3 2 R2  R3  R3 0 0 3 1 2 5 13 R3  R3
 1 0 1 0 1 2  R3  R1  R1  1 0 0 1/ 3 1/ 3 1/ 3
0 1 2 0 1 1 2 R3  R2  R2 0 1 0 2 / 3 1/ 3 7 / 3

0 0 1 1/ 3 2 / 3 5 / 3  0 0 1 1/ 3 2 / 3 5 / 3
 1/ 3 1/ 3 1/ 3
Inverse =  2 / 3 1/ 3 7 / 3


 1/ 3 2 / 3 5 / 3

16.  1 2 3 1 0 0   1 2 3 1 0 0  
 1 5 6 0 1 0  R1  R2  R2 0 7 9 1 1 0 
   
1
7
R2  R2
 1 3 3 0 0 1 R1  R3  R3 0 5 6 1 0 1 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 170
 Chapter 3: Matrices

1 2 3 1 0 0  2 R2  R1  R1  1 0 3 / 7 5 / 7 2 / 7 0  
0 1 9 / 7 1/ 7 1/ 7 0   0 1 9 / 7 1/ 7 1/ 7 0 
  
0 5 6 1 0 1  5 R2  R3  R3 0 0 3 / 7 2 / 7 5 / 7 1  3 R3  R3
7

 1 0 3 / 7 5 / 7 2 / 7 0   73 R3  R1  R1 1 0 0 1 1 1
0 1 9 / 7 1/ 7 1/ 7 0   97 R3  R2  R2 0 1 0 1 2 3
 
0 0 1 2 / 3 5 / 3 7 / 3  0 0 1 2 / 3 5 / 3 7 / 3
 1 1 1

Inverse =  1 2 3
 2 / 3 5 / 3 7 / 3

17.  1 3 5 1 0 0    1 3 5 1 0 0  1 3 5 1 0 0
 1 1 2 0 1 0  R  R  R 0 2 7 1 1 0  0 2 7 1 1 0 
  1 2 2   
 1 5 12 0 0 1  R1  R3  R3 0 2 7 1 0 1  R2  R3  R3 0 0 0 2 1 1
There is no inverse since there is a row of 0’s in the original matrix.

18.  1 1 4 1 0 0    1 1 4 1 0 0  
 1 0 2 0 1 0  R  R  R 0 1 2 1 1 0   R  R
  1 2 2   2 2

 1 3 4 0 0 1 R1  R3  R3 0 4 8 1 0 1

 1 1 4 1 0 0  R2  R1  R1 1 0 2 0 1 0 
0 1 2 1 1 0   0 1 2 1 1 0 
  
0 4 8 1 0 1 4 R2  R3  R3 0 0 0 3 4 1 
There is no inverse since there is a row of 0’s in the original matrix.

19.  1 2 4 1 0 0   1 2 4 1 0 0   1 2 4 1 0 0
 1 1 3 0 1 0   R  R  R 0 3 7 1 1 0  0 3 7 1 1 0 
  1 2 2    
 2 1 1 0 0 1 2 R1  R3  R3 0 3 7 2 0 1  R2  R3  R3 0 0 0 1 1 1
There is no inverse since there is a row of 0’s in the original matrix.

20.  3 4 1 1 0 0  R1  R3  2 6 4 0 0 1 1
2
R1  R1  1 3 2 0 0 1/ 2  
4 2 2 0 1 0 4 2 2 0 1 0  4 2 2 0 1 
0  4 R1  R2  R2
     
 2 6 4 0 0 1  3 4 1 1 0 0   3 4 1 1 0 0  3R1  R3  R3
1 3 2 0 0 1/ 2   1 3 2 0 0 1/ 2 
0 10 10 0 1 2  0 10 10 0 1 2 
 
0 5 5 1 0 3 / 2   12 R2  R3  R3 0 0 0 1 1/ 2 1/ 2 
There is no inverse since there is a row of 0’s in the original matrix.

 1 1 0 0 1
 3 0 3 1 4 

21. C 1   1 2 0 0 1 Use a graphing calculator to find the inverse.
 
 3 1 3 1 3
 8 5 8 2 7 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 171
 Chapter 3: Matrices

 1.5 2 2.5 3.5 15

 0.5 1 1.5 2.5 9 

22. B 1   2.5 3 2.5 4.5 23 Use a graphing calculator to find the inverse.
 
 1 2 1 2 12 
 0.5 1 0.5 0.5 5
3  3  3 2   3  13
23. AX    X  A1         
2  2  1 1   2   5 

 5  5  1 2   5 7 
24. AX    X  A 1         
 1  1 1 3  1  2 

 3  3   3 2 1   3  9 
25. AX   1 X  A1  1  1 1 2    1  6 
 2   2  1 2 1   2   3 

 1  1 3 0 3  1  12 

26. AX   2  X  A  2    1 1 2   2    7 
1

 3  3  1 2 1  3  6 

 x  1   x 1   1 1 0  1  1  x  1
27. A   y    2   y   A–1  2    1 0 0    2   1  y  1
         
 z   3   z   3   1 0 1  3   2  z  2

0 2 1  x  1   x   1 1 2  1   7  x  7
28.  3 0 1  y    0    y    2
      1 3  0    10  y  10
1 1 1  z   4   z   3 2 6   4   21 z  21

1 2  1  4  2   2 1  x   4   2 1   4  2
29. A =   , A–1      ;    A–1         
3 4  2  3 1 3 / 2 1/ 2   y  10  3 / 2 1/ 2  10   1 
So, x = 2, y = 1.

 3 4  1 1  3 4   3 /17 4 /17   x  –1  11  3 /17 4 /17   11  1

30. A = 
2 3  , A  17  2 3   2 /17 3 /17  ;  y   A  4    2 /17 3 /17   4    2 
              
So, x = 1, y = –2.

 2 1 1  1 1  1 1  x   4   1 1  4  1 
31. A =   , A–1      ;    A–1         
 3 1 1  3 2   3 2   y   5   3 2   5   2 
So, x = 1, y = 2.

5 2  1  3 2   1/ 7 2 / 21
 , A  21  3 5   1/ 7 5 / 21
–1
32. A = 
 3 3     
 x  6   1/ 7 2 / 21  6   2 
 y   A 12    1/ 7 5 / 21 12    2  So, x = 2, y = 2.
–1

        

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 172
 Chapter 3: Matrices

33. 1 1 1 1 0 0    1 1 1 1 0 0 
 2 1 1 0 1 0  2 R  R  R 0 1 1 2 1 0   R  R
  1 2 2   2 2

 2 2 1 0 0 1  2 R1  R3  R3 0 0 1 2 0 1  R3  R3
 1 1 1 1 0 0   R2  R1  R1  1 0 0 1 1 0  
0 1 1 2 1 0   0 1 1 2 1 0   R  R  R
    3 2 2

0 0 1 2 0 1 0 0 1 2 0 1

 1 0 0 1 1 0   x   1 1 0   3  1
0 1 0 0 1 1  y    0 1 1  4   1
        
0 0 1 2 0 1  z   2 0 1  5  1
So, x  1, y  1, z  1 .

34.  2 1 2 1 0 0  R1  R3  1 1 1 0 0 1 
 3 1 1 0 1 0   3 1 1 0 1 0  3R  R  R
     1 2 2

 1 1 1 0 0 1  2 1 2 1 0 0  2 R1  R3  R3
 1 1 1 0 0 1  1 1 1 0 0 1  R2  R1  R1
0 4 4 0 1 3  1 R  R 0 1 1 0 1/ 4 3 / 4  
  4 2 2 

0 3 0 1 0 2  0 3 0 1 
0 2  3R2  R3  R3
1 0 0 0 1/ 4 1/ 4   1 0 0 0 1/ 4 1/ 4  
0 1 1 0 1/ 4 3 / 4  0 1 1 0 1/ 4 
3 / 4  R3  R2  R2
  
0 0 3 1 3 / 4 1/ 4   13 R3  R3 0 0 1 1/ 3 1/ 4 1/12 
1 0 0 0 1/ 4 1/ 4  x  0 1/ 4 1/ 4   2   1
0 1 0 1/ 3 0 2 / 3  y    1/ 3 0 2 / 3  3   4 
   
0 0 1 1/ 3 1/ 4 1/12   z   1/ 3 1/ 4 1/12   7   2 
So, x  1, y  4, z  2 .

35. 1 1 2 1 0 0  1 1 2 1 0 0  R2  R1  R1
2 
1 1 0 1 0  2 R1  R2  R2 0 1 3 2 1 0 
  
 2 2 1 0 0 1  2 R1  R3  R3 0 0 3 2 0 1  13 R3  R3
1 0 1 1 1 0  R3  R1  R1  1 0 0 1/ 3 1 1/ 3
0  R2  R2
 1 3 2 1 0   0 1 0
 0 1 1

0 0 1 2 / 3 0 1/ 3 3R3  R2  R2 0 0 1 2 / 3 0 1/ 3
1 0 0 1/ 3 1 1/ 3  x   1/ 3 1 1/ 3  8 1 
0 1 0 0 1 1  y   0 1 1  7    3 
   
0 0 1 2 / 3 0 1/ 3  z   2 / 3 0 1/ 3 10   2 
So, x  1, y  3, z  2 .

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 173
 Chapter 3: Matrices

36.  1 2 1 1 0 0  2 R1  R2  R2  1 2 1 1 0 0
2 1 2 0 1 0  0 5 4 2 1 0  1
    5 R2  R2
 3 2 3 0 0 1 3R1  R3  R3 0 8 6 3 0 1 
 1 2 1 1 0 0  2 R2  R1  R1  1 0 3 / 5 1/ 5 2 / 5 0  
0 1 4 / 5 2 / 5 1/ 5 0   0 1 4 / 5 2 / 5 
1/ 5 0 
 
0 8 6 3 
0 1 8 R2  R3  R3 0 0 2 / 5 1/ 5 8 / 5 1 52 R3  R3
 1 0 3 / 5 1/ 5 2 / 5 0 3
5
R3  R1  R1  1 0 0 1/ 2 2 3 / 2 
0 1 4 / 5 2 / 5 1/ 5 0  4
R3  R2  R2 0 1 0 0 3 2 
 5 
0 0 1 1/ 2 4 5 / 2   0 0 1 1/ 2 4 5 / 2 
 x  1/ 2 2 3 / 2   0   1
 y   0 3 2   2    2 
  
 z  1/ 2 4 5 / 2   2   3
So, x  1, y  2, z  3 .

37. The graphing calculator yields

 3 2 2 4 3  0.7   5.6 
 1 0 2 2 1   1.6   5.4 
    
A  0.5 1 1 3 1.5 ; X = A  1.275  3.25
–1 –1

     
 2 0 2 2 1  1.15  6.1
 1 0 0 0 2   0.15  0.4 

 1/ 4 5 / 4 3 / 4 5 / 4 1/ 2 
 1/ 4 3 / 4 1/ 4 3 / 4 1/ 2 

38. A–1   1/12 17 /12 1/ 4 23 /12 1/ 3
 
 0 1 0 1 0
 1/12 5 /12 1/ 4 5 /12 1/ 6 
 x1   1/ 4 5 / 4 3 / 4 5 / 4 1/ 2  0   3 
 x   1/ 4  3/ 4 1/ 4 3 / 4 1/ 2  27   6 
 2 
 x3    1/12 17 /12 1/ 4 23 /12 1/ 3  15  12 
      
 x4   0 1 0 1 0   24   3 
 x5   1/12 5 /12 1/ 4 5 /12 1/ 6   24   9 

1 2 b. Determinant equals zero, so matrix does not

39. a.  1(4)  3(2)  2 have an inverse.
3 4
b. Determinant does not equal zero, so matrix 1 2
has an inverse. 42. a.  (1)(8)  2(4)  0
4 8
4 5 b. Determinant equals zero, so matrix does not
40. a.  4(2)  5(1)  3 have an inverse.
1 2
b. Determinant does not equal zero, so matrix
has an inverse.

3 1
41. a.  3(4)  12(1)  0
12 4

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 174
 Chapter 3: Matrices

3 2 1 0 1 2
43. a. Using technology, 1 0 2  5 45. a. Using technology, 3 1 1  19
0 1 1 4 1 3
b. Determinant does not equal zero, so matrix b. Determinant does not equal zero, so matrix
has an inverse. has an inverse.

1 2 2 3 1 4 2
44. a. Using technology, 3 0 1  10 1 2 0 5
46. a. Using technology,  368
1 0 2 4 3 0 1
b. Determinant does not equal zero, so matrix 0 4 2 1
has an inverse. b. Determinant does not equal zero, so matrix
has an inverse.

 11 9   11 9   49 133 270 313 8 14 27 14 

47. A1   ,  
 6 5  6 5   59 161 327 381  1 7 15 27 
8 1 14 7 27 15 14 27
H A N G O N

 2 5  2 5 157 73 147 63 119  19 1 4 6 18

48. A1    ,    
 1 3   1 3  59 29 58 24 44   20 14 27 9 13
19 20 1 14 4 27 6 9 18 13
S T A N D F I R M

 1 1 2   1 1 2   47 28 63 56 17   1 23 19 14 1 

49. A   2
–1
1 3 ,  2
 1 3   22 87 66 44 14   14 5 27 27 3 
 3 2 6   3 2 6  34 46 55 43 15  19 18 9 2 11
1 14 19 23 5 18 19 27 9 14 27 2 1 3 11
A N S W E R S I N B A C K

 2 5 4   2 5 4   49 49 39   1 12 16 
50. A   1 4 3 ,
1  1 4 3  165 154 162   16 5 9 
     
 1 3 2   1 3 2   231 220 226  16 27 5 
1 16 16 12 5 27 16 9 5
A P P L E P I E

1900   2 / 3 1/ 4   x0 
51.      For ease in calculations, use a graphing calculator.
1700   1/ 3 3 / 4   y0 
1
 x0   2 / 3 1/ 4  1900   9 / 5 3 / 5 1900   2400 
 y    1/ 3 3 / 4  1700    4 / 5 8 / 5 1700   1200 
 0         

1
u  0.90 0.30  u0  u  0.60 
52.       r  where  r   0.40  .
  
r 0.10 0.70   0    
u  1  0.7 0.3 0.60  1  0.30   0.5
 r   0.63  0.03  0.1 0.9  0.40   0.6  0.30    0.5 Thus u  50% and r  50% .
        

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 175
 Chapter 3: Matrices

53. Medication A is given every 4 hours, or 6 times per day. Medication B is given 2 times per day.
A 5
The ratio of the dosage of A to the dosage of B is always 5 to 8:  or, rearranging, 8A – 5B = 0.
B 8
a. For Patient I, the total dosage is 50.6 mg per day: 6A + 2B = 50.6, or rearranging, 3A + B = 25.3
3 1   A  25.3 3 1 1  5 1 5 / 23 1/ 23
We need to solve:       The inverse of   is    .
 8 5   B   0  8 5 23  8 3 8 / 23 3 / 23


 A 5 / 23 1/ 23  25.3 5.5 5.5 mg of A

Patient 1:       
 B  8 / 23 3 / 23  0.0  8.8  8.8 mg of B

b. For Patient II, the total dosage is 92.0 mg per day: 6A + 2B = 92.0, or rearranging, 3A + B = 46.0
3 1   A  46.0 
We need to solve:      
 8 5   B   0 
Using the inverse found in part a:
 A 5 / 23 1/ 23  46.0  10  10 mg of A
Patient II:       
 B  8 / 23 3 / 23  0  16  16 mg of B

54. For truck A: Let x = number of I and y = number of II.

 20 30   x   2350 
The matrix equation is      .
100 400   y   23, 000 
1  400 30   0.08 0.006 
Find the inverse: 
8000  3000  100 20   0.02 0.004 
 x   0.08 0.006   2350  50  50 of I
 y    0.02 0.004   23, 000    45
       45 of II
For truck B: Let x = number of I and y = number of II.
 20 30   x   2500 
The matrix equation is       . The inverse is the same.
100 400   y   24,500 
 x   0.08 0.006   2500  53  53 of I
 y    0.02 0.004   24,500    48
       48 of II

55. x = amount invested at 10%.

y = amount invested at 18%.
x + y = 145,600 Total investment
0.10x + 0.18y = 20,000 Total income
1
 x  1 1 145, 600  77, 600 
 y  0.10 0.18  20, 000    68, 000 

       
$77,600 at 10% and $68,000 at 18%
Note - Use the graphing utility to find the inverse, then multiply.

56. Let x = cc of 40% solution and y = cc of 10% solution.

x  y  25
0.4 x  0.1y  0.28(25)  7
1  0.1 1  1/ 3 10 / 3  x   1/ 3 10 / 3  25 15 
A –1   ,       
0.1  0.4  0.4 1  4 / 3 10 / 3  y   4 / 3 10 / 3  7  10 
Use 15 cc of 40% solution and 10 cc of 10% solution.

57. a. Use the graphing utility to find the inverse.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 176
 Chapter 3: Matrices

1
 Deluxe  1.6 2 2.4   96   2.5 2 2   96   2 
 Premium    2 3 4   156    0 1 4   156    8 
      
 Ultimate   0.5 0.5 1   37   1.25 0.5 2   37  32 
Produce 2 deluxe, 8 premium, and 32 ultimate models.
1
 Deluxe  1.6 2 2.4  96  8  2.5 2 2  104   22 
  
b.  Premium    2 3    
4    156    0 1 4   156    8 
 Ultimate  0.5 0.5 1   37   1.25 0.5 2   37   22 
Produce 22 deluxe, 8 premium, and 22 ultimate models.
 New    Old   8 Col.1 of A1 
1
 A   24 20 40   8, 000    83 1
4
0   8, 000  100 
       5 1 
58. a.  B    40 30 60   12, 400    64  32 3
800  
12, 400   120 
 C  1500 1800 2000  526, 000   128 27
 320
33 1 
 1600  526, 000   80 
Use the graphing utility to find the inverse. Carry 100 A units, 120 B units, and 80 C units.
1
 A   24 20 40   8, 000    83 1
4
0   8, 000   100 
      
b.  B    40 30 60   12, 400    645  3
32
1
800
  
  12, 400    200 
 C  1500 1800 2000  526, 000  64, 000   128 27
 33
320
  590, 000   40 
1
1600

Carry 100 A units, 200 B units, and 40 C units.

 New   Old   64, 000 Col.3 of A1 

59. x  8% investment, y  10% investment, z  6% investment

x  y  z  1,000, 000 Total investment
0.08 x  0.10 y  0.06 z  86, 000 Investment income
y  xz Third condition
Use the graphing utility to find the inverse.

1
 x  1 1 1  1, 000, 000   4 50 1  1, 000, 000   300, 000 
 y    0.08 0.10 0.06    86, 000    0.5 0 0.5   86, 000   500, 000 
           
 z   1 1 1   0   4.5 50 0.5  0   200, 000 
$200,000 at 6%, $300,000 at 8%, and $500,000 at 10%

60. x  units of Plan I , y  units of Plan II , z  units of Plan III

1
4 x  8 y  14 z  84  x   4 8 14  84   0.5 1.5 0.33 84   6 
2 x  4 y  6 z  40  y    2 4 6   40    0.5 1 0.167   40    4 
6 y  6 z  36  z   0 6 6   36   0.5 1 0   36   2 
Use the graphing utility to find the inverse.
Buy 6 units of Plan I, 4 units of Plan II, and 2 units of Plan III.

a b c   nt   nt 1 
61. a. d e   
f   nt 1     nt  2 
 
 g h i   nt  2   nt  nt 1  nt  2 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 177
 Chapter 3: Matrices

0 1 0 
ant  bnt 1  cnt  2  nt 1 , etc.
M  0 0 1 
implies a  0, b  1, c  0, d  0, e  0, f  1, g  h  i  1
1 1 1 
 1 1 1  nt  191  108 
1
b. M   1 0 0     1    
 nt 1   M 346   191 
 0 1 0   nt  2  645 346 
There were 108 visitors on the day before there were 191 visitors.

8
62. The number of ancestors 5 and 6 generations back is represented by   .
13
0 1  1 1
M   and M 1   
1 1  1 0
 8   1 1  8  5
The number of ancestors 4 and 5 generations back is given by M 1          .
13  1 0  13 8 

Exercises 3.5 __________________________________________________________________

1. a. Row 3, column 2 = 0.15 100(0.15) = 15 7. Most dependent would be the largest entry on the
b. Row 4, column 1 = 0.10 40(0.10) = 4 main diagonal. Raw materials is the most self
dependent. Likewise, Fuels is least dependent.
2. Fuels industry is most dependent on utilities
since the largest element in the 4th row is in the 8. Agriculture and food (0.097)
column headed by F.
9. The largest entries in Row 2 give the industries
3. 1000(0.008) = 8. most affected by a rise in raw material cost.
These are Raw materials, Manufacturing, and
4. 1000(0.006) = 6 Service industries.

5. 1000(0.040) = 40. 10. Service industry (0.116)

6. 1000(0.008) = 8

96   0.5 0.1  P  96 

11. D =   . (I – A)X = D or      
8  0.1 0.7   M   8 
1
 P   0.5 0.1 96  1  0.7 0.1 96  1  68   200 
 M    0.1 0.7    8          
      0.34  0.1 0.5  8  0.34 13.6   40 
P = 200 units of farm products and M = 40 units of machinery.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 178
 Chapter 3: Matrices

0.3 0.1  60  x 
12. A    D    X   1  , where
 0.1 0.2   70   x2 
x1 = gross production for agriculture and x2 = gross production for minerals.
X = (I – A) –1 D
1 0   0.3 0.1
I –A=   
 0 1   0.1 0.2 
 0.7 0.1
 
 0.1 0.8 
1  0.8 0.1 1.45 0.18 1.45 0.18  60  99.6 
( I – A) –1      X = (I – A) –1 D       
0.56  0.01  0.1 0.7   0.18 1.27  0.18 1.27  70  99.7 
Agr = 100; Min = 100

 80 
13. D    . (I – A)X = D or
180 
 0.7 0.15  U   80 
 0.3 
 0.6   M  180 
1
 U   0.7 0.15  80  1  0.6 0.15  80   200  Utility
 M    0.3    
0.6  180  0.375 0.3 0.7  180   400  Manufacturing

  

 0.25 0.05  147  x 

14. A    D    X   1  , where
 0.05 0.40   26   x2 
x1 = gross production for mining and x2 = gross production for fishing.
1 0   0.25 0.05   0.75 0.05
X = (I – A) –1 D I –A   
 0 1   0.05 0.40   0.05 0.60 
1  0.60 0.05 1.34078 0.11173
( I – A) –1  
0.45  0.0025  0.05 0.75  0.11173 1.67598 
1.34078 0.11173 147   200  Mining = 200
X  ( I – A) –1 D       
0.11173 1.67598  26   60  Fishing = 60

0.4 0.2   0  x 
15. a. A    D  X   1  , where
0.2 0.1 610   x2 
x1 = gross production for agriculture and x2 = gross production for oil.
1 0   0.4 0.2   0.6 0.2 
X = (I – A) –1 D I –A   
 0 1   0.2 0.1  0.2 0.9 
1.8 0.4 
( I – A) –1   
 0.4 1.2 
1.8 0.4   0   244 
X  ( I – A) –1 D      Agriculture Products = 244; Oil Products = 732
 0.4 1.2   610   732 
b. The additional production needed from each industry for 1 more unit of oil surplus is
Col 2 of  0.4 
1  1     Agriculture Products = 0.4; Oil Products = 1.2
 I  A   1.2 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 179
 Chapter 3: Matrices

0.3 0.2  15  x 

16. a. A    D    X   1  , where
 0.1 0.4  35  x2 
x1 = gross production for agriculture and x2 = gross production for steel.
1 0   0.3 0.2   0.7 0.2 
X = (I – A) –1 D I –A   
 0 1   0.1 0.4   0.1 0.6 
 1.5 0.5 
( I – A) –1   
 0.25 1.75
 1.5 0.5  15   40  Agriculture = 40
X  ( I – A) –1 D       
 0.25 1.75 35  65  Steel = 65
b. The additional production needed from each industry for 1 more unit of agriculture surplus is
Col 1 of   1.5 
1  1     Agriculture = 1.5; Steel = 0.25
 I  A   0.25

 36   0.8 0.1  MINE   36 

17. a. D    . (I – A)X = D or    
 278  0.6 0.7   MFG   278
1
 MINE   0.8 0.1  36  1 0.7 0.1  36  1.4 0.2   36  106  Mining
 MFG    0.6 0.7    278       
      0.5  0.6 0.8  278 1.2 1.6   278  488 Manufacturing
b. The additional production needed from each industry for 1 more unit of mining surplus is
Col 1 of  1.4
1  1    
 I  A   1.2

 0.20 0.20   8 
18. a. A    D  620 
 0.20 0.45   
 x1 
X    , where x1 = gross production for agr. and x2 = gross production for mfg.
 x2 
1 0   0.20 0.20   0.80 0.20 
X  ( I – A) –1 D I –A   
 0 1   0.20 0.45   0.20 0.55 
1  0.55 0.20   118 12 
( I – A) –1   
0.4 0.20 0.80   12 2 
 11 1   8   321 
X  ( I – A) –1 D   18 2     Agriculture = 321; Manufacturing = 1244
 2 2   620  1244 
b. The additional production needed from each industry for 1 more unit of manufacturing surplus is
Col 2 of  0.5
1  1     Agriculture = 0.5; Manufacturing = 2
 I  A    2 

19. a. Let E = gross production for electronics and C = gross production for computers.
E C
 0.3 0.6 
A 
0.2 0.2 
 648 E 
X   I  A D
1
b. D    x 
 16  C 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 180
 Chapter 3: Matrices

1 0   0.3 0.6   0.7 0.6  1  0.8 0.6   11 20 15


 I  A
1
I A     
11


 0 1   0.2 0.2   0.2 0.8  0.44 0.2 0.7   115 35
22 
 20 15   648 1200 
X   I  A  D   115 11
1
35    
 11 22   16   320 
Gross production for electronics is 1200 units and for computers is 320 units.

0.4 0.1
20. a. A   
 0.1 0.2 
 5  x 
b. D    X   1  , where x1 = gross production for agr. and x2 = gross production for textiles
195  x2 
1 0   0.4 0.1  0.6 0.1
X = (I – A) –1 D I –A  
 0 1   0.1 0.2   0.1 0.8 
1  0.8 0.1 1.70213 0.21277 
( I – A) –1  
0.48  0.01  0.1 0.6  0.21277 1.27660 
1.70213 0.21277   5   50 
X = (I – A) –1 D        Agriculture = 50; Textiles = 250
 0.21277 1.27660  195  250 

 0.30 0.04 
21. a. A   
 0.35 0.10 
 20   0.7 0.04   Fish   20 
b. D    . (I – A)X = D or  0.35 0.9   Oil   1090 
1090      
1
 Fish   0.7 0.04   20  1  0.9 0.04   20   100  Fishing
 Oil    0.35 0.9   1090   0.35 0.7  1090   1250 
      0.616      Oil

 0.5 0.3
22. a. A   
0.2 0.3
141 x 
b. D    X   1  , where x1 = gross production for mfg. and x2 = gross production for banking
106   x2 
1 0   0.5 0.3  0.5 0.3
X = (I – A) –1 D I –A   
 0 1   0.2 0.3  0.2 0.7 
1  0.7 0.3  2.41379 1.03448 
( I – A) –1  
0.35  0.06  0.2 0.5  0.68966 1.72414 
 2.41379 1.03448  141  450 
X = (I – A) –1 D        Manufacturing = 450; Banking = 280
 0.68966 1.72414  106   280 

 x   0 0.05  x   20, 400   1 0.05  x   20, 400 

23.       y    9900  or  0.1 
  
y 0.1 0      1  y   9900 
 x 1  1 0.05  20, 400  1  20,895  21, 000 
 y   1  0.005  0.1  
1  9900  0.995 11,940  12, 000 
  
  
Costs for development are $21,000. Costs for promotional are $12,000.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 181
 16,500   0 0.1  x
24. D    A X  
11, 400   0.2 0   y
X =  I – A D
–1

1 0   0 0.1  1 0.1
I –A  
 0 1   0.2 0   0.2 1
1  1 0.1
 I – A 
–1

1  0.02  0.2 1 
1.02041 0.10204 
 
0.20408 1.02041 
X =  I – A D
–1

1.02041 0.10204  16,500 

  
 0.20408 1.02041  11, 400 
18, 000 
 
15, 000 
Total costs shipping: $18,000; Total costs printing: $15,000.

 E  11, 750   0 0.25  E 

25.     
 C  10, 000   0.2 0   C 
 1 0.25  E  11, 750 
 0.2  or
 1  C  10, 000 
E  1  1 0.25  11, 750  15, 000 
 C   1  0.05  0.2 
1  10, 000  13, 000 
  
Engineering costs are $15,000.
Computer costs are $13,000.

88, 200   0 0.2   x

26. D    A   0.1  X   y
 49, 000   0   
X =  I – A D
–1

1 0   0 0.2   1 0.2 
I –A  
0 1   0.1 0   0.1 1
1  1 0.1 1.02041 0.10204 
 I – A 
–1

1  0.02  0.2 1  0.20408 1.02041 
X =  I – A D
–1

1.02041 0.20408 88, 200  100, 000 

   
 0.10204 1.02041   49, 000   59, 000 
Total costs sales: $100,000; Total costs service: $59,000.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 182
 Chapter 3: Matrices

110 
27. D   50 
 50 
 I  A X  D or X   I  A   D
1

1
 0.5 0.1 0.1 110   2.79 1.05 0.81 110   400 
X   0.3 0.5 0.2    50    2.33 3.37 1.51    50   500 
 0.1 0.3 0.6   50  1.63 1.86 2.56   50   400 
400 units of fishing output, 500 units of agricultural goods and 400 units of mining goods are needed.

180 
28. D   90  .  I  A X  D or X   I  A   D
1

 40 
1
 0.5 0.1 0.1 180   2.79 1.05 0.81 180  629.07 
X   0.3 0.5 0.2    90    2.33 3.37 1.51   90    782.56 
 0.1 0.3 0.6   40  1.63 1.86 2.56   40  562.79 
Fishing = 629.07, Agriculture = 782.56, Mining = 562.79

100   0.4 0.2 0.2 100 

29. D   272  . (I – A)X = D or  0.1 0.6 0.5 272  is the required augmented matrix.
 
 200   0.1 0.2 0.8 200 

 1 0 0 1240 
By reducing this to 0 1 0 1260  we have 1240 electronics, 1260 steel, and 720 autos.
0 0 1 720 

0.6 0.2 0.2  540   x1 

  
30. A   0.1 0.4 0.5  D   30   X =  x2  ,
 0.1 0.2 0.2  140   x3 
where x1 = gross prod. for electronics;
x2 = gross prod. for steel;
x3 = gross prod. for autos
X = (I – A) –1 D
1 0 0  0.6 0.2 0.2   0.4 0.2 0.2 
I – A  0 1 0    0.1 0.4 0.5   0.1 0.6 0.5
0 0 1   0.1 0.2 0.2   0.1 0.2 0.8
38 /11 20 /11 2  38 /11 20 /11 2  540   2200 
( I  A) 1  13 /11 30 /11 2  ; X  ( I – A) –1 D  13 /11 30 /11 2   30   1000 
 8 /11 10 /11 2   8 /11 10 /11 2  140   700 

Electronics = 2200; Steel = 1000; Autos = 700

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 183
 Chapter 3: Matrices

 24 
31. D   62  .  I  A X  D or X   I  A   D
1

32 
1
 0.6 0.1 0.1  24  1.964 0.476 0.417   24   90 
X   0.2 0.5 0.2    62   1.071 2.381 0.833    62    200 
 0.2 0.1 0.7   32   0.714 0.476 1.667  32  100 
Service = 90; Manufacturing = 200; Agriculture = 100

 0 
32. D   14  .  I  A X  D or X   I  A   D
1

104 
1
 0.6 0.1 0.1  0   50 
X   0.2 0.5 0.2   14   120 
   
 0.2 0.1 0.7  104  180 
Service = 50; Manufacturing = 120; Agriculture = 180

33. 0.5P + 0.1M + 0.2H = P –0.5P + 0.1M + 0.2H = 0

0.1P + 0.3M + 0.0H = M or 0.1P – 0.7M + 0.0H = 0
0.4P + 0.6M + 0.8H = H 0.4P + 0.6M – 0.2H = 0
 1 7 0 0    1 7 0 0 
 5 
1 2 0  5 R1  R2  R2 0 34 2 0  
  
 4 6 2 0  4 R1  R3  R3 0 34 2 0  R2  R3  R3
 1 7 0 0    1 7 0 0  7R2  R1  R1  1 0 7 /17 0 
 0 34 2 0   1 R  R 0 1 1/17 0   0 1 1/17 0 
  34 2 2   
 0 0 0 0  0 0 0 0  0 0 0 0 
7 1
So, Farm Products = Households and Farm Machinery = Households.
17 17

34. 0.4G + 0.1I + 0.3H = G –0.6G + 0.1I + 0.3H = 0

0.4G + 0.3I + 0.2H = I or 0.4G – 0.7I + 0.2H = 0
0.2G + 0.6I + 0.5H = H 0.2G + 0.6I – 0.5H = 0
 4 7 2 0  14 R1  R1  1 7 / 4 1/ 2 0  6 R1  R2  R2  1 7 / 4 1/ 2 0 
 6 1 3 0  
 6 1 3 0   0 19 / 2 6 0  
  
 2 6 5 0   2 6 5 0  2 R1  R3  R3 0 19 / 2 6 0  R3  R2  R3
 1 7 / 4 1/ 2 0    1 7 / 4 1/ 2 0  74 R2  R1  R1  1 0 23 / 38 0 
0 19 / 2 6 0   192 R2  R2 0 1 12 /19 0  
0 1 12 /19 0 
 
0 0 0 0  0 0 0 0  0 0 0 0 
23 12
Government = , Households Industry = Households.
38 19

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 184
 Chapter 3: Matrices

35. 0.4G + 0.2I + 0.2H = G –0.6G + 0.2I + 0.2H = 0

0.2G + 0.3I + 0.3H = I or 0.2G – 0.7I + 0.3H = 0
0.4G + 0.5I + 0.5H = H 0.4G + 0.5I – 0.5H = 0
 2 7 3 0  2 7 3 0  2 7 3 0
 6 2 2 0  3R  R  R  0 19 11 0  0 19 11 0   191 R2  R2
  1 2 2   
 4 5 5 0  2 R1  R3  R3  0 19 11 0  R2  R3  R3  0 0 0 0  
 2 7 3 0 2 0 20 /19 0  1 0 10 /19 0 
0 7 R2  R1  R1 1
R1  R1
 1 11/19 0  0
 1 11/19 0  2 0
 1 11/19 0 
 
 0 0 0 0   0 0 0 0  0 0 0 0 
Government = 10
19
Households. Industry = 1911
Households.

0.2 0.1 0.1  x1   0.2 x1  0.1x2  0.1x3  x1


36. A  0.6 0.5 0.1 X   x2  Solve AX = X  0.6 x1  0.5 x2  0.1x3  x2 .
0.2 0.4 0.8  x3  0.2 x  0.4 x  0.8 x  x
 1 2 3 3

 0.8 0.1 0.1 0   0.2 0.4 0.2 0  5R1  R1

 0.6 0.5  R1  R3  
 0.1 0 
  0.6 0.5 0.1 0  
 0.2 0.4 0.2 0   0.8 0.1 0.1 0 
 1 2 1 0   1 2 1 0  
 0.6 0.5 0.1 0  0.6 R  R  R 0 17 /10 7 /10 0 
  1 2 2  
 0.8 0.1 0.1 0  0.8 R1  R3  R3 0 17 /10 7 /10 0  R2  R3  R3
1 2 1 0   1 2 1 0  2R2  R1  R1  1 0 3 /17 0 
0 17 /10 7 /10 0   10 R  R 0 1 7 /17 0   0 1 7 /17 0 
  17 2 2    
0 0 0 0  0 0 0 0  0 0 0 0 
Shipping is 173 of Households. Manufacturing is 177 of Households.

 0.5 0.4 0.3 Manufacturing

37. a. A  0.4 0.5 0.3 Utilities
 0.1 0.1 0.4  Households

b. 0.5M  0.4U  0.3H  M 0.5M  0.4U  0.3H  0


0.4M  0.5U  0.3H  U 0.4 M  0.5U  0.3H  0
0.1M  0.1U  0.4 H  H 0.1M  0.1U  0.6 H  0
 1 1 6 0   1 1 6 0    1 1 6 0 
 4 5 3 0  4 R  R  R 0 9 27 0  0 9 27 0 
  1 2 2    
 5 4 3 0  5 R1  R3  R3 0 9 27 0  R2  R3  R3 0 0 0 0 
 1 1 6 0   R2  R1  R1  1 0 3 0 

 R2  R2 0 1 3 0 
1   0 1 3 0 
9  
0 0 0 0  0 0 0 0 
Manufacturing = 3 Households and Utilities = 3 Households.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 185
 Chapter 3: Matrices

 0.3 0.2 0.2 0.3 

 0.2 0.3 0.1 0.4 
38. a. A   
 0.1 0.1 0.2 0.6 
 
 0.05 0.1 0.1 0.75
b. 0.7 w  0.2 x  0.2 y  0.3z
0.2  0.7 x  0.1 y  0.4 z
0.1w  0.1x  0.8 y  0.6 z
0.05w  0.1x  0.1 y  0.25 z

 7 2 2 3   2 2 3 
 10 10 10 10   1 7 7 7 
   
 2 7 1 4   2 7 1 4 
 10 10 10 10   10 10 10 10 
  multiply the 1st row by 10/7  
 1 1 8 6   1 1 8 6 
 10 10 10 10   10 10 10 10 
 5 1 1 25   5 1 1 25 
   
100 10 10 100  100 10 10 100 

 2 5 
1 7 0 1 0 0 1
7  0
  1 0 1
0 1 0 1  add 2/7 times the 2nd row to the first row 
0 0 1 0 0 1 1
1   
 
0 0 0 0
 0 0 0 0 
 w  z, x  z, y  z

39.  1 0 0 0 0 0 24   1 0 0 0 0 0 24 
 4   0 0 0 0 96 
 1 0 0 0 0 0  4 R1  R2  R2 0 1 
 1 0 1 0 0 0 0  R1  R3  R3 0 0 1 0 0 0 24 
   
 0 1 1 1 0 0 0  0 1 1 1 0 0 0  R2  R4  R4
 0 4 4 0 1 0 12  0 4 4 0 1 0 12  4 R  R  R
    2 5 5

 20 24 24 0 0 1 96  20 R1  R6  R6 0 24 24 0 0 1 576  24 R2  R6  R6

1 0 0 0 0 0 24  1 0 0 0 0 0 24 
0 1 0 0 0 0 
96    0 1 0 0 0 0 96 
  
0 0 1 0 0 0 24   0 0 1 0 0 0 24 
   
0 0 1 1 0 0 96  R3  R4  R4  0 0 0 1 0 0 120 
 0 0 4 0 1 0 396  4 R3  R5  R5  0 0 0 0 1 0 492 
   
 0 0 24 0 0 1 2880  24 R3  R6  R6  0 0 0 0 0 1 3456 
Therefore, 120 panels, 492 braces, and 3456 bolts are required to fill the order.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 186
 Chapter 3: Matrices

10   x1   total tables 

4  x   total legs 
   2  
1  x3   total tops 
     
40. D   0  X   x4    total rods  Solve  I  A X  D
1  x5   total covers 
     
6  x6   total clamps 
12   x   total bolts 
   7  
 1 0 0 0 0 0 0 10  1 0 0 0 0 0 0 10 
 4 1 0 0 0 0 0 4  4 R1  R2  R2 0 1 0 0 0 0 0 44  
 
 1 0 1 0 0 0 0 1 R1  R3  R3 0 0 1 0 0 0 0 11 
   
 0 1 4 1 0 0 0 0  0 1 4 1 0 0 0 0  R2  R4  R4
 0 0 1 0 1 0 0 1  0 0 1 0 1 0 0 1
   
 0 0 4 0 0 1 0 6  0 0 4 0 0 1 0 6 
 4 0 8 0 0 0 1 12  4 R1  R7  R7 0 0 8 0 0 0 1 52 
 
1 0 0 0 0 0 0 10  1 0 0 0 0 0 0 10 
0 1 0 0 0 0 0 44    0 1 0 0 0 0 0 44 
 
0 0 1 0 0 0 0 11 0 0 1 0 0 0 0 11
   
0 0 4 1 0 0 0 44  4 R3  R4  R4 0 0 0 1 0 0 0 88
0 0 1 0 1 0 0 
1 R3  R5  R5 0 0 0 0 1 0 0 12 
   
0 0 4 0 0 1 0 6  4 R3  R6  R6 0 0 0 0 0 1 0 50 
0 0 8 0 0 0 1 52  8 R3  R7  R7 0 0 0 0 0 0 1 140 
 
To fill the order, 88 rods, 12 covers, 50 clamps, and 140 bolts are needed.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 187
 Chapter 3: Matrices

 10   x1   total sawhorses 
 0   x   total tops 
   2  
 0   x3   total leg pairs 
     
41. D   6  X   x4    total 2  4s  Solve  I  A X  D
 0   x5   total braces 
     
 6   x6   total clamps 
100   x   total nails 
   7  
 1 0 0 0 0 0 0 10  1 0 0 0 0 0 0 10 
 1 1 0 0 0 0 0 0  R1  R2  R2 0 1 0 0 0 0 0 10  
 
 2 0 1 0 0 0 0 0  2 R1  R3  R3 0 0 1 0 0 0 0 20 
   
 0 1 2 1 0 0 0 6  0 1 2 1 0 0 0 6  R2  R4  R4
 0 0 1 0 1 0 0 0  0 0 1 0 1 0 0 0
   
 0 0 1 0 0 1 0 6 0 0 1 0 0 1 0 6
 4 0 8 0 0 0 1 100  4 R1  R7  R7 0 0 8 0 0 0 1 140 
 
1 0 0 0 0 0 0 10  1 0 0 0 0 0 0 10 
0 1 0 0 0 0 0 10    0 1 0 0 0 0 0 10 
 
0 0 1 0 0 0 0 20  0 0 1 0 0 0 0 20 
   
0 0 2 1 0 0 0 16  2 R3  R4  R4 0 0 0 1 0 0 0 56 
0 0 1 0 1 0 0 0  R3  R5  R5 0 0 0 0 1 0 0 20 
   
0 0 1 0 0 0 10 6  R3  R6  R6 0 0 0 0 0 1 0 26 
0 0 8 0 0 0 1 140  8 R3  R7  R7 0 0 0 0 0 0 1 300 

To fill the order, 56 2  4s , 20 braces, 26 clamps, and 300 nails.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 188
 Chapter 3: Matrices

500   x1   total log carriers 

 0   x   total bodies 
   2  
42. D   20  X   x3    total handles  Solve (I – A)X = D
     
 0   x4   total cloths 
 0   x5   total patches 

 1 0 0 0 0 500    1 0 0 0 0 500  1 0 0 0 0 500 

 1 1 0 0 0
 0  R1  R2  R2 0
 1 0 0 0 500   0
 1 0 0 0 500 
 2 0 1 0 0 20  2 R1  R3  R3 0 0 1 0 0 1020  0 0 1 0 0 1020 
     
 0 1 0 1 0 0 0 1 0 1 0 0  R2  R4  R4 0 0 0 1 0 500 
 0 2 0 0 1 0  0 2 0 0 1 0  2 R2  R5  R5 0 0 0 0 1 1000 
To fill the order, 1020 handles, 500 cloths, 1000 patches are needed.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 189
 Chapter 3: Matrices

Chapter 3 Review Exercises ______________________________________________________

1. a12  4
12 20   3 0   9 20 
15. 4 D  3I     
2. b23  0  4 8  0 3  4 5 

3. A and B  1 6   6 10   5 16 
16. F  2 D     
4. None  4 11  2 4   6 15 

5. D, F, G, I 17. 3 A  5B
12 12 6 15  10 25 55 40 
 2 5 11 8  18 9 3 0    20 0 0 20 
6. The negative of B is  4 0 0 4  .  0 0 9 15  10 10 5 45
 2 2 1 9 
 2 37 61 55
  2 9 3 20 

7. Zero matrix
 10 10 14 30 
8. Two matrices can be added if they have the same
order.  4 2 
 4 4 2 5    43 23
  5 0  
9. A B 18. AC   6 3 1 0    33 12 
6 0 
 4 4 2 5  2 5 11 8  0 0 3 5    13 15
 1 3
  6 3 1 0    4 0 0 4 
 0 0 3 5  2 2 1 9 
 4 2  10 16 
 6 1 9 3  5 0 3 5  25
19. CD     15
  10 3 1 4    
 6 0  1 2  18 30 
 2 2 2 14     
 1 3  6 11

 4 2   1 1   3 3 3 5   1 6  17 73

 5 0 1 1   4 20. DF   
1 
1 2   4 11  7 28

10. C  E    
6 0 4 6 2 6 
     
 1 3  0 5   1 2   1 6   3 5   3 7 
21. FD     
 4 11  1 2   23 42 
3 1  1 0   2 1
11. DT  I     
5 2   0 1   5 1 22. FI = F

23. IF = F
 4 2  12 6 
 5 0  15 0 
12. 3C  3    3 5   2 1  19 12 
 6 0  18 0  24. DG T     
     1 2   5 3    8 5 
 1 3  3 9 
25.
4 0 3 5   2 5
13. 4 I    DG    
0 4 1 2   1 3
1 0 
 1 6   2 12   I
14. 2 F  2    0 1 
 4 11  8 22  So, (DG)F = F.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 190
 Chapter 3: Matrices

26. a. Infinitely many solutions.

b. The general solution is: x  6  2 z and y  7  3z , where z is any real number. Answers will vary
depending on the choice of z. If we let z  0, then y  6  2  0   6 and y  7  3  0   7. If we let z  1,
then y  6  2 1  8 and y  7  3 1  4.

27. a. No solution. If translated into equation form, the last row would be 0 x  0 y  0 z  1 . Zero cannot equal
one, so there is no solution.
b. No solution.

28. a. Unique solution, the coefficient matrix is I 3 .

b. x  0, y  10, z  14

29. 1 1 2 5  1 1 2 5 R2  R3 1 1 2 5 
4 0 1 5 4 R1  R2  R2 0 4 7 15 0 1 3 5  R  R
      2 2

 2 1 1 5 2 R1  R3  R3 0 1 3 5 0 4 7 15

1 1 2 5  R2  R1  R1  1 0 1 0    1 0 1 0  R3  R1  R1
0 1 3 5  0 1 3 5  0 1 3 5  3 R  R  R
     3 2 2

0 4 7 15 4 R2  R3  R3 0 0 5 5 15 R3  R3 0 0 1 1 

1 0 0 1
0 1 0 2  The solution is (1, 2, 1).

0 0 1 1 

 1 2 4    1 2 4    1 2 4  2R2  R1  R1 1 0 22 
30.   
  4 36  R2  R2  0 1 9  0 1 9 
1
 3 10 24  3R 1 R2 R2 0 4   
Solution: x = 22, y = 9

31.  1 1 1 4  1 1 1 4   R2  R1  R1
3 4 1 1 3R1  R2  R2 0
 1 4 13
 
 2 1 3 3 2 R1  R3  R3 0 3 1 5 3R2  R3  R3
1 0 5 17   1 0 5 17  5 R3  R1  R1  1 0 0 3
0 1 4 13  0 1 4 13 4 R3  R2  R2 0 1 0 3
 
0 0 11 44   111 R3  R3 0 0 1 4   0 0 1 4 
Solution: x  3, y  3, z  4

32.  1 1 1 3   1 1 3 1 R3  R1  R1  1 0 1 7   R1  R1
 3 0 1 
1 3R1  R2  R2  0 3 2 10   0 4 22 
  3R3  R2  R2  0 
 2 3 4 2  2 R1  R3  R3  0 1 2 4    0 1 2 4  R2  R3
1 0 1 7   1 0 1 7   R3  R1  R1 1 0 0 3 / 2 
0 1 2 
4   R2  R2 0 1 2 4  2 R3  R2  R2
0 1 0 7 
  
0 0 4 22   14 R3  R3 0 0 1 11/ 2   0 0 1 11/ 2 
3 11
Solution: x   , y  7, z  
2 2

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 191
 Chapter 3: Matrices

33.  1 1 2 5   1 1 2 5   1 1 2 5
 3 2 5 10  3R  R  R 0 1 11 5 0 1 11 5
  1 2 2    
 2 3 15 2  2 R1  R3  R3 0 1 11 12   R2  R3  R3 0 0 0 17 
No solution.

34.  1 1 0 3   1 1 0 3 
 1 1 4 1  R  R  R 0 2 4 2  1
  1 2 2   2 R2  R2
 2 3 2 7  2 R1  R3  R3 0 1 2 1
 1 1 0 3 R2  R1  R1  1 0 2 2 
0 1 2 1  0 1 2 1
   
0 1 2 1 R2  R3  R3 0 0 0 0 
There are infinitely many solutions. The general solution is x  2  2 z, y  1  2 z.

 1 3 1 4    1 3 1 4  3R2  R1  R1  1 0 8  2 
35.   2R  R  R 0
 2  5  1 6  1 2 2  1  3 2    0 1  3 2 
 
There are infinitely many solutions. The general solution is x  2  8 z and y  2  3z.

36.  1 1 1 1 3  1 1 1 1 3 
 1 2 1 4 5 0 3 0 5 8 R  R
   R1  R2  R2   2 4

 1 0 1 1 0   R1  R3  R3 0 1 2 0 3 
   
0 1 1 1 2  0 1 1 1 2 
 1 1 1 1 3  R2  R1  R1 1 0 0 0 1 
0 1 1 1 2   0 1 1 1 2 
  
 0 1 2 0 3 R2  R3  R3  0 0 1 1 1  R3  R3
   
 0 3 0 5 8 3R2  R4  R4  0 0 3 2 2 
1 0 0 0 1  1 0 0 0 1  1 0 0 0 1
0 1 1 1 2   R  R  R 0 1 0 2 1 2R  R  R 0 1 0 0 11
  3 2 2
  4 2 2 
 0 0 1 1 1  0 0 1 1 1 R4  R3  R3 0 0 1 0 4 
     
 0 0 3 2 2  3R3  R4  R4  0 0 0 1 5  0 0 0 1 5 
Solution: x1  1, x2  11, x3  4, x4  5

 3 5   2 5   1 0 
37. DG      Yes, D and G are inverse matrices.
1 2   1 3 0 1 

1
 7 1 1  2 1  1/ 2 1/ 4 
38. 
10 2   14  10 10 7   5 / 2 7 / 4 
     

39.  1 0 2 1 0 0   1 0 2 1 0 0  R2  R3
3 4 1 0 1 0  3R  R  R 0 4 7 3 1 0 
  1 2 2   
 1 1 0 0 0 1  R1  R3  R3 0 1 2 1 0 1
1 0 2 1 0 0   1 0 2 1 0 0  2 R3  R1  R1
0 1 2 1 0 1 0 1 2 1 0 1 2 R3  R2  R2
  
0 4 7 3 1 0  4R2  R3  R3 0 0 1 1 1 4  

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 192
 Chapter 3: Matrices

 1 0 0 1 2 8  1 2 8
0 1 0 1 2 7  Answer:  1 2 7 

 
0 0 1 1 1 4   1 1 4 

40.  3 3 2 1 0 0 2 R2  R1  R1  1 11 6 1 2 0  
 1 4 2 0 1 0   1 4 2 0 1 0  R  R  R
    1 2 2

 2 5 3 0 0 1 2 R2  R3  R3   0 13 7 0 2 1

1 11 6 1 2 0   1 11 6 1 2 0  6 R2  R1  R1
0 15 8 1 3 0   R3  R2  R2 0 2 1 1 1 1 

0 13 7 0 2 1  0 13 7 0 2 1 7 R2  R3  R3
 1 1 0 5 4 6  R2  R3  1 1 0 5 4 6  R2  R1  R1
0 2 1 1 1 1  0 1 0 7 5 8 
 
0 1 0 7 5 8 (1) new R2 0 2 1 1 1 1 2 R2  R3  R3
1 0 0 2 1 2   2 1 2 
0 1 0 7 5 8 
Answer:  7 5 8

0 0 1 13 9 15  13 9 15

41. Use the inverse of problem 35.

1
 x   1 0 2   5   1 2 8   5  33
 y   3 4 1  2    1 2 7   2    30 
          
 z   1 1 0   3  1 1 4   3  19 

42. Use the inverse of problem 36.

1
 x   3 3 2   1  2 1 2   1  4 
 y    1 4 2   10    7 5 8  10    5
      
 z   2 5 3  6   13 9 15  6   13

43.  1 3 1 1 0 0  1 3 1 1 0 0  3R2  R1  R1
1 4 
1 0   R1  R2  R2 0 2 1 1 0 
 3 0  1 
 2 1 11 0 0 1 2 R1  R3  R3 0 7 13 2 0 1 7 R2  R3  R3
 1 0 5 4 3 0  5 R3  R1  R1  1 0 0 41 32 5
0 1 2 1 1 0  2 R3  R2  R2 0 1 0 17 13 2 
  
0 0 1 9 7 1  0 0 1 9 7 1
 x   41 32 5  0   4 
 y    17 13 2   2    2 
  
 z   9 7 1  12   2 

44. The determinant of the matrix is 0. The matrix does not have an inverse.

4 4
45. a.   4  2    2  4   8   8   16
2 2
b. Yes, since the determinant does not equal zero, this matrix has an inverse.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 193
 Chapter 3: Matrices

1 2 3
46. a. Using technology, 4 1 8  0
6 3 14
b. No, since the determinant equals zero, the matrix does not have an inverse.

 250 140 
47. Total production = N  M   
 480 700 

1030 800 
48. M  P  S   
 700 1200 

A B A B
100 0  15, 000 8000  100 0   10, 000 6000 
49. June: 
0 120   M  33, 600 36, 000  July: 
0 120   N   24, 000 48, 000 
       
48, 600 44, 000 34, 000 54, 000
a. Production was higher at Plant A in June.
b. Production was higher at Plant B in July.

M W
S M L M W
50.  1 14  S
R  25 40 45  865 885  R
  12 10  M  
H 10 10 10   210 270  H
 8 3  L 
BA gives costs of robes and hoods for men and women.

 1 14 
 25 40 45  865 885 
51.   12 10    
10 10 10    210 270 
 8 3 
 865 885 1 1750  R
 210 270  1   480  H
    
The cost of new robes is $1750.
The cost of new hoods is $480.

300 280 
30 20 10   9000  3000  1500 8400  2000  2000  13,500 12, 400 
52. a.   150 100    
 20 10 20  

 6000  1500  3000 5600  1000  4000  10,500 10, 600 
150 200 
b. Column 1 is Ace’s price and column 2 is Kink’s price. Dept. A buys from Kink and Dept. B buys from
Ace.

53. a. W   0.20 0.30 0.50

0.013469 
b. R   0.013543
0.006504 
0.013469 
c. WR   0.20 0.30 0.50  0.013543   0.20  0.013469   0.30  0.013543  0.50  0.006504   0.0100087
0.006504 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 194
 Chapter 3: Matrices

d. The historical return on the portfolio, 0.0100087, is the estimated expected monthly return of the portfolio.
This is roughly 1% per month.

54. x = fast food shares; y = software shares; z = pharmaceutical shares

50 x  20 y  80 z  50, 000
0.115  50 x   0.15  20 y   0.10  80 z   0.12  50, 000   x  2z
Rearranged and simplified: x  2z  0
5 x  2 y  8 z  5000
5.75 x  3 y  8 z  6000
 1 0 2 0  1 0 2 0  1 0 2 0
 5 2 8 5000  5 R  R  R 0 2 18 5000  1 0 1
R2  R2 9 2500 
  1 2 2  2 
5.75 3 8 6000  5.75 R1  R3  R3 0 3 19.5 6000 0 3 19.5 6000 
 1 0 2 0  1 0 2 0  2 R3  R1  R1
1 0 0 400 
0 1 9 2500   0 1 9 2500  9 R3  R2  R2
 0 1 0 700 
   
3R2  R3  R3 0 0 7.5 1500   152 R3  R3 0 0 1 200   0 0 1 200 

Buy 400 shares of fast food company, 700 shares of software company, and 200 shares of pharmaceutical
company.

55. A  B  2C  2000 Units of I

3 A  4 B  10C  8000 Units of II
A  2 B  6C  4000 Units of III
1 1 2 2000   1 1 2 2000   R2  R1  R1  1 0 2 0
a. 3 4 10 8000  3R  R  R  0 1 4 2000   0 1 4 2000 
  1 2 2    
1 2 6 4000   R1  R3  R3  0 1 4 2000   R2  R3  R3 0 0 0 0 
Solution: A  2C , B  2000  4C
b. 500  2C , so C  250
When C  250, B  2000  4  250   1000 .
Yes, it is possible to support 500 type A slugs; there would be 1000 type B slugs and 250 type C slugs.
c. 0  2000  4C so C  500
When C  500 , A  2  500   1000 .
The maximum number of type A slugs is 1000, when there are 500 type C slugs and no type B slugs.

56. a. Using inverse matrices, and letting x = passenger planes, y = transport planes, and z = jumbos:
100 100 100   x  1100 
150 20 350   y   1930 
    
 20 65 35   z   460 
1
100 100 100  1100   x 
150 20 350  1930    y 
     
 20 65 35   460   z 
 0.0201 0.0027 0.0301 1100   3 
 0.0016 0.0014 0.0183  1930    4 
    
 0.0085 0.0041 0.0119   460   4 
Use 3 passenger, 4 transport, and 4 jumbo.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 195
 Chapter 3: Matrices

1
100 100 100   1100   1 
b. 150 20 350  1930  730    3 
 20 65 35   460   7 
Use 1 passenger, 3 transport, and 7 jumbo.
c. Column 2

 4720   0.9 0.2   S   4720 

57. a. D  (I – A)X = D or      
 40   0.2 0.6   A   40 
1
 S   0.9 0.2   4720  1 0.6 0.2   4720  1.2 0.4   4720  5680 
 A    0.2 0.6   40   0.5 0.2 0.9   40   0.4 1.8   40   1960 
             
shipping = 5680; agriculture = 1960
Col 2 of  0.4 
b. 1  1     shipping = 0.4; agriculture = 1.8
1  A   1.8 

58. a. S C
 0.1 0.1  Shoes
A 
0.2 0.05 Cattle
850   0.9 0.1  S  850 
b. D  (I – A)X =D or      
 275  0.2 0.95  C   275
1
S   0.9 0.1 850  1 0.95 0.1 850  1000 
C    0.2 0.95  275  0.835  0.2 0.9   275  500 
          
Shoes = 1000; cattle = 500

59. (I – A)X = D or
 0.6 0.2 0.2   Min   72 
 0.2 0.6 0.2   Mfg    40 
    
 0.1 0.2 0.8  Fuel   220 
1
 0.6 0.2 0.2   72   Min 
 0.2 0.6 0.2   40    Mfg 
     
 0.1 0.2 0.8  220   Fuel 
 2.1154 0.9615 0.7692   72  360 
 0.8654 2.2115 0.7692   40   320 
    
 0.4808 0.6731 1.5385  220   400 
Mining = 360; manufacturing = 320; fuels = 400

60. A closed Leontief model must be solved by the Gauss-Jordan elimination method. A graphing calculator is
strongly suggested.
64 59 40
G H, A  H, M  H
93 93 93

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 196
 Chapter 3: Matrices

Chapter 3 Test ______________________________________________________________

 1 3 4   2 2 1 3 1 5 
1. AT  B    
 2 2 1  3 1 5 1 3 6 

 2 2 1  3 4 1  1 2 2 
2. B C    
3 1 5  2 2 1  1 1 6 

 1 2 4
 3 4 1    12 16 155
3. CD    3 5 41   5 12
 2 2 1  87 
 3 2 3 


 1 2 4   1 2   23 6 
4. DA  3 5 41  3 2   182 45
3 2 3  4 1  21 1

 1 2 
 2 2 1   0 7 
5. BA    3 2   
3 1 5 
 26 1
 4 1

 1 2   1 2 4   4 4 9   1 2 4   43 46 207 

   2 2 1       
6. ABD   3 2    3 5 41   12 4 13 3 5 41   39 30 77 
3 1 5
 4 1   3 2 3  11 7 9  3 2 3  17
      5 216 

1
1 3  1  4 3  2 3 / 2 
7.  2 4   2  2 
1  1 1/ 2 
  

8. 1 2 4 1 0 0   1 2 4 1 0 0 
1 2 2 0 1 0   R  R  R 0 0 2 1 1 0   R3  R3
  1 2 2 
1 1 4 0 0 1   R1  R3  R3 0 1 0 1 0 1 R2  new R3
 1 2 4 1 0 0  2R2  R1  R1 1 0 4 1 0 2  4R3  R1  R1
  0 0 1
0 1 0 1 0 1   1 0 1 
0 0 2 1 1 0   2 R3  R3
1 00 1 1/ 2 1/ 2 0 
 1 0 0 3 2 2  3 2 2
0 1 0 1 0 1 
Inverse =  1 0 1

0 0 1 1/ 2 1/ 2 0  1/ 2 1/ 2 0 

9. AX  B
A AX  A–1 B
–1

X  A–1 B
1 2 0  3  5 
X   3 1 2  1   14 
   
 4 1 1   2  15

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 197
 Chapter 3: Matrices

10. Begin with the augmented matrix.

 1 1 2 4   1 1 2 4    1 1 2 4  
 1 4 1 4 1 4 1 4   R  R  R 0 5 1 0  1
R3  R3
    1 2 2   2
 2 2 4 10  12 R3  R3 1 1 2 5  R1  R3  R3 0 2 0 1 R2  new R3
 1 1 2 4  R2  R1  R1  1 0 2 9 / 2  2R3  R1  R1  1 0 0 1/ 2 
0 1 0 1/ 2   0 1 0 1/ 2   0 1 0 1/ 2 
   
0 5 1 0  5 R2  R3  R3 0 0 1 5 / 2   R3  R3 0 0 1 5 / 2 
1 1 5
Solution: x   , y  , z 
2 2 2

11. Begin with the augmented matrix.

 1 1 2 4    1 1 2 4    1 1 2 4  R2  R1  R1
 1 4 1 4   R  R  R 0 5 1 0  1 R  R then 0 1 1/ 5 0  
  1 2 2   5 2 2  
 2 3 3 8 2 R1  R3  R3 0 5 1 0  5 R2  R3  R3 0 0 0 0 
 1 0 9 / 5 4
0 1 1/ 5 0  Solution: x  4  9 z , y  1 z , z  z
  5 5
0 0 0 0 

12. Begin with augmented matrix.

 1 1 3 4    1 1 3 4    1 1 3 4 
 1 5 2 3  R  R  R 0 6 1 1  R  R  R 0 0 0 1
  1 2 2   3 2 2  
 2 4 5 8 2 R1  R3  R3 0 6 1 0  0 6 1 0 
There is no solution. In R2 we have 0 = –1.

13. Your calculator will give, in decimal notation, A–1.

 1 2 1 0 x  4   2
  4 / 3  2 / 3 1 2 / 3   y    
A–1   ;    A–1   4    2 
 2 / 3 2 / 3 0 1/ 3 z 10   0 
       
 1 1 1 1  w   0   2 

14. Your calculator will say that the coefficient matrix has no inverse. We will use the Gauss-Jordan method, give
the matrices, and ask you to use the same steps with your calculator.
 1 1 2 1 4    1 1 2 1 4   R4  R1  R1  1 0 1 3 2 
 1 4 1 1 4   R  R  R  0 5 1 2 0   
  1 2 2   5R4  R2  R2 0 0 4 12 10 
 2 2 4 2 10  2 R1  R3  R3 0 4 0 4 2  4 R4  R3  R3 0 0 4 12 10 
     
 0 1 1 2 2  0 1 1 2 2   0 1 1 2 2 
  1 0 1 3 2    1 0 1 3 2   R3  R1  R1
 0 0 4 12 10  1. Interchange R3 and R4 .  0 1 1 2 2 
    R3  R2  R2
 R2  R3  R3  0 0 0 0 0  2. Interchange R2 and R3 . 0 0 1 3 5 / 2 
 R4  R4  0 1 1 2 2  3. 14 R3  R3 
 0 0 0 0

0 
1 0 0 6 1/ 2 
0 1 0 1 1/ 2 
 1 1 5
Solution: x  6 w  , y   w  , z  3w 
0 0 1 3 5 / 2 2 2 2
 
0 0 0 0 0 

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 198
 Chapter 3: Matrices

15. a. H  $10, 000;

B  75, 000  3 10, 000   $45, 000;
E  20, 000  2 10, 000   $40, 000
b. $0  H  $25, 000 (so B  0 )
E  20, 000  2  0   $20, 000;
c. H  $0;
B  75, 000  3  0   $75, 000

0.08 0.22 0.12 

0.10 0.08 0.19 

16. a. AB  0.05 0.07 0.09 
 
0.10 0.26 0.15 
0.12 0.04 0.24 
b. Plant type 1: 0.08, 0.22, 0.12 are consumed by carnivores 1, 2, 3, respectively.
c. Plant 5 by 1; Plant 4 by 2; Plant 5 by 3.

17. a. 1000 4000 2000 1000

10 5 0 0 
 5 0 20 10 
1000 4000 2000 1000  
b. 5 20 0 10 
 
 5 10 10 10 
  45, 000 55, 000 90, 000 70, 000
5
 3
c.  
 4
 
 4 
5
3
 45, 000 55, 000 90, 000 70, 000   
d. 4
 
4
 1, 030, 000
10 5 0 0   5   65 
 5 0 20 10   3  145
e.      
 5 20 0 10   4  125
    
 5 10 10 10   4  135

18. a. 12 5 19 19 27 9 19 27 13 15 18 5 12 19 27 19 13 18


L E S S I S M O R E 5 19 9 27 15 5
8 5  12 19 27 19 13 18 121 247 261 287 179 169 
Encoding:    69 64 
3 2   5 19 9 27 15 5  46 95 99 111
Coded message: 121, 46, 247, 95, 261, 99, 287, 111, 179, 69, 169, 64

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 199
 Chapter 3: Matrices

1  2 5  2 5
b. A 1  
16  15  3 8   3 8 
 2 5 138 140 255 141 201 287   6 15 15 12 22 19 
 3 8   54 53 99 54 76 111  18 4 27 9 5 27 
    
6 18 15 4 15 27 12 9 22 5 19 27
F R O D O L I V E S

19. Using the calculator and solving with the inverse is more efficient. This method shows the inefficiency of the
Gauss-Jordan method.
x = Growth shares 30x = 100y + 50z
y = Blue-chip shares 4.6x + 11y + 5z = 0.13(120,000)
z = Utility shares 30x + 100y + 50z = 120,000
 30 100 50 0   30 100 50 0  301 R1  R1
 4.6 11 5 15, 600   4.6 11 5 15, 600  
 
 30 100 50 120, 000   R1  R3  R3  0 200 100 120, 000 
 1 10 / 3 5 / 3 0   1 10 / 3 5 / 3 0
 4.6 11 
5 15, 600  4.6 R1  R2  R2 0 79 / 3 38 / 3 15, 600  R2  R3
   
 0 200 100 120, 000  0 200 100 120, 000 
1 10 / 3 5 / 3 0   1 10 / 3 5 / 3 0 10
3
R2  R1  R1
0 
200 100 120, 000  200 R2  R2
1 0 1 1/ 2 600  
 
0 79 / 3 38 / 3 15, 600  0 79 / 3 38 / 3 15, 600   793 R2  R3  R3
1 0 0 2000   1 0 0 2000   1 0 0 2000 
0 1 1/ 2 600  0 1 1/ 2 600   12 R3  R2  R2 0 1 0 400 
   
0 0 1/ 2 200  2 R3  R3 0 0 1 400  0 0 1 400 
Solution: x  2000, y  400, z  400

20. a. The technological equation is (I – A)X = D.

 0.6 0.2  1  0.7 0.2 
IA ; ( I  A) –1   0.1 0.6 
  0.1 0.7  0.42  0.02  
 
Ag 1  0.7 0.2   
100 1.75 0.5   
100 245 
 M   0.40  0.1 0.6  140   0.25 1.5  140    235 Agriculture = 245; minerals = 235
         
b. The additional units each industry must produce for 4 more units of agricultural surplus are given by:
Col 1 of  1.75  7 
4 1   4      Agriculture = 7; minerals = 1
1  A   0.25 1 
c. The additional units each industry must produce for 1 more unit of minerals surplus is given by:
Col 2 of  0.5 0.5
1  1   1      Agriculture = 0.5; minerals = 1.5
1  A   1.5  1.5 

21. The technological equation is (I – A)X = 0.

The augmented matrix to be solved is
 0.6 0.3 0.4 0  10 R1  R1  6 3 4 0  6 R2  R1  R1
 0.2 0.6 0.2 0  5R  R  1 3 1 0  
  2 2  
 0.4 0.3 0.6 0  10 R3  R3  4 3 6 0  4 R2  R3  R3

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 200
 Chapter 3: Matrices

 0 15 10 0   0 15 10 0  1
R and
15 1
 1 
3 1 0   R2  R2  1 3 
1 0  then interchange 
 
 0 15 10 0  R1  R3  R3 0 0 0 0  R1 and R2
 1 3 1 0  3R2  R1  R1 1 0 1 0 
0 1 2 / 3 0   0 1 2 / 3 0 
  
0 0 0 0  0 0 0 0 
2
Profit = Households Non-profit = Households
3

22. Ag M F S
Ag 0.2 0.1 0.1 0.1
Mach  0.3 0.2 0.2 0.2 
Fuel  0.2 0.2 0.3 0.3
 
Steel  0.1 0.4 0.2 0.2 

23. The technological equation is (I – A)X = D.

 0.8 0.1 0.1 0.1 1700 
 0.3 0.8 0.2 0.2  1900 
( I  A)    X  (I  A) 1  
 0.2 0.2 0.7 0.3  900 
   
 0.1 0.4 0.2 0.8  300 
Note: Use the graphing utility to find ( I  A) 1 .
1.74 0.68 0.62 0.62  1700  5000 
1.30 2.30 1.18 1.18  1900  8000 
Then X     
1.39 1.55 2.50 1.50   900  8000 
    
1.22 1.62 1.29 2.29   300  7000 
Agriculture = 5000; machinery = 8000; fuel = 8000; steel = 7000

24. The Gauss-Jordan method must be used since the equation is (I – A)X = 0. We begin with the augmented
matrix and will use fractions. The student is encouraged to solve with the graphing calculator and work
with decimals.
 3 / 4 1 / 4 3 / 10 1/ 10 0    3/ 4 1 / 4 3 / 10 1 / 10 0 
 3 / 10 3 / 4 2 / 10 4 / 10 0   4    0 0 
 33 / 10
R1 R2 R 7/4 1
 2

 3 / 20 2 / 10 9 / 10 3 / 10 0  3R1  R3  R3  48 / 20 11 / 20 18 / 10 0 0
   
 3 / 10 3 / 10 4 / 10 8 / 10 0  8 R1  R4  R4  57 / 10 23 / 10 28 / 10 0 0
3 R R R
10 2 1 1
 24 / 100 11 / 40 0 1 / 10 0 
  33 / 10 7/4 1 0 0 

 18 R2  R3  R3  354 / 100 104 / 40 0 0 0
10  
28 R  R  R  354 / 100 104 / 40 0 0 0
10 2 4 4

 24 / 100 11 / 40 0 1 / 10 0 
  33 / 10 7/4 1 0 0 

 354 / 100 104 / 40 0 0 0
R R R  
3 4 4  0 0 0 0 0

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 201
 Chapter 3: Matrices

 11
 24 / 100 11/ 40 0 1 / 10 0   40 R3  R1  R1  699 / 5200 0 0 1 / 10 0
 33 / 10 7/4 1 0 0   7 R  R  R  477 / 520 0 1 0 0 
 4 3 2 2 
 40 R  R  177 / 130 1 0 0 0  177 / 130 1 0 0 0
104 3 3     
 0 0 0 0 0  0 0 0 0 0

699 477 177

Our solution yields: Hhold  Ag, Fuel  Ag, Steel  Ag
520 520 130
Now we must solve in terms of Hholds to yield the desired form.
520
Ag  Hhold
699
177  520  236
Steel   Hhold   Hhold
130  699  233
477  520  159
Fuel   Hhold   Hhold.
520  699  233
This was a difficult problem. The authors’ step by step method always works. Sometimes it is not the
shortest method.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 202
 Chapter 3: Matrices

Chapter 3 Extended Applications & Group Projects ___________________________________

I. Taxation
1. Estimate of federal taxes is
0.34(1,000,000) = $340,000.
Based on this assumption, the taxable state income is $660,000 and the tax is 0.05(660,000) or $33,000.

2. Deducting this estimated state tax from the federal taxable income gives $967,000 as the adjusted federal
taxable income. The federal tax on this income is 0.34(967,000), which equals $328,780.

3. The state taxable income is now $671,220 with a state tax of 0.05(671,220) = $33,561

4. & 5. Repeat steps (2) and (3).

Federal taxable income Federal tax State taxable income State tax
966,439.00 328,589.26 671,410.74 33,570.54
966,429.46 328,586.02 671,413.98 33,570.70
966,429.30 328,585.96 671,414.04 33,570.70
Federal tax is $328,585.96 and state tax is $33,570.70.

6. Let x = the federal tax and y = the state tax.

0.34(1, 000, 000  y )  x  x  0.34 y  340, 000
0.05(1, 000, 000  x)  y  0.05 x  y  50, 000
Multiplying the second equation by –0.34 and adding the result to the first equation gives the equation
0.983x = 323,000. Solving this equation for x gives x = $328,585.96. Substituting this x-value into the second
equation and solving for y gives y = $33,570.70.

7. The effective rate to each government is approximately 32.86% to Federal and 3.36% to Alabama.

II. Company Profits after Bonuses and Taxes

1. Let x = bonuses, y = state tax, z = federal tax
Then x  0.02(800, 000  y  z )
 x  0.02 y  0.02 z  16, 000
y  0.06(800, 000  x)  0.06 x  y  48, 000
z  0.34(800, 000  x  y )
 0.34 x  0.34 y  z  272, 000
 1 0.02 0.02   16, 000 

Let A  0.06 1 
0  and D   48, 000  .
0.34 0.34 1   272, 000 
 10, 002.34 
Aw  D  
 w   47,399.86 
w  A1 D
 252, 483.25
So x = 10,002.34, y = 47,399.86, and z = 252,483.25. Thus, the remaining profit is
$800,000 – $10,002.34 – $47,399.86 – $252,483.25 or $490,114.55.

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 203
 Chapter 3: Matrices

 1 0.03 0.03  24, 000 

2. 
A  0.06 1 
0  and D   48, 000  .
0.34 0.34 1   272, 000 
 15, 061.12 
w  A D   47, 096.33 
1

 250,866.47 
So x = 15,061.12, y = 47,096.33, and z = 250,866.47. Thus, the remaining profit is
$800,000 – $15,061.12 – $47,096.33 – $250,866.47 or $486,976.08 for a loss of profit of $3138.47.

3. 10% bonus:
 1 0.10 0.10   80, 000 

A  0.06 1 
0  and D   48, 000  .
0.34 0.34 1   272, 000 
 51,590.37 
w  A D   44,904.58 
1

 239,191.72 
So x = 51,590.37, y = 44,904.58, and z = 239,191.72. Thus, the remaining profit is $464,313.33 for a loss of
profit of $25,801.22 more than the 2% bonus.

4. y = –3229.7895x + 496,616.9474

©2019 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly
accessible website, in whole or in part. 204