Matrices Exercises 8.1

8
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

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
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
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 .
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 .
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)
7. Theorem 8.10
8. Theorem 8.12 and 8.9
9. Theorem 8.8
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
=
1
5 4 13
45 15

1
0
1 2 0
6
1
= 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

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
=
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
Exercises 8.8

0
1
3
1

1 4 = 12 = 3 4 ; = 3
1
3
9
3

1
2

We solve
det(A I) =
= ( 6)( 1) = 0.
7
8

1 2/7 0
7 2 0
For 1 = 6 we have
=
7 2 0
0
0
0

2
so that k1 = 27 k2 . If k2 = 7 then K1 =
. For 2 = 1 we have
7

2 2 0
1 1 0
=
7 7 0
0
0 0

1
so that k1 = k2 . If k2 = 1 then K2 =
.
1

2
1

= ( 3) = 0.
We solve
det(A I) =
2
1

2 1 0
1 1/2 0
For 1 = 0 we have
=
2 1 0
0
0
0

1
. For 2 = 3 we have
2

1
1 0
1 1 0
=
2 2 0
0
0 0

1
so that k1 = k2 . If k2 = 1 then K2 =
.
1

8 1
= ( + 4)2 = 0.
We solve
det(A I) =
16

4 1 0
1 1/4 0
For 1 = 2 = 4 we have
=
16
4 0
0
0
0

1
.
4

1
1
We solve
det(A I) =
= ( 3/2)( 1/2) = 0.
1/4 1

0
1 2 0
1/2
1
For 1 = 3/2 we have
=
1/4 1/2 0
0
0 0

2
so that k1 = 2k2 . If k2 = 1 then K1 =
. If 2 = 1/2 then
1

1/2
1
0
1 2 0
=
1/4 1/2 0
0 0 0

2
so that k1 = 2k2 . If k2 = 1 then K2 =
.
1
6. K2 since 1
0
7.
8.
9.
10.
1
2
3
335
Exercises 8.8

1
2
= 2 + 9 = ( 3i)( + 3i) = 0.
det(A I) =
5
1

1 (1/5) + (3/5)i 0
0
1 3i
2
For 1 = 3i we have
=
0
5
1 3i 0
0
0

1 3i
so that k1 = 15 35 i k2 . If k2 = 5 then K1 =
. For 2 = 3i we have
5

1 + 3i
2
0
1 15 35 i 0
=
5
1 + 3i 0
0
0
0

1 + 3i
so that k1 = 15 + 35 i k2 . If k2 = 5 then K2 =
.
5

1
1

= 2 2 + 2 = 0.
We solve
det(A I) =
1
1

i 1 0
i 1 0
For 1 = 1 i we have
=
1
i 0
0
0 0

i
i
so that k1 = ik2 . If k2 = 1 then K1 =
and K2 = K1 =
.
1
1

4
8
= ( 4)( + 5) = 0.
We solve
det(A I) =
0
5

0
8 0
0 1 0
For 1 = 4 we have
=
0 9 0
0 0 0

1
so that k2 = 0. If k1 = 1 then K1 =
. For 2 = 5 we have
0

9 8 0
1 89 0
=
0 0 0
0 0 0

8
.
9

7
0
= ( 7)( 13) = 0.
We solve
det(A I) =
0
13

0 1 0
0 0 0
For 1 = 7 we have
=
0 6 0
0 0 0

1
. For 2 = 13 we have
0

6 0 0
1 0 0
=
0 0 0
0 0 0

0
.
1

5
1
0
1
0 4

9 = (4 )( + 4) = 0.
5
9 = 4 5
We solve
det(A I) = 0

5
1

1
4
5 1 0 0
1 0 9/25 0
For 1 = 0 we have
0 5 9 0 = 0 1 9/5 0
5 1 0 0
0 0
0
0
11. We solve
12.
13.
14.
15.
336
Exercises 8.8
9

9
so that k1 = 25
k3 and k2 = 95 k3 . If k3 = 25 then K1 = 45 . If 2 = 4 then
25
0
5
1 0 1
0 = 0 1 1
0
0

1

so that k1 = k3 and k2 = k3 . If k3 = 1 then K2 = 1 . If 3 = 4 then
1
0
5
1
1
1 0 1
0 = 0 1 9

1

so that k1 = k3 and k2 = 9k3 . If k3 = 1 then K3 = 9 .
1
16. We solve

3

det(A I) = 0

4
0
2
0
2 0 0
0 1 0
For 1 = 1 we have

0 = (3 )(2 )(1 ) = 0.

1
0
1 0 0
0 = 0 1 0
0
0

0

so that k1 = 0 and k2 = 0. If k3 = 1 then K1 = 0 . If 2 = 2 then
1
0
4
1 0 0
0 = 0 0 1
0
0
0

0

so that k1 = 0 and k3 = 0. If k2 = 1 then K2 = 1 . If 3 = 3 then
0
0
4
1
0
0
2
0
1 0 1/2
0 = 0 1
0
0 0
0
0

1

1
so that k1 = 2 k3 and k2 = 0. If k3 = 2 then K3 = 0 .
2
337
0
0
Exercises 8.8
17. We solve

det(A I) = 1

0
1
0
For 1 = 2 = 3 = 2 we have

0

0 = ( + 2)3 = 0.

2
4 0 0
1 2 0 0
2 0 0 = 0 0 0 0
0 0 0
0 0 0 0
4
4
0
so that k1 = 2k2 . If k2 = 1 and k3 = 1 then
K1 = 1
0

0

and K2 = 0 .
1

1
6
0

3 3 = (3 )(1 )2 = 0.
18. We solve
= 0

1
2
1
2 0
2 6
0 0
1 0 3 0
For 1 = 3 we have
0 0 = 0 1 1 0
0 0
0 1 1 0
0 0
0 0

3

so that k1 = 3k3 and k2 = k3 . If k3 = 1 then K1 = 1 . For 2 = 3 = 1 we have
1
0 6 0 0
0 1 0 0
0 1 1 0 = 0 0 1 0

1

det(A I) = 0

0
6
2
0
1
0
0 0 0 0

1

so that k2 = 0 and k3 = 0. If k1 = 1 then K2 = 0 .
0

0
1

0 = ( + 1)(2 + 1) = 0.
19. We solve
det(A I) = 0

1
1 1
1 0 1 0
1 0 1 0
For 1 = 1 we have
0 0 = 0 1
1 0
1 1
1 1
0 0
0 0
0 0
so that k1 = k3 and k2 = k3 . If k3 = 1 then K1 = 1 . For 2 = i we have

1
i
0
1
0
1 0 i 0
0
0 = 0 1 1 0
1 i
1
1 i
0 0
0 0
0

i
i

so that k1 = ik3 and k2 = k3 . If k3 = 1 then K2 = 1 and K3 = K2 = 1 .
1
1
338
Exercises 8.8
20. We solve

2

det(A I) = 5

0

0

4 = 3 + 62 13 + 10 = ( 2)(2 + 4 5)

2
1
2
1
= ( 2)( (2 + i))( (2 i)) = 0.
0
1 0 4/5
0 = 0 1 0
0 0 0
0
0 1 0
0 4
5
0
1 0
For 1 = 2 we have
0
0
so that k1 = 45 k3 and k2 = 0. If k3 = 5 then K1 = 0 . For 2 = 2 + i we have

5
i 1
5
0
1 i
0
1 i
0 = 0
0
0
so that k1 = ik2 and k2 = ik3 . If k3 = i then K2 = 1 . For 3 = 2 i we have

i
5
0
i 4
0 = 0
i 0
1 i
0
0
so that k1 = ik2 and k2 = ik3 . If k3 = i then K3 = 1 .

i

1
2
3

21. We solve
det(A I) = 0
5
6 = ( 1)( 5)( + 7) = 0.

0
0
7
0 2
0 4
For 1 = 1 we have
3
6
0 1 0
0 = 0 0 1
0
0
0

1

so that k2 = k3 = 0. If k1 = 1 then K1 = 0 . For 2 = 5 we have
0
0
0
0
0
6
12
0
1 12 0
0 = 0
0 1
0
0 0
0
339
0
0
Exercises 8.8

1

so that k3 = 0 and k2 = 2k1 . If k1 = 1 then K2 = 2 . For 3 = 7 we have
0
8 2 3 0
1 0 14 0
0 12 6 0 = 0 1 12 0
0 0 0 0
0 0 0 0
so that k1 = 14 k3 and k2 = 12 k3 . If k3 = 4 then K3 = 2 .

4

0
0

22. We solve
det(A I) = 0
0 = 2 ( 1) = 0.

0
0 1
0 0 0 0
0 0 1 0
For 1 = 2 = 0 we have
0 0 0 0 = 0 0 0 0
0
0 1 0
0 0 0 0

1
0

so that k3 = 0. If k1 = 1 and k2 = 0 then K1 = 0 and if k1 = 0 and k2 = 1 then K2 = 1 . For 3 = 1 we
0
0
have
1
0 0 0
1 0 0 0
0 1 0 0 = 0 1 0 0
0
0 0 0

0

so that k1 = k2 = 0. If k3 = 1 then K3 = 0 .
1

5 1
23. The eigenvalues and eigenvectors of A =
are
1 5

1
1
, K2 =
1
1

5 1
1
and the eigenvalues and eigenvectors of A1 =
are
24 1
5

1
1
1
1
1 = , 2 = , K 1 =
, K2 =
.
4
6
1
1
1 = 4,
2 = 6,
24. The eigenvalues and eigenvectors of A = 1

4
1 = 1,
2 = 2,
3 = 3,
K1 =
1 are
5
K1 = 1 ,
2
0
4
340
K2 = 1 ,
4
K3 = 1 .
4
Exercises 8.8
4 6
2
1
and the eigenvalues and eigenvectors of A1 = 1

9 2 are
6
4 12 2
1
2
1
1
1 = 1, 2 = , 3 = , K1 = 1 , K2 = 1 ,
2
3
2
4

6 0
= 0 the matrix is singular. Now from
25. Since det A =
3 0

6 0

= ( 6)
det(A I) =
3

K3 = 1 .
4
we see = 0 is an eigenvalue.

1
0 1

26. Since det A = 4 4 5 = 0 the matrix is singular. Now from

7 4 8

1
0
1

det(A I) = 4
4
5 = (2 5 15)

7
4
8
we see = 0 is an eigenvalue.
27. (a) Since p + 1 p = 1 and q + 1 q = 1, the rst matrix A is stochastic. Since
and
1
6
1
3
1
2
1
2
1
4
1
4
= 1,
1
3
1
3
1
3
= 1,
= 1, the second matrix A is stochastic.
(b) The matrix from part (a) is shown with its eigenvalues and corresponding eigenvectors.
1 1 1
2
4
4
1
1 1 1
1
1
2 , 6 + 12
2;
3 3 3 ; eigenvalues: 1, 16 12
1
6
1
3
1
2

3(1+2) 2(2+2)
2) 2(2+ 2)
,
,1 ,
,
eigenvectors: (1, 1, 1), 3(1+

,1
6+ 2
6+ 2
6+ 2
6+ 2
Further examples indicate that 1 is always an eigenvalue with corresponding eigenvector (1, 1, 1). To prove
this, let A be a stochastic matrix and K = (1, 1, 1). Then

a11 a1n
a11 + + a1n
1
1
.. ..
..
..
..
AK = .
= . = 1K,
. . =
.
an1
ann
an1 + + ann
and 1 is an eigenvalue of A with corresponding eigenvector (1, 1, 1).

(c) For the 3 3 matrix in part (a) we have
3
7
A2 =
8
1
3
5
18
24
11
36
23
72
1
3
13
36
29
72
A3 =
49
144
71
216
5
16
29
96
11
36
67
216
103
288
79
216
163
432
These powers of A are also stochastic matrices. To prove that this is true in general for 2 2 matrices, we
prove the more general theorem that any product of 2 2 stochastic matrices is stochastic. Let

a11 a12
b11 b12
A=
and B =
a21 a22
b21 b22
341
Exercises 8.8
be stochastic matrices. Then

AB =

a11 b12 + a12 b22
.
a21 b12 + a22 b22
a11 b11 + a12 b21

a21 b11 + a22 b21
The sums of the rows are

a11 b11 + a12 b21 + a11 b12 + a12 b22 = a11 (b11 + b12 ) + a12 (b21 + b22 )
= a11 (1) + a12 (1) = a11 + a12 = 1
a21 b11 + a22 b21 + a21 b12 + a22 b22 = a21 (b11 + b12 ) + a22 (b21 + b22 )
= a21 (1) + a22 (1) = a21 + a22 = 1.
Thus, the product matrix AB is stochastic. It follows that any power of a 2 2 matrix is stochastic. The
proof in the case of an n n matrix is very similar.
Exercises 8.9
1. The characteristic equation is 2 6 + 13 = 0. Then

7 12
6
A2 6A + 13I =
24
17
24
2. The characteristic equation is 3 + 2 + 4 1.

2 6 13
1

3
2
A + A + A I = 4 5 17 + 0
1 5
9
1

12
13
+
30
0
Then
2
4
5
0
5 + 41
1
0
1

0
0
=
13
0
1

3 + 0
1
0
0
1
0

0
.
0

0
0

0 = 0
1
0
0
0
0.
3. The characteristic equation is 2 3 10 = 0, with eigenvalues 2 and 5. Substituting the eigenvalues into
m = c0 + c1 generates
(2)m = c0 2c1
5m = c0 + 5c1 .
Solving the system gives
c0 =
1
[5(2)m + 2(5)m ],
7
c1 =
1
[(2)m + 5m ].
7
Thus
1
A
= c0 I + c1 A =
m m+1
7 [3(1) 2
2
m
7 [(2)
and

A3 =
11
38
+ 5m ]
+ 5m ]
3
m
m
7 [(2) + 5 ]
1
m
m
7 [(2) + 6(5) ]

57
.
106
4. The characteristic equation is 2 10 + 16 = 0, with eigenvalues 2 and 8. Substituting the eigenvalues into
2m = c0 + 2c1
8m = c0 + 8c1 .
c0 =
1 m+2
8m ),
(2
3
c1 =
342
1
(2m + 8m ).
6
Exercises 8.9
Thus
m
2 (2
1 m
2 (2
Am = c0 I + c1 A =
and
+ 8m )
8m )
1 m
2 (2
1 m
2 (2
8m )
+ 8m )

2040
.
2056
2056
A =
2040
4
5. The characteristic equation is 2 8 20 = 0, with eigenvalues 2 and 10. Substituting the eigenvalues into
(2)m = c0 2c1
10m = c0 + 10c1 .
c0 =
1
[5(2)m + 10m ],
6
c1 =
1
[(2)m + 10m ].
12
Thus
1
Am = c0 I + c1 A =
m
m m+1
]
6 [(2) + 2 5
1
m
m
3 [(2) + 10 ]
and
5
m
m
12 [(2) + 10 ]
1
m
m
6 [5(2) + 10 ]

41680
.
16640
83328
A =
33344
5
6. The characteristic equation is 2 + 4 + 3 = 0, with eigenvalues 3 and 1. Substituting the eigenvalues into
(3)m = c0 3c1
(1)m = c0 c1 .
c0 =
1
[(3)m + 3(1)m ],
2
c1 =
1
[(3)m + (1)m ].
2
Thus
= c0 I + c1 A =
and
(1)m
(3)m + (1)m
(3)m
1
A =
0
6

728
.
729
7. The characteristic equation is 3 + 22 + 2 = 0, with eigenvalues 1, 1, and 2. Substituting the eigenvalues

into m = c0 + c1 + c2 2 generates
(1)m = c0 c1 + c2
1 = c0 + c1 + c2
2m = c0 + 2c1 + 4c2 .
343
Exercises 8.9
1
[3 + (1)m 2m ],
3
1
c1 = [1 (1)m ],
2
1
c2 = [3 + (1)m + 2m+1 ].
6
c0 =
Thus
1 + 2m
Am = c0 I + c1 A + c2 A2 = 0
1
m
m+1
]
3 [(1) + 2
1
m
m
3 [(1) + 2 ]
0
and
A10
= 0
0
1023
683
341
1 + 2m
23 [(1)m 2m ]
1
m
3 [2(1)
+ 2m ]
1023
682 .
342
8. The characteristic equation is 3 2 + 2 + 2 = 0, with eigenvalues 1, 2 , and 2 . Substituting the

eigenvalues into m = c0 + c1 + c2 2 generates
(1)m = c0 c1 + c2
( 2 )m = c0 2c1 + 2c2
( 2 )m = c0 + 2c1 + 2c2 .
c0 = [2 ( 2 )m1 ( 2 )m2 ](1)m + ( 2 1)( 2 )m2 ,
1
c1 = [1 (1)m ]( 2 )m1 ,
2
1
1
c2 = (1)m+1 + (1 + 2 )(1)m ( 2 )m1 + ( 2 1)( 2 )m1 .
2
2
Thus Am = c0 I + c1 A + c2 A2 and
6
A = 7
0
0
8
0
7 .
8
9. The characteristic equation is 3 +32 +68 = 0, with eigenvalues 2, 1, and 4. Substituting the eigenvalues
into m = c0 + c1 + c2 2 generates
(2)m = c0 2c1 + 4c2
1 = c0 + c1 + c2
4
= c0 + 4c1 + 16c2 .

1
[8 + (1)m 2m+1 4m ],
9
1
c1 =
[4 5(2)m + 4m ],
18
1
c2 =
[2 + (2)m + 4m ].
18
c0 =
344
Exercises 8.9
Thus
1
Am = c0 I + c1 A + c2 A2 =
m
9 [(2)
+ (1)m 2m+1 + 3 22m+1 ]

23 [(2)m 4m ]
1
3 [3
and
+ (2)m + 22m+1 ]
A10
699392
= 698368
699391
1
m
m
3 [(2) + 4 ]
1
m m+1
+ 4m ]
3 [(1) 2
1
m
m
3 [(2) + 4 ]
0
1
0.
1
349184
350208
349184
10. The characteristic equation is 3 32 2 + 32 + 1 = 0, with eigenvalues 2, 12 , and 1. Substituting the

(2)m = c0 2c1 + 4c2
1 m
1
1
= c0 c1 + c2
2
2
4
1 = c0 + c1 + c2 .
1 m
[2 [(4)m + 8(1)m + 2m+1 (1)m 22m+1 ],
9
1
c1 = 2m [(4)m + 4(1)m 5 2m ],
9
2
c2 = [1 + (2)m (1)m 2m1 ].
9
c0 =
Thus
Am = c0 I + c1 A + c2 A2
m
[2(1)m + 2m ]
32

1 m
2
3 1 + 2
m
m
m
19 2m [7(4) 6(1) 3 2 + (1)m 22m+1 ]

and
43
128
85
A8 = 128
32725
128
85
256
171
256
85
256

1 m
1
3 [ 1 + 2

1 m
1
3 2 + 2

1 m
1
3 1 + 2
0
1
m
3 [(2)
+ (1)m 2m+1 ]
0 .
256
11. The characteristic equation is 2 8 + 16 = 0, with eigenvalues 4 and 4. Substituting the eigenvalues into
4m = c0 + 4c1
4m1 m = c1 .
c0 = 4m (m 1),
Thus
345
c1 = 4m1 m.
Exercises 8.9
= c0 I + c1 A =
and

A6 =
4m1 (3m + 4)
3 4m1 m
3 4m1 m
4m1 (3m + 4)

18432
.
14336
22528
18432
12. The characteristic equation is 3 2 + 21 + 45 = 0, with eigenvalues 3, 3, and 5. Substituting the

(3)m = c0 3c1 + 9c2
(3)m1 m = c1 6c2
5m = c0 + 5c1 + 25c2 .
1
[73(3)m 2(1)m 3m+2 + 9 5m 40(3)m m],
64
1
c1 =
[(1)m 3m+2 + 9 5m 8(3)m m],
96
1
c2 =
[(3)m + 5m 8(3)m1 m].
64
c0 =
Thus
Am = c0 I + c1 A + c2 A2
1
m
m
[31(3)
(1) 3m+1 + 4 5m ]
1
[(3)m
16
(1)m 3m+1 + 4 5m ]
1
[(3)m
16
(1)m 3m+1 + 4 5m ]
1
[7(3)m
8
(1)m 3m+1 + 4 5m ]
3
[(3)m
32
+ (1)m 3m+1 4 5m ]
3
[(3)m
16
+ (1)m 3m+1 4 5m ]
32
and
178
5
A = 842
1263
1
[(3)m
32
+ (1)m 3m+1 4 5m ]
1
[(3)m
16
+ (1)m 3m+1 4 5m ]
m
m m+2
m
1
[29(3)
(1)
3
+
12
5
]
32
421
842 .
1020
842
1441
2526
13. (a) The characteristic equation is 2 4 = ( 4) = 0, so 0 is an eigenvalue. Since the matrix satises the
characteristic equation, A2 = 4A, A3 = 4A2 = 42 A, A4 = 42 A2 = 43 A, and, in general,

4m
4m
m
m
.
A =4 A=
3(4)m 3(4)m
(b) The characteristic equation is 2 = 0, so 0 is an eigenvalue. Since the matrix satises the characteristic
equation, A2 = 0, A3 = AA2 = 0, and, in general, Am = 0.
(c) The characteristic equation is 3 + 52 6 = 0, with eigenvalues 0, 2, and 3. Substituting = 0 into
m = c0 + c1 + c2 2 we nd that c0 = 0. Using the nonzero eigenvalues, we nd
2m = 2c1 + 4c2
3m = 3c1 + 9c2 .
c1 =
1
[9(2)m 4(3)m ],
6
c2 =
346
1
[3(2)m + 2(3)m ].
6
Exercises 8.9
Thus Am = c1 A + c2 A2 and
2(3)m1
Am =
1
m
6 [9(2)
3m1
4(3)m ]
1
m
6 [9(2)
1
m
6 [3(2)
+ 8(3)m ]
14. (a) Let

Xn1 =
Then
Xn = AXn1
1
=
1

and A =
1
0
1
m
6 [3(2)
1
m
6 [3(2)
+ 4(3)m ]
yn1
2(3)m ]
1
m
6 [3(2)
xn1
3m1
xn1

=
yn1
1
0
2(3)m ]
.
+ 4(3)m ]

1
.
1
xn1 + yn1
xn1

.
(b) The characteristic equation of A is 2 1 = 0, with eigenvalues 1 = 12 (1 5 ) and 2 = 12 (1 + 5 ).

m
From m = c0 + c1 we get m
1 = c0 + c1 1 and 2 = c0 + c1 2 . Solving this system gives
m
m
m
c0 = (2 m
1 1 2 )/(2 1 ) and c1 = (2 1 )/(2 1 ).
Thus
Am = c0 I + c1 A

(1 + 5 )m+1 (1 5 )m+1
1
=
2(1 + 5 )m 2(1 5 )m
2m+1 5
(1 +

2(1 + 5 )m 2(1 5 )m
m
m .
5 )(1 5 ) (1 5 )(1 + 5 )
(c) From part (a), X2 = AX1 , X3 = AX2 = A2 X1 , X4 = AX3 = A3 X1 , and, in general, Xn = An1 X1 .
With

1
144 89
1
233
X1 =
we have X12 = A11 X1 =
=
,
1
89 55
1
144
so the number of adult pairs is 233. With

1
X1 =
we have
0
144
A X1 =
89
so the number of baby pairs is 144. With

2
X1 =
we have
1
144
A X1 =
89
11
11
89
55

1
144
=
,
0
89
89
55

2
377
=
,
1
233
so the total number of pairs is 377.

1
15. The characteristic equation of A is 2 5 + 10 = 0, so A2 5A + 10I = 0 and I = 10
A2 + 12 A. Multiplying
by A1 we nd

3 2
1
1
1 2 4
1 1 0
10
5
1
A = A+ I=
.
+
=
1
1
10
2
10 1
2 0 1
3
10 5
16. The characteristic equation of A is 3 +22 +2 = 0, so A3 +2A2 +A2I = 0 and I = 12 A3 +A2 + 12 A.

Multiplying by A1 we nd
3
2
1
1
A1 = A2 + A + I = 21
2
2
1
2
347
1
2
52
1
2
12 .
1
2
32
Exercises 8.9
17. (a) Since
1
A =
1
2
0
0
we see that
1
=
1
0
0
for all integers m 2. Thus A is not nilpotent.

(b) Since A2 = 0, the matrix is nilpotent with index 2.
(c) Since A3 = 0, the matrix is nilpotent with index 3.
(d) Since A2 = 0, the matrix is nilpotent with index 2.
(e) Since A4 = 0, the matrix is nilpotent with index 4.
(f ) Since A4 = 0, the matrix is nilpotent with index 4.
18. (a) If Am = 0 for some m, then (det A)m = det Am = det 0 = 0, and A is a singular matrix.
(b) By (1) of Section 8.8 we have AK = K, A2 K = AK = 2 K, A3 K = 2 AK = 3 K, and, in general,
Am K = m K. If A is nilpotent with index m, then Am = 0 and m = 0.
Exercises 8.10

0
0 4
0
0
0

1. (a)(b) 0 4
0 1 = 4 = 4 1 ; 1 = 4
4
0 15
0
0
0

0
0 4
4
4
4

0
4
0
0
=
0
=
(1)
0 ; 2 = 1
4
0 15
1
1
1
0
0 4
1
16
1
0 0 = 0 = 16 0 ; 3 = 16
0 4
4
0 15
4
64
4

4
1

(c) KT1 K2 = [ 0 1 0 ] 0 = 0; KT1 K3 = [ 0 1 0 ] 0 = 0; KT2 K3 = [ 4

1
4
1] 0 = 4 4 = 0
4
1 1 1
2
4
2
2. (a)(b) 1
1 1 1 = 2 = 2 1 ; 1 = 2
1 1
1
1
2
1
1 1 1
0
0
0
1 1 1 = 2 = 2 1 ; 2 = 2
1
1 1
1
1
2
1

1 1 1
1
1
1

1 1 1 = 1 = (1) 1 ; 3 = 1
1
1 1
1
1
1
1

0
1

T
T
(c) K1 K2 = [ 2 1 1 ] 1 = 1 1 = 0; K1 K3 = [ 2 1 1 ] 1 = 2 + 1 + 1 = 0
1
1
348
Exercises 8.10

1

KT2 K3 = [ 0 1 1 ] 1 = 1 1 = 0
1
2
2
13
0
2
9
2
2

5
0 22 = 9 2 = 18 22 ; 1 = 18
0 8
0
0
0
3. (a)(b) 13
0
5 13
5
13
0
0
5 13
5
13
0
3 82
3
3
0
3
3
3 83
3
0 3 =
3 = (8) 3 ; 2 = 8
3
8 3
3
8
6
0
6
0 66
8
36
(c) KT1 K2 = [
2
2
2
2
3
3
0 ] 33
3
3
KT2 K3
=[
3
3
3
3
8 6
6
86
8 6
3
6
6
3
6
3 ] 6
36
6
6
(8) 66
36
; 3 = 8
6
6
= 0; KT1 K3 = [
6
6
2
2
2
2
6
6
0 ] 66
36
12
12
=0
12
12
18
18
18
+
=0
18
18
9
2
0
2
4. (a)(b) 2 2 0 2 = 0 = 0 2 ; 1 = 0
2 0 4
1
0
1
3 2 2
1
3
1
2 2 0 2 = 6 = 3 2 ; 2 = 3
2 0 4
2
6
2

3 2 2
2
12
2

2 2 0 1 = 6 = 6 1 ; 3 = 6
2 0 4
2
12
2
T
(c) K1 K2 = [ 2 2 1 ] 2 = 2 + 4 2 = 0; KT1 K3 = [ 2
2

2

T
K2 K3 = [ 1 2 2 ] 1 = 2 + 2 4 = 0
3
2
5. Orthogonal. Columns form an orthonormal set.
6. Not orthogonal. Columns one and three are not unit vectors.
7. Orthogonal. Columns form an orthonormal set.
8. Not orthogonal. The matrix is singular.
349

2

1 ] 1 = 4 + 2 + 2 = 0
2
Exercises 8.10
9. Not orthogonal. Columns are not unit vectors.
10. Orthogonal. Columns form an orthogonal set.
1

1
1
2
11. 1 = 8, 2 = 10, K1 =
, K2 =
, P=
1
1
1

1 0
1
0
12. 1 = 7, 2 = 4, K1 =
, K2 =
, P=
0
1
0 1

3
3
1
10
13. 1 = 0, 2 = 10, K1 =
, K2 =
, P=
1
1
3
10
1
2
1
2
1
10
3
10
1+5

1+ 5
1 5
1
1
5
5
10+2 5
14. 1 = +
, K2 =
, P=
, 2 =
, K1 =
2
2
2
2
2
2
2
10+2 5
102 5
2
102 5
2 12 0
1
1
0
15. 1 = 0, 2 = 2, 3 = 1, K1 = 0 , K2 = 0 , K3 = 1 , P =
0 0 1
1
1
1
1
0
0
2
2
1
2
1
1
1
16. 1 = 1, 2 = 1 2 , 3 = 1 + 2 , K1 = 0 , K2 = 2 , K3 = 2 , P =
0
1
1
1
1

3
11
3
1
1

1
17. 1 = 11, 2 = 0, 3 = 6, K1 = 1 , K2 = 4 , K3 = 2 , P =
11
1
7
1
1
11
1
66
466
7
66
2
1
6
2
6
1
6
1
2
2
2
1
2
1
2
2
2
1
2

1
23 32
1
2
2
3
1
2
18. 1 = 18, 2 = 0, 3 = 9, K1 = 2 , K2 = 1 , K3 = 2 , P = 23
3
3
2
2
1
2
2
1
3
3
3
3

3
4
a
1 0
5
5
5
9
4
3
2
19. 4
+ a2 = 1 and 16
=
implies 25
25 + b = 1. These equations give a = 5 , b = 5 . But
a
b
0
1
b
5
+ ab = 0 indicates a and b must have opposite signs. Therefore choose a = 45 , b = 35 .
3

45
5
The matrix 4
is orthogonal.
3
12
25
20.
1
5
1
5
1
5
1
5
1
=
0

0
implies
1
1
5
+ b2 = 1 and a2 + 15 = 1. These equations give a = 25 , b = 25 .
a
b
But + = 0 indicates a and b must have opposite signs. Therefore choose a = 25 , b =
5
5
1

2
The matrix
5
2
21. (a) AK1 = 4

4
5
1
5
4
8
1
is orthogonal.
4
4
36
4
1 1 = 9 = 9 1 = 1 K1
8
1
9
1
350
2
2
Exercises 8.10
AK2 = 4
4
AK3 = 4
4
4
8
1
4
8
1

4
1
9
1

1 0 = 0 = 9 0 = 2 K2
8
4
36
4
4
1
9
1
1 4 = 36 = 9 4 = 3 K3
8
0
0
0
(b) For 2 = 3 = 9 we have
4 4
16
4
4
0 = 0
0
14
0
1
4
so that k1 = 14 k2 + 14 k3 . The choices k2 = 0, k3 = 4 and k2 = 4, k3 = 0 give the eigenvectors in part (a).

These eigenvectors are not orthogonal. However, by choosing k2 = k3 = 1 and k2 = 2, k3 = 2 we obtain,
respectively,

0

K2 = 1 ,
1
K3 = 2 .
2
Mutually orthogonal eigenvectors are
1,
1

0

1,
1
2 .
2
22. The eigenvalues and eigenvectors of A are
1 = 2 = 1,
3 = 4 = 3,
K1 =
,
0
K2 =
,
1
0
Since K1 = K2 = K3 = K4 =

0
0

K3 = ,
1
2 , an orthogonal matrix is
1
1
2
0
0
2
1
1
0
0
2
2
P=
.
0
0 12 12
0
1
2
1
2
23. Suppose A and B are orthogonal matrices. Then A1 = AT and B1 = BT and

(AB)1 = B1 A1 = BT AT = (AB)T .
Thus AB is an orthogonal matrix.
351

1
1

K4 = .
0
0
Exercises 8.11
Exercises 8.11

1
1. Taking X0 =
and computing Xi = AXi1 for i = 1, 2, 3, 4 we obtain
1

2
4
8
16
X1 =
, X2 =
, X3 =
, X4 =
.
2
4
8
16

1
AK K
4
We conclude that a dominant eigenvector is K =
with corresponding eigenvalue =
= = 2.
KK
2
1

1
2. Taking X0 =
and computing Xi = AXi1 for i = 1, 2, 3, 4, 5 we obtain
1

5
49
437
3937
35429
X1 =
, X2 =
, X3 =
, X4 =
, X5 =
.
7
47
439
3935
35431

35429
0.99994
1
with corresponding eigen35439

35431
1
AK K
value =
= 8.9998.
KK

1
6
6
0.375
1
3. Taking X0 =
and computing AX0 =
, we dene X1 =
=
. Continuing in this
16 16
1
16
1
manner we obtain

0.3363
X2 =
,
1

0.3335
0.3333
X3 =
, X4 =
.
1
1

0.3333
with corresponding eigenvalue = 14.
1

1
1
0.2
1 1
4. Taking X0 =
and computing AX0 =
, we dene X1 =
=
. Continuing in this manner we
5 5
1
5
1
obtain

0.2727
0.2676
0.2680
0.2679
X2 =
, X3 =
, X4 =
, X5 =
.
1
1
1
1

0.2679
with corresponding eigenvalue = 6.4641.
1

1
11
11
1
1

5. Taking X0 = 1 and computing AX0 = 11 , we dene X1 =

11 = 1 . Continuing in this
11
1
6
6
0.5455
manner we obtain
X2 =
1
1
X3 =
0.5045
1
1
0.5005
X4 = 1 .
0.5
We conclude that a dominant eigenvector is K = 1 with corresponding eigenvalue = 10.

0.5
352
Exercises 8.11

1
5
5
1
1

6. Taking X0 = 1 and computing AX0 = 2 , we dene X1 = 2 = 0.4 . Continuing in this manner

5
1
2
2
0.4
we obtain
1
1
1
1
X2 = 0.2105 , X3 = 0.1231 , X4 = 0.0758 , X5 = 0.0481 .

0.2105
0.1231
0.0758
0.0481

1
1

At this point if we restart with X0 = 0 we see that K = 0 is a dominant eigenvector with corresponding
0
0
eigenvalue = 3.

1
7. Taking X0 =
and using scaling we obtain
1

0.625
0.5345
0.5098
0.5028
0.5008
X1 =
, X2 =
, X3 =
, X4 =
, X5 =
.
1
1
1
1
1

0.5
Taking K =
as the dominant eigenvector we nd 1 = 7. Now the normalized eigenvector is
1

0.4472
1.6 0.8
1
1
K1 =
and B =
. Taking X0 =
and using scaling again we obtain X1 =
,
0.8944
0.8
0.4
1
0.5

1
1
. Taking K =
we nd 2 = 2. The eigenvalues are 7 and 2.
0.5
0.5

1
0.3333
0.3333
1/3
8. Taking X0 =
and using scaling we obtain X1 =
, X2 =
. Taking K =
as the
1
1
1
1
X2 =

dominant eigenvector we nd 1 = 10. Now the normalized eigenvector is K1 =

0.3162
0
and B =
0.9486
0

0
.An
0
eigenvector for the zero matrix is 2 = 0. The eigenvalues are 10 and 0.

1

9. Taking X0 = 1 and using scaling we obtain
1

1
1
1
1
1

X1 = 0 , X2 = 0.6667 , X3 = 0.9091 , X4 = 0.9767 , X5 = 0.9942 .

1
1
1
1
1
Taking K = 1 as the dominant eigenvector we nd 1 = 4. Now the normalized eigenvector is

1
0.5774
1.6667
K1 = 0.5774 and B = 0.3333

0.5774
1.3333
0.3333
0.6667
0.3333

1.3333
1

0.3333 . If X0 = 1 is now chosen only one more
1.6667
1
353
Exercises 8.11

1

eigenvalue is found. Thus, try X0 = 1 . Using scaling we obtain
0
1
1
1
1
1
X1 = 0.5 , X2 = 0.2 , X3 = 0.0714 , X4 = 0.0244 , X5 = 0.0082 .

0.5
0.8
0.9286
0.9756
0.9918
Taking K = 0 as the eigenvector we nd 2 = 3. The normalized eigenvector in this case is

1

0.7071
0.1667 0.3333 0.1667
1

K2 =
0
and
C
=
0.3333
0.6667
0.3333
.
If
X
=
1 is chosen, and scaling is used we

0
0.7071
0.1667 0.3333 0.1667
1
0.5
0.5
0.5
obtain X1 = 1 , X2 = 1 . Taking K = 1 we nd 3 = 1. The eigenvalues are 4, 3, and 1.

0.5
0.5
0.5

1

The diculty in choosing X0 = 1 to nd the second eigenvector results from the fact that this vector is a
1
linear combination of the eigenvectors corresponding to the other two eigenvalues, with 0 contribution from the
second eigenvector. When this occurs the development of the power method, shown in the text, breaks down.

1

10. Taking X0 = 1 and using scaling we obtain
1
0.3636
0.2431
0.2504
0.2499
X1 = 0.3636 , X2 = 0.0884 , X3 = 0.0221 , X4 = 0.0055 .

1
1
1
1
0.25
Taking K = 0 as the dominant eigenvector we nd 1 = 16. The normalized eigenvector is

1
0.2425
0.9412
0 0.2353
1

K1 =
0
and
B
=
0
4
0
.
Taking
X
=
1 and using scaling we obtain

0
0.9701
0.2353
0 0.0588
1
0.2941
0.0735
0.0184
0.0046
X1 = 1 , X2 = 1 , X3 = 1 , X4 = 1 .
0.0735
0.0184
0.0046
0.0011

0
0

Taking K = 1 as the eigenvector we nd 2 = 4. The normalized eigenvector in this case is K2 = K = 1
0
0
0.9412 0 0.2353
1
1
and C =
0
0
0
. Taking X0 = 1 and using scaling we obtain X1 = 0 ,
0.2353 0 0.0588
1
0.25
354
Exercises 8.11
1
1
X2 = 0 . Using K = 0 we nd 3 = 1. The eigenvalues are 16, 4, and 1.

0.25
0.25

4 1
1
11. The inverse matrix is
. Taking X0 =
3
1
1

1
1
1
1
X1 =
, X2 =
, X3 =
, X4 =
.
0.6667
0.7857
0.7910
0.7913

1
1 1
Using K =
we nd = 4.7913. The minimum eigenvalue of
is 1/4.7913 0.2087.
0.7913
3 4

1 3
1
12. The inverse matrix is
. Taking X0 =
4 2
1

0.6667
0.7857
0.75
X1 =
, X2 =
, . . . , X10 =
.
1
1
1

0.75
0.2
0.3
Using K =
we nd = 5. The minimum eigenvalue of
is 1/5 = 0.2
1
0.4 0.1
13. (a) Replacing the second derivative with the dierence expression we obtain
EI
yi+1 2yi + yi1

+ P yi = 0
h2
or EI(yi+1 2yi + yi1 ) + P h2 yi = 0.
(b) Expanding the dierence equation for i = 1, 2, 3 and using h = L/4, y0 = 0, and y4 = 0 we obtain
EI(y2 2y1 + y0 ) +
P L2
y1 = 0
16
EI(y3 2y2 + y1 ) +
P L2
y2 = 0
16
EI(y4 2y3 + y2 ) +
P L2
y3 = 0
16
1
0
1
2
1
or
2y1 y2 =
P L2
y1
16EI
y1 + 2y2 y3 =
P L2
y2
16EI
y2 + 2y3 =
P L2
y3 .
16EI

0
y1
y1
P L2

1 y2 =
y2 .
16EI
2
y3
y3
0.5 0.25
(c) A1
1
0.5
0.5 0.75

1

(d) Taking X0 = 1 and using scaling we obtain
1
0.75
0.7143
0.7083
0.7073
0.7071
X1 = 1 , X2 = 1 , X 3 = 1 , X 4 = 1 , X5 = 1 .
0.75
0.7143
0.7083
0.7073
0.7071
0.7071
Using K = 1 we nd = 1.7071. Then 1/ = 0.5859 is the minimum eigenvalue of A.

0.7071
0.75
= 0.5
0.25
355
Exercises 8.11
(e) Solving
P L2
EI
= 0.5859 for P we obtain P = 9.3726 2 . In Example 3 of Section 3.9 we saw
16EI
L
P = 2
EI
EI
9.8696 2 .
2
L
L
14. (a) The dierence equation is

EIi (yi+1 2yi + yi1 ) + P h2 yi = 0, i = 1, 2, 3,
where I0 = 0.00200, I1 = 0.00175, I2 = 0.00150, I3 = 0.00125, and I4 = 0.00100. The system of equations
is
P L2
y1 = 0
16
P L2
0.00150E(y3 2y2 + y1 ) +
y2 = 0
16
P L2
0.00125E(y4 2y3 + y2 ) +
y2 = 0
16
P L2
y1
16E
P L2
y2
0.0015y1 + 0.003y2 0.0015y3 =
16E
P L2
0.00125y2 + 0.0025y3 =
y3 .
16E
0.00175E(y2 2y1 + y0 ) +
0.0035y1 0.00175y2 =
or
0.0035 0.00175
0.003
0.0015
0 0.00125
(b) The inverse of A is
y1
y1
PL
0.0015 y2 =
y2 .
16E
0.0025
y3
y3
A1
428.571
= 285.714
142.857
333.333
666.667
333.333

1

Taking X0 = 1 and using scaling we obtain
1
0.7113
0.6710
0.6645
X1 = 1 , X2 = 1 , X 3 = 1 ,
0.7958
0.7679
0.7635
200
400 .
600
0.6634
X4 = 1 ,
0.7628
0.6632
X5 = 1 .
0.7627
This yields the eigenvalue = 1161.23. The smallest eigenvalue of A is then 1/ = 0.0008612. The lowest
critical load is
16E
E
P =
(0.0008612) 0.01378 2 .
L2
L
15. (a) A10
(b) X10
67,745,349 43,691,832
8,258,598
= 43,691,832
28,182,816 5,328,720
8,258,598 5,328,720
1,008,180

1
67,745,349
1

= A10 0 = 43,691,832 67,745,349 0.644942

0
8,258,598
0.121906
356
Exercises 8.12
X12
1
2,680,201,629
1

= A12 0 = 1,728,645,624 2,680,201,629 0.644968 .

0
326,775,222
0.121922
The vectors appear to be approaching scalar multiples of K = (1, 0.644968, 0.121922), which approximates
the dominant eigenvector.
(c) The dominant eigenvalue is 1 = (AK K)/(K K) = 6.28995.
Exercises 8.12
1. Distinct eigenvalues 1 = 1, 2 = 5 imply A is diagonalizable.

3 1
1
P=
, D=
1 1
0

5 1
0
P=
, D=
4
2
0
0
5
0
6

1
3. For 1 = 2 = 1 we obtain the single eigenvector K1 =
. Hence A is not diagonalizable.
1
4. Distinct eigenvalues 1 = 5 , 2 = 5 imply A is diagonalizable.

5 5
5
0
P=
, D=
1
1
0 5

13 1
7
P=
, D=
2 1
0
0
4

3
1
4
P=
, D=
1 5
0
0
10
7. Distinct eigenvalues 1 =
1
2
, 2 =
imply A is diagonalizable.
3
3

1
1 1
P=
, D= 3
1 1
0
2
3

1
8. For 1 = 2 = 3 we obtain the single eigenvector K1 =
. Hence A is not diagonalizable.
1
9. Distinct eigenvalues 1 = i, 2 = i imply A is diagonalizable.

1 1
i 0
P=
, D=
i i
0 i
10. Distinct eigenvalues 1 = 1 + i, 2 = 1 i imply A is diagonalizable.

2
2
1+i
0
P=
, D=
i i
0
1i
357
Exercises 8.12
11. Distinct eigenvalues 1 = 1, 2 = 1, 3 = 2 imply A is diagonalizable.
1 0 1
1
0 0
P = 0 1 1 , D = 0 1 0
0 0 1
0
0 2
1 2
0
3 0 0
P = 0 2
1, D = 0 4 0
1 1 1
0 0 5
1 1 1
0 0 0
P = 0 1 0, D = 0 1 0
1 1 1
0 0 2
14. Distinct eigenvalues 1 = 1, 2 = 3i, 3 = 3i imply A is diagonalizable.
0 3i 3i
1
0 0
P = 0
1 1 , D = 0 3i 0
1
0 0
0
0 3i

1

15. The eigenvalues are 1 = 2 = 1, 3 = 2. For 1 = 2 = 1 we obtain the single eigenvector K1 = 0 .
0
Hence A is not diagonalizable.
16. Distinct eigenvalues 1 = 1, 2 = 2, 3 = 3 imply
1 1
P = 0 1
0 0
A is diagonalizable.
0
1 0 0
0, D = 0 2 0
1
0 0 3
17. Distinct eigenvalues 1 = 1, 2 = 5 , 3 = 5 imply A is diagonalizable.

1 0
0
0 1+ 5 1 5
2
2 , D = 0
P = 0
5
0
1
0
0
0 0 5
18. For 1 = 2 = 3 = 1 we obtain the single eigenvector K1 = 2 . Hence A is not diagonalizable.

1
19. For the eigenvalues 1 = 2 = 2, 3 = 1, 4 = 1
is diagonalizable and
3 1 1
0
1
0
P=
3
0
0
1
0
1
we obtain four linearly independent eigenvectors. Hence A
1
0
,
1
0
358
2
0
D=
0
0
0
2
0
0
0
0
1
0
0
0
.
0
1
Exercises 8.12

1
0

20. The eigenvalues are 1 = 2 = 2, 3 = 4 = 3. For 3 = 4 = 3 we obtain the single eigenvector K1 = .
1
0
Hence A is not diagonalizable.
1

1
1
2
21. 1 = 0, 2 = 2, K1 =
, K2 =
, P=
1
1
1
1

1
2
5
22. 1 = 1, 2 = 4, K1 =
, K2 =
, P=
2
1
2

10
10
23. 1 = 3, 2 = 10, K1 =
, K2 =
, P
2
5
0
, D=
0

2
5
1
5
5
10
14
=
2
14
1

1
1
2
24. 1 = 1, 2 = 3, K1 =
, K2 =
, P=
1
1
1
1
2
1
2
1
2
1
0
2
1
, D=
0
10
35
15
35

, D=
1
0

1
2
1
1
0

1
25. 1 = 1, 2 = 3 = 1, K1 = 1 , K2 = 1 , K3 = 0 , P =
2
0
0
1
0
26.
27.
28.
29.
30.

, D=
0
4
0
3
10
1
2
1
2
0 , D = 0
0
1
1
0
0
1
0
1
2 12
1
1
1
3
1 = 2 = 1, 3 = 5, K1 = 0 , K2 = 1 , K3 = 1 , P =
0 12 13 ,
1
0
1
1
1
0
2
3
1
0 0
D = 0 1 0
0
0 5
2
2
1
3 0
2
2
1
3
3
3
1 = 3, 2 = 6, 3 = 9, K1 = 2 , K2 = 1 , K3 = 2 , P = 32 13 23 , D = 0 6
1
2
0 0
1
2
2
23
3
3

0
1 2
1+ 2
1 = 1, 2 = 2 2 , 3 = 2 + 2 , K1 = 1 , K2 = 0 , K3 = 0 ,
1
1
0

2
2+ 2
0 2
1
0
0
2
2
, D =
P=
0
2
2
2
0
1
0
0
2+ 2
2 2
0
0
2+ 2
0
2
2

1
1
0
0
1
1
1
0
2
2

1 = 1, 2 = 6, 3 = 8, K1 = 1 , K2 = 0 , K3 = 0 , P = 1
0 0 , D = 0 6
1
0
1
1
0
0
0 2 12

1
0
1
1
0
1
1
1

1 = 2 = 0, 3 = 2, 4 = 2, K1 =
, K2 =
, K3 =
, K4 =
1
0
1
1
0
359
0
1
0
9
0
8
Exercises 8.12
P=
12
0
1
2
0
12
1
2
1
2
12
1
2
12
1
0
2
, D=
1
0
2
0
1
1
2
0
0
0
0
0
0
2
0
0
0
0
2

5 1
x
31. The given equation can be written as X AX = 24: [ x y ]
= 24. Using
1
5
y

1
1
1
1
2
2
1 = 6, 2 = 4, K1 =
and X = PX we nd
, K2 =
, P=
1
1
12 12

6 0
X
[X Y ]
= 24 or 6X 2 + 4Y 2 = 24.
0 4
Y
T
The conic section is an ellipse. Now from X = PT X we see that the XY -coordinates of (1, 1) and (1, 1)
are ( 2 , 0) and (0, 2 ), respectively. From this we conclude that the X-axis and Y -axis are as shown in the
accompanying gure.

13 5
x
32. The given equation can be written as XT AX = 288: [ x y ]
= 288. Using
5
13
y

1
12
1
1
2
1 = 8, 2 = 18, K1 =
and X = PX we nd
, K2 =
, P=
1
1
1
1
2
2

8 0
X
[X Y ]
= 288 or 8X 2 + 18Y 2 = 288.
0 18
Y
The conic section is an ellipse. Now from X = PT X we see that the XY -coordinates of (1, 1) and (1, 1) are
( 2 , 0) and (0, 2 ), respectively. From this we conclude that the X-axis and Y -axis are as shown in the
accompanying gure.

3 4
x
T
33. The given equation can be written as X AX = 20: [ x y ]
= 20. Using
4 3
y

1
25
1
2
5
1 = 5, 2 = 5, K1 =
and X = PX we nd
, K2 =
, P=
2
1
2
1
5
5

5
0
X
[X Y ]
= 20 or 5X 2 5Y 2 = 20.
0 5
Y
The conic section is a hyperbola. Now from X = PT X we see that the XY -coordinates of (1, 2) and (2, 1)
are ( 5 , 0) and (0, 5 ), respectively. From this we conclude that the X-axis and Y -axis are as shown in the
accompanying gure.
34. The given equation can be written as XT AX = 288:

16 12
x
x
[x y]
+ [ 3 4 ]
= 0.
12 9
y
y

4

3
4
3
5
5
Using 1 = 25, 2 = 0, K1 =
and X = PX we nd
, K2 =
, P= 3
4
3
4
5
5

25 0
X
X
[X Y ]
+ [0 5]
= 0 or 25X 2 + 5Y = 0.
0 0
Y
Y
360
Exercises 8.13
The conic section is a parabola. Now from X = PT X we see that the XY -coordinates of (4, 3) and (3, 4)
are (5, 0) and (0, 5), respectively. From this we conclude that the X-axis and Y -axis are as shown in the
accompanying gure.
35. Since D = P1 AP we have A = PDP1 . Hence

1 1
2 0
1
A=
2 1
0 3
2
36. Since eigenvectors are mutually orthogonal we
1
1
1
1
3
2
6
1
2
A = 3
0
0
6
1
1
1
0
1
1

=

.
use an orthogonal matrix P and A = PDPT .

1
8 4
1
13
13
0 0
3
3
3
3

4
3 0 12
0 12 = 34 11
3
3
1
4
8
2
1
1
0 5
37. Since D = P1 AP we have

A = PDP1
A2 = PDP1 PDP1 = PDDP1 = PD2 P1
A3 = A2 A = PD2 P1 PDP1 = PD2 DP1 = PD3 P1
and so on.
4
2
0
0
0 34
0
38.
0 0 (1)4
16 0 0
0
0
0
0
0 81 0
0 0 0 1 0
0
0 0 625
0 0
0
(5)4
2

1
1
1 1
3
1
39. 1 = 2, 2 = 1, K1 =
, K2 =
, P=
, P =
1
2
1
2
13

2 1
21 11
1 1
32
0
3
3
5
A =
=
22 10
1
2
0 1
13 31

5
2
5 2
1
2
1
40. 1 = 0, 2 = 1, K1 =
, K2 =
, P=
, P =
3
1
3 1
3 5

5
2
0
0
1
2
6
10
A10 =
=
3 1
0 1
3 5
3
5
1
3
1
3
Exercises 8.13

19 5 14 4 0
1. (a) The message is M =
. The encoded message is
8 5 12 16 0

1 2
19 5 14 4 0
35 15
B = AM =
=
1 1
8 5 12 16 0
27 10
38
26
36
20

0
.
0
(b) The decoded message is

M = A1 B =
1
2
1 1
35
27
15
10
38
26
361
36
20

0
19
=
0
8
5
5
14
12
4
16

0
.
0
Exercises 8.13

3
B = AM =
1
5
2
20 8 5 0
0 9 19 0
20
0
8
9

14 5 25
18 5 0

14 5 25
60 69 110 0 79 70 132
=
18 5 0
20 26 43 0 29 25 50
13
8
5 0 13
19 0 8
15
5
15
5

40 75
.
15 25

M = A1 B =

=

2
1
5
3
20
0
8
9
16
15
8
15
B = AM =
60
20
69
26
110
43
0
0
13
8
15
5
5
19
14
40 75
15 25

13 5

5
16 8
15
14
15
13
0 79 70 132
0 29 25 50

14 5 25
.
18 5 0

=
48
64
120
107
40
32
40
75
67
25

.

M = A1 B =

3
5
48
=
2 3
32
15
14
15
64
40
120
75
18
20
4. (a) The message is M = 8 0 15 14 0 13 1

9 14 0 19 20 0
0
1 2 3
7 15 0 14 15
B = AM = 1 1 2 8 0 15 14 0
0
14
0
1 1
50
1
M = A B = 2 2 1 33
1
1
1
26
107
67

40
16
=
25
0
8
8
15
15
14
13

5
.
5
18
13
20 0

20
50

1 = 33
0
26
30
99
75
44
19
43
28
15
15
66
52
55
40
31
13
21 .
1
57
43
28

30 99 75 44 22
7

15 66 55 31 21 = 8
15 52 40 13 1
9
15
0
14
0
15
0
14
14
19
15
0
20
18
13
0
7 15 0 14 15 18 20
5. (a) The message is M = 8 0 15 14 0 13 1 . The encoded message is

9 14 0 19 20 0
0

2 1 1
7 15 0 14 15 18 20
31
44 15 61

B = AM = 1 1 1 8 0 15 14 0 13 1 = 24
29 15 47
1 1 0
9 14 0 19 20 0
0
1 15 15 0
22
57
20
1 .
0
1 1
0
31
1
M = A B = 1 1
1 24
2
3 1
1
44
29
15
15
15
15
61
47
0
50
35
15
362
49
31
5

41
7

21 = 8
19
9
15
0
14
50
35
15
0
15
0
14
14
19
49
31
5
15
0
20
41
21 .
19
18
13
0
20
1 .
0
Exercises 8.13
4 18 0 10 15 8
6. (a) The message is M = 14 0 9 19 0 20 . The encoded message

8
5 0 19 16 25

5 3
0
4 18 0 10 15 8
62 90

B = AM = 4 3 1 14 0 9 19 0 20 = 50 67
5 2
2
8 5 0 19 16 25
64 100
8 6
1
M = A B = 13 10
7
5
7. (a) The decoded message is
M=A
3
62
5 50
3
64
2 3
B=
5
8
90 27 107 75
67 27 78
44
100 18 126 107
is

100
4

67 = 14
130
8

184 171 86 212
19
=
116 107 56 133
0
152
95
100
67 .
130
27 107 75
27 78
44
18 126 107
20
8
18 0 10
0 9 19
5 0 19
21
1
15
0
16
20 .
25

4 25
.
18 4
From correspondence (1) we obtain: STUDY HARD.

8. The decoded message is

1 1
46 7
1
M=A B=
1 2
23 15
13
14
22
2

10
23
=
5
0
18
1
18 12
8
23
1
15
20
18

13 5
.
25 0
0
18
From correspondence (1) we obtain: WHAT ME WORRY .

1
M = A B = 0
1
0
1
31
1
0 19
0 1
13
21
0
21
9
22 20
13 16

9
13

15 = 19
20
18
20
0
20
9
1
13
14
16
20
15 .
0
From correspondence (1) we obtain: MATH IS IMPORTANT.

1
0 1
36 32
28 61
1
M = A B = 1
1
2 9 2 18 1
0 1
0
23 27
23 41
13 5
5 20 0 13 5 0
= 1 20 0 20 8
5 0 12 .
9 2 18 1 18 25 0 0
26
18
26
From correspondence (1) we obtain: MEET ME AT THE LIBRARY .

u v
1
11. Let A =
. Then
x y

u v
17
16
18
5
34 0
34
20
1
A B=
x y
30 31 32 10 59 0 54 35
12
0
12
56 10
25 0
43 5
25
,
13 6 50

2
1
so 17u 30v = 4, 16u 31v = 1 and 5x 6y = 1, 25x 50y = 25. Then A1 =
and
1 1

4 1
4 0 9 0 14 5 5 4 0
A1 B
.
13 15 14 5 25 0 20 15 4 1 25
363
Exercises 8.13
From correspondence
22 8
12. (a) MT = 13 3
2 27
T
(b) B = M = 1
1
(1) we obtain: DAD I NEED MONEY TODAY.
19 27 21 3 3 27 21 18 21
21 22 3 25 27 6 7 14 23
21 7 27 5 21 17 2 25 7

1
0
37

0
1 = 24
1 1
11
(c) BA1
38
35
24
61
40
0
56
34
15
51 33 51
48 8 24
24 20 6
50 30
44 23
11 5
57 51
43 28
11 16
1
1
1 1 = M
0 1
= B 2
1
15 22 20 8 23 6 21 22
13. (a) B = 10 22 18 23 25 2 23 25
3 26 26 14 23 16 26 12
(b) Using correspondence (1) the encoded message is: OVTHWFUVJVRWYBWYCZZNWPZL.
1
4 3
46
32
14
58
(c) M A1 B = 2
3 2 B = 54
58
42
57
2 4
3
61 54 34 66
19 5 14 4
0 20 8 5
M = M mod 27 = 0 4 15 3 21 13 5 14 .
20 0 20 15 4 1 25 0
54
75
77
34
14
28
35
59
56
86
95
108
Using correspondence (1) the encoded message is: SEND THE DOCUMENT TODAY.
Exercises 8.14
1. [ 0
1 1
0]
3. [ 0
0 0
1]
5. [ 1
0 1
7. [ 1
0]
9. Parity error
11. [ 1
0 0
1]
1]
2. [ 1
1]
4. [ 1
0]
6. [ 0
8. [ 0
1]
10. [ 1
0]
12. Parity error
364
0]
Exercises 8.14
In Problems 13-18 D = [ c1
13. DT = P [ 1
14. DT = P [ 0
15. D = P [ 0
16. DT = P [ 0
17. D = P [ 0
18. DT = P [ 1
1] = [1
1] = [0
1] = [1
1 .
1
0] ; C = [0
0]
1]
1]
1]
0]
0]
0] ; C = [0
0] = [1
1] ; C = [1
0
1
1
0] ; C = [1
0] = [0
c2
1
0
1
c3 ] and P = 1
0
0] = [0
0] ; C = [1
1] ; C = [0
In Problems 19-28 W represents the correctly decoded message.

19. S = HRT = H [ 0
0] = [0
0] ;
a code word. W = [ 0
0]
20. S = HR
= H[1
W = [1 0 0 0]
0] = [0
1 ] ; not a code word. The error is in the third bit.
21. S = HRT = H [ 1
W = [0 0 0 1]
1] = [1
1] ;
22. S = HRT = H [ 0
23. S = HR = H [ 1
24. S = HR = H [ 1
0] = [0
1] = [0
0]
1]
0]
0] ;
0] ;
T
not a code word. The error is in the second bit.
0] ;
not a code word. The error is in the seventh bit.
25. S = HRT = H [ 0
W = [1 0 0 1]
1] = [0
0] ;
26. S = HRT = H [ 1
W = [0 0 0 1]
1] = [0
27. S = HRT = H [ 1 0
W = [1 0 1 0]
1] = [1
1] ;
28. S = HRT = H [ 0
W = [1 0 1 1]
1] = [0
0] ;
not a code word. The error is in the fth bit.
0] ;
0] = [0
29. (a) 27 = 128

(b) 24 = 16
(c) [ 0
0 ], [ 1
1 ], [ 0
0 ], [ 1
1 ],
[1
0 ], [ 0
1 ], [ 1
0 ], [ 0
1 ],
[1
0 ], [ 0
1 ], [ 1
0 ], [ 0
1 ],
[0
0 ], [ 1
1 ], [ 0
0 ], [ 1
1]
30. (a) c4 = 0, c3
0
0
(b) H =
0
1
= 1, c2 = 1, c1 = 0; [ 0 1 1 0 0 1 1 0 ]
0 0 0 1 1 1 1
0 1 1 0 0 1 1
(c) S = HRT = H [ 0
1 0 1 0 1 0 1
1
365
0] = [0
0]
Exercises 8.15
Exercises 8.15
1. We have
Y = [1

AT A =
Now
54
14
2
14
4
2]

and
(AT A)1 =
2
T
so X = (A A)
5
3
5
A Y=
14
A A=
6
13
so X = (AT A)1 AT Y =
3. We have

4
1
20 14
14
54
Now

5
.
1
3
1
and the least squares line is y = 0.4x + 0.6.
YT = [ 1
2. We have
4
1
2
and A =
1
T
25
3
6
4
7]
and AT =

and
(A A)
0
1
1
1

4
1
=
20 6

3
.
1
2
1
6
14
and the least squares line is y = 2.6x 0.4.

YT = [ 1 1.5
4.5
5]
and AT =
1 2
1 1
3
1
4
1

5
.
1

5 15
55 15
1
Now
A A=
and (AT A)1 =
50
15
55
15 5

1.1
0.3

0 2 3 4 5
T
T
4. We have
Y = [ 0 1.5 3 4.5 5 ] and A =
.
1 1 1 1 1

5 14
54 14
1
Now
AT A =
and (AT A)1 =
74 14
54
14 5

1.06757
0.189189

0 1 2 3 4 5 6
5. We have
YT = [ 2 3 5 5 9 8 10 ] and AT =
.
1 1 1 1 1 1 1

91 21
7 21
1
T
T
1
Now
A A=
and (A A) =
196 21
21 7
91
19
T
6. We have
14
27
14
YT = [ 2 2.5

1
1.5
3.2
5]
and AT =
1 2
1 1
3
1
4
1
5
1
6
1

7
.
1

140 28
7 28
1
T
1
Now
A A=
and (A A) =
196 28 140
28 7

0.407143
0.828571
T
366
Exercises 8.16

7. We have
YT = [ 220
200
180
170
150
and AT =
135 ]
20
1
40
1
60
1
80
1
100
1

120
.
1

36400 420
6 420
1
T
1
Now
A A=
and (A A) =
42000
420
6
420 36400
117
140
and the least squares line is v = 0.835714T + 234.333. At T = 140,
703
T
v 117.333 and at T = 160, v 100.619.

8. We have YT = [ 0.47
0.90
2.0
3.7
7.5
15 ]
and AT =
400
1
450
1
500
1
550
1
600
1

650
.
1

1697500 3150
6
3150
1
T
1
Now
A A=
and (A A) =
262500 3150 1697500
3150
6

0.0538
and the least squares line is R = 0.0538T 23.3167. At T = 700,
23.3167
R 14.3433.
T
Exercises 8.16
In Problems 1-5 we use the fact that the element ij in the transfer matrix T is the rate of transfer from compartment
j to compartment i, and the fact that the sum of each column in T is 1.
1. (a) The initial state and the transfer matrix are

90
0.8
X0 =
and T =
60
0.2

0.4
.
0.6
(b) We have

X1 = TX0 =
and

X2 = TX1 =

90
96
=
60
54

0.4
96
98.4
=
.
0.6
54
51.6
0.8
0.2
0.4
0.6
0.8
0.2
X
= (T I)X
= 0 and the fact that the system is closed we obtain
(c) From TX
0.2x1 + 0.4x2 = 0
x1 +
x2 = 150.

100
The solution is x1 = 100, x2 = 50, so the equilibrium state is X =

.
50
100
0.7 0
X0 = 200 and T = 0.3 0.8

150
0 0.2
367
0.5
0 .
0.5
Exercises 8.16
(b) We have
145
X1 = TX0 = 190
115
159
and X2 = TX1 = 195.5 .

95.5
X
= (T I)X
(c) From TX
0.8x1 + 0.5x2
=0
0.3x1 0.9x2
=0
x1 +
x2 + x3 = 450.
145.161
=
The solution is x1 = 145.161, x2 = 217.742, x3 = 87.0968, so the equilibrium state is X
217.742 .
87.097
100
0.2
X0 = 0 and T = 0.3
0
0.5
(b) We have
20

X1 = TX0 = 30
50
0.5
0.1
0.
0.4
19

and X2 = TX1 = 9 .
72
X
= (T I)X
(c) From TX
0.8x1 + 0.5x2
=0
0.3x1 0.9x2
=0
x1 +
x2 + x3 = 100.
=
The solution is x1 = x2 = 0, x3 = 100, so the equilibrium state is X
0 .
100
4. (a) The transfer matrix is
0.7
T = 0.3
0
(b)
0.05
0.75
0.2
Year
Bare Space
Grasses
Small Shrubs
10.00
0.00
0.00
1
2
7.00
5.05
3.00
4.35
0.00
0.60
3.84
4.78
1.38
4
5
3.14
2.75
4.74
4.49
2.13
2.76
2.56
4.19
3.24
368
0.15
0 .
0.85
Chapter 8 Review Exercises

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.
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

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
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

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

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

52. The encoded message is
B = AM =

=
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.

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 ].

Matrices Exercises 8.1

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Matrices Exercises 8.1

Caricato da

Copyright:

Formati disponibili

8

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

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

(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)

36. Using Problem 33 we have (AAT )T

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

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

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

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

The solution is x1 = 8, x2 = 10.

Since the bottom row implies 0 = 1, the system

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

21. 0.2 0.1 0.5 1.978 0 1 2.333

22. 1.35 0.95

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

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

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

8x1 + 4x2 = 8x3 ,

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

32. Multiply row 3 by c in I3 .

34. Add row 4 to row 1 in I4 .

39. The system is equivalent to

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

and 2x1 2x2 = 2x1

40. The system is equivalent to

This implies y1 = 1 and 23 y1 + y2 =

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

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

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

rank of the matrix is 3 and

there are 3 vectors, the vectors are linearly independent.

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

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

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

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

4. Theorem 8.12 and 8.11

5. Theorem 8.12 (twice)

6. Theorem 8.11 (twice)

8. Theorem 8.12 and 8.9

10. Theorem 8.11 (twice)

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

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

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

the second row.

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

Row reduction: 253 /3 5.2(103 )

(b) Cofactors: about 90 billion centuries;

Row reduction: about

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

In matrix form this becomes

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

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

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

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

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

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