McMaster Math 1ZC3 Custom

Courseware Winter 2012

--Ripped from Google Books--

Contents:
Advanced Engineering Mathematics 3rd ed., Zill, D.G. & Cullen, M.R.
7.6 Vector Spaces
7.7 Gram-Schmidt Orthogonalization Process
8.1 Matrix Algebra
8.2 Systems of Linear Algebraic Equations
8.3 Rank of Matrix
8.4 Determinants
8.5 Properties of Determinants
8.6 Inverse of a matrix
8.7 Cramer's Rule
Chapter 8 Review Exercises
Numerical Mathematics, Grasselli, M. & Pelinovsky, D.
"Elements of the Laboratory" - Introduction to Matlab
Solutions to Advanced Engineering Mathematics (in this order):
7.6
Chapter 7 Review
7.7 (brief - all full solutions not available)
All of Chapter 8

Exercises 7.6

Exercises 7.6
1. Not a vector space. Axiom (vi) is not satised.

2. Not a vector space. Axiom (i) is not satised.

3. Not a vector space. Axiom (x) is not satised.

4. A vector space

5. A vector space

6. A vector space

7. Not a vector space. Axiom (ii) is not satised.

8. A vector space

9. A vector space

10. Not a vector space. Axiom (i) is not satised.

11. A subspace

12. Not a subspace. Axiom (i) is not satised.

13. Not a subspace. Axiom (ii) is not satised.

14. A subspace

15. A subspace

16. A subspace

17. A subspace

18. A subspace

19. Not a subspace. Neither axioms (i) nor(ii) are satised.

20. A subspace
21. Let (x1 , y1 , z1 ) and (x2 , y2 , z2 ) be in S. Then
(x1 , y1 , z1 ) + (x2 , y2 , z2 ) = (at1 , bt1 , ct1 ) + (at2 , bt2 , ct2 ) = (a(t1 + t2 ), b(t1 + t2 ), c(t1 + t2 ))
is in S. Also, for (x, y, z) in S then k(x, y, z) = (kx, ky, kz) = (a(kt), b(kt), c(kt)) is also in S.
22. Let (x1 , y1 , z1 ) and (x2 , y2 , z2 ) be in S. Then ax1 + by1 + cz1 = 0 and ax2 + by2 + cz2 = 0. Adding gives
a(x1 + x2 ) + b(y1 + y2 ) + c(z1 + z2 ) = 0 and so (x1 , y1 , z1 ) + (x2 , y2 , z2 ) = (x1 + x2 , y1 + y2 , z1 + z2 ) is in S. Also,
for (x, y, z) then ax + by + cz = 0 implies k(ax + by + cz) = k 0 = 0 and a(kx) + b(ky) + c(kz) = 0. this means
k(x, y, z) = (kx, ky, kz) is in S.
23. (a) c1 u1 + c2 u2 + c3 u3 = 0 if and only if c1 + c2 + c3 = 0, c2 + c3 = 0, c3 = 0. The only solution of this system
is c1 = 0, c2 = 0, c3 = 0.
(b) Solving the system c1 + c2 + c3 = 3, c2 + c3 = 4, c3 = 8 gives c1 = 7, c2 = 12, c3 = 8. Thus
a = 7u1 12u2 + 8u3 .
24. (a) The assumption c1 p1 + c2 p2 = 0 is equivalent to (c1 + c2 )x + (c1 c2 ) = 0. Thus c1 + c2 = 0, c1 c2 = 0.
The only solution of this system is c1 = 0, c2 = 0.
(b) Solving the system c1 + c2 = 5, c1 c2 = 2 gives c1 =

7
2

, c2 =

3
2

. Thus p(x) = 72 p1 (x) + 32 p2 (x)

25. Linearly dependent since 6, 12 = 32 4, 8

26. Linearly dependent since 21, 1 + 30, 1 + (1)2, 5 = 0, 0
27. Linearly independent
28. Linearly dependent since for all x (1) 1 + (2)(x + 1) + (1)(x + 1)2 + (1)x2 = 0.
29. f is discontinuous at x = 1 and at x = 3.
 2
2

30. (x, sin x) =
x sin x dx = (x cos x + sin x)  = 2
0

309

Exercises 7.6

2
2 3
1 3 
8 3
31. x =
x dx = x  = and so x = 2
. Now
3
3
3
0
0


 2

1 2
1
1
2
sin2 x dx =
(1 cos 2x) dx =
 sin x2 =
x sin 2x  =
2 0
2
2
0
0

and so  sin x = .


32. A basis could be 1, x, ex cos 3x, ex sin 3x.

33. We need to show that Span{x1 , x2 , . . . , xn } is closed under vector addition and scalar multiplication. Suppose
u and v are in Span{x1 , x2 , . . . , xn }. Then u = a1 x1 + a2 x2 + + an xn and v = b1 x1 + b2 x2 + + bn xn , so
that
u + v = (a1 + b1 )x1 + (a2 + b2 )x2 + + (an + bn )xn ,
which is in Span{x1 , x2 , . . . , xn }. Also, for any real number k,
ku = k(a1 x1 + a2 x2 + + an xn ) = ka1 x1 + ka2 x2 + + kan xn ,
which is in Span{x1 , x2 , . . . , xn }. Thus, Span{x1 , x2 , . . . , xn } is a subspace of V.

Chapter 7 Review Exercises

1. True
2. False; the points must be non-collinear.
3. False; since a normal to the plane is 2, 3, 4 which is not a multiple of the direction vector 5, 2, 1 of the
line.
4. True

5. True

6. True

7. True

8. True

9. True

10. True; since a b and c d are both normal to the plane and hence parallel (unless a b = 0 or c d = 0.)
11. 9i + 2j + 2k

12. orthogonal

13. 5(k j) = 5(i) = 5i

14. i (i j) = i k = 0

15.

(12)2 + 42 + 62 = 14

16. (1 20)i (2 0)j + (8 0)k = 21i + 2j + 8k

17. 6i + j 7k
18. The coordinates of (1, 2, 10) satisfy the given equation.
19. Writing the line in parametric form, we have x = 1 + t, y = 2 + 3t, z = 1 + 2t. Substituting into the equation
of the plane yields (1 + t) + 2(2 + 3t) (1 + 2t) = 13 or t = 3. Thus, the point of intersection is x = 1 + 3 = 4,
y = 2 + 3(3) = 7, z = 1 + 2(3) = 5, or (4, 7, 5).
20. |a| =

1
4
3
1
42 + 32 + (5)2 = 5 2 ; u = (4i + 3j 5k) = i j + k
5 2
5 2
5 2
2

21. x2 2 = 3, x2 = 5; y2 1 = 5, y2 = 6; z2 7 = 4, z2 = 3; P2 = (5, 6, 3)
22. (5, 1/2, 5/2)

23. (7.2)(10) cos 135 = 36 2

310

Matrices
Exercises 8.1

1. 2 4

2. 3 2

3. 3 3

4. 1 3

6. 8 1

7. Not equal

8. Not equal

9. Not equal

11. Solving x = y 2, y = 3x 2 we obtain x = 2, y = 4.

12. Solving x2 = 9, y = 4x we obtain x = 3, y = 12 and x = 3, t = 12.
13. c23 = 2(0) 3(3) = 9; c12 = 2(3) 3(2) = 12
14. c23 = 2(1) 3(0) = 2; c12 = 2(1) 3(0) = 2

 

42
5+6
2 11
15. (a) A + B =
=
6 + 8 9 10
2 1

 

2 4
65
6
1
(b) B A =
=
8 + 6 10 9
14 19

 
 
8 10
6
18
2
(c) 2A + 3B =
+
=
12 18
24 30
12

2 3 0 + 1
5
1

16. (a) A B = 4 0 1 2 = 4 1
7+4 3+2

(b)

(c)

17. (a)

(b)

(c)

(d)

18. (a)

11

28
12

3 + 2 1 0
5 1

BA= 04
2 1 = 4
1
4 7 2 3
11 5

1 1
2 2

2(A + B) = 2 4
3 = 8
6
3
1
6
2

 

2 9
12 6
11
6
AB =
=
5 + 12 30 + 8
17 22

 

2 30 3 + 24
32 27
BA =
=
6 10 9 + 8
4 1

 

4 + 15 6 12
19 18
2
A =
=
10 20 15 + 16
30
31

 

1 + 18 6 + 12
19 6
B2 =
=
3 + 6
18 + 4
3 22

4 + 4
6 12
3 + 8
0

AB = 20 + 10 30 30 15 + 20 = 10
32 + 12 48 36 24 + 24
20

6 5

0 5
12

313

5. 3 4
10. Not equal

Exercises 8.1


 
4 + 30 24 16 + 60 36
2
=
1 15 + 16
4 30 + 24
2


9 24
19. (a) BC =
3
8

8
2

(b) BA =


(b) A(BC) =

(c) C(BA) =

2
4

1
2
0
3

2
4





0
0

9
3

 
24
3
=
8
6

 
0
0
=
0
0

0
0

8
16


 
1 2
6 5
4
(d) A(B + C) =
=
2
4
5 5
8

20. (a) AB = [ 5 6 7 ] 4 = (16)

5
10

(b) BA = 4 [ 5 6
1

18 21
1

24 28 0
6 7
3

15

(c) (BA)C = 20
5

21

28
7

18
24
6

15

7 ] = 20
5
2

78

1 1 = 104
2
1
26

54
72
18

99

132
33

(d) Since AB is 1 1 and C is 3 3 the product (AB)C is not dened.

21. (a) AT A = [ 4 8 10 ] 8 = (180)

10

2

(b) BT B = 4 [ 2
5

4
8

5 ] = 8 16
10 20

10

20
25

4
2
6

(c) A + BT = 8 + 4 = 12
10
5
5

 
 
1 2
2 5
1
22. (a) A + BT =
+
=
2 4
3 7
5


 
4
2

8
3

2
(b) 2A B =
4
T


(c) AT (A B) =

23. (a) (AB)T =

7
38

4
T

10
75



7
11

 
5
4
=
7
1
1

3 3


7 38
=
10 75


=

1
1

14

314

Exercises 8.1



 

5 2
3 8
7 38
=
10 5
4 1
10 75

 
 

5 4
3 11
2 7
24. (a) AT + B =
+
=
9
6
7
2
2 8

 
 

10 18
3 7
7 11
(b) 2A + BT =
+
=
8 12
11
2
3 14
(b) BT AT =


25.

8


27.

4
16


+

6
9



=

19
19
38

=
18
20
2

14

6
5
6
5

26. 3 + 5 + 8 = 10
3
15
10
22

7
1
2
10

28. 17 + 1 8 = 10
6
4
6
4

29. 4 5

30. 3 2




2 4
6 6
T
(A ) =
=A
32. (A + B) =
= A T + BT
3 2
14 10

T 



 

16
40
16
8
4 2
2 3
16 8
33. (AB)T =
=
;
BT A T =
=
8 20
40 20
10 5
4
2
40 20


12 18
34. (6A)T =
= 6AT
24
12

2 1 
5 15 9


2 6 2

35. B = AAT = 6 3
= 15 39 27 = BT
1 3 5
2 5
9 27 29
2
31. A =
4
T


3
;
2

T T

36. Using Problem 33 we have (AAT )T





1 0
0 0
37. Let A =
and B =
.
0 0
0 1

38. We see that A = B, but AC = 4

6

= (AT )T AT = AAT , so that AAT is symmetric.

Then AB = 0.

3 4

6 8 = BC.
9 12

39. Since (A+B)2 = (A+B)(A+B) = A2 +AB+BA+B2 , and AB = BA in general, (A+B)2 = A2 +2AB+B2 .

40. Since (A + B)(A B) = A2 AB + BA B2 , and AB = BA in general, (A + B)(A B) = A2 B2 .
41. a11 x1 + a12 x2 = b1 ;
a21 x1 + a22 x2 = b2

7
2 6
1
x1

42. 1 2 1 x2 = 1
9
5 7 4
x3

 
 
a b/2
x
x
43. [ x y ]
= [ ax + by/2 bx/2 + cy ]
= [ ax2 + bxy/2 + bxy/2 + cy 2 ] = [ ax2 + bxy + cy 2 ]
b/2 c
y
y

0
/z
/y
P
Q/z + R/y

44. /z
0
/x Q = P/z R/x = curl F
/y
/x
0
R
P/y + Q/x

315

Exercises 8.1

45. (a)

(b)

(c)

46. (a)

(b)

(c)

(d)

47. (a)

x
cos sin 0
x
x cos + y sin
xY

MY y = sin cos 0 y = x sin + y cos = yY

z
0
0
1
z
z
zY

1
0
0
cos 0 sin

MR = 0
cos sin
1
0 ;
MP 0
0 sin cos
sin 0
cos

1 0
0
1
1
0
0
1
1
1

3
1
MP 1 = 0
cos 30 sin 30 1 = 0
2
2 1 = 2 ( 3 + 1)

1
3
1
1
1
0 sin 30 cos 30
0 12
2 ( 3 1)
2

2
0 22
1
1
1
cos 45 0 sin 45
2

1

MR MP 1 = 0
1
0
0 12 ( 3 + 1)
2 ( 3 + 1) = 0 1

1
2
2
1
1
sin 45 0
cos 45
0
2 ( 3 1)
2
2
2 ( 3 1)

1
6)
4 (3 2
1

= 2 ( 3 + 1)

1
6)
4( 2 +


1
1
cos 60 sin 60 0
6)
4 (3 2

MY MR MP 1 = sin 60 cos 60 0 12 ( 3 + 1)

1
1
0
0
1
6)
4( 2 +

1
3
1
0
(3 2 6 )
(3 2 6 + 6 + 2 3 )
2
2
4
8

1
1

1
= 23
0 2 ( 3 + 1) = 8 (3 6 + 3 2 + 2 3 + 2)
2

1
1
6)
6)
0
0 1
4( 2 +
4( 2 +


 

1 0
2 2
2 2
LU = 1
=
=A
1
0
3
1
2
2
 



6 2
1 0
6
2
=
=A
LU = 2
4 1
1
0 13
3

1
0 0
1 2
1
1 2 1

LU = 0
1 00
1
2 = 0
1 2 = A
2 10 1
0
0 21
2
6 1

1 0 0
1
1
1
1
1 1

LU = 3 1 0 0 2 1 = 3
1 2 = A
1 1 1
0
0
1
1 1 1

17 43


 

A11 A12
B1
A11 B1 + A12 B2

AB =
=
= 3 75
A21 A22
B2
A21 B1 + A22 B2
14 51
since

 
 

13 25
4 18
17 43
A11 B1 + A12 B2 =
+
=
9 49
12 26
3 75
and
A21 B1 + A22 B2 = [ 24

34 ] + [ 10

316

17 ] = [ 14

51 ] .

Exercises 8.2
(b) It is easier to enter smaller strings of numbers and the chance of error is decreased. Also, if the large matrix
has submatrices consisting of all zeros or diagonal matrices, these are easily entered without listing all of
the entries.

Exercises 8.2

1.



11 4R1 +R2 1

5
0

1
7

The solution is x1 = 4, x2 = 7.



3 2
4
1 1
R12
2.

1 1 2
3 2


 1
1
11
7 R2

49
0
2

3R +R

2
1

1
0

The solution is x1 = 8, x2 = 10.





1
1 13 59 2R1 +R2 1
9
3 5
9 R1
3.

2 1 1
2 1 1
0


1 0 23
1 R2 +R1
3
1
0 1
3
The solution is x1 = 23 , x2 = 13 .



 1
1
1 32 10
1
10 15
1
3R1 +R2
10 R1
4.

3 2 1
3 2 1
0


1 0 17
3 R2 +R1
25
2
13
0 1
25



1
11
R3 +R1

7
0

1
1
1
1

1
3
1
3

3
2
52

10
59
1
9

R +R

1
2

3R2

1
10
13
10

25 R2

4
7

1
0

0
1

1
3

59

1
3

10

3
2

1
10
13
25

13
The solution is x1 = 17
25 , x2 = 25 .

1 1 1
1 1 1 3
3
1 1 1 3
1
R2

2R +R2

7
13
5. 2
3
5
7 1
5
7 13 5 0
1
0
5
5
R1 +R3
1 2
3 11
0 1
4 8
0 1
4 8

1 0 25
1 0 0
25
1 0 25 25
5
2
R2 +R1

27 R3
7
13
7
13 5 R3 +R1
0 1 5
0 1 0
5 0 1
5
5
R2 +R3
75 R3 +R2
27
27
0 0 1
0 0 5 5
0 0 1 1

x1 = 0, x2 = 4, x3 = 1.

1
2 1 0
0
0
1
2 1
1
2R +R2
3 R2

4 9
1 43 3
9 1
0
0 3
R1 +R3
0 3
2 3
0 3
2
3
3

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

4
1

The solution is

1
2 1

6. 2
1
2
1 1
1

The solution is x1 = 1, x2 = 1, x3 = 3.




1 1 1 0 R1 +R2 1 1 1 0
7.

1 1 3 0
0 0 2 0

317

1
3

Exercises 8.2
Since x3 = 0, setting x2 = t we obtain x1 = t, x2 = t, x3 = 0.





1
1
2 4 9 5R1 +R2 1
2 4
1 2 4
9
11
R2
8.

5 1
2 1
0 11 22 44
0 1 2
If x3 = t, the solution is x1 = 1, x2 = 4 + 2t, x3 = t

1 1 1 8
8
1 1 1
row

9. 1 1
1 3 0
0
2 5
operations
1
1
1 4
0
0
0 12
Since the bottom row implies 0 = 12, the system is inconsistent.

4
1 13
3
1
4
3
row

10. 4
3 3 0 1 5
operations
2 1 11
0 0
0
The solution is x1 = 3, x2 = 5.

1 1
2 2 0 0
row

11. 2 1 1 0 0 1
operations
3 0 1 0
0 0

1
3

The solution is x1 = x2 = x3 = 0.

1 1
1 1 2 0
row

12. 2
4
5 0 0
1
operations
6
0 3 0
0
0

3
2

The solution is x1 = 12 t, x2 = 32 t, x3 = t.

13. 1
1

1 2 2
row

0 0 1 1
operations
0
0 0 1

The solution is x1 = 2, x2 2, x3 = 4.

1 2
1
1 2 1 2
row

1
14. 3 1 2 5 0
1 5
operations
2
1 1 1
0
0
0
Since the bottom row implies 0 = 2, the

1
1
1
3
1 1 1
row

15. 1 1 1 1 0 1 1
operations
3
1
1
5
0 0 0

2
4

15
2
system is inconsistent.

2
0

If x3 = t the solution is x1 = 1, x2 = 2 t, x3 = t.

1 1 2 1
1 1 2 1
row

16. 3 2
1 7 0
1
1
2
operations
2
3
1
0
0
0
8
0
If x3 = t the solution is x1 = 1 + t, x2 = 2 t, x3 = t.

318

9
4

2R +R

1
2

Exercises 8.2

0 1 1
2 1
1

1
0

17.
1

1 0
1
1 1

The

2
3

18.
1
4
The

1
0

19.
1

0 1
3
row

1 operations 0 0
2
0 0

1
1

1
2

1
2

1
0

5
1

solution is x1 = 0, x2 = 1, x3 = 1, x4 = 0.

0
1 12 12
1
1 0
3

1
1 1
4
row
0 1 1 2

2
2 3
3 operations 0 0 1 1
5

16

solution is x1 = 1, x2 = 2, x3 = 1,

3 5 1
1
1 3

1 1 1
4
row
0 1

2 5 4 2 operations 0 0

1 4

3 1

3
2

x4 = 0.
5 1
1 1
1 4

1
4

Since the bottom row implies 0 = 1, the system

1 2 0
1 0
1 2 0
1
4 9 1 12 0
0 1 1
8
row

20.

3 9 6 21 0 operations 0 0 1 2
1

1
3
2

is inconsistent.

0
0

0
0

If x4 = t the solution is x1 = 19t, x2 = 10t, x3 = 2t, x4

1
1
1
4.280
1 1
1
row

21. 0.2 0.1 0.5 1.978 0 1 2.333

operations
4.1
0.3
0.12
1.686
0 0
1
The solution is x1 = 0.3, x2 = 0.12, x3 = 4.1.

2.5 1.4
4.5
2.6170
1
row

22. 1.35 0.95

1.2
0.7545 0
operations
2.7 3.05 1.44 1.4292
0

0.56
1

= t.
4.28

9.447
4.1

1.8
6.3402

1.0468

3.3953
0.28

The solution is x1 = 1.45, x2 = 1.62, x3 = 0.28.

23. From x1 Na + x2 H2 O x3 NaOH + x4 H2 we obtain the system x1 = x3 , 2x2 = x3 + 2x4 , x2 = x3 . We see
that x1 = x2 = x3 , so the second equation becomes 2x1 = x1 + 2x4 or x1 = 2x4 . A solution of the system is
x1 = x2 = x3 = 2t, x4 = t. Letting t = 1 we obtain the balanced equation 2Na + 2H2 O 2NaOH + H2 .
24. From x1 KClO3 x2 KCl + x3 O2 we obtain the system x1 = x2 , x1 = x2 , 3x1 = 2x3 . Letting x3 = t we see that
a solution of the system is x1 = x2 = 23 t, x3 = t. Taking t = 3 we obtain the balanced equation
2KClO3 2KCl + 3O2 .
25. From x1 Fe3 O4 + x2 C x3 Fe + x4 CO we obtain the system 3x1 = x3 , 4x1 = x4 , x2 = x4 . Letting x1 = t we
see that x3 = 3t and x2 = x4 = 4t. Taking t = 1 we obtain the balanced equation
Fe3 O4 + 4C 3Fe + 4CO.

319

Exercises 8.2
26. From x1 C5 H8 + x2 O2 x3 CO2 + x4 H2 O we obtain the system 5x1 = x3 , 8x1 = 2x4 , 2x2 = 2x3 + x4 . Letting
x1 = t we see that x3 = 5t, x4 = 4t, and x2 = 7t. Taking t = 1 we obtain the balanced equation
C5 H8 + 7O2 5CO2 + 4H2 O.
27. From x1 Cu + x2 HNO3 x3 Cu(NO3 )2 + x4 H2 O + x5 NO we obtain the system
x1 = 3,

x2 = 2x4 ,

x2 = 2x3 + x5 ,

3x2 = 6x3 + x4 + x5 .

Letting x4 = t we see that x2 = 2t and

2t = 2x3 + x5

2x3 + x5 = 2t

or

6x3 + x5 = 5t.

6t = 6x3 + t + x5

Then x3 = 34 t and x5 = 12 t. Finally, x1 = x3 = 34 t. Taking t = 4 we obtain the balanced equation

3Cu + 8HNO3 3Cu(NO3 )2 + 4H2 O + 2NO.
28. From x1 Ca3 (PO4 )2 + x2 H3 PO4 x3 Ca(H2 PO4 )2 we obtain the system
3x1 = x3 ,

2x1 + x2 = 2x3 ,

8x1 + 4x2 = 8x3 ,

3x2 = 4x3 .

Letting x1 = t we see from the rst equation that x3 = 3t and from the fourth equation that x2 = 4t. These
choices also satisfy the second and third equations. Taking t = 1 we obtain the balanced equation
Ca3 (PO4 )2 + 4H3 PO4 3Ca(H2 PO4 )2 .
29. The system of equations is
i1 + i2 i3 = 0
10 3i1 + 5i3 = 0

i1 + i2 i3 = 0
3i1 5i3 = 10

or

27 6i2 5i3 = 0
Gaussian elimination gives

1 1

3 0 5
0 6
5

6i2 + 5i3 = 27

1 1
row

1
10 0
operations
0
0
27
0

35
38
1
, i2 =
, i3 = .
9
9
3
30. The system of equations is
i1 i2 i3 = 0

1
8/3

10/3 .

1/3

The solution is i1 =

52 i1 5i2 = 0

i1 i2 i3 = 0
or

5i2 10i3 = 0

10i3 + 5i2 = 0
Gaussian elimination gives

1 1

1
0

5
0
5 10

i1 + 5i2 = 52

0
1 1 1
row

52 0
1 1/6
operations
0
0
1
0

26/3 .
4

The solution is i1 = 12, i2 = 8, i3 = 4.

31. Interchange row 1 and row in I3 .

32. Multiply row 3 by c in I3 .

320

Exercises 8.2
33. Add c times row 2 to row 3 in I3 .

a21

35. EA = a11
a31

37. EA =

a22

a23

34. Add row 4 to row 1 in I4 .

a12

a13

a32

a33

36. EA = a21

a22

ca31
a12

a13

a21

a22

a23

ca21 + a31

ca22 + a32

ca23 + a33

a23
ca33

a11

a12

a13

a21

a22

a23

ca21 + a31

ca22 + a32

ca23 + a33

39. The system is equivalent to

ca32

a13

a11

38. E1 E2 A = E1

a12

a11

1
2

Letting




Y=


a21

a22

a23

a11

a12

a13

ca21 + a31

ca22 + a32

ca23 + a33

we have

1
2


=

y2


 
2
2
X=
.
3
6

2
0

y1



y1
y2


=


X

 
2
6

This implies y1 = 2 and 12 y1 + y2 = 1 + y2 = 6 or y2 = 5. Then


   
2 2
x1
2
=
,
0
3
5
x2
which implies 3x2 = 5 or x2 =

5
3

and 2x1 2x2 = 2x1

40. The system is equivalent to

2
3



Letting


Y=

we have

This implies y1 = 1 and 23 y1 + y2 =

2
3

6
0

y1

2
3

13



=

y2

10
3



y1
y2

= 2 or x1 =

8
3

. The solution is X =

5
3, 3


1
X=
.
1

13


=


X


1
.
1

+ y2 = 1 or y2 = 53 . Then

  

6
2
x1
1
=
,
0 13
x2
53



which implies 13 x2 = 53 or x2 = 5 and 6x1 + 2x2 = 6x1 + 10 = 1 or x1 = 32 . The solution is X = 32 , 5 .
41. The system is equivalent to

0
2

0
1
10

0
1

00
1
0

2
1
0

321

1
2

2 X = 1 .
21
1

Exercises 8.2
Letting

1

Y = y2 = 0

2
1

y1
y3

we have

2X
21

0 0
y1
2

1 0 y2 = 1 .
10 1
1
y3

0
2

This implies y1 = 2, y2 = 1, and 2y1 + 10y2 + y3 = 4 10 + y3 = 1 or y3 = 7. Then

2
1 2
1
x1

1
2 x2 = 1 ,
0
7
0
0 21
x3
which implies 21x3 = 7 or x3 = 13 , x2 + 2x3 = x2 23 = 1 or x2 = 13 , and x1 2x2 + x3 = x1 + 23 13 = 2


or x1 = 53 . The solution is X = 53 , 13 , 13 .
42. The system is equivalent to

0
1

0
1

00

Letting

1
1
0

2 1 X = 1 .

0
y1

2
0

Y = y2 = 0
y3
we have

4
1

1 X
1

0
1

0
y1
0

0 y2 = 1 .

y3

This implies y1 = 0, 3y1 + y2 = y2 = 1, and y1 + y2 + y3 = 0 + 1 + y3 = 4 or y3 = 3. Then

0
1
1
1
x1

0 2 1 x2 = 1 ,
3
0
0
1
x3
which implies x3 = 3, 2x2 x3 = 2x2 3 = 1 or x2 = 2, and x1 + x2 + x3 = x1 2 + 3 = 0 or x1 = 1.
The solution is X = (1, 2, 3).
43. Using the Solve function in Mathematica we nd
(a) x1 = 0.0717393 1.43084c, x2 = 0.332591 + 0.855709c, x3 = c, where c is any real number
(b) x1 = c/3, x2 = 5c/6, x3 = c, where c is any real number
(c) x1 = 3.76993, x2 = 1.09071, x3 = 4.50461, x4 = 3.12221
(d) x1 =

8
3

73 b + 23 c, x2 =

2
3

13 b 13 c, x3 = 3, x4 = b, x5 = c, where b and c are any real numbers.

322

Exercises 8.3

Exercises 8.3

1.


3
1



1
1
row

3 operations 0


3
;
1

The rank is 2.




2
1 1
row
2.

; The rank is 1.
0 operations 0
0

1 12 23
2
1
3
row

3. 6
3
9 0 0 0 ; The rank is 1.
operations
1 12 32
0 0 0

1 1 2
1 1 2
row

4. 1 2 4 0 1 5 ; The rank is 3.
operations
1 0 3
0 0 1
2
0

1
1
row

4 0
operations
4 1
0

1 1

5. 1 0
1

6.

3
6

2
4
1
5

2
4 1

9.
2 1
6


1 13
1 2 0
row

2 4 5 operations 0
1

1 2
1
3 6
0
row

7.

7 1 operations 0
4
5
0
1
1

8.
0
2

The rank is 3.

1
1

1 3 ;

3
6
0
6

4
0

2
5

2
3

12

;
0
0

5
4


; The rank is 2.

The rank is 2.

2
1

3
0

4
0

;
4

0
1
2
0
1
row

operations 0
3
0

1
4
0
8
row

0 operations 0
8

2
3

1
3
4
3

1
6
13

0
0

1
0

0
0

1
2

3
2

The rank is 3.

1 2 1 8 1 1
1 6
1
0

0 1 3 1 1
1 5

0
row

10. 0
0 1 3 1 2 10 8 0

operations
0
0
0 0 0
0 1
1 3
1 2 1 8 1 1
2 6
0

1
2 3
1 2 3
row

11. 1
0 1 0 1 1 ;
operations
1 1 5
0 0 1

; The rank is 3.
2
2
0
0
0
0

1
1
0
0
0

8
3
0
0
0

1 1 1 6
1 1 1 5

0 1 9 3 ;

0 0 1 0
0 0 0 0

The rank is 4.

Since the rank of the matrix is 3 and there are 3 vectors, the vectors are linearly independent.

323

Exercises 8.3

Since the

1 1

13. 1 1
1 1

1 1
4
3
0
4
1 58
row

1 operations 0
0
1
4
0
0
0
rank of the matrix is 3 and there are 4 vectors, the vectors are linearly dependent.

3 1
1 1 3 1
row

4
2 0
0 1
3
operations
5
7
0
0 0
1

Since the

2
1
2
2

14.
3 1

rank of the matrix is 3 and

1
5
1 1

1
1
row
0 1

6
1 operations 0 0

2
6
1 1

12.
3
2
2
5

there are 3 vectors, the vectors are linearly independent.

1 1
1 7

1 3

1
1 1 1
0 0 0
1
Since the rank of the matrix is 4 and there are 4 vectors, the vectors are linearly independent.
15. Since the number of unknowns is n = 8 and the rank of the coecient matrix is r = 3, the solution of the
system has n r = 5 parameters.
16. (a) The maximum possible rank of A is the number of rows in A, which is 4.
(b) The system is inconsistent if rank(A) < rank(A/B) = 2 and consistent if rank(A) = rank(A/B) = 2.
(c) The system has n = 6 unknowns and the rank of A is r = 3, so the solution of the system has n r = 3
parameters.
17. Since 2v1 + 3v2 v3 = 0 we conclude that v1 , v2 , and v3 are linearly dependent. Thus, the rank of A is at
most 2.
18. Since the rank of A is r = 3 and the number of equations is n = 6, the solution of the system has n r = 3
parameters. Thus, the solution of the system is not unique.
19. The system consists of 4 equations, so the rank of the coecient matrix is at most 4, and the maximum number
of linearly independent rows is 4. However, the maximum number of linearly independent columns is the same
as the maximum number of linearly independent rows. Thus, the coecient matrix has at most 4 linearly
independent columns. Since there are 5 column vectors, they must be linearly dependent.
20. Using the RowReduce in Mathematica we nd

1 0 0

0 1 0

0 0 1

0 0 0
0

that the reduced row-echelon form of the augmented matrix is

834
0 0
261
2215
443
282
1818
0 0
2215
443

13
6
.
0 0

443
443

4214
130
1 0
443
2215

6079
2215

677
443

We conclude that the system is consistent and the solution is x1 = 226

443
6
x3 = 443

13
443 c,

x4 = 130
443

4214
2215 c,

x5 =

677
433

6079
2215 c,

x6 = c.

324

834
2215 c,

x2 =

282
443

1818
2215 c,

Exercises 8.4

Exercises 8.4

 1
= 
2


2
=9
1. M12
5


 1 1 
=1
3. C13 = (1)1+3 
2
3


0 2 0




5. M33 =  1 2 3  = 2


1 1 2

7. C34
9. 7


0


= (1)3+4  1

1


2
4 

2 2  = 10

1
1
10. 2

2. M32


2
= 
1


4

2



 2 4
 = 18
4. C22 = (1)2+2 
2 5 


2
4
0 



6. M41 =  2 2
3  = 24


1
0 1 

8. C23

11. 17


0


= (1)2+3  5

1

2
1
1


0 

1  = 22

2
12. 1/2

13. (1 )(2 ) 6 = 2 3 4
14. (3 )(5 ) 8 = 2 2 23




0 2 0
5
0 0 









 3 0 
2 0




 = 48


15.  3 0 1  = 3 
16.
0
3
0
=
5



 0 2  = 5(3)(2) = 30




5
8
0 5 8
0
0 2


3 0 2






7 1
2 7





 = 3(22) + 2(2) = 62
+ 2
17.  2 7 1  = 3 


6 4
2 6
2 6 4


 1 1 1  

 


  2 2 
 1 1   1 1 

 




 = 20 2(8) + 4 = 40
2 2  = 
2
+
18.  2


1
9
1
9   2 2 
1
1
9


4 5 3








2 3






 51 3 + 31 2 = 0
19.  1 2 3  = 4 






2 3
1 3
1 2
1 2 3
1

 4 6 0




20.  13 8 0  = 0, expanding along the third column.


 1 9 0
2


 2 1 4 








6 1






 + 3  1 4  3  1 4  = 2(44) + 3(24) 3(25) = 85
21.  3
6 1  = 2 






4 8
4 8
6 1
 3
4 8


 3
5
1 



 


 2
 1
5 
5   1
2 




5
+
= 3(40) 5(45) + (10) = 335
22.  1
2 5 = 3


4 10 
7 10   7 4 
 7 4 10 


1 1 1 
  y z   x z   x y 




 

23.  x y z  = 
  2 4  +  2 3  = (4y 3z) (4x 2z) + (3x 2y) = x + 2y z


3
4
2 3 4

325

Exercises 8.4

 1
1


24.  x
y

2 + x 3 + y

1
1 3

1
5
3

25. 
 1 2
1

4
8
0

2
1 2

0
5
0

26. 
1
6
1

 5 1
1


1  
  y
z  = 

3+y
4+z

 
 

z   x
z   x
y 

+

4 + z 2 + x 4 + z 2 + x 3 + y

= (4y + yz 3z yz) (4x + xz 2z xz) + (3x + xy 2y xy) = x + 2y z




0 
1
1 3 






 1 3 
 1 3 
2





 = 8(5) 16(4) = 104
1  = 2(4) 
 = 2  1 2
 2(8)  1



0 
2
1
1
4
8
0

0





1 
2
 2 2 1 
1 2 




4




6
1  = 5(0) + 4(80) = 320
1 0 + 41
 = 51




0 
 5 1
5
1
1 1

1

27. Expanding along the rst column in the original matrix and each succeeding minor, we obtain 3(1)(2)(4)(2) = 48.
28. Expanding along the bottom row we obtain

 
2 0
0 2   2

 
1 6
0
5   1

1 
+
 1 2 1
1 1

 
 2 1 2
3 2

2
1

0
6

0
0

2
1


0

0 
 = 1(48) + 0 = 48.
1 

2 

29. Solving 2 2 15 20 = 2 2 35 = ( 7)( + 5) = 0 we obtain = 7 and 5.

30. Solving 3 + 32 2 = ( 2)( 1) = 0 we obtain = 0, 1, and 2.

Exercises 8.5
1. Theorem 8.11

2. Theorem 8.14

3. Theorem 8.14

4. Theorem 8.12 and 8.11

5. Theorem 8.12 (twice)

6. Theorem 8.11 (twice)

7. Theorem 8.10

8. Theorem 8.12 and 8.9

9. Theorem 8.8

10. Theorem 8.11 (twice)

11. det A = 5

12. det B = 2(3)(5) = 30

13. det C = 5

14. det D = 5

15. det A = 6( 23 )(4)(5) = 80

16. det B = a13 a22 a31

17. det C = (5)(7)(3) = 105

18. det D = 4(7)(2) = 56

19. det A = 14 = det AT

20. det A = 96 = det T

326

Exercises 8.5

 0


21. det AB =  10

 8


2
2 

7 23  = 80 = 20(4) = det A det B

4 16 

22. From Problem 21, (det A)2 = det A2 = det I = 1,


a


23. Using Theorems 8.14, 8.12, and 8.9, det A =  b

c
24. Using Theorems 8.14 and 8.9,


1


det A = 
x

x + y + z

1


25.  4

0

 


2
5   2
4
5 

 


0  =  0 6 10  = 2  0
 


0
2   0 9 22 


 1


27.  4

 9

 
2
3   1
 
5 2  =  0
 
9
6  0


 2


28.  5

 1

2
0
2

2
3
9

 
3   1
 
10  =  0
 
33   0



2
5 



5  = 2  0


0
22 

4
3
9



1
2
2 



10 9  =  0


0
2 2 

 
 
2
1   1
2
2 1   1 2
5 6
1   0
1 2 3   0
=
=
4 8 1   0 10 14 2   0
6 1   0
11 12 2   0 5


0

2

30. 
1

3

1
5
2
1


1

1

31. 
2

1

2
3
3
5

3
5
6
8

37
= (1)(1)(8)( ) = 148
2
 
 
4   1
2 3
4   1
7   0
1 2
3   0
=
=
7   0 1 0 1   0
20   0
3 5 16   0

2
5
1
1

2
0
4
3



1
0



0
1

 = 
0
5



0
2

4
3
0


5 

5  = 2(2)(3)(7) = 84

7 


3 

10  = 1(3)(3) = 9

3

2
3
0


1

2

29. 
3

3



1
5



2
1

 = 
0
0



3
2


1 

z  = 0.

1


5 

14  = 1(1)(15) = 15

15 





1
 1 2
2 
6 






0
1 = 0
1 =  5




0
 2
2 6 
2

4
0
2
3


1 

1  = 0.

1




1 1
1




z
 = (x + y + z)  x y


1 1
x+y+z

1
y
x+y+z

 
 
1 5   1
1
5   1
1
 
 
3 6  =  0 1 14  =  0 1
 
 
1 1   0 1
1 0
0


2 4


26.  4 2

8 7

so det A = 1.


a 1
1 2 



1 2 = 2 b 1


c 1
1 2

2
1
1
5

2
1
0
0

2
10
0




19

 = 1(10)( ) = 38

5
19 
2
9
5


2
2
1 
5 6
1 
 = 1(5)(2)(0) = 0
0 2 4 
0
0
0
2
4
4
3



1
0



0
1

 = 
0
5



0
2

 
3 4   1
2 3   0
=
2 2   0
1 7   0

327

2
1
0
0

2
1
0
0



1
2 0



0
4 1 

 = 
0
8 4



0
23 7

3
2
2
0


4 
3 
 = 1(1)(2)(8) = 16
2 
8

2
1
0
0

2
4
8
23









37 
0
1
4
2

Exercises 8.5

2

1

32. 
0

3

9
3
1
1

1
7
6
4



1
8



2
4

 = 
0
5



3
2

1

0

=
0

0

3
9
1
1

7
1
6
4



1
4



0
8

 = 
0
5



0
2

 
3
7
4   1
1
6
5   0
=
0 31 15   0

0
31
30   0

3
3

7
13

1
8

6
17

3
1

7
6

0
0

31
0

 
4 1
 
0   0
=
5   0
10   0

1
3
8

6
13
17


4

5 

0 
10 


4

5 
 = 1(1)(31)(15) = 465
15 
15 

33. We rst use the second row to reduce the third row. Then we use the rst row to reduce

 


1

1 1
1
1   1
1
1




 


b
c  = 0
ba
c a  = (b a)(c a)  0 1
a





 0 b2 ab c2 ac   0 b(b a) c(c a) 
0 b

the second row.


1 

1.

c

Expanding along the rst row gives (b a)(c a)(c b).

34. In order, we use the third row to reduce the fourth row, the second row to reduce the third row, and the rst
row to reduce the second row. We then pull out a common factor from each column.

 



 1 1 1 1  1

1 1 1 1 
1
1
1

 



 a b c d  0
0 1 1 1 
ba
ca
d a 

 


 2 2 2
=
 = (b a)(c a)(d a) 
.
 a b c d2   0 b2 ab c2 ac d2 ac 
0 b c d 

 



 a3 b3 c3 d3   0 b3 ab2 c3 ac2 d3 ad2 
 0 b2 c2 d2 
Expanding along the rst column and using Problem 33 we obtain (b a)(c a)(d a)(c b)(d b)(d c).
35. Since C11 = 4, C12 = 5, and C13 = 6, we have a21 C11 + a22 C12 + a23 C13 = (1)(4) + 2(5) + 1(6) = 0. Since
C12 = 5, C22 = 7, and C23 = 3, we have a13 C12 + a23 C22 + a33 C32 = 2(5) + 1(7) + 1(3) = 0.
36. Since C11 + 7, C12 = 8, and C13 = 10 we have a21 C11 + a22 C12 + a23 C13 = 2(7) + 3(8) 1(10) = 0.
Since C12 = 8, C22 = 19, and C32 = 7 we have a13 C12 + a23 C22 + a33 C32 = 5(8) 1(19) 3(7) = 0.


 10
0 

37. det(A + B) = 
= 30;
det A + det B = 10 31 = 21
0 3 
38. det(2A) = 25 det A = 32(7) = 224
39. Factoring 1 out of each row we see that det(A) = (1)5 det A = det A. Then det A = det(A) =
det AT = det A and det A = 0.
40. (a) Cofactors: 25! 1.55(1025 );

Row reduction: 253 /3 5.2(103 )

(b) Cofactors: about 90 billion centuries;

Row reduction: about

328

1
10

second

Exercises 8.6

Exercises 8.6

1. AB =

2.

3.

4.

5.

6.

7.

32
66

 
1 + 1
1
=
2 + 3
0

0
1

2 + 2
1 0 0

AB =
6 6 = 0 1 0
2 + 1 3 1 1 + 2 2 + 2 3
0 0 1


1 1
1 1
1
9
9
1
det A = 9. A is nonsingular. A =
=
4
9 4 5
9 95

3 1 

3 1
1
5
5
1
det A = 5. A is nonsingular. A =
=
1
5 4 13
45 15



1
0
1 2 0
6
1
det A = 12. A is nonsingular. A =
= 1 1
12 3 6
4
2



1
1

1
3
3
det A = 3 2 . A is nonsingular. A1 = 2
=
1
2
3 2
3
3

1
1
1
8 8 8
2
2
2
1

1
det A = 16. A is nonsingular. A1 = 2 4
6 = 18
38
4
16
3
1
6
4 2
14
8
8
21
66

1 + 1
3 + 4

8. det A = 0. A is singular.
9.

10.

11.

12.

13.

7
8
13
15
14 13 16
15
30
1
1
2
1
det A = 30. A is nonsingular. A1 = 2
4 2 = 15
15
15
30
7
2
2
4 7 4
15
30
15

4
10
1
8 20
2
39
39
39
1
1
5
19
det A = 78. A is nonsingular. A1 =
78
2 5 19 39
78
78
2
3
1
12 9
3

13
26
26

1
0
0
12
0 0
3
1

det A = 36. A is nonsingular. A1 = 0 6
0
0 = 0 16
36
0 0 12
0
0 18

0 0 2
0 0 18
1

det A = 16. A is nonsingular. A1 =
8 0 0 = 21 0 0
16
0 1 0
0 16 0

2
7
13
6 21 9 36
9
9
1
1
2
1
6 3
1
1
27
27
9
det A = 27. A is nonsingular. A1 =

=
17
27 10 17 6 51 10
2

14. det A = 6. A is nonsingular. A1

0
1
0
=
6 0
6

4
1
1
2
1

3
3
3
0
3

329

12

0
3

9 0
=
0 0
15

27
4
27

27

9
1
9

4
27

16

43
19

17

16

1
2
12

1
3
1
6

1
2

12

3
2

52

9
4
9

Exercises 8.6

15.

16.

17.

6
0

2
4

1
2

A1


A1

R1

1
4

12

1 32
2
4

1
2

1 2 3
row

0 0 1 2
operations
0 0 0
1

0 1

4
3

13

2
5
9
29
49

row

0 0
operations
1
0

1 2 0
R13

1 0
1 0 2
4
2 3
0 1
1

21. 2
1 0 0
1 2 0 0

2
0
3
3

1
1
A = 0 3 23
23

1
3

22. 4 2
8 10

23. 3
0

2
6
3

2
1

1
2

A1 = 2
1

1 2

24. 0 1
0 0

3
4
8

0
1

0
1 2
row

0 0 1
operations
0 0
1

1
13
0

0
1 3 0
row

0 0
1 1
operations
0
0 1
0 0 1

6 3

2 1
1

1
0

0
1

1

6
1
; A =
0

1
12
1
4

5
12

1
12

1 32
0
1

3R2 +R1

1
2

R2 +R1

14

5
12

1
4
1
12

3
2


;

0 ; A is singular.
1
19

2
9
1
9
2
9

59
19

; A1 =

19

5
9
2
9
49

2
9
1
9
2
9

59
19

row

0 0
operations
0
0

1
3

2
3
13
23

1
3
23

5
2

6
2

1
0

1
0

1
12
1
4

2R +R

0
2

1
2

1
6

1 0

0 1



1
1 3
1 0
12
R2

5 1
0 1

1
3 R2 +R1


1
0
1
; A = 8
2
0

1
8

1
6

2 3

20. 0
2

4 0 1


2 32
=
1 1

19. 4 5
7 8



1
0
1 0
8 R1

2R2
1
0 1



1 0 5R1 +R2 1

3 0 1
0

1

1
4
4
=
5
1

12
12

2
2

1
0

18.



1
1 13
0
6 R1
1
1
0
1
4 R2

1
0

0
1

0 ; A is singular.
1

1
2
1
3

16

1
1

0 0
1 0 0
row

1 0 0 1 0
operations
0 0 1
1 1

0
1 0 0
row

0 0 1 0
operations
1
0 0 1

1
0

2
1

5
8
12
1
8

330

; A1

1 2

= 0
1
0

5
8
12
1
8

1 ;
1

Exercises 8.6

1 2
1 0

25.
2 1
1

3 1
2 1
3

1 0

1 2

0
row
0 1

0 operations 0 0

0 0 0 1

1 0 0 0

0 1 0 0
row

operations
0 0 1 0
0

26.
0

0 1
0 0

0
1

1 0

1
0

0
1

0
0

0 1

1
3

27. (AB)1 = B1 A1 =

12

23

16

1
0

1
3
13

12

1
3
13
1
2

3
5
2

1
1

23

7
6
43
1
3
1
2

0
1 0 0 0
0 1 0 0
0
row

0 interchange 0 0 1 0
0

1
3
10
3




32. A

sin
=
cos




x 4
cos
sin

sin
33. (a) AT =
cos

x 4

1
2
1
3
12

1
2

23

; A1

1
1
2

1
=
0

1
2

1
2

23

16

1
3
13

1
3
13
1
2

12

1
0

0
0

0
0

0
1
0
1

; A1 =
0
0

7
6
43
1
3
1
2

0
0
1
0

0
0
0
1

0
1

0
0

1 4
20

28. (AB)1 = B1 A1 = 2
6 30
3
6 32


2
3
29. A = (A1 )1 =
3 4





1 2
5 1
5
1
30. AT =
;
A
; (AT )1 =
=
1
4 10
2
1
2
31. Multiplying


=



5
1 T
;
(A
)
=
1
2
2

1
2

16 3x

16 3x

we see that x = 5.

cos
sin

(b) AT =

= A1

1
3

0
26

1
3
1
2
1
6

1
3
12
1
6

= A1

34. Since det A det A1 = det AA1 = det I = 1, we see that det A1 = 1/ det A. If A is orthogonal, det A =
det AT = det A1 = 1/ det A and (det A)2 = 1, so det A = 1.
35. Since A and B are nonsingular, det AB = det A det B = 0, and AB is nonsingular.
36. Suppose A is singular. Then det A = 0, det AB = det A det B = 0, and AB is singular.
37. Since det A det A1 = det AA1 = det I = 1, det A1 = 1/ det A.
38. Suppose A2 = A and A is nonsingular. Then A2 A1 = AA1 , and A = I. Thus, if A2 = A, either A is
singular or A = I.
39. If A is nonsingular, then A1 exists, and AB = 0 implies A1 AB = A1 0, so B = 0.
40. If A is nonsingular, A1 exists, and AB = AC implies A1 AB = A1 AC, so B = C.

331

Exercises 8.6

41. No, consider A =

1
0

0
0


and B =

0
0


0
.
1

42. A is nonsingular if a11 a22 a33 = 0 or a11 , a22 , and a33 are all nonzero.

1/a11
0
0

A1 = 0
1/a22
0
0
0
1/a33

43.

44.

45.

46.

47.

48.

49.

For any diagonal matrix, the inverse matrix is obtaining by taking the reciprocals of the diagonal entries and
leaving all other entries 0.


1
  

1
4
6
3
3
1
1
A = 2
;
A
=
; x1 = 6, x2 = 2
14
2
13
3

2 1

  1
2
1
3
3
6
2
1
A1 =
=
; x1 = , x2 =
;
A
3
1
1
2
2
5

3 6
2

1 3
 
3
6
3
1
16
8
4
1
1
A =
; A
; x1 = , x2 =
=
1
1
1
4
2
1
8 4
2


 


4
11
2
1
15
A1 =
; A1
=
; x1 = 11, x2 =
3
1
15
2
3

2
2
2

1
1
1
4
2
5
5
5

1
1
A = 1
1
0 ; A 0 = 4 ; x1 = 2, x2 = 4, x3 = 6
6
6
6
15 15
5
5

1
1
1
12
1
2
12
4
1
3

2
1
1
A1 = 3
0
;
A
2
=

0 ; x1 = , x2 = 0, x3 =
3
2
2
3
1
1
5
3
12

2
12
4

2 3
2
1
21

0
A1 = 14 14
; A1 3 = 1 ; x1 = 21, x2 = 1, x3 = 11
5
4

7
4

11

2
1
2 1
1
1
1 2
1
2 1 1

50. A1 =
=
; x1 = 1, x2 = 2, x3 = 1, x4 = 4
; A1
5 1
1 1
1
1
3
4
1 1
1
0


1

   
 
9 
   
1
7 2
x1
b1
5
10
6
10
10
10
1
1
1
51.
; X=A
=
; A =
= 13 ; X = A
=
;
3
7
3
2
4
50
16
x2
b2
20 20
20

 

0
2
X = A1
=
20
7

1 2 5
x1
2 1 1
b1
1
12

52. 2 3 8 x2 = b2 ; A1 = 12 7 2 ; X = A1 4 = 52 ;
1 1 2
5
3
1
6
23
x3
b3

3
0
0
1

1
1
X = A 3 = 9 ; = A 5 = 27
3
3
4
11

332

Exercises 8.7
53. det A = 18 = 0, so the system has only the trivial solution.
54. det A = 0, so the system has a nontrivial solution.
55. det A = 0, so the system has a nontrivial solution.
56. det A = 12 = 0, so the system has only the trivial solution.

1
1
1
i1
0

57. (a) R1
R2 0 i2 = E2 E1
0
R2 R3
i3
E3 E2
(b) det A = R1 R2 + R1 R3 + R2 R3 > 0, so A is nonsingular.

R2
R2 R3 R2 R3
1

(c) A1 =
R3
R1 ;
R1 R3
R1 R2 + R1 R3 + R2 R3
R1 R2
R2
R1 + R2

0
R 2 E1 R 2 E 3 + R 3 E 1 R 3 E 2
1

A1 E2 E1 =
R 1 E2 R 1 E 3 R 3 E 1 + R 3 E 2
R 1 R 2 + R1 R3 + R 2 R 3
E3 E 2
R1 E2 + R1 E3 R2 E1 + R2 E3
58. (a) We write the equations in the form
4u1 + u2 + u4 = 200
u1 4u2 + u3 = 300
u2 4u3 + u4 = 300

In matrix form this becomes

(b) A

7
24

1
12
=
1
24
1
12

1
12

1
24

7
24

1
12

1
12

7
24

1
24

1
12

4
1

0
1
1

u1 + u3 4u4 = 200.

1
0
1
u1
200

4
1
0
u2 300
=
.
1 4
1 u3 300
1 4

200

u4
225

200
2
275
1
300

24
225
275
2
; A1

= 275

; u1 = u4 = 2 , u2 = u3 = 2
1

300
12
2
225
7
200

12

24

Exercises 8.7
1. det A = 10, det A1 = 6, det A2 = 12; x1 =

6
10

2. det A = 3, det A1 = 6, det A2 = 6; x1 =

= 35 , x2 =

6
3

= 2, x2 =

3. det A = 0.3, det A1 = 0.03, det A2 = 0.09; x1 =

0.03
0.3

12
10

6
3

=2

= 0.1 , x2 =

4. det A = 0.015, det A1 = 0.00315, det A2 = 0.00855; x1 =

6
5

0.09
0.3

0.00315
0.015

= 0.3

= 0.21, x2 =

0.00855
0.015

= 0.57

5. det A = 1, det A1 = 4, det A2 = 7; x = 4, y = 7

6. det A = 70, det A1 = 14, det A2 = 35; r =

14
70

, s=

35
70

= 12

7. det A = 11, det A1 = 44, det A2 = 44, det A3 = 55; x1 =

44
11

= 4, x2 =

1
5

333

44
11

= 4, x3 =

55
11

= 5

Exercises 8.7
173
8. det A = 63, det A1 = 173, det A2 = 136, det A3 = 61
2 ; x1 = 63 , x2 =

9. det A = 12, det A1 = 48, det A2 = 18, det A3 = 12; u =

48
12

= 4, v =

136
63

18
12

, x3 =
3
2

61
126

, w=1

10. det A = 1, det A1 = 2, det A2 = 2, det A3 = 5; x = 2, y = 2, z = 5

11. det A = 6 5k, det A1 = 12 7k, det A2 = 6 7k; x1 =
for k = 6/5.

12 7k
6 7k
, x2 =
. The system is inconsistent
6 5k
6 5k

%11
1
%2
1
=
=1
, x2 =
%1
%1
%1
%1
(b) When % = 1.01, x1 = 99 and x2 = 100. When % = 0.99, x1 = 101 and x2 = 100.

12. (a) det A = % 1, det A1 = % 2, det A2 = 1; x1 =

13. det A 0.6428, det A1 289.8, det A2 271.9; x1

289.8
0.6428

450.8, x2

271.9
0.6428

423

14. We have (sin 30 )F + (sin 30 )(0.5N ) + N sin 60 = 400 and (cos 30 )F + (cos 30 )(0.5N ) N cos 60 = 0. The
system is
(sin 30 )F + (0.5 sin 30 + sin 60 )N = 400
(cos 30 )F + (0.5 cos 30 cos 60 )N = 0.
det A 1, det A1 26.795, det A2 346.41; F 26.795, N 346.41
15. The system is
i1 + i2 i3 = 0
r1 i1 r2 i2 = E1 E2
r2 i2 + Ri3 = E2
det A = r1 R r2 R r1 r2 , det A3 = r1 E2 , r2 E1 ; i3 =

r1 E2 + r2 E1
r1 R + r2 R + r1 r2

Exercises 8.8


 



2
2
2
=
= (1)
; = 1
5
5
5




 



2 1
1
1
2
=
, = 2
= 2
and K2 since
2 2
2 2
2 2
2 + 2 2
 





2+ 2

2 1
2+ 2
2+2 2

=
; = 2
= 2
2 2
2
2 2
2


  


6 3
5
0
5
since
=
=0
; =0
2 1
10
0
10


 



2
8
2 + 2i
4 + 4i
2 + 2i
since
=
= 2i
; = 2i
1 2
1
2i
1

1 2
2
4
12
4

and K3 since 2
1 2 4 = 12 = 3 4 ; = 3
2
2
1
0
0
0

1 2
2
1
1

1 2 1 = 1 ; = 1
2
2
2
1
1
1

1. K3 since
2. K1

3. K3
4. K2

5. K2

4
5

2
1



334

Chapter 8 Review Exercises

5. (a) The initial state and the transfer matrix are

0
0.88

X0 = 100 and T = 0.06

0
0.06
(b)

Year

Phytoplankton

Water

Zooplankton

0
1

0.00
2.00

100.00
97.00

0.00
1.00

3.70

94.26

2.04

3
4

5.14
6.36

91.76
89.47

3.10
4.17

5
6

7.39
8.25

87.37
85.46

5.24
6.30

8.97

83.70

7.33

8
9

9.56
10.06

82.10
80.62

8.34
9.32

10
11

10.46
10.79

79.28
78.04

10.26
11.17

12

11.06

76.90

12.04

0.02
0

0.97 0.05 .
0.01 0.95

= 1X
we see that the equilibrium state vector X
is the eigenvector of the transfer matrix T corre6. From TX
sponding to the eigenvalue 1. It has the properties that its components add up to the sum of the components
of the initial state vector.

Chapter 8 Review Exercises

4
5

2 3
3 4

1.
4 5
5 6
2. 4 3

7



4
; BA = [ 11 ]
8


 
4 2
2
1
1
1
A =
=
3
2 3
12
1
2




1 0
0 1
False; consider A =
and B =
0 1
1 0
True

 3
det 12 A = 12 (5) = 58 ; det(AT ) = (1)3 (5) = 5

3
3. AB =
6
4.
5.
6.
7.

8. det AB1 = det A/ det B = 6/2 = 3

9. 0
10. det C = (1)3 / det B = 1/103 (2) = 1/2000
11. False; an eigenvalue can be 0.

369

Chapter 8 Review Exercises

12. True
13. True
14. True, since complex roots of real polynomials occur in conjugate pairs.
15. False; if the characteristic equation of an nn matrix has repeated roots, there may not be n linearly independent
eigenvectors.
16. True
17. True
18. True
19. False; A is singular and thus not orthogonal.
20. True
21. A = 12 (A + AT ) + 12 (A AT ) where 12 (A + AT ) is symmetric and 12 (A AT ) is skew-symmetric.




0 1
0 1
2
2
2
22. Since det A = (det A) 0 and det
= 1, there is no A such that A =
.
1 0
1 0


1
1
23. (a)
is nilpotent.
1 1
(b) Since det An = (det A)n = 0 we see that det A = 0 and A is singular.





i
0
0 1
0
24. (a) x y =
= y x ; x z =
= z x ; y z =
0 i
1
0
i


i
= z y
0

(b) We rst note that for anticommuting matrices AB = BA, so C = 2AB. Then Cxy




0 2i
0 2
Cyz =
, and Czx =
.
2i 0
2 0

5 1 1 9
9
1 0
1
1 5
1 1
5 9
row
row

R13

9
25. 2
4 0 27 2
4 0 27 0 1 5 2 0 1
operations
operations
1
1 5
5 1 1 9
0 0
9
0 0
1 12
T

The solution is X = [ 12 7 12 ]

1
1
1 6
1
row

26. 1 2
3 2 0
operations
2
0 3 3
0


=


2i
0
,
0 2i

12

0
1

1
2

7 .

.
1
1
2
1 3
0

1 0 0
row

4
3 0 1 0
operations
1
0 0 1

2 .
1

The solution is x1 = 3, x2 = 2, x3 = 1.
27. Multiplying the second row by abc we obtain the third row. Thus the determinant is 0.
28. Expanding along the rst row we see that the result is an expression of the form ay + bx2 + cx + d = 0, which
is a parabola since, in this case a = 0 and b = 0. Letting x = 1 and y = 2 we note that the rst and second
rows are the same. Similarly, when x = 2 and y = 3, the rst and third rows are the same; and when x = 3
and y = 5, the rst and fourth rows are the same. In each case the determinant is 0 and the points lie on the
parabola.
29. 4(2)(3)(1)(2)(5) = 240
30. (3)(6)(9)(1) = 162

370

Chapter 8 Review Exercises

1 1
1

31. Since 5
1 1 = 18 = 0, the system has only the trivial solution.
1
2
1

1 1 1

32. Since 5
1 1 = 0, the system has innitely many solutions.
1
2
1
33. From x1 I2 + x2 HNO3 x3 HIO3 + x4 NO2 + x5 H2 O we obtain the system 2x1 = x3 , x2 = x3 + 2x5 , x2 = x4 ,
3x2 = 3x3 +2x4 +x5 . Letting x4 = x2 in the fourth equation we obtain x2 = 3x3 +x5 . Taking x1 = t we see that
x3 = 2t, x2 = 2t + 2x5 , and x2 = 6t + x5 . From the latter two equations we get x5 = 4t. Taking t = 1 we have
x1 = 1, x2 = 10, x3 = 2, x4 = 10, and x5 = 4. The balanced equation is I2 +10HNO3 2HIO3 +10NO2 +4H2 O.
34. From x1 Ca + x2 H3 PO4 x3 Ca3 P2 O8 + x4 H2 we obtain the system x1 = 3x3 , 3x2 = 2x4 , x2 = 2x3 , 4x2 = 8x3 .
Letting x3 = t we see that x1 = 3t, x2 = 2t, and x4 = 3t. Taking t = 1 we obtain the balanced equation
3Ca + 2H3 PO4 Ca3 P2 O8 + 3H2 .
1
1
2
42
21
56
= , x2 =
= , x3 =
=
84
2
84
4
84
3
16
4
0
36. det = 4, det A1 = 16, det A2 = 4, det A3 = 0; x1 =
= 4, x2 =
= 1, x3 = = 0
4
4
4
2
2
37. det A = cos + sin , det A1 = X cos Y sin , det A2 = Y cos + X sin ;
x1 = X cos Y sin , y = Y cos + X sin

35. det A = 84, det A1 = 42, det A2 = 21, det A3 = 56; x1 =

38. (a) i1 i2 i3 i4 = 0, i2 R1 = E, i2 R1 i3 R2 = 0, i3 R2 i4 R3 = 0

1 1
1
1
0 R
0
0
1

(b) det A =
= R1 R 2 R 3 ;
0 R1 R2
0
0

0
E

det A1 =
0
0

R2

1
R1
R1

1
0

R2
0
R2

R3

1
0

= E[R2 R3 R1 (R3 + R2 )] = E(R2 R3 + R1 R3 + R1 R2 );

0

R3



det A1
1
1
1
E(R2 R3 + R1 R3 + R1 R2 )
=E
+
+
=
det A
R1 R2 R 3
R1
R2
R3

2
3 1
x1
6
2 3
1

1
39. AX = B is 1 2
0 x2 = 3 . Since A = 1
0
3
2
0
1
9
4 6
x3

7

1
X = A B = 5 .
23

3
14 94
1
1
2

1
3
40. (a) A1 B = 1
2
2 1 = 1
1
1
0
14 14
2
3

14 94
2
10
2

3
1
(b) A1 B = 1
7
2
2 1 =
i1 =

1
2

14

14

371

1 , we have
7

Chapter 8 Review Exercises

41. From the characteristic equation 2 4 5 = 0 wesee 
that the eigenvalues are 1 = 1 and 2 = 5. For
1
1 = 1 we have 2k1 + 2k2 = 0, 4k1 4k2 = 0 and K1 =
. For 2 = 5 we have 4k1 + 2k2 = 0, 4k1 2k2 = 0
1
 
1
and K2 =
.
2
2
42. From the characteristic
  equation = 0 we see that the eigenvalues are 1 = 2 = 0. For 1 = 2 = 0 we have
0
4k1 = 0 and K1 =
is a single eigenvector.
1

43. From the characteristic equation 3 + 62 + 15 + 8 = ( + 1)2 ( 8) = 0 we see that the eigenvalues are
1 = 2 = 1 and 3 = 8. For 1 = 2 = 1 we have

4 2 4 0
1 12 1 0
row

2 1 2 0 0 0 0 0 .
operations
4 2 4 0
0 0 0 0
Thus K1 = [ 1 2

Thus K3 = [ 2

0 ] and K2 = [ 1 0 1 ] . For 3 = 8 we have

5
2
4 0
1 25 45
row

2 0 0
1 12
2 8
operations
4
2 5 0
0
0
0

0.
0

2] .

44. From the characteristic equation 3 +182 99+162 = (9)(6)(3) = 0 we see that the eigenvalues
are 1 = 9, 2 = 6, and 3 = 3. For 1 = 9 we

2 2
0

2
3
2

0
2 4
Thus K1 = [ 2

Thus K2 = [ 2

have

0
1 1
row

0 0 1
operations
0 0
0

0
2
0

0.
0

1 ] . For 2 = 6 we have

1 2
0 0
1 2
row

0
2 0 0
1
2
operations
0
2 1 0
0
0

0.

0
12
0

2 ] . For 3 = 3 we have

4 2 0

3 2
2
0
2 2

0
1 12
row

0 0
1
operations
0
0
0

0
1
0

0.
0

Thus K3 = [ 1 2 2 ] .
45. From the characteristic equation 3 2 + 21 + 45 = ( + 3)2 ( 5)
1 = 2 = 3 and 3 = 5. For 1 = 2 = 3 we have

1
2 3 0
1 2 3
row

2
4
6
0
0

0 0
operations
1 2
3 0
0 0
0
Thus K1 = [ 2

0 ] and K2 = [ 3 0 1 ]

7
2 3

2 4 6
1 2 5

. For 3 = 5 we have

0
1 27
row

0 0
1
operations
0
0
0

372

3
7

2
0

= 0 we see that the eigenvalues are

0

0.
0

0.
0

Chapter 8 Review Exercises

Thus K3 = [ 1

1] .

46. From the characteristic equation 3 + 2 + 2 = ( + 1)( 2) = 0 we see that the eigenvalues are 1 = 0,
T
2 = 1, and 3 = 2. For 1 = 0 we have k3 = 0, 2k1 + 2k2 + k3 = 0 and K1 = [ 1 1 0 ] . For 2 = 1 we
have

1 0 0 0
1 0 0 0
row

0 1 1 0 0 1 1 0 .
operations
2 2 2 0
0 0 0 0
T

Thus K2 = [ 0 1 1 ] . For 3 = 2 we have

2
0
0 0
1 0
row

1 0 0 1
0 2
operations
2
2 1 0
0 0
Thus K3 = [ 0

XT1

1
3

1
3

0.
0

12
0

2] .
T

47. Let X1 = [ a b

be the rst column of the matrix. Then XT1 [ 12

c]

T
1 ]
3

1 (a + b + c) =
3
2
2

0. Also
2

XT1 X1

T
1 ]
2

1 (c
2

a) = 0 and

= a + b + c = 1. We see that c = a and b = 2a from

2

the rst two equations. Then a + 4a + a = 6a = 1 and a =

1
6

. Thus X1 = [ 16

26

T
1 ] .
6
T

48. (a) Eigenvalues are 1 = 2 = 0 and 3 = 5 with corresponding eigenvectors K1 = [ 0 1 0 ] , K2 =

T
T
[ 2 0 1 ] , and K3 = [ 1 0 2 ] . Since K1  = 1, K2  = 5 , and K3  = 5 , we have

0
1 0
0 25 15

2
1
1
T
P = 1 0
0 and P = P = 5 0 5 .
2
0 15
1 0 2
5
5

(b) P1 AP = 0
0


0
0
0
1

0
5
3 
2
. Eigenvalues are 1 = 12 and 2 =
1


5
2

49. We identify A = 3
so D =
  2
X
[X Y ]D
= 12 X 2 + 52 Y 2 = 1. The graph is a hyperbola.
Y

12

5
2


and the equation becomes

50. We measure years in units of 10, with 0 corresponding to 1890. Then Y = [ 63 76


T


0 1 2 3 4
30 10
A=
, so AT A =
. Thus
1 1 1 1 1
10 5
 


15
5 10
1
T
1 T
T
X = (A A) A Y =
,
A Y=
50 10
62
30

92

106

123 ]

and

and the least squares line is y = 15t + 62. At t = 5 (corresponding to 1940) we have y = 137. The error in the
predicted population is 5 million or 3.7%.
51. The encoded message is




10 1
19 1 20 5 12 12 9 20 5 0 12 1 21
B = AM =
9 1
14 3 8 5 4 0 15 14 0 6 18 9 0


204 13 208 55 124 120 105 214 50 6 138 19 210
=
.
185 12 188 50 112 108 96 194 45 6 126 18 189

373

Chapter 8 Review Exercises

52. The encoded message is

B = AM =

=
53. The decoded message is

1
M=A B= 1
2

2
0
1



10

19

14

20

18

22

19

20

21

19

208

72

49

30

91

145

219

11

189

67

46

29

84

131

199

10

1
19

0 35
1
5

15 14 0 20
8

27 53 1 54 = 19
3 48 2 39
8

0
10
15

18

13

193
.
175

5 12 16 0 9

0 15 14 0 20 .
5 0 23 1 25

From correspondence (1) we obtain: HELP IS ON THE WAY.

54. The decoded message is

M = A1 B = 1
2

2
0
1

1
5

0 27
1
21

From correspondence (1) we obtain: ROSEBUD

55. (a) The parity is even so the decoded message is [ 1

2
17

21
18

40 = 5

13

15

19

21 .
0

2
0

.
1

1]

(b) The parity is odd; there is a parity error.

1

c1
1 1 0 1
0

0
56. From c2 1 0 1 1 = 0 we obtain the codeword [ 0
0
0 1 1 1
1
c3
1

374

1 ].