Answers To Odd-Numbered Exercises: Appendix

i
main
2007/2/16
page 763
APPENDIX
E
Answers
to Odd-Numbered
Exercises
Chapter 1
1 x + k.
21. y = m
23. y m = kx.
Section 1.1
25. y = kx 2 .
True-False Review
Section 1.2
1. False
True-False Review
3. True
5. False
1. False
7. False
3. True
9. False
5. False
11. False
Problems
Problems

1. y(t) = gt 2 /2; t = 200
g 4.52 sec.
3.
(a) 180g 42.0 m/sec.

(b) t = 180
g 4.28 sec.
5. y(t) = gt 2 /2 2t;
7. A = a;
h 470 m.
= n (n an integer).
1. 2, nonlinear.
3. 2, nonlinear.
5. 4, linear.
7. (, ).
9. (, 4) or (4, ).
11. (, ).
13. (, 0) or (0, ).
13. After 4 p.m.
15. (, ).
15. y = kx 4 .
17. (, ).
17. x 2 + 2y 2 = k.
19. r = 3, 1.
19. y = kex .
21. r = 1.
763
i
main
2007/2/16
page 764
i
764
APPENDIX E Answers to Odd-Numbered Exercises
ln x
, x > 0.
x
1 + sin x
, x > 0.
29. y(x) =
x
31. y(x) = 2 x + c for all x > 0.
33. If n = 1, 2,
27. y(x) =
y(x) =
x n+2
+ c1 x + c2 .
(n + 1)(n + 2)
If n = 1, y(x) = x ln |x| + c1 x + c2 . If n = 2, y(x) =

c1 x + c2 ln |x|. Solution is valid on (, ) for n 0 and on
(, 0) or (0, ) for n < 0.
35. y(x) = 3 + x cos x.
37. y(x) = xex 2ex + 5x + 5.
39. y(x) = ex 1e x.
7. y(x) =
(x 1) + c(x 2)2
and y(x) = 1.
(x 1) c(x 2)2
1/(ab)

xa
11. y(x) = c + c1
.
xb

13. y(x) = a(1 + 1 x 2 ).
9. y(x) =
15. y(x) = 0.
(a) v(t) = a
mg/k.
17.
egt/a egt/a
egt/a + egt/a

= a tanh(gt/a), where a =
(b) No.
(c) y(t) =
1 x4 + .
49(a) y(x) = 1 41 x 2 + 64
a2
ln [cosh(gt/a)].
g
19. y(x) = ln(ex e3 + e).
Section 1.3
21.
True-False Review
1.
3.
5.
7.
cx 3
.
2x 1
True
False
True
True
(a) No.
(b) 21 ln(1 + v02 ).
25. T (40) = 225 F; t 96.4 minutes.

(a) 500 F.
27.
(b) t 6 : 07 p.m.
Section 1.5
Problems
y
1. y = .
x
y2 x2
3. y =
.
2xy
x

5. y =
.
y x 2 + y 2
x 2 + 2xy y 2
7. y = 2
.
y + 2xy x 2
1
15.
(c) (i) y(x) = 2
on (, ),
x +1
1
(ii) y(x) = 2 on (0, ),
x
1
(iii) y(x) = 2
on (1, 1).
x 1
(d) y(x) = 0.
True-False Review
1. True
3. True
5. True
7. False
9. False
Problems
1. 2560.
3. t 35.86 hours.
5. 1091.
7.
Section 1.4
(a) P1 >
2P0 P2
P0 + P2
(b) No.
True-False Review
9.
(a) Equilibrium solutions:

(t) = 0, P(t) = T .
P
Isoclines: P = 21 T rT r+4k .
Slope: positive for P > T , negative for 0 < T < P . Concave up for P > T /2, concave down for 0 < P < T /2.
2
1.
3.
5.
7.
9.
True
True
False
True
True
(c) For 0 < P0 < T , population dies out; For P0 > T , population grows.
Problems
2
1. y(x) = cex .
3. y(x) = ln (c ex ).
5. y(x) = c(x 2).
11. Equilibrium solutions: P (t) = 0, P (t) = T , P (t) = C.

Slope: positive for T < P < C, negative for 0 < P <
T and for P > C. Changes in concavity occur when P =
1 C + T C 2 CT + T 2 . For 0 < P < T , population
0
3
dies out; for T < P0 < C, population grows asymptotically toward
C; for P0 > C, population declines asymptotically toward C.
main
2007/2/16
page 765
i
13. P (t) = Celn(P0 /k)e

15.
(a) More.
(b) 31.06 min.
(c) 85.02 min.
19. Approx. 52 years.
rt
765
Section 1.8
True-False Review
1.
3.
5.
7.
9.
Section 1.6
True-False Review
1. False
3. True
5. True
True
False
True
True
True
Problems
1. F (V ) = (1 V 2 )/V .
Problems
cos V
3. F (V ) = sin(1/V )V
.
V
1. y(x) = ex (ex + c).

2
3. y(x) = x 2 1 + cex .
1
5. y(x) =
(4 tan1 x + c).
1 + x2
x 3 (3 ln x 1) + c
7. y(x) =
.
ln x
4et (t 1) + c
.
9. x(t) =
t2
11. y(x) = (tan x + c) cos x.
1 ex + cex , + =
0,
13. y(x) = +
x
(x + c),
+ = 0.
e
17. y 2 = x 2 ln(ln cx).
15. y(x) = x 2 (x 4 + 1).
19. y 2 = c2 2cx.
17. x(t) = (4
t)(1 + t).
2ex + 1,
19. y(x) = x
e (e + 2),
if x 1,
if x > 1.
29. y(x) = x 1 (cos x + x sin x + c).

31. y(x) = sin x + c csc x.
5. Not homogeneous.

7. F (V ) = 1 + V 2 .
9. y 2 = ce3x/y .
11. y(x) = x cos1 (c/x).

13. y + 9x 2 + y 2 = cx 2 .
15. y(x) = xe(cx+1) .
21. y(x) = x sin1 cx.

25. 2y 2 + xy x 2 = 2.
27. sin1 (y/2x) = ln x + c, and y(x) = 2x.
29. x 2 + y 2 = 2kx.
Section 1.7
31.
True-False Review
33. (3y x)3 = k(2y x)4 .
1.
3.
5.
7.
True
True
False
True
Problems
1. 196 g.
3. 300 g.
5.
(a) 6.75 g.
(b) 15 3 2 L.
9. i(t) = 5(1 e40t ).
11. i(t) = 35 (3 sin 4t 4 cos 4t + 4e3t ).
13. q(t) = 5et/RC .

E
15. i(t) = 2 0 2 2 (R sin t L cos t) + AeRt/L ,
R +L
E
iS (t) = 2 0 2 2 (R sin t L cos t),
R +L
iT (t) = AeRt/L.

1 t/RC
E0 C
17. i(t) =
e
aeat .
1 aRC RC
35.
(b) (x + cm)2 + (y c)2 = c2 (1 + m2 ).
(a) (y 2 x 2 ) tan(0 ) 2xy = k.
37. y 2 = x 2 (8 sin x + c).

39. y 2/3 = x[x 2 (2 ln x 1) + c].
1
41. y(x) = 2
.
x (c 2x 3 )

1 xb 2
43. y(x) =
[x + (b a) ln |x b| + c]2 .
4 xa
2
45. y(x) = [(x 2 1) + cex ]2 .

1/(1)
x3 + c
47. y(x) =
.
x

49. y(x) = 1 +
51. y 2 =
1/(13)
c
.
sec x + tan x
1
sin2 x(2 cos x + 1)
53. y(x) = 3(3x tanh 3x).
main
2007/2/16
page 766
i
766
55. y(x) = 13 [3x tan1 (3x + c) + 1].
Section 1.11
57. y(x) = x 1 ecx .
61.

1
1 .
c ln x

1
(b) y(x) = x 1 1 +
.
c 3 ln x
59. y(x) = x 1
63. y(x) = xex .
65. y(x) = tan1 (1 + ce 1+x ).
Problems
1. y(x) = c1 x 3 + x 4 + c2 .
3. y(x) = 3 c1 + c2 ex .
5. y(x) = c2 ln |c1 sin x|.
7. y(x) = 13 x 6 + c1 x 3 + c2 .
Section 1.9
1
ln |c1 + c2 ex |.
11. y(x) = c1 tan1 x + c2 .
True-False Review
13. y(x) = ln(sec x) + c1 ln(sec x + tan x) + c2 .
1.
3.
5.
7.
9.
False
False
False
False
False
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
Exact.
Not exact.
xy 2 cos y + sin x = c.
6e2x + 3x 2 y 3xy 2 + y 3 = c.
tan1 (y/x) + ln |x| = c.
sin xy + cos x = c.
y(x) = x 1 (x 3 ln x + 5).
y(x) = x 1 ln(2 sin x).
Yes.
Yes.
2x y 4 = cy 2 .
c + 2x 5/2
23. y(x) =
.
10 x
c + tan1 x
.
25. y(x) =
1 + x2
27. r = 2, s = 4.
29. r = 1, s = 2.
Section 1.10
True-False Review
1. True
3. False
Problems
1.
3.
5.
7.
9.
11.
13.
15.
y(0.5) 4.8938.
y(0.5) 1.0477.
y(1) 0.8564.
y(1) 0.5012.
y(1) 0.7115.
y(0.5) 5.79167.
y(0.5) 1.08785.
y(1) 0.999996.
9. y(x) =
15. y(x) = a cosh(x).
19.
(a) = 0 cos( gt/L).
Section 1.12
Additional Problems
1. Yes.
3. x 2 + 3y 2 = k.
5. x 2 + 2y = k.
7.
(b) 2y 2 = kx 6 + x 2 .
13. y(x) = x 2 [(ln x)2 + c].

y+x
15. coth1
= 2 ln |x| + c.
2x
1
(x + ln |e2x 1| + c).
17. y(x) = 2x
e +1
19. y sin x + x sin y y + x = c.
21. y(x) = 21 ln (c 2ex ).
x ex + c
y=
.
1 + ex
y
2
25. e x + x y = c.
23.
27. y 2 = cx 3 x 2 .
29. y(x) = c(x + 1)ex .
31. y(x) = x 1 tan1 (c x 2 ).
y3
y
+ 3 = ln |x| + c.
x
3x
25(ln x)2 + c
2
35. y =
2x 2
37. y(x) = sin x(c ln(sin x)).
33.
39. e6y = 23 e4x + 25 .

41. yecos x = x + 1.
43. 12.32 minutes.
1
.
kt + (Tm T0 )1
(a) 20, 000.
45. T (t) = Tm
47.
(b) 11, 696.

(c) 57.9 days after April 1.
3 [64 cos(2t) 40 sin(2t)] + 1185 e5t/4 .
49. i(t) = 178
356
51. 157.5 g.
53. y(1.5) 3.67185.
55. y(1.5) 3.66576.
57. y(1.5) 3.66565.
main
2007/2/16
page 767
i

Chapter 2
7.
True-False Review
9.
True
True
True
True
True
11.
13.
Problems
1. a31 = 0, a24 = 1, a14 = 2, a32 = 2, a21 = 7, a34 = 4.

2 1 1
3.
, 2 3.
0 4 2
1 3 2
3 6 0
5.
2 7 4 , 4 3.
4 1 5
7. 4.
9. 1.
1
3
4
11. Column vectors: 1 , 2 , 5 .
2
6
7
Row vectors: [1 3 4], [1 2 5], [2 6 7].

1 2
1
2
13. A = 3 4 . Column vectors: 3 , 4 .
5 1
5
1
15. q p.

t + 2 0 0 .
21. For example, A(t) =
1/ 3 t 0 0
25. For example, A(t) = [t] and B(t) = [t 2 ].
27. a12 = 1, a13 = 3, a32 = 1, a11 = a22 = a33 = 0.
Section 2.2
True-False Review
1.
3.
5.
7.
9.
11.
False
True
False
False
True
False
Problems
17. x = 2, y = 1 or x = 1, y = 2.

6 1
19.
.
2 6
1 2 3
19 8 2
1 0 4
T
T
27. A =
, AA = 8 17 4 ,
1 2 1
2 4 26
4 3 0

10 4 5
.
B T AT =
4 1 10
29.
(a) 2I4 .
(b) 7I3 .
33. S = 0.
37. A (t) =

2e2t
.
cos t

et 2e2t 2t
.
2et 8e2t 10t
1
e
1
1
1
e
43. 0 A(t) dt =
1 .
2(e 1) 5(1 )
e

e 1 21 (e2 1) 13
1
.
45. 0 A(t) dt =
2(e 1) 2(e2 1) 53
cos t
sin t 0

1
2
47. A(t) dt = sin t cos t 2 t .
39. A (t) =
49.

2 4 2
6
3 9
, 3B =
,
6 10 4
3 12 15

3 4 7
A 2B =
.
1 3 8

5 10 3
3. AB =
, CA not possible,
27 22 3
2 2 3
DB = [6 14 4], CD = 2 2 3 .
4 4 6
1. 2A =

9 21i 11 + 10i
.
1 + 19i 9 + 15i

12 22
ABC =
.
14 126

0
.
38
7
13 .
29

1 4
9 11
(a) A2 =
, A3 =
,
8 7
22 13

31 24
.
A4 =
48 17
2 0 1
4 3 0
2
3
(b) A =
4 3 0 , A =
6 4 3 ,
2 4 1
12 3 4
6
4 3
9 4 .
A4 = 20
10 16 3
5. AB =
Section 2.1
1.
3.
5.
7.
9.
767
3 2 t
2t
21 cos 2t
tet et
.
1 e2t
1 2
A(t) dt = 3 t 3 5t
3 2
tan t
2 t + cos t
Section 2.3
True-False Review
1. False
3. False
5. True
main
2007/2/16
page 768
i
768
Problems
Problems

7. A =
1 1 1 1
, b=
2 4 3 7
3
, A# =
2
1 1 1 1 3
.
2 4 3 7 2
x1 x2 + 2x3 + 3x4 =
1
x1 + x2 2x3 + 6x4 = 1
3x1 + x2 + 4x3 + 2x4 = 2.
11.
(b) No.

x1
x1
t 2 t
13.
=
.
x2
x2
sin t 1

0 sin t 1
t
x1
x1
15. x2 = et
0
t 2 x2 + t 3 .
x3
x3
1
t
t2
0
9.
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
Section 2.4
True-False Review
1.
3.
5.
7.
9.
True
True
False
True
True
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
23.
25.
Row-echelon form.
Reduced row-echelon form.
Reduced row-echelon form.
Reduced

row-echelon form.
1 3
, rank(A) = 2.
0 1
1 1 2
0 1 0 , rank(A) = 2.
0 0 0
1 3
0 1 , rank(A) = 2.
0 0
1 2 1
3
0 1 1 2 , rank(A) = 2.
3
3
0 0 0
0
1 2 1 2
0 1 0 1
0 0 0 0 , rank(A) = 2.
0 0 0 0
I2 , rank(A) = 2.
1 1 2
0 0 0 , rank(A) = 1.
0 0 0
I4 , rank(A) = 4.
0 1 0 0
0 0 1 0 , rank(A) = 3.
0 0 0 1
Section 2.5
True-False Review
1. False
3. True
5. False
23.
31.
33.
35.
37.
39.
41.
43.
45.
47.
49.
51.
53.
(2, 2, 1).
No solution.
(2, 1, 3).
{(1 2r + s t, r, s, t) : r, s, t R}.
{(1 2r + 3s t, r, 2 4s + 3t, s, t) : r, s, t R}.
No solution.
{(s + t, 3 + s + t, s, t) : s, t R}.
(1, 3, 4, 4, 2).
{(5t, 2t 1, t) : t R}.
No solution.
(a) k = 2.
(b) k = 2.
(c) k = 2.
(a) a = 3 and b = 10.
(b) a = 3 and b = 10.
(c) a = 3 and b R.
(b) (2, 1, 1).
Trivial solution.
{(t, 3t, t) : t R}.
{(t, 0, 3t) : t R}.
{(2t (1 + i), t, (2 i)t) : t C}.
{(2r 3s, r, s) : r, s R}.
Trivial solution.
{((1 i)t, t) : t C}.
Trivial solution.
{((1 5i)r + (5 + i)s, 13r, 13s) : r, s C}.
{(3t, 2t, t) : t R}.
{(3s, r, s, t) : r, s, t R}.
Section 2.6
True-False Review
1.
3.
5.
7.
9.
False
True
False
True
True
Problems

1 1 + i
.
1 i 1
A is not invertible.
8 29 3
A1 = 5 19 2 .
2 8 1
18 34 1
1
A = 29 55 2 .
1 2 0
i 1 0
1
A = 1 5i i 2i .
2 0 1
5. A1 =
7.
9.
11.
13.
main
2007/2/16
page 769
i

15.
17.
19.
21.
33.
37.
27 10 27 35
7 3 8 11
A1 =
14 5 14 18 .
3 1 3
4
1
2 .
1
(2, 2, 1).
(6, 1, 3).
No.
7 + 5r 3 + 5s
(b) The set of right inverses is 2 2r 1 2s .
r
s
769
3.
5.
7.
13.
15.

4 52
.
52 676

1
17
8
.
6 16
320

5 + 3a 2a + 4b
(a)
; a = 2, b = 1.
14 + 7a 5a + 9b
1 1 2
(b) 0 2 2 .
0 1 1
3t
3e
2 sec2 t tan t
2
6t
.
sin t
6/t
5
Not possible.
Section 2.7
1
17. ( 17
2 , 2 , 0).
True-False Review
16
33
15
21. {( 27 , 27 , 41
7 , 2, 0) + t ( 7 , 7 , 7 , 4, 1) : t R}.
19. {(5 t, t 2, t) : t R}.
1.
3.
5.
7.
9.
True
False
False
False
False
23. {(0, 13 , 0) + t ( 21 (1 3i), 16 (1 + i), 1) : t R}.

25. Innitely many solutions for all k.
27.
29.
Problems
3.
5.
7.
9.
11.
M2 ( 17 )A12 (5)P12 .
A23 (2)M2 (1)A13 (3)A12 (2).
A12 (2)P12 A12 (2)A21 (1)M2 (1).
P12 A12 (4)M2 (21)A21 (4).
P12 A13 (2)A21 ( 41 )M2 (4)M3 (8)A32 ( 21 )A31 ( 27 ).
13. P12 , A12 (2), M2 ( 17 ), A21 (3).

1 0
2 3
, U=
.
15. L = 5
0 13
1
2
1 0 0
3 1 2
17. L = 2 1 0 , U = 0 1 3 .
1 4 1
0 0 16
1 1 2
3
1 0 0 0
2 1 0 0
0 2 1 10
.
19. L =
3 1 1 0 , U = 0 0 2
9
1 2 2 1
0 0 0
4
21. x = (11, 7).
1 , 1 , 1 ).
23. x = ( 12
3 2
31.
Section 2.9
17 17
1 13 2
(a) 0
1 23 .
0
0 0
(b) rank(A) = 2.
33.
(c) No inverse.
1 0 0
(a) 0 1 2 .
0 0 1
(b) rank(A) = 3.
1 0 0
13 2 1
(c)
9 3 3 .
29 13 23
35. For e1 : (25, 3, 7). For e2 : (7, 1, 2). For e3 : (4, 1, 1).
39.
41.
True-False Review
1. False
3. False
(c) k = 0.
7
1 4
(a)
.
0 1
(b) rank(A) = 2.

5
7
34 34
.
(c)
1
25. x1 = (4, 11), x2 = ( 13

2 , 15), x3 = (3, 11).
Section 2.8
(a) k = 2.
(b) k = 0, 2.
43.
(a) A = M1 (4)A12 (2)M2 (17/2)A21 (7/4).

1 0
4 7
(b) L =
.
;U =
1
17
2 1
0 2
(a) A = M1 (3)A13 (1)P23 A23 (2)M3 (3)A32 (2)M2 (1).
1
0 0
3 0 0
1 0 ; U = 0 2 1 .
(b) L = 0
1 1 1
0 0 23
3
2
(b) All terms containing two factors of A and one factor of B
become subtracted.
(c) 2k .
45.
(a) 6.
(b) 4.
Additional Problems

11 18 9 24
1.
.
4
2 17 1
(c) 15.

n!
n
(d)
=
.
m
m!(n m)!
main
2007/2/16
page 770
i
770
Chapter 3
33. 24.
Section 3.1
35. 12.
True-False Review
1.
3.
5.
7.
True
False
False
True
Problems
1.
3.
5.
9.
11.
13.
15.
17.
19.
21.
23.
25.
27.
31.
33.
35.
37.
39.
Odd
Even
Even
0.
17.
8.
60.
48.
20.
42et .
(b) (d1 , d2 , d3 ) = (1, 1, 1).
70.
315.
No.
Yes, Even, Plus.
p = 1, q = 4, 2 inversions, Plus.
p = 2, q = 1, 3 inversions, Minus.
(1)n(n1)/2 .
37. 6075.
5 .
39. 16
(a) |8 + 8k|.
41.
(b) No change.
(c) k = 1.
47.
(b) 26.
Section 3.3
True-False Review
1. False
3. True
5. False
7. True
Problems
1. M11 = 4, M12 = 2, M21 = 3, M22 = 1,
C11 = 4, C12 = 2, C21 = 3, C22 = 1.
3. M11 = 5, M12 = 0, M13 = 4, M21 = 47, M22 = 2,
M23 = 38, M31 = 3, M32 = 0, M33 = 2,
C11 = 5, C12 = 0, C13 = 4, C21 = 47, C22 = 2,
C23 = 38, C31 = 3, C32 = 0, C33 = 2.
5. 5.
7. 153.
9. 0.
Section 3.2
11. 9.
13. 3.
True-False Review
1. False
3. True
5. False
15. 4.
17. 11,997.
19. 170.
23.
36.
45.
103.
624.
21.
84.
Invertible
Invertible
Invertible
Not invertible
k = 4, 13 .
All k = 0, 1.
40.
2.

1 4
.
2 1

1 2
(c) adj(A) =
.
4 1

(b) MC =
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
23.
25.
31.
(a) 7.
1
7
(d) A1 =
25.
(a) 26.
2
7
47 17
7 4 2
(b) MC =
6
4 2 .
15 10 8
7 6 15
(c) adj(A) = 4 4 10 .
2 2
8
7 3 15
26 13
26
2 2 5
(d) A1 = 13
.
13
13
4
1 1
13
13
13
main
2007/2/16
page 771
i
27.
(a) 6.
(b)
(c)
(d)
29.
(a)
(b)
(c)
(d)
31.
(a)
(b)
(c)
(d)
11 1 8
MC =
9 3 6 .
2 2 2
11 9 2
adj(A) =
1 3 2 .
8 6 2
3 1
11
2
3
6
1 .
A1 = 16 21
3
1
4 1
3
3
14.
9 1
7
MC =
32 2 14 .
13 3
7
9 32 13
adj(A) =
1 2
3 .
7 14
7
9 32 13
1
1
A =
1 2
3 .
14
7 14
7
402.
84 46 29 81
162 60 99 27
.
MC =
18 38 11
3
30 26 130 72
84 162 18 30
46
60 38 26
.
adj(A) =
29
99 11 130
81 27
3 72
84 162 18 30
1
60 38 26
46
A1 =
99 11 130
402 29
81 27
3 72
33. 1.
9 .
35. 16
t

e sin 2t et cos 2t
37.
.
t
t
e cos 2t e sin 2t
39. 03 ; det(A) = 0.
41. ( 23 , 0, 21 ).
17
16
43. ( 11
3 , 3 , 3 , 2).
45. 49 .
771
17. (3.77, 0.66, 1.46).

19. det(2A) = 24, det(A1 ) = 13 , det(AT B) = 12,
det(B 5 ) = 1024, det(B 1 AB) = 3.
Section 3.5
Additional Problems
1. 37.
3. 22.
5. 24.
7. 32.
9. 12.
11. 6.
13. 8.
15. det(A) not dened, det(C) = 18, det(AB) = 474, det(ACB) =
4104.
4
1 1
7
7
7
1
5
1 .
17. A1 =
28
28 14
5
5 3
28
28 14
11
1
6 23 13 12
1
1
1
1
2 4 4 8 .
19. A1 =
1
1
5
5
6 12 12 24
1
0
0
7
0 3
2
21. A1 = 1 1 0 .
0 1 1
23. False.
(a) k = 0, 4.
25.
(b) |4k k 2 |, Yes.

29. ( 57 , 67 ).
31. ( 21 , 21 , 23 ).
Chapter 4
Section 4.1
Section 3.4
True-False Review
Problems
1.
3.
5.
7.
38.
3.
3abc a 3 b3 c3 .
2196.
1. False
3. True
5. False
5 1 7
1
1
9. det A = 18, A =
1 7 5 .
18
7 5 1
51
8 31
1
1
11. det A = 116, A =
32 20 24 .
116
54 12 26
37 , 1 ).
13. ( 24
8
1 , 21 ).
15. ( 41 , 16
16
7. True
9. False
11. False
Problems
1. v1 = (6, 2), v2 = (3, 6), v3 = (3, 8).
3. v = (22, 19, 53, 39), v = (22, 19, 53, 39).
main
2007/2/16
page 772
i
772
Section 4.2
7. False
True-False Review
11. False
9. True
1. True
3. False
Problems
5. True
1. Yes.
7. False
3. No.
5. Yes.
Problems
1. (A1) holds, (A2) fails.
3. (A1), (A2) both fail.
5. (A1), (A2) both hold.

0 0 0
a b c
a b c
9. 0 = 023 =
,
=
.
0 0 0
d e f
d e f
1 (3x +x +5x )v + 1 (x 5x +7x )v +

9. (x1 , x2 , x3 ) = 16
1
2
3 1 16
1
2
3 2
1
16 (7x1 + 3x2 x3 )v3 .
13. One possible answer: {(2, 1, 0), (1, 0, 1)}.

15. One possible answer: {(1, 1, 1, 0)}.

0 1
17. One possible answer:
.
1 0
11. No.
19. {v R3 : v = (a + 2b, a b, 2a + 3b), a, b R}. Geometrically, span{v1 , v2 } is the plane through (0, 0, 0) determined by the
two given vectors.
13. Only (A1), (A2), (A5), (A6) hold.
23. Yes.
15. Only (A1), (A2), (A4), (A5), (A7), (A8) hold.
25. Yes.
19. Yes.
Section 4.3

a 2b 2a + b
27. span{A1 , A2 } = A Mn (R) : A =
,
a + b 3a b
B span{A1 , A2 }.
29. {(0, 0, 0)}.
31. Plane spanned by {v1 , v2 }.
True-False Review
1. False
3. True
Section 4.5
True-False Review
5. True
7. False
1. False
3. False
5. True
Problems
3. S = {(x, y) R2 : 3x + 2y = 0}, Yes.
7. True
9. False
5. S = {(x, y, z) R3 : x + y + z = 1}, No.

7. S = {(x, y) R2 : x 2 y 2 = 0}, No.
9. S = {A Mn (R) : A is lower triangular}, Yes.
11. S = {A M2 (R) : A is invertible}, No.
13. S = {f V : f (a) = f (b)}, Yes.
15. S = {f V : f (x) = f (x) for all x R}, Yes.
17. S = {p V : p(x) = ax 2 + 1 for some a R}, No.
Problems
1. Linearly independent.
5. Linearly dependent: 3(2, 4, 6) + 2(3, 6, 9) = (0, 0, 0).
7. Linearly dependent: 2(1, 1, 2) + 3(0, 2, 1) + (3, 1, 2) +
5(1, 1, 1) = (0, 0, 0).
19. S = {y V : y + 2y y = 1 on I }, No.
11.
21. nullspace(A) = {(8r + 8s, 2r 3s, r, s) : r, s R}.
13. k = 1, 2.
(b) No.
15. Linearly dependent.
Section 4.4

True-False Review
1. True

23. One possible answer: {(3, 1, 5), (1, 2, 1), (1, 2, 3)}.
25. One possible answer: {(1, 1, 1, 1), (2, 1, 3, 1), (1, 1, 2, 1)}.
3. True
27. One possible answer: {2 5x, 3 + 7x}.
5. True
main
2007/2/16
page 773
i
Section 4.6
True-False Review
1.
3.
5.
7.
9.
11.
False
True
False
False
False
False
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
23.
27.
29.
31.
33.
37.
Yes.
No.
Yes.
One possible basis: {1, x, x 2 , x 3 }.
dim[nullspace(A)] = 1.
dim[nullspace(A)] = 1.
One possible basis: {(3, 1, 0), (1, 0, 1)}; dim[S] = 2.

1 0
0 1
0 0
One possible basis:
,
,
; dim[S] = 3.
0 0
0 0
0 1
One possible basis: {v1 , v2 }; dim[S] = 2.

1 3
1 4
One possible basis:
,
.
1 2
1 1
= 1.
(b) (x, y, z, w) = (2a +3b, 7a 8b, 5a, 5b), where a, b R.
1 0 0
0 1 0
0 0 1
0 0 0
(a)
0 0 1 ,
0 0 1 ,
0 0 1 ,
1 0 1 ,
0 1 0
1 0 0
1 1 1
1 0 1
0 0 0
0 1 1 , dim[S] = 5.
0 1 1
(b) To the basis in (a), add E11 , E12 , E23 , E31 .
dim[Symn (R)] = n(n + 1)/2, dim[Skewn (R)] = n(n 1)/2.

1 0
0 1
Basis:
,
; Extension: add E11 , E12 .
0 1
1 0
(a) 2n; One possible basis:
{ej : j = 1, 2, . . . , n} {i ej : j = 1, 2, . . . , n}.
(b) n; One possible basis: {ej : j = 1, 2, . . . , n}.
Section 4.7
True-False Review
1.
3.
5.
7.
True
True
True
False
Problems
1.
3.
5.
7.
9.
11.
13.
[v]B = (3, 1).

[v]B = (4, 1, 3).
[v]B = (1, 4, 6).
[p(x)]B = (4, 3, 0).
[p(x)]B = (5, 2, 3, 2).
[A]B = (2, 3, 1, 1).
55 56
[A]B = ( 34
3 , 12, 3 , 3 ).
773
15. (2a0 a1 a2 , 2a0 2a1 a2 , a0 + a1 + a2 ).

1
4
17. PCB =
.
1 20
0
3 5
19. PCB = 53 23 4 .
1 4
73
3
1 0 2
3 0 1 .
21. PCB =
3 2 2
3 4 2
23. PCB = 3 2 1 .
1 3 5
0 1 0 0
0 0 0 1
25. PCB =
0 0 1 0 .
1 0 0 0

1 20 4
27. PBC =
.
16 1 1

1
1 2
29. PBC =
.
7 2 3
0 0 0 1
1 0 0 0
31. PBC =
0 0 1 0 .
0 1 0 0
Section 4.8
True-False Review
1. True
3. False
5. True
Problems
1. Basis for rowspace(A): {(1, 2)}.
Basis for colspace(A): {(1, 3)}.
3. Basis for rowspace(A): {(1, 2, 3), (0, 1, 2)}.
Basis for colspace(A): {(1, 5, 9), (2, 6, 10)}.
5. Basis for rowspace(A): {(1, 2, 1, 3), (0, 0, 0, 1)}.
Basis for colspace(A): {(1, 3, 1, 5), (3, 5, 1, 7)}.
7. Basis: {(1, 1, 2), (0, 1, 9)}.
9. Basis: {(1, 1, 1, 2), (0, 1, 5, 8)}.
11. Basis for rowspace(A): {(1, 3)}.
Basis for colspace(A): {(3, 1)}.
Section 4.9
True-False Review
1. False
3. True
5. True
7. False
9. True
main
2007/2/16
page 774
i
774

Problems
15. Orthonormal basis:
1. nullspace(A) = {(x, y, z, w) : x 6z w = 0}; nullity(A) = 3;

rank(A) = 1.
3. nullspace(A) = {0}; nullity(A) = 0; rank(A) = 3.
5. 1.
7. 1.
9. x = cx1 + xp , where x1 = (34, 11, 1) and xp = (5, 3, 0).
11. x = xp = (2, 3, 1).
13. No.
Section 4.10
True-False Review
1.
3.
5.
7.
9.
True
False
True
False
False
Section 4.11
1
17. Orthonormal basis: { (1, 0, 1, 0), (0, 1, 0, 0),
2
1
(1, 0, 1, 2)}.
6
19.
Orthonormal basis:

1
1
1
(1, 1, 1, 0), (1, 2, 1, 3), (3, 1, 2, 1) .
3
15
15

1
1
21. Orthonormal basis: (1 i, 0, i), (1, 3 + 3i, 1 i) .
3
21

1
1
2
23. Orthogonal basis: 1, (2x 1), (6x 6x + 1) .
2
6

1
25. Orthogonal basis: 1, sin x, ( cos x 2) .

0 1
1 0
0 0
27. Orthogonal basis:
,
,
, the subspace of all
1 0
0 0
0 1
symmetric matrices in M2 (R).

29. Orthogonal basis: 1 + x 2 , 1 x x 2 + x 3 , 3 5x + 3x 2 + x 3 .
35. W = span {(0, 1, 1, 0), (3, 3, 0, 1)}.
True-False Review
1.
3.
5.
7.

1
1
(2, 1, 2), (1, 4, 1) .
3
3 2
False
True
False
False
Section 4.13
Additional Problems
3. No.
Problems
1. = 0.95 rad.
3. u, v = 19 + 11i, ||u|| = 35, ||v|| = 22.
7. A, B = 13, ||A|| = 13, ||B|| = 7.

11.
(a) 9.
(b) 0.
5. No.
7. No.
9. Yes.
11. No.
13. No.
Section 4.12
19. No.
True-False Review
21. No.
1.
3.
5.
7.
23. Yes.
True
True
True
True
25. (b) only.

27. (b) only.
29. (a) and (b).
Problems
1. Orthonormal set:
3. Not orthogonal.

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

1
1
1
5. Orthonormal set: (1, 2, 3), (1, 1, 1), (5, 4, 1) .
3
14
42
7.
Orthonormal set:

1
1
1
(1 i, 1 + i, i), (0, i, 1 i), (3 + 3i, 2 + 2i, 2i) .
3
5
30

1
9. Orthonormal set: , sin x, cos x .
2

3 1
.
13. A4 = k
2 0
31. (b) only.

35.
(b) One possible basis:
0 0 1
0 0 0
0 1 0
1 0 0 , 0 0 0 , 0 0 1 .
0 0 0
1 0 0
0 1 0
(c) Add E11 , E22 , E33 , E12 , E13 , and E23 .
41. Basis for rowspace(A): {(3, 6)}. Basis for colspace(A):

{(3, 6)}. Basis for nullspace(A): {(2, 1)}.
43. Basis for rowspace(A): {(1, 0, 0), (0, 1, 0), (0, 0, 1)}. Basis for
colspace(A): {(4, 0, 6, 2), (0, 10, 5, 5), (3, 13, 2, 10)}. Basis
for nullspace(A): {(0, 0, 0)}.
main
2007/2/16
page 775
i
45. Orthonormal basis for rowspace(A):

1
1
(14, 13, 2) .
(1, 2, 6),
369
41
Orthonormal basis for colspace(A):
9

3 4
1
2
1
( , , 1, ) .
(1, 2, 0, 1),
10 3
3
3
6
Orthonormal basis for nullspace(A): {( 23 , 23 , 13 )}.
7
47. Orthogonal basis = {(5, 1, 2), (1, 11
5 , 5 )}.
49. Orthogonalizing standard basis on P3 gives:
1 }.
{1, x 21 , x 2 x + 16 , x 3 23 x 2 + 35 x 20
51. = cos1 (5/ 221) 1.23 radians.
53. = cos1 (13/ 561) 0.99 radians.

55. 0.100.
Chapter 5
Section 5.1
Problems
5. Shear parallel to the x-axis.
7. Shear parallel to the y-axis.
9. Shear parallel to the x-axis, followed by a linear stretch in the ydirection, followed by a shear parallel to the y-axis.
11. Reection in the x-axis followed by a linear stretch in the ydirection.
Section 5.3
True-False Review
1. False
3. False
5. True
Problems
Problems
11. A =

(b) T (x) = (2, 3).
17.
19.
23.
25.
27.
29.
31.
35.
(c) T (x) = 0.
3. Ker(T ) = 0, dim[Ker(T )] = 0; Rng(T ) = R3 , dim[Rng(T )] = 3.
5. Ker(T ) = {x R3 : x = r(2, 0, 1) + s(1, 1, 0), r, s R},
dim[Ker(T )] = 2; Rng(T ) = {y R2 : y = t (1, 3), t R},
dim[Rng(T )] = 1.

3 2
.
1 5

1 1 1
.
1 0 1
1 0 1
1 0 0
.
A=
3 0 2
0 0 0
T (x1 , x2 , x3 ) = (2x1 x2 + 5x3 , 3x1 + x2 2x3 ).
T (x) = (3x, 2x, 0, x).
(b) T (x1 , x2 ) = ( 21 x1 + 23 x2 , 2x1 + x2 ); T (4, 2) = (1, 6).

3 2 6 3
A=
.
2 3 1 2
0 23 13
3 1 1
A = 21 2
.
4 5 25
1
17
8
4 15 15
T (v1 ) = 8v1 4v2 , T (v2 ) = 5v1 + 3v2 .
Writing v = av1 + bv2 , we have T (v) = (3a + b)v1 + (2b a)v2 .

5 6
3c c
Matrix of T1 + T2 is
. Matrix of cT1 is
.
2 2
c 2c
13. A =
15.
(a) T (x) = 0.
1.
True-False Review
1. False
3. False
5. True
775
Section 5.2
7. Ker(T ) = {0},
Rng(T ) = Span{( 53 , 13 , 53 , 1), ( 23 , 13 , 13 , 1)}.
9. Ker(T ) = {0}, Rng(T ) = R3 .
(a) Ker(T ) = {v R3 : v is orthogonal to u}, the plane of vectors orthogonal to u, dim[Ker(T )] = 2.
11.
(b) Rng(T ) = R, dim[Rng(T )] = 1.

13. Ker(T ) is the set of all matrices that commute with B.
15. Ker(T ) = {r(x 2 + x + 1) : r R}, dim[Ker(T )] = 1;
Rng(T ) = P2 , dim[Rng(T )] = 2.
17. Ker(T ) = {v V : r(v1 + v2 + v3 ), r R}, dim[Ker(T )] = 1.
Rng(T ) = W , dim[Rng(T )] = 2.
Section 5.4
True-False Review
1. False
3. True
5. True
7. False
9. True
11. False
True-False Review
1. False
3. False
5. False
Problems
1. (T1 T2 )(x, y) = (5(x + y), x + 15y),
(T2 T1 )(x, y) = (7(2x + y), 2(x 2y)), No.
main
2007/2/16
page 776
i
776

19 2
.
0 8
3. Ker(T1 ) = {x R2 : x = r(1, 1), r R}, Ker(T2 ) = {0},

Ker(T1 T2 ) = {x R2 : x = s(2, 1)}, Ker(T2 T1 ) = Ker(T1 ).
5.
(a) [T1 (f )](x) = cos(x a), [T2 (f )](x) = 1 cos(x a).
7. If v = av1 + bv2 , (T2 T1 )(v) = av1 9av2 .
9. Ker(T ) = {r(2, 1) : r R}, Rng(T ) = {r(1, 2) : r R2 }, T
is neither one-to-one nor onto.
11. Ker(T ) = {r(1, 2, 1) : r R},
Rng(T ) = {r(0, 3, 5, 2) + s(1, 4, 4, 1) : r, s R}, T is neither
one-to-one nor onto.
1
13. T 1 (x) = x.
15. T is onto, but not one-to-one.

17. (T1 T2 )(v) = (T2 T1 )(v) = v.

a b
19. One example is T (a, b, c) =
.
0 c

a b
21. One example is T (a, b, c) =
.
b c
Section 5.6
23. n = 5: T (a0 +a2 x 2 +a4 x 4 +a6 x 6 +a8 x 8 ) = (a0 , a2 , a4 , a6 , a8 ).

13 16
1
25. T2 (x) =
1
2 x.
Problems
8 29 3
1
27. T4 (x) = 5 19 2 .
2 8 1
6 13 18
29. Matrix of T4 T3 : 4 8 6 ;
23 43 11
10 25 23
Matrix of T3 T4 : 5 14 15 .
12 19 1
Section 5.5
True-False Review

(a)
7.
9.

1 0 3
.
2 1 2

1 53 43
.
(b)
1 43 13

1 0 2
(a)
.
0 3 1

4 11.5 4.5
(b)
.
0
2.5 6.5
0 1 0 0
(a) 0 0 2 0 .
0 0 0 3
0 0 1 2
(b) 3 3 3 1 .
3 3 3 3
1 0 0 0
1 1 0 0
0 2 1 0
2 0 8 7
(a)
(b)
0 1 2 0 .
2 3 7 2 .
0 0 0 1
3 2 2 0

5 0
T (v) =
.
6 5

5.
(a) 02 .
17.
19. No.
True-False Review
1. False
3. True
5. True
7. False
9. True
5. Vectors along the x-axis are eigenvectors with = 1 and vectors

along the y-axis are eigenvectors with = 1.
7. = 0, : all nonzero vectors are eigenvectors (corresponding to
= 1 or = 1, respectively).
9. 1 = 4, v1 = r(1, 1); 2 = 2, v2 = s(1, 5).
11. = 5, v = r(2, 1).
13. 1 = 1 + 2i, v1 = r(1, 1 i); 2 = 1 2i, v2 = s(1, 1 + i).
15. = 2, v = r(3, 2, 0) + s(1, 0, 1).
17. = 1, v = r(0, 1, 1).
19. = 1, v = r(3, 0, 4) + s(1, 1, 0).
23. 1 = 0, v1 = r(3, 9, 5); 2 = 2, v2 = s(1, 3, 1);

3 = 4, v = t (1, 1, 1).
Problems
3.
13. T (v) = 3.
15. T (p(x)) = 8.
21. 1 = 1, v1 = r(1, 0, 0); 2 = i, v2 = s(0, 1, i);

3 = i, v3 = t (0, 1, i).
1. False
3. False
5. True
1.
11. T (v) =
25. 1 = 2, v1 = r(1, 0, 1) + s(1, 1, 0); 2 = 4, v2 = t (1, 1, 1).

27. 1 = i, v1 = a(0, 0, i, 1) + b(i, 1, 0, 0);
2 = i, v2 = r(0, 0, i, 1) + s(i, 1, 0, 0).

(c) A1 =
29.
2
3
13
1
6
1
6
31. (12, 3).

37.
(a) .
(b) + .
Section 5.7
True-False Review
1. True
3. True
5. True
7. True
Problems
1. 1 = 5, m1 = 1, basis for E1 : {(1, 1)}, n1 = 1;
2 = 1, m2 = 1, basis for E2 : {(2, 1)}, n2 = 1; nondefective.
main
2007/2/16
page 777
i
3. 1 = 3, m1 = 2, basis for E1 : {(1, 1)}, n1 = 1; defective.

5. 1 = 2, m1 = 1, basis for E1 : {(1, 1, 1)}, n1 = 1; 2 = 3, m2 =
2, basis for E2 : {(1, 0, 0), (0, 1, 4)}, n2 = 2; nondefective.
7. 1 = 4, m1 = 3, basis for E1 : {(0, 0, 1), (1, 1, 0)}, n1 = 2; defective.
9. 1 = 2, m1 = 2, basis for E1 : {(1, 2, 0)}, n1 = 1;
2 = 3, m2 = 1, basis for E2 : {(1, 1, 1)}, n2 = 1; defective.

25.
(c) One possible answer:

4 1
;Eigenvectors with 1 = 3: r(1, 1).
1 1
Eigenvectors with 2 = 2: s(1, 4).

1 0
33. One possible answer: S =
.
1 1
Section 5.9
13. 1 = 0, m1 = 2, basis for E1 : {(2, 0, 1), (1, 1, 0)}, n1 = 2;

2 = 2, m2 = 1, basis for E2 : {(1, 1, 1)}, n2 = 1; nondefective.
True-False Review
17. Defective.
31. S =
11. 1 = 1, m1 = 3, basis for E1 : {(3, 0, 4), (1, 1, 0)}, n1 = 2;

defective.
15. 1 = 1, m1 = 2, basis for E1 : {(1, 0, 1), (1, 1, 0)}, n1 = 2;

2 = 2, m2 = 1, basis for E2 : {(1, 1, 1)}, n2 = 1; nondefective.
12 2
5
5
35 13
5
777
1. True
3. False
5. False
19. Nondefective.
21. 1 = 1, basis for E1 : {(1, 1)}; 2 = 5, basis for E2 : {(1, 3)}.
23. 1 = 5, basis for E1 : {(1, 0), (0, 1)}.
25. 1 = 2, basis for E1 : {(1, 1, 0)}.
27. 1 = 2, orthogonal basis for E1 : {(1, 0, 1), (1, 2, 1)}; 2 = 1,
basis for E2 : {(1, 1, 1)}. Vectors in E2 are orthogonal to the
vectors in E1 .
Section 5.8
True-False Review
Problems
7. eAt =
9. eAt
11. eAt
13. eAt
1. True
3. False
15. eAt
5. True
7. True
17. eAt
Problems

1. S =

1 2
, S 1 AS = diag(3, 2).
2 1
3. Not diagonalizable.
15 0 0
5. S = 7 7 1 , S 1 AS = diag(1, 4, 4).
2 1 1
1 1 1
7. S = 1 0 1 , S 1 AS = diag(4, 2, 2).
1 1 0
2 4 + 3i 4 3i
11. S =
1 2 + 6i 2 6i , S 1 AS = diag(0, 3i, 3i).
2
5
5
3 3 1
13. S = 0 1 2 , S 1 AS = diag(2, 2, 1).
1 0 2
15. x1 (t) = c1 e5t 2c2 et , x2 (t) = c1 e5t + c2 et .
17. x1 (t) = c1 e3t + 3c2 et , x2 (t) = c1 e3t 5c2 et .
19. x1 (t) = c1 sin t c2 cos t, x2 (t) = c1 cos t + c2 sin t.
21. x1 (t) = e2t (c1 c2 ) + c3 et , x2 (t) = c1 e2t c3 et ,
x3 (t) = c2 e2t + c3 et .

1
4t
2t 1 4t
2t
2 (e + e ) 2 (e e )
.
1 (e4t e2t ) 1 (e4t + e2t )
2
2 t

e cos 3t et sin 3t
=
.
et sin 3t et cos 3t
2t
2e et 2(et e2t ) et e3t

= e2t et 2et e2t et e3t .
0
0
e3t

1 3t 9t
=
.
t 1 + 3t
1 0 0
.
t
1
0
=
1 t2 t 1
2
1 t 21 t 2 61 t 3
1 2
= 0 1 t 2 t .
0 0 1
t
0 0 0
1
Section 5.10
True-False Review
1. True
3. False
5. True
7. True
Problems
2
5
5 , S T AS = diag(2, 3).
1. S =
2
1
5
5
1 1
2 , S T AS = diag(3, 1).
3. S = 12
1
2
2
1 1 1
3
6
2
0 1 2 , S T AS = diag(0, 0, 6).
5. S =
3
6
1
1 1
3
6
2
main
2007/2/16
page 778
i
778
7. S =
0 1
2
2
1 0 1 , S T AS = diag(1, 1, 1).
2
2
0 1 0
1 1 1
3
6
2
1 , S T AS = diag(1, 1, 2).
1 1
9. S =
3
6
2
2
1
0
3
6
1
1 1
6
2
13
1 1 , S T AS = diag(1, 5, 5).
11. S =
3
6
2
1
0 2
3
6

1
13. Principal axes:

,
, 1 , 1 , 1
2
2
2
2
reduced quadratic form: 4y12 2y22 .
15. Principal axes:

1
1
1
1
1
2
1
1
,
, ,0 , , , , , ,
3
3
3
6
6
6
2
2
reduced quadratic form: 2y12 + 2y22 y32 .
19. v2 = (2, 1).
21.
(a) Basis for E2 : {(1, 1, 0), (1, 0, 1)};
1 1 1
3
6
2
1 .
1 1
S=
3
6
2
1
2
0
3
6
1 + 22 1 + 2 1 2
(b) A = 13 1 + 2 1 + 22 1 + 2 .
1 2 1 + 2 1 + 22
25. 1 = 0,v1 = r(5, 6, 1);
26i, v2 = s(966 31 26i, 26 + 30 26i, 156

2 =
5 26i);
3 = 26i, v3 = t (966 + 31 26i, 26 30 26i, 156

5 26i).

0 1
; v = (0, 1).
0 0

2 1
1 0
=
,S =
.
0 2
1 1
4 1 0
1 1 0
= 0 4 0 , S = 1 0 1 .
0 0 4
1 0 0
5 1 0
1 0 1
=
0 5 0 , S = 1 1 0 .
0 0 6
0 1 1
5 1 0
2 2 1
= 0 5 1 , S = 1 0 0 .
0 0 5
1 1 0
2 1 0 0
1 0 1 1
0 2 0 0
1 0 0 0
=
0 0 2 0 , S = 1 1 0 0 .
0 0 0 3
1 1 0 1
15. A =
17. J
19. J
21. J
23. J
25. J
27. Block sizes: (3, 1, 1).

29. Block sizes: (2, 2, 2, 2).
31. Yes.
1
t +1
1
33. x(t) = c1 et 1 + c2 et t + c3 et 1 .
1
t 1
1

1
0
0
35. x(t) = e4t c1 t + c2 1 + c3 0 .
t
1
t 2 /2
Section 5.12
Additional Problems
1. No.
Section 5.11
3. Yes, onto only, Basis for Ker(T ) = {(1, 2, 0)}, dim[Ker(T )] = 1,

Basis for Rng(T ) = {(1, 0), (0, 1)}, dim[Rng(T )] = 2.
True-False Review
5. Yes, onto only, Basis for Ker(T ) = {(1, 1)}, dim[Ker(T )] = 1,

Basis for Rng(T ) = {1}, dim[Rng(T )] = 1.
1.
3.
5.
7.
9.
11.
True
False
True
True
True
True
Problems
1. 3. Block sizes: (3), (2, 1), (1, 1, 1).
3. 7. Block Sizes: (5), (4, 1), (3, 2), (3, 1, 1), (2, 2, 1),
(2, 1, 1, 1), (1, 1, 1, 1, 1).
5. 75.
7. 20.
9. 3. Block sizes: (3, 3), (3, 2, 1), (3, 1, 1, 1).
11. Block structures: (3; 2), (2, 1; 2), (1, 1, 1; 2), (3; 1, 1),
(2, 1; 1, 1), (1, 1, 1; 1, 1).
13. Block structures: (2; 5), (1, 1; 5), (2; 4, 1), (1, 1; 4, 1), (2; 3, 2),
(1, 1; 3, 2), (2; 3, 1, 1), (1, 1; 3, 1, 1), (2; 2, 2, 1), (1, 1; 2, 2, 1),
(2; 2, 1, 1, 1), (1, 1; 2, 1, 1, 1), (2; 1, 1, 1, 1, 1), (1, 1; 1, 1, 1, 1, 1).
7. Yes, one-to-one only, Basis for

=
Ker(T ) =
, dim[Ker(T
)]
1 0
1 0
0 0
0, Basis for Rng(T ) =
,
,
,
1 0
0 2
3 0
dim[Rng(T )] = 3.
9. Yes, neither, Basis for Ker(T ) = {(0, 1, 2)}, dim[Ker(T )] = 1,
Basis for Rng(T ) = {x 2 + 1, 2x 2}, dim[Rng(T )] = 2.
11. T (x, y, z) = (x + 8y, 2x 2y 5z).
13. T (x) = ( 21 x, 25 x, 0, x).

2a 5b c
a 2b + 2c
15. T (a + bx + cx 2 ) =
.
a 1.5b 2.5c 3a 8.5b 0.5c
17. 6.
1 1 1
23. S = 0 0 2 ; D = diag(4, 1, 1).
1 2 0
1 1 0
29. J = 0 1 0 .
0 0 3
main
2007/2/16
page 779
i
31. Block sizes: (5), 1 linearly independent eigenvector, maximum cycle length: 5; (4, 1), 2 linearly independent eigenvectors, maximum
cycle length: 4; (3, 2), 2 linearly independent eigenvectors, maximum cycle length: 3; (3, 1, 1), 3 linearly independent eigenvectors,
maximum cycle length: 3; (2, 2, 1), 3 linearly independent eigenvectors, maximum cycle length: 2; (2, 1, 1, 1), 4 linearly independent
eigenvectors, maximum cycle length: 2; (1, 1, 1, 1, 1), 5 linearly
independent eigenvectors, maximum cycle length: 1.
35. False.
37. False.
41. 1 2 k .
9. y(x) = e2x (c1 + c2 x).
11. y(x) = e5x (c1 + c2 x).
13. y(x) = e4x (c1 cos 2x + c2 sin 2x).
15. y(x) = c1 e4x + c2 e2x .
17. y(x) = c1 ex + c2 cos x + c3 sin x.
19. y(x) = c1 e2x + c2 e4x + c3 e4x .
21. y(x) = c1 ex + c2 cos 2x + c3 sin 2x + x(c4 cos 2x + c5 sin 2x).

23. y(x) = c1 + c2 x + c3 ex .
25. y(x) = c1 e2x + c2 e2x + c3 cos 2x + c4 sin 2x.

27. y(x) = c1 ex + c2 e5x + e2x (c3 cos x + c4 sin x).
29. y(x) = c1 ex + c2 ex + ex (c3 cos x + c4 sin x) + xex (c5 cos x +

c6 sin x).
Chapter 6
Section 6.1
31. y(x) = c1 cos 3x + c2 sin 3x + x(c3 cos 3x + c4 sin 3x) +

x 2 (c5 cos 3x + c6 sin 3x).
True-False Review
1.
3.
5.
7.
779
33. y(x) = e2x (3 cos x sin x).
True
False
True
True
35. y(x) = 2(e2x e2x xe2x ).

37. y(x) = emx (c1 ekx + c2 ekx ).
39.
(b) u(x, y) = ex/ [ep (A sin q + B cos q ).
41. All roots must have negative real part.
Problems
1. L(2x 3e2x ) = 2(1 x 2 ) + 3e2x (x 2).
3. L(2x 3e2x ) = 24e2x (x 1).
Section 6.3
True-False Review
9. Ker(L) = {cex : c R}.

11. Ker(L) = {c1 e5x + c2 e3x : c1 , c2 R}.
13. L1 L2 = D 2 + (1 2x 2 )D 2x(x + 2),
L2 L1 = D 2 + (1 2x 2 )D 2x 2 .
15. L2 = D + a1 (x) + c, where c is a constant.
17. (D 2 + 4xD 6x 2 )y = x 2 sin x, y + 4xy 6x 2 y = 0.
21. y(x) = c1 e2x + c2 e5x .
23. y(x) = c1 + c2 e4x .
25. y(x) = c1 e2x + c2 e2x + c3 e3x .
27. y(x) = c1 + c2 ex + c3 e2x .
29. y(x) = c1 ex + c2 + c3 ex + c4 e2x .
31. y(x) = c1 x 2 + c2 x 4 .
33. y(x) = c1 x + c2 x 2 + c3 x 1 .
35. y(x) = c1 e3x + c2 e2x + 3e3x .
1 e3x .
37. y(x) = c1 e2x + c2 ex + c3 ex + 10
3 e4x .
39. y(x) = c1 + c2 e2x + c3 e3x 168
Section 6.2
True-False Review
1.
3.
5.
7.
False
True
False
True
Problems
1.
3.
5.
7.
{ex , e3x }.
{e3x cos 4x, e3x sin 4x}.
y(x) = c1 ex + c2 e2x .
y(x) = e3x (c1 cos 4x + c2 sin 4x).
1. False
3. True
5. False
7. False
Problems
1. D 2 (D 1).
3. (D 2 + 16)(D 7)4 .
5. (D 2 2D + 5)(D 2 + 4).
7. (D 2 10D + 26)3 .
9. (D 4)2 (D 2 8D + 41)D 2 (D 2 + 4D + 5)3 .
11. (D 2 + 9)2 .
13. D 5 + 20D 3 + 64D.
15. D 3 + 64D.
17. y(x) = e2x (c1 + c2 x + 56 x 3 ).
19. y(x) = c1 e2x + c2 ex + 53 xe2x .
21. y(x) = c1 e2x + c2 e3x 7xe2x .
1 cos 4x + 1 .
23. y(x) = c1 cos 6x + c2 sin 6x + 80
48
10
2 2
25. y(x) = c1 e2x + c2 ex + c3 e3x 37
27 + 9 x 3 x .
27. y(x) = ex (c1 + c2 x + c3 x 2 + 13 x 3 ) + 19 e2x .

29. y(x) = c1 ex + c2 ex + c3 e2x + 21 e3x .
6 cos x 2 sin x.
31. y(x) = c1 e3x + c2 e2x + c3 e2x 25
25
33. y(x) = ex (c1 + c2 x + c3 x 2 + 56 x 3 ).
35. yp (x) = x 2 e2x (A0 cos 3x + B0 sin 3x).
37. yp (x) = A0 xex + x 2 (A1 sin 2x + B1 cos 2x).
39. yp (x) = A0 xe3x + xe2x (A1 sin x + B1 cos x).
main
2007/2/16
page 780
i
780
Section 6.4
True-False Review
1. True
3. False
5. False
Problems
1. yp (x) = (3 cos 3x + 4 sin 3x).
3. yp (x) = (12 cos 3x + 5 sin 3x).
3 ex (2 sin 2x cos 2x).
5. yp (x) = 10
7. yp (x) = ex [2 sin x 14 cos x 10x(2 sin x + cos x)].
9. yp (x) = 4xex sin 3x.
F
cos t, if 0 = ;
11. yp (t) = 2 0
0 2
F
yp (t) = 0 t sin 0 t, if = 0 .
20
3. True
5. False
Problems
1. iS (t) = 2(3 cos 3t + 2 sin 3t).
2
5. i(t) = A0 e3t [3 cos(t )+sin(t )]
sin(t ), where
H

2
10
3
1
(10 2 )2 + 362 , cos =
, sin =
. The
H =
2
2H
H
maximum value of the amplitude occurs when = 10.

aCE0
7. i(t) = A0 eRt/(2L) cos(t ) 2
eat ,
(a
LC
aCR + 1)

(4L/C) R 2
.
where =
2L
Section 6.7
True-False Review
Section 6.5
1. True
True-False Review
3. False
1.
3.
5.
7.
9.
True
True
False
True
True
Problems
1. 0 = 2, A0 = 2 2, = /4, T = .
3.
(a) k = 3.
3/2, A0 = 2 3/3, = 5/6,

(b) 0 =
T = 4 3/3.
5. Overdamped, y(t) = e2t (2et 1).
7. Critically damped, y(t) = et (t 1).
9. Underdamped, y(t) = 23 e2t (3 cos 3t + 5 3 sin 3t).

11. t = ln 2; Max. displacement: 1/27.
13.
(a) y(t) = et + 2e2t .
(b) ln 2.
1 cos 2g t.
17. (t) = 10
19. L 0.993 m.
23.
(a) Underdamped.
(b) y(t) = 2et cos 2t 4 cos 2t + sin 2t; Transient part:
2et cos 2t, Steady-state part: 4 cos 2t + sin 2t.
25. yp (t) = 10 sin(t tan1 (3)).

31.
(a) Transient part: et (c1 cos 2t + c2 sin 2t), Steady-state part:
40 82
16
cos t + 4
sin t.
4 62 + 25
62 + 25
(b) = 3, yp (t) = 2 cos( 3t /3).

33. y(t) = A0 cos(4t ) + et (8 cos t sin t); Transient part:
et (8 cos t sin t), Steady-state part: A0 cos(4t ).
Section 6.6
True-False Review
1. True
Problems
1. y(x) = e3x [c1 + c2 x + 2x tan1 x ln(x 2 + 1)].
3. y(x) = e2x [cos x(c1 ln | sec x + tan x|) + c2 sin x].
5. y(x) = e2x (c1 + c2 x ln x).
7. y(x) = c1 ex + c2 ex + 4 tan1 (ex ) cosh x.
9. y(x) = ex [c1 + c2 x + x 1 (2 ln x + 3)].

cos 4x + 2
11. y(x) = ex c1 cos 4x + c2 sin 4x + cos 4x ln
+
cos 4x 2

sin
4x
4
.
sin 4x tan1
3
3
13. y(x) = e5x [c1 + c2 x ln(4 + x 2 ) + x tan1 (x/2)].
15. y(x) = c1 cos x + c2 sin x + 2ex + cos x ln(cos x) + x sin x.
17. y(x) =
2 2x (2 ln x 3).
c1 e2x + c2 xe2x + 3 cos x + 4 sin x + 15
4 x e
19. yp (x) = x 3 e2x (6 ln x 11).
21. yp (x) = ex [x + (x 2 1) tan1 x x ln(1 + x 2 )].
x
sinh(x t)F (t) dt.
23. yp (x) =
x0

1 x tx
[e
e4(tx) ]F (t) dt.
25. yp (x) =
3 x0
27. y(x) = sin x + x sin x + [ln (cos x)] cos x.

1
x
x2 + 2
29.
(a) yp (x) = eax
.
tan1 (x/) ln
2
2

(b) yp (x) = eax [x sin1 (x/) + 2 x 2 2 ].
xeax
[(ln x)2 2 ln x 2];
2
= 2: yp (x) = eax [(ln x)2 /2 + ln x + 1].
= 1, 2:

eax x +2
2 + 3
ln x
.
yp (x) =
( + 1)( + 2)
( + 1)( + 2)
(c) = 1: yp (x) =
main
2007/2/16
page 781
i
x

1
F (t) e3(xt) + 3e5(xt) 4e3(xt) dt.
48 x0
x

1
F (t) e4(xt) [6(t x) 1] + e2(xt) dt.
35. yp (x) =
36 x0

1 x F (t) e4(xt) + 5e2(xt) 6ext dt
37. y + p(x) = 30
x
33. yp (x) =
Section 6.8
True-False Review
1. False
3. False
5. True
781
13. y(x) = c1 e3x + c2 e2x + c3 xe2x .

15. D 2 6D + 10.
17. (D + 2)(D 2 + 1)2 .
19. yp (x) = A0 e2x .
21. yp (x) = A0 cos 4x + B0 sin 4x.
23. yp (x) = x 3 (A0 cos x + B0 sin x).
22 x + 6 x 2 + 1 x 3 .
25. y(x) = c1 + e3x (c2 cos 4x + c3 sin 4x) + 15625
625
75
27. y(x) = c1 e2x + c2 e2x 53 ex .

29. y(x) = c1 ex + c2 ex + 2xex .
31. Annihilators cannot be used.
33. Annihilators cannot be used.
Problems
1.
3.
5.
7.
9.
11.
15.
17.
19.
21.
23.
y(x) = x[c1 sin(2 ln x) + c2 cos(2 ln x)].

y(x) = x 2 (c1 + c2 ln x).
y(x) = x 1 (c1 + c2 ln x).
y(x) = c1 x 7 + c2 x 5 .
y(x) = c1 x m + c2 x m .
y(x) = x m [c1 cos(k ln x) + c2 sin(k ln x)].
y(x) = c1 x 3 + x 2 (c2 sin x).
y(x) = x 2 [c1 + c2 ln x + ln x(ln | ln x| 1)].
y(x) = c1 cos(3 ln x) + c2 sin(3 ln x) + ln x.
y(x) = yc (x) + yp (x), where yc (x) = c1 x m + c2 x m ln x, and
x m (ln x)k+2
if k = 1, 2,
(k + 1)(k + 2) ,
yp (x) =
m
(ln | ln x| 1)x ln x, if k = 1,
m
x (1 + ln | ln x|),
if k = 2.
35. yp (x) = A0 x 2 e4x .

37. yp (x) = A0 cos x + B0 sin x + A1 ex cos x + A2 ex sin x.
39. yp (x) = A1 eat + A2 teat + A0 teat cos bt + B0 teat sin bt.
41. y(x) = c1 ex + c2 e3x 18 xe3x 41 x 2 e3x .
43. y(x) = c1 cos 2x + c2 sin 2x + 2x sin 2x.
45. y(x) = c1 ex + c2 ex + e2x 21 sin x.
47. y(x) = c1 cos x + c2 sin x x cos x + (ln | sin x|) sin x.

49. y(x) = c1 emx + c2 xemx emx 21 x 2 ln x 41 x 2 +
xemx [x ln x x].

51. y(x) = c1 ex + c2 xex ex 21 x 2 ln x 41 x 2 + xex [x ln x x].
53. y(x) = c1 x 4 + c2 x 4 ln x.
55. y(x) = c1 x 6 cos x + c2 x 6 sin x.
(b) t = e(6n+5)/30 .
57. y(x) = c1 x 6 + c2 x 3 .
(d) No.
59. y(x) = c1 x 4 + c2 x 4 ln x x 4 [x ln x x] + x 3 ln x.
Section 6.9
Problems
1. y2 (x) = x 2 ln x.
3. y2 (x) = ex ln x.

1+x
1
5. y2 (x) = x ln
1.
2
1x
m
7.
(a) y1 (x) = x .
(b) y2 (x) = x m ln x.
11. y(x) = e2x [c1 + c2 x + x 2 (2 ln x 3)].
13. y(x) = c1 cos x + c2 sin x + sin x[ln(sin x) x cot x].
15. y(x) = x 2 (c1 + c2 ln x + 2x 2 ).
Section 6.10
61. y(x) = c1 x 3 cos x + c2 x 3 sin x + x 3 cos x(x cos x sin x) +

x 3 sin x(x sin x + cos x).
63. yp (x) = e2x (x ln x x) + xe2x (ln x)2 /2.
4 5x
65. yp (x) = x 4e e5x (x 3 3x 2 + 6x 6).
Chapter 7
Section 7.1
True-False Review
1. True
3. False
5. True
7. False
Additional Problems
3
1. 3ex [3x 4 + 2x + 1].
4
3. x sin x + 4x cos x 8 sin x.
5. 23 + x2 + 5x + 480x 2 40x 3 + 480x 4 + 200x 6 cosx x .
x
7. y(x) = c1 ex + c2 e2x + c3 xe2x .
9. y(x) = c1 cos 2x + c2 sin 2x + c3 cos 3x + c4 sin 3x.

11. y(x) = c1 e3x +c2 xe3x +c3 x 2 e3x +e2x (c4 cos 3x+c5 sin 3x).
9. False
Problems
1. x1 (t) = c1 et + c2 et , x2 (t) = 13 (c1 et + 3c2 et ).
3. x1 (t) = e2t (c1 + c2 t), x2 (t) = 41 e2t [4c1 + c2 (1 4t)].
5. x1 (t) = et (c1 cos 3t + c2 sin 3t), x2 (t) = et (c1 sin 3t c2 cos 3t).
main
2007/2/16
page 782
i
782
7. x1 (t) = e2t (2c1 + c2 cos t + c3 sin t),

x2 (t) = e2t [c1 + c2 (cos t sin t) + c3 (sin t + cos t)],
x3 (t) = e2t (c1 + c2 cos t + c3 sin t).
9. x1 (t) = 5 sin t, x2 (t) = cos t 2 sin t.
11. x1 (t) = c1 et + c2 e3t + 3e4t , x2 (t) = c1 et + c2 e3t + 2e4t .
13. x1 (t) = c1 e2t + c2 e2t + 2te2t ,
x2 (t) = c1 e2t 3c2 e2t + e2t (1 + 2t).
15. x1 = x2 , x2 = x1 + 3x4 + sin t, x3 = x4 , x4 = tx2 + et x3 + t 2 .
17. x1 = x2 , x2 = bx1 ax2 + F (t).
(k + k2 )
k
k
19. x1 = x2 , x2 = 1
x1 + 2 x3 , x3 = x4 , x4 = 2 x1
m1
m1
m2
k2
x3 , x1 (0) = 1 , x2 (0) = 2 , x3 (0) = 3 , x4 (0) = 4 .
m2
Section 7.2
True-False Review
1.
3.
5.
7.
True
False
False
False
Section 7.3
True-False Review
1. False
3. True
0
sin t
cos t
7. x(t) = c1 e5t 0 + c2 cos t + c3 sin t .
1
0
0
9. x(t) = c1 e3t
Section 7.4
True-False Review
1. True
3. False
5. True
5 cos t sin t
cos t + 5 sin t
2t
c 13(cos t + sin t) + c3 13(cos t sin t) .
e
2
26 cos t
26 sin t

3
1
1
13. x(t) = c1 0 + c2 2 + c3 e4t 1 .
2
0
1
15. x(t)
0
0
0
0
c1
sin t + c2 cos t
cos t
sin t
sin t
cos t
+ c3
0
0
cos t
sin t
c4
0 .
0

17. x(t) = e2t

19. x(t) =

2 cos 3t 6 sin 3t
.
2 cos 3t + 4 sin 3t

cos 4t + sin 4t
.
sin 4t + cos 4t
Section 7.5
True-False Review
1. False
3. False
Problems

1
1 2t
1. x(t) = e2t c1
+ c2
.
1
2t

1
1
1+t
3. x(t) = c1 et 1 + et c2 1 + c3 t .
1
1
t 1
Problems

7
1
1. x(t) = c1 e3t
+ c2 e5t
.
1
1

3 cos t sin t
cos t + 3 sin t
3. x(t) = e2t c1
+ c2
.
5 cos t
5 sin t

0
1
0
5. x(t) = c1 e2t 1 + c2 e2t 0 + c3 e3t 7 .
1
0
2
11. x(t) = c1 e3t 0 +
Problems
4t
t
e
3e
1. General solution: x(t) = c1
+
c
.
2
et
2e4t

4t
1
e 3et
.
Particular solution: x(t) =
1
2e4t et
3 e2t e4t
c1
3. General solution: x(t) = 9 3e2t e4t c2 .
c3
5 e2t e4t

t sin t
t cos t
5. General solution: x(t) = c1
+ c2
.
cos t
sin t
1
1
2
t
2t
0 + c2 e
2 + c3 e
10 .
1
1
3
5. x(t) = e2t c1 0 + c2 1 + c3
1
1
t .
t

2
0
0
7. x(t) = e4t c1 0 + c2 1 + c3 2t .
1
t
t2

main
2007/2/16
page 783
i

0
1
t
x(t) = e4t c1 0 + c2 1 + c3 1 + t .
1
0
0
5(2 sin t cos t)

5(2 cos t + sin t)
5(2 cos t + sin t)
5(cos t 2 sin t)
x(t) = c1
2(cos t + 2 sin t) + c2 2(cos t sin t)
5 cos t
5 sin t

0
0
0

+ c4 0 .
+ e2t c3
1
t
0
1
0
0
0
0
0
cos t
x(t) = c1
sin t + c2 cos t + c3 cos t t sin t +
cos t
sin t
sin t + t cos t
cos t
sin t
c4
sin t + t cos t .
t sin t cos t
7 2t 9et
t
.
x(t) =
e
3 t 2et

9.
11.
13.
15.
783
Section 7.7
True-False Review
1. False
3. False
5. False
Problems
3. x(t) = 2(c1 sin t c2 cos t c3 sin 3t + c4 cos 3t),
y(t) = 3c1 sin t 3c2 cos t + c3 sin 3t c4 cos 3t.
9. A1 (t) = 120 50et/5 10et/15 ,
A2 (t) = 120 + 100et/5 20et/15 .
+ 2
1 2 2 t
+
e ,
(c) A1 = 1
1+
1+
1 + 2
2 1 2 t
+
e .
A2 =
1+
1+
11.
Section 7.8
Section 7.6
True-False Review
True-False Review
1. False
3. True
5. False
Problems
t

e (2t + 1)
1. xp (t) =
. General solution:
t
e (2t 1)

t

1
1
e (2t + 1)
+ c2 e3t
x(t) = c1 et
+ t
.
1
1
e (2t 1)
t 2t

4e (2e 1)
. General solution:
3. xp (t) =
4et (3e2t 2)

t 2t

1
1
4e (2e 1)
x(t) = c1 e2t
+ c2 e2t
+
.
1
3
4et (3e2t 2)

(12t + 1) sin 2t + (1 4t) cos 2t
. General solution:
5. xp (t) =
(8t 1) cos 2t 4t sin 2t

cos 2t + sin 2t
cos 2t + sin 2t
x(t) = c1
+ c2
+
cos 2t
sin 2t

(12t + 1) sin 2t + (1 4t) cos 2t
.
(8t 1) cos 2t 4t sin 2t
tet
. General solution:
7. xp (t) = 9et
tet + 6et

0
2
1
2t
t
t
x(t)
=
c1 e
2
+ c2 e
1
+ c3 e
0 +
1
0
1
tet
9et
.
tet + 6et
1. True
3. True
5. True
Problems

1 t
.
0 1

1 + 2t
t
, x2 (t) = et
, eAt =
x1 (t) = et
4t
1 2t

1 + 2t t
et
.
4t 1 2t

1
0
2t
3t
0 , x2 (t) = e
1 + 4t , x3 (t) =
x1 (t) = e
0
2t
2t
e
0
0
0
3t
At
3t
3t
.
e
8t
,e =
0 e (1 + 4t) 8te
1 4t
0
2te3t
e3t (1 4t)

7
1
t
t
3t
4 + e c2 0 + c3 1 .
x(t) = c1 e
1
1
t
sin t
cos t
cos t
sin t
,
, x (t) =
x1 (t) =
t sin t 2
t cos t
t cos t
t sin t
0
0
0
0
x3 (t) =
sin t , x4 (t) = cos t .
cos t
sin t
3. eAt = e2t
5.
7.
9.
11.
main
2007/2/16
page 784
i
784
Section 7.9
11.
True-False Review
1. False
3. True
5. True
13.
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
(0, 0), (1, 0), ( 13 , 23 ).

(0, 0), (1, 0), (1, 0).
Stable center.
Saddle.
Stable node.
Stable center.
Unstable spiral.
Unstable node.
Stable degenerate node.
Unstable proper node.
Section 7.10
15.
17.
19.
21.
True-False Review
23.
1. True
3. False
5. False
Problems
1.
3.
5.
7.
9.
(0, 0), center or spiral.

(0, 0), saddle; ( 49 , 23 ), unstable spiral; ( 49 , 23 ), unstable spiral.
(0, 0), unstable node.
(0, 0), unstable spiral; ( 21 , 1), saddle.
(0, 0), unstable degenerate node.
Section 7.11
27.
29.
Additional Problems

1
1
+ c2 e8t
.
3
2

1
1
1
+ c2 e6t
+t
.
5. x(t) = c1 e6t
3
1
1
4

0
1
2t
t
1 + c2 e
7. x(t) = c1 e
0 +
0
1

1
1
0+t 0 .
c3 et
3/4
1

3 cos 2t 2 sin 2t
2 cos 2t + 3 sin 2t
9. x(t) = c1
+ c2
.
cos 2t
sin 2t
3. x(t) = c1 e3t
25.
1
5 cos 2t
x(t)
=
c1 e3t 0 + c2 e5t 4 cos 2t + 2 sin 2t +
4
0
5 sin 2t
c3 e5t 2 cos 2t 4 sin 2t .
0

4
0
0
x(t) = c1 e2t 1 + c2 e2t 1 + c3 e5t 2 .
2
2
3
2
0
3
4t
4t
3t
x(t) = c1 e
0 + c2 e
1 + c3 e
1 .
1
0
1
1
t
2
x(t) = c1 0 + c2 1 + c3 e3t 1 .
1
1+t
2
2
sin 2t
t
t
+
x(t)
=
c1 e 1 + c2 e cos 2t
2
cos 2t sin 2t
cos 2t
t
.
sin 2t
c3 e
cos 2t sin 2t
2
t2
1
t
x(t) = c1 et 0 + c2 et 1 + c3 et 2 t .
2
t
1
1+t
1+t + 2
3 sin 3t 2 cos 3t
3 cos 3t 2 sin 3t
cos 3t
sin 3t
+ c2
x(t) = c1
0
0
0
0

0
0
0

+ c4 e2t 0 .
+ c3 e2t
4
4t
0
1
5

1
t
+ 14 e
xp (t) = 24
. General solution: Add xp to Problem 3
1 + 5 et
4
14
answer.

4t (1 ln |t|)
xp (t) = e6t
. General solution: Add xp to
ln |t| + 4t (1 ln |t|)
Problem 5 answer.
t
1
2 + 4
t
3
xp (t) =
4 35 . General solution: Add xp to Problem 13
t
13
2 35
answer.
Chapter 8
Section 8.1
True-False Review
1. False
3. True
5. False
7. False
9. False
main
2007/2/16
page 785
i
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
23.
25.
27.
29.
31.
33.
35.
1
.
s2
b
.
s 2 + b2
s
.
s 2 b2
2
.
s2
1
(1 2e2s ).
s
1
.
(s 1)2 + 1
2
1
.
s3
s2
s
.
s 2 b2
5s
6
3
2
+ 2
.
s3
s +4
s +9
4
2
5
+
.
2
s+3
s1
s +1
2
2
4(s + 2b )
.
s(s 2 + 4b2 )
Piecewise continuous.
Not piecewise continuous.
Piecewise continuous.
Not piecewise continuous.
1
[1 es (s + 1)].
s2
1 2s s
e
[e (s + 1) (2s + 1)].
s2
s
b
L[eibt ] = 2
+ 2
i.
s + a2
s + a2
Section 8.2
True-False Review
1. True
3. False
5. False
Problems
7.
9.
11.
13.
15.
17.
19.
2.
5e3t .
2 cos 3t.
cos t + 6 sin t.
2 3et .
1 et .
1 (7e2t 7 cos t 4 sin t).
5
21. 16 (4 cos t + 6 sin t 4 cos 2t 3 sin 2t).
Section 8.3
785
Problems
1
[1 es (s + 1)].
1. F (s) = 2
s (1 es )
3. F (s) =
1 + es
.
(1 es )(s 2 + 1)
e1s 1
.
(1 s)(1 es )

2 es/2 (s + 2)
ses/2 + es
1
+
.
7. F (s) =
1 es
s 2
s2 + 1
5. F (s) =
9. F (s) =
11. F (s) =
as
1
tanh
.
2
2
as
s .
s 2 +a 2
Section 8.4
True-False Review
1. False
3. True
Problems
1. y(t) = 2e3t .
3. y(t) = 2t 1 + 2e2t .
5. y(t) = et sin 2t 2 cos 2t.
7. y(t) = 2et e2t .
9. y(t) = 2 + 3e2t 5et .
11. y(t) = 2et + 3e2t 5et .
13. y(t) = 3e2t + 2e3t 4.
15. y(t) = 2 cos 2t + sin 2t + 2et .
17. y(t) = 27 et 21 et 3 cos t.
19. y(t) = et 2et 4 sin t + 3 cos t.
21. y(t) = 2et e4t 2 cos 2t.
23. y(t) = 15 (7e2t 5et + 3 cos t 4 sin t).
25. y(t) = 2(cos t + sin t cos 2t).
27. y(t) = y(0) cosh t + y (0) sinh t.
29.
(a) i(t) =
E0
[1 e(R/L)t. ].
R
True-False Review
1.
3.
5.
7.
False
False
False
False
E L
E0
sin(t ) + 2 0 2 2 eRt/L ,
(b) i(t) =
R +L
R 2 + L2 2
where tan = L/R.
31. x1 (t) = 2(e3t e2t ), x2 (t) = 2e2t e3t .
main
2007/2/16
page 786
i
786
Section 8.5
Section 8.7
True-False Review
True-False Review
1.
3.
5.
7.
True
True
False
True
1. False
3. True
5. True
7. False
Problems
1.
3.
5.
7.
9.
11.
13.
15.
17.
19.
21.
23.
25.
27.
29.
31.
33.
t 1.
t (t + 2).
e2(t) cos t.
1 (t/6) (sin 2t 3 cos 2t).

2e
t 1
.
t 2 6t + 10
2
t .
te3t .
(t + 3)et .
s3
.
(s 3)2 + 16
1
.
(s 2)2
6
.
(s + 4)4
2(2s 3 9s 2 + 10s + 30)
.
[(s 3)2 + 1][(s + 1)2 + 9]
2
6
3.
(s 1)3
s
te3t .
2
.
e3t t
e2t cos 3t.
5 2t
4 e sin 4t.
35. 15 et (5 cos 5t 3 sin 5t).

37. 21 et (2 cos 2t sin 2t).
39. 1 e2t (1 + 2t).

1 [6 + et (13 sin 2t 6 cos 2t)].
41. 10
43.
45.
47.
49.
y(t) = e2t (1 + 3t) + e2t .

y(t) = 2et + e2t (1 t).
y(t) = et (2 + 3t + t 2 ).
1 e2t (12t 7).
y(t) = 73 et 47 e2t + 12
51. y(t) = 2et + et et (sin 2t + cos 2t).

53. x1 (t) = e2t cos t, x2 (t) = e2t sin t.
Problems
1
1. F (s) = 2 es .
s
es/4
.
s2 + 1
2
5. F (s) = 3 e2s .
s

s 2 + 2s + 2 2s
7. F (s) =
.
e
s3
3. F (s) =
9. F (s) =
3
es .
(s + 2)2 + 9
11. f (t) = (t 2)u2 (t).

13. f (t) = e4(t3) u3 (t).
15. f (t) = u3 (t) sin(t 3).
17. f (t) = 15 u1 (t)[e4(t1) e(t1) ].
19. f (t) = [cos 3(t 1) + 2 sin 3(t 1)]u1 (t).
21. f (t) = 21 u2 (t)(t 2)2 e3(t2) .
23. f (t) = e2(t1) [2 cos(t 1) 5 sin(t 1)]u1 (t).
25. f (t) = [2e(t3) (5t 13) 4 cos 2(t 3) 3 sin 2(t 3)]u3 (t).
27. y(t) = 2e2t u2 (t)[e(t2) e2(t2) ].

29. y(t) = 3e2t + 41 u (t) e2(t) cos 2t + sin 2t .
u (t)
1 3t
21e cos t 3 sin t + 2
e3(t 2 ) 10
10
3

+ 9 sin t + 3 cos t .
31. y(t) =
33. y(t) = 2 cosh t + u1 (t)[cosh(t 1) 1].

35. y(t) = 2 sinh 2t + 41 u1 (t)[cosh 2(t 1)
1] 41 u2 (t)[cosh 2(t 2) 1].
Section 8.6
37. y(t) = 2et e2t + u/4 (t)[5e(t/4) 2e2(t/4)

3 cos(t /4) + sin(t /4)].
True-False Review
39. y(t) = e2t (2 cos t + 5 sin t)

+ u3 (t) 1 e2(t3) [cos(t 3) 2 sin(t 3)] .
1. False
3. True
Problems
7.
9.
11.
13.
f (t) = 3 4u1 (t).

f (t) = 2 u2 (t) 2u4 (t).
f (t) = t + 2(3 t)u3 (t) (6 t)u6 (t).
f (t) = 1 + (sin t 1)u/2 (t) (sin t + 1)u3/2 (t).
41. y(t) = 2e t + u1 (t)[e(t1)

+ t 2]

2u2 (t) e(t2) + t 3 + u3 (t) e(t3) + t 4 .
43. y(t) = 3et 1 t 21 u1 (t)[3et1 + e(t1) 2 2t].
45. y(t) = 3et 2 + 3u1 (t)(1 et1 ).
1
20 at
47. i(t) =
+ u10 (t)
e
(aea(t10) e(t10) )
R
a1

eat , where a = 1/RC.
main
2007/2/16
page 787
i
Section 8.8

1
1 t
f (t ) sinh a d + (a cosh at + sinh at).
a 0
a

1 t
a
31. y(t) =
f (t )ea sin b d +eat cos bt +
sin bt .
b 0
b
29. y(t) =
True-False Review
1. True
3. False
5. False
33. x(t) = e3t + et .

35. x(t) = 2 cosh t 1.
Problems
1. y(t) = e2t + u2 (t)e2(t2) .
3. y(t) = 13 (e5t et ) + u3 (t)e5(t3) .
5. y(t) = 21 [sinh 2t + u3 (t) sinh 2(t 3)].
7. y(t) =
2 2(t/4)
2t
e (3 cos 3t 2 sin 3t)
e
(sin 3t + cos 3t)u/4 (t).
6
9. y(t) = 5e3t (cos 2t + 2 sin 2t) 21 e3(t/4) u/4 (t) cos 2t.
11. y(t) = 47 (cos 3t cos 4t) + 41 u/3 (t) sin[4(t /3)].
5
F
13. y(t) = 0 (cos 2t cos 3t) u1 (t) sin[2(t 1)].
5
2
15. y(t) =
F0
A
( sin 0 t 0 sin t) +
ut (t) sin[0 (t t0 )].
0 0
0 (2 2 )
0
4
37. x(t) = 2 + et sin 3t.
3
Section 8.10
Additional Problems
3
4
1. F (s) = 2 .
s
s
8
3. F (s) = 3 .
s
5. F (s) =
7
.
(s + 1)2
7. F (s) =
s
1
.
2s
2(s 2 + 4a 2 )
9. F (s) =
s+1
(4s 2 + 5s + 2)e3s
+ 2 .
s3
s
Section 8.9
True-False Review
1.
3.
5.
7.
787
True
False
False
True
360
5s
7
7 .
11. F (s) = 2
s+1
s
s +4
13. F (s) =

15.
Problems
1
1. t 2 .
2
3. et 1 t.
5. et (1 cos t).
1
9. 2 2
.
s (s + 1)
s
.
11.
(s 2 + 1)(s 2 + 4)
4
13. 3
.
s [(s 3)2 + 4]
15. 1 et .
17. 13 e2t sin 3t.

0,
if t < ,
19.
t + sin t, if t .
t
21.
e(t+2 ) cos(t ) d .
0
0 t < /2,
0,
t
23.
4(t
)
e
cos[3(t )] cos 4 d, t /2.
/2
t
e sin(t ) d + sin t.
25. y(t) =
0
1
1 t
f (t ) sin 4 d + (4 cos 4t + sin 4t).
27. y(t) =
4 0
4
s3
2
.
(s 3)2 + 25
(s + 1)2 + 4
.
s+5
17. F (s) =
2
2e(s+1)
(1 es ) +
.
s
s+1
2
19. F (s) = 3
.
s (s 1)
21. f (t) = 4 cos 3t + 53 sin 3t.
23. f (t) = 18 [1 cos 4t].
25. f (t) = 18 [2 + 3e2t sin 4t 2e2t cos 4t].
27. f (t) = 1 + uln 2 (t)[2et 1]; L[f ] =
1
1
.
s
s(s + 1)2s
13 e4t + 13 e2t 5 .
35. y(t) = 24
12
8
37. y(t) = 1 + sin t cos t u/2 (t)[1 cos(t /2).

39. y(t) = u4 (t)(t 4)e(t4) .
41. x1 (t) = 41 e3t + 43 et , x2 (t) = 41 e3t 43 et .
43. x1 (t) = e2t 4te2t , x2 (t) = e2t + 4te2t .
45. x(t) = 2t + t 3 /3.
47. x(t) = 2 + 4t 2 + 2 cos
2t.
main
2007/2/16
page 788
i
788
Chapter 9
1 x4 + 1 x5 + ,
15. y1 (x) = 1 + 21 x 2 + 16 x 3 + 12
24
1 x 4 + 1 x 5 + , R = .
y2 (x) = x + 61 x 3 + 12
30
Section 9.1
17.
(a) No.
True-False Review
1.
3.
5.
7.
9.
(b)
True
False
True
True
False
R
R
R
R
R
n=0
13 x 4 + 1 x 5 + 1 x 6 + . . . ).
(3x 2 + x 3 + 24
10
120
Section 9.3
True-False Review
1. False
3. True
5. False
Section 9.2
Problems
True-False Review
True
False
True
False
True
1. = 3 : y2 (x) = a1 x(1 53 x 2 ); = 4 : y1 (x) = a0 (1 10x 2
3
5 2
3
4
2 35 4
+ 35
3 x ); P3 (x) = 2 x(1 3 x ); P4 (x) = 8 (1 10x + 3 x ).
6
2
4
5. 2x 3 + x 2 + 5 = 16
3 P0 + 5 P1 + 3 P2 + 5 P3 .
Problems

n=0
3. y1 (x) = 1 +
Section 9.4
True-False Review
5. y1 (x) =
y2 (x) =
7. y1 (x) =
y2 (x) =
9. y1 (x) =
n=0
(2)n
x 2n ,
1 3 (2n 1)
1. False

(1)n 2n+1
, R = .
x
n!
n=0

n=0

n=0

n=0

n=0

n=0
9. = 0 : y1 (x) = 1;
= 1 : y2 (x) = x;
= 2 : y1 (x) = 1 2x 2 ; = 3 : y2 (x) = x(1 23 x 2 ).

1 2n
1
x , y2 (x) =
x 2n+1 , R = .
(2n)!
(2n + 1)!
n=1
y2 (x) =
(n + 1)! 2n
(1)n n
x .
2 (2n)!
1 x5 + ) +
21. y(x) = a0 (1 + 2x 2 + 13 x 4 + ) + a1 (x + 21 x 3 + 40
= 4.
= 21 .
= .
= 1.
= 5.
(a) Analytic for x = 1.

1 |x0 |, if |x0 | < 1,
(b) R =
|x0 | 1, if |x0 | > 1.
1. y1 (x) =
1 x4
(b) Polynomial approximation: y8 (x) = 1 21 x 2 + 16
1 x 6 + 1 x 8 , error < 6.3 106 on [1, 1].
240
5376
1 x 2 ).
13. f (x) = a0 (1 + 23 x + 12
1.
3.
5.
7.
9.
1 (x 1)4 + , R 1
y2 (x) = (x 1) + 13 (x 1)3 12
(a) y(x) =
19.
Problems
1.
3.
5.
7.
9.
11.
y1 (x) = 1 + 21 (x 1)2 + 18 (x 1)4 + ,
x
3n n!
3. True
5. True
3n ,
1
x 3n+1 , R = .
1 4 (3n + 1)
1 3 (2n + 1) 2n
(1)n
x ,
(2n)!
(2)n
(n + 1)! 2n+1
, R = .
x
(2n + 1)!
(1)n x 2n , y2 (x) =
(1)n x 2n+1 , R = 1.
n=0
11. y1 (x) = x(1 + x 2 ), y2 (x) = 1 + 6x 2 + x 4 , R = .
11 x 5 + , y (x)
13. y1 (x) = 1 x 2 16 x 3 + 13 x 4 + 120
2
1
1
1
3
4
5
= 1 2 x 12 x + 8 x + , R = .
Problems
1. x = 1 is a regular singular point. All other points are ordinary points.
3. x = 0, 2 are regular singular points. All other points are ordinary
points.
5. r = 7.
7. r = 0, 1.

9. y1 (x) = x 1/4 1 +
y2 (x) = 1 +

n=1
n=1

(1)n
xn ,
n![5 9 (4n + 1)]
(1)n
xn.
n![3 7 (4n 1)]
main
2007/2/16
page 789
i

11. y1 (x) = x 2 1+

1
xn ,
n!(1 + 2 2)(2 + 2 2) (n + 2 2)
n=1

1
y2 (x) = x 2 1+
xn .
n!(1 2 2)(2 2 2) (n 2 2)
n=1
(n + 1)(n + 2)
n
3
13. y1 (x) = x 1 +
x ,
10 13 (3n + 7)
n=1

(3n
4)(3n
1)
n
2/3
1 +
x .
y2 (x) = x
n!3n
n=1

(1
+
5)(2
+
5)
(n
+
5)
n
5
15. y1 (x) = x 1 +
x ,
n!(1 + 2 5)(2 + 2 5) (n + 2 5)
n=1

(1 5)(2 5) (n 5)
n
1+
y2 (x) = x
x .
n!(1 2 5)(2 2 5) (n 2 5)
n=1
3 x 2 + ) cos(ln x)
17. y1 (x) = (1 + 51 x 100
1 x(10 + x + ) sin(ln x),
+ 25
3 x 2 + ) sin(ln x)
y2 (x) = (1 + 15 x 100
1 x(10 + x + ) cos(ln x).

25
19. y1 (x) = x, y2 (x) = x ln x +
n=1
11. y1 (x) = x 1

n=0

n=0
3
11 2
x+
x + ).
4
108
1
x n = x 1 (ex x 1),
(n + 2)!
y2 (x) = x 1 (1 + x).

(2x)n
15. y1 (x) =
,
(n!)2
n=0
y2 (x) = y1 (x) ln x (4x + 3x 2 +

17. y1 (x) = x 2

(n + 1) n
x ,
n!
22 3
x + ).
27
n=0
13 2 31 3
y2 (x) = y1 (x) ln x x 2 (3x +
x +
x + ).
4
18

(n + 4) n
19. y1 (x) = x 2 1 +
x ,
n!
n=1
y2 (x) = 2y1 (x) ln x + x 1 (1 x +
1
x n .
n n!
21. y1 (x) = x 3/2

n=0
3 2
x 12x 4 + . . . ).
2
1
1
x n = x 3/2 (ex 1 x x 2 ),
(n + 3)!
2
y2 (x) = x 3/2 (1 + x + 21 x 2 ).
Section 9.5
23. y1 (x) = x,
y2 (x) = y1 (x) ln x +

(1)n n+1
.
x
n n!
n=1
True-False Review
1
25. y1 (x) = x 3/2
xn,
n!(n + 2)!
n=0

1
37 4
y2 (x) = 2y1 (x) ln x 5x 1/2 1 x + x 3 +
x + .
5
960
1. False
3. False
5. True
27. y1 (x) = x, y2 (x) = x ln x 1 +
Problems
1. y1 (x) =

x
an x n , y2 (x) = y1 (x) ln x + x
bn x n .
n=0
3. y1 (x) = x 2
n=1
an x n , y2 (x) = x 1
n=0
5. y1 (x) = x
an x n , y2 (x) = Ay1 (x) ln x + x 1
0.
7. y1 (x) = x 3
bn x n , A =
n=0
an x n , y2 (x) = y1 (x) ln x + x 3
n=0
y2 (x) = y1 (x) ln x + x 1
bn x n .
n=0
(c) y1 (x) = x N
True-False Review
3. False
5. False
7. False
an x n ,
n=0
N

(1)k N(N 1) (N k + 1) k
29. y(x) = 1 +
x .
(k!)2
1. False
bn x n .
n=1
(b) y1 (x) = x 1
n=2
1
xn.
n!(n 1)
Section 9.6
n=0
k=1
bn x n .
n=0
9.
1 n
x ,
(n!)2
y2 (x) = y1 (x) ln x (2 +
13. y1 (x) = x
789
y2 (x) = Ay1 (x) ln x + x 1
2 3/2
x
(sin x x cos x),

2 3/2
(x sin x + cos x).
J3/2 (x) =
x

2
13. x p =
Jp (n x).
n Jp+1 (n )
7. J3/2 (x) =
an x n ,
n=0
Problems

n=0
bn x n , where A = 0 if and
only if = 1, 0, 1, . . . , 1 N.
n=1
main
2007/2/16
page 790
i
790
Section 9.7
Appendix A
3.
1. Ordinary point.
5.

(1)k (3k 2)(3k 5) 7 4 1 3k
y1 (x) = 1 +
x ,
(3k)!
y2 (x) = x +
k=1
k=1
(1)k (3k 1)(3k 4) 5 2 3k+1

x
.
(3k + 1)!
Solutions valid on (, ).
3. Ordinary point.
y1 (x) = 1 + 2x 2 + 3x 4 + 4x 5 + ,
y2 (x) = x +
5 3 7 5 9 7
x + x + x + .
3
3
3
Solutions valid on (1, 1).

5. Regular singular point.
1 2
1
1
x + x4 x6 + ,
3!
5!
7!

1
1
y2 (x) = x 1 1 x 2 + x 4 +
2
4!
y1 (x) = 1
Solutions valid on (0, ).

(1)n
x 2n , y2 (x) = y1 (x) ln x +
7. y1 (x) =
22 42 (2n)2
n=0

1 2
3 4
4 x 128 x +

2
2
9. y1 (x) = J 1 (x) =
sin x, y2 (x) = J 1 (x) =
cos x.
x
x
2
2

1 x3 1 x4 1 x5 +
11. y1 (x) = x 1 1 x 21 x 2 18
360
12600

1 x2 + 1 x3 + 1 x4
y2 (x) = x 1/2 1 + 15 x + 70
1890
83160

1
+ 5405400
x5 +

4 4
16 5
3
13. y1 (x)
=
x 2 1 4x + 4x 2 16
9 x + 9 x 225 x +

50 4
3
y2 (x) = y1 (x) ln x + x 2 8x 12x 2 + 176
27 x 27 x

5
+ 1096
3375 x +
15.
17.
29.
z = 5 + 2i, |z| = 29.
z = 1 2i, |z| = 5.
z
z1 z2 = 1 + 7i, 1 = 1 + i.
z2
z
1
(1 13i).
z1 z2 = 7 + 11i, 1 =
z2
10
1. z = 2 5i, |z| =
Additional Problems
ab 2 ab(2 a)(2 b) 4
(a) y1 (x) = 1 +
x +
x + ...,
2!
4!
(1 a)(1 b) 3
y2 (x) = x +
x
3!
(1 a)(1 b)(3 a)(3 b) 5
+
x + ....
5!
2
4
(d) y1 (x) = 1 + 21x + 35x , y2 (x) = x + 5x 3 + 15x 5 .
(c) N = 0 : y(x) = 1;
N = 1 : y(x) = x 1 (1 x);
N = 2 : y(x) = x 1 [1 2x + 21 x 2 ];
N = 3 : y(x) = x 1 [1 3x + 23 x 2 16 x 3 ].
7.
9.
Appendix B
5
3
.
x+2
x+1
1
4
+
.
3.
5(x 3)
5(x + 2)
1
1
1
+
.
5.
3(x + 1)
6(x 2)
2(x + 4)
1
3
3
.
7.
x+1
x+2
(x + 1)2
1.
1
3x + 4
3
+ 2
.
4x
x
4(x 2 + 4)
1
x+2
11.
+
.
2(x 2)
2(x 2 + 16)
1
1
3
13.
+
.
x2
x+2
(x + 2)2
2
2
2
1
15.
+
.
3(x 2)
3(x + 1)
(x + 1)2
(x + 1)3
x+1
1
.
17.
2(x 3)
2(x 2 + 4x + 5)
9.
Appendix C
Note that we have omitted the integration constants.
1. cos x + x sin x.
3. x ln x x.
2
5. 21 ex (x 2 1).
7. x 3 ln |x + 2|.
x
9. 41 ln |x| 18 ln(x 2 + 4) + tan1 .
2
11. 21 x + 47 ln |2x 1|.
13. 2 ln |x|
1
2 ln |x + 1|.
x+1
15. tan1 (x + 1).

17. ln | cos x|.
19. 41 (2x + sin 2x).
1 e3x (3 sin 2x 2 cos 2x).
21. 13

Answers To Odd-Numbered Exercises: Appendix

Uploaded by

Copyright:

Available Formats

You might also like

Answers To Odd-Numbered Exercises: Appendix

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Answers To Odd-Numbered Exercises: Appendix

Uploaded by

Copyright:

Available Formats

i

13. After 4 p.m.

APPENDIX E Answers to Odd-Numbered Exercises

If n = 1, y(x) = x ln |x| + c1 x + c2 . If n = 2, y(x) =

19. y(x) = ln(ex e3 + e).

25. T (40) = 225 F; t 96.4 minutes.

(a) Equilibrium solutions:

11. Equilibrium solutions: P (t) = 0, P (t) = T , P (t) = C.

13. P (t) = Celn(P0 /k)e

1. y(x) = ex (ex + c).

17. y 2 = x 2 ln(ln cx).

15. y(x) = x 2 (x 4 + 1).

29. y(x) = x 1 (cos x + x sin x + c).

21. y(x) = x sin1 cx.

33. (3y x)3 = k(2y x)4 .

13. q(t) = 5et/RC .

(b) (x + cm)2 + (y c)2 = c2 (1 + m2 ).

(a) (y 2 x 2 ) tan(0 ) 2xy = k.

37. y 2 = x 2 (8 sin x + c).

45. y(x) = [(x 2 1) + cex ]2 .

sin2 x(2 cos x + 1)

53. y(x) = 3(3x tanh 3x).

APPENDIX E Answers to Odd-Numbered Exercises

55. y(x) = 13 [3x tan1 (3x + c) + 1].

57. y(x) = x 1 ecx .

63. y(x) = xex .

65. y(x) = tan1 (1 + ce 1+x ).

11. y(x) = c1 tan1 x + c2 .

13. y(x) = ln(sec x) + c1 ln(sec x + tan x) + c2 .

15. y(x) = a cosh(x).

13. y(x) = x 2 [(ln x)2 + c].

39. e6y = 23 e4x + 25 .

(b) 11, 696.

47. A(t) dt = sin t cos t 2 t .

APPENDIX E Answers to Odd-Numbered Exercises

19. {(5 t, t 2, t) : t R}.

23. {(0, 13 , 0) + t ( 21 (1 3i), 16 (1 + i), 1) : t R}.

13. P12 , A12 (2), M2 ( 17 ), A21 (3).

25. x1 = (4, 11), x2 = ( 13

(a) A = M1 (4)A12 (2)M2 (17/2)A21 (7/4).

APPENDIX E Answers to Odd-Numbered Exercises

17. (3.77, 0.66, 1.46).

(b) |4k k 2 |, Yes.

APPENDIX E Answers to Odd-Numbered Exercises

1 (3x +x +5x )v + 1 (x 5x +7x )v +

13. One possible answer: {(2, 1, 0), (1, 0, 1)}.

13. Only (A1), (A2), (A5), (A6) hold.

15. Only (A1), (A2), (A4), (A5), (A7), (A8) hold.

5. S = {(x, y, z) R3 : x + y + z = 1}, No.

21. nullspace(A) = {(8r + 8s, 2r 3s, r, s) : r, s R}.

15. Linearly dependent.

17. Linearly dependent.

21. Linearly dependent.

27. One possible answer: {2 5x, 3 + 7x}.

35. Linearly dependent.

[v]B = (3, 1).

15. (2a0 a1 a2 , 2a0 2a1 a2 , a0 + a1 + a2 ).

3. u, v = 19 + 11i, ||u|| = 35, ||v|| = 22.

7. A, B = 13, ||A|| = 13, ||B|| = 7.