29.06.2016 Views

Thomas Calculus 13th [Solutions]

  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Section 10.7 Power Series 759<br />

1 2<br />

1 2<br />

1<br />

35. For the series x , recall 1 2<br />

2 2 2<br />

can rewrite the series as<br />

n<br />

(2n<br />

1)<br />

(2n<br />

3)<br />

n<br />

n<br />

n<br />

n( n 1)<br />

2<br />

n( n 1)(2n<br />

1)<br />

6<br />

n 3<br />

2n<br />

1<br />

n 1 n 1<br />

n( n 1)<br />

2<br />

n and 1 2<br />

x x ; then<br />

n<br />

n<br />

2 2 2<br />

x lim 1 x 1 1 x 1; when x 1 we have<br />

3<br />

n<br />

convergent series; when x 1 we have<br />

3<br />

2n<br />

1<br />

n 1<br />

,<br />

a divergent series.<br />

(a) the radius is 1; the interval of convergence is 1 x 1<br />

(b) the interval of absolute convergence is 1 x 1<br />

(c) the series converges conditionally at x 1<br />

n( n 1)(2n<br />

1)<br />

6<br />

n so that we<br />

u<br />

u<br />

n 2( n 1) 1 3x<br />

n 1<br />

n 1<br />

3x<br />

(2n<br />

1)<br />

n<br />

n<br />

lim 1 lim 1<br />

2n<br />

1<br />

n 1<br />

n<br />

( 1) , a<br />

conditionally<br />

36. For the series<br />

n 1<br />

rewrite the series as<br />

n 1 n ( x 3) , note that<br />

( x 3)<br />

n 1<br />

n 1<br />

n 1 n<br />

n 2 n 1<br />

n<br />

n<br />

n<br />

; then<br />

n<br />

n 1 n n 1 n 1<br />

1 n 1 n n 1 n<br />

n 1 n so that we can<br />

n 1<br />

un<br />

1 ( x 3) n 1 n<br />

u n<br />

n n n 2 n 1 ( x 3)<br />

lim 1 lim 1<br />

x 3 lim 1 x 3 1 2 x 4; when x 2 we have<br />

n<br />

convergent series; when x 4 we have<br />

1<br />

n 1<br />

n 1<br />

(a) the radius is 1; the interval of convergence is 2 x 4<br />

(b) the interval of absolute convergence is 2 x 4<br />

(c) the series converges conditionally at x 2<br />

n<br />

, a<br />

divergent series;<br />

( 1)<br />

n 1<br />

n 1<br />

n<br />

n<br />

, a<br />

conditionally<br />

37.<br />

n 1<br />

un<br />

1 ( n 1)! x 3 6 9 (3 n) ( n 1) x<br />

x x R<br />

3 6 9 (3 ) 3( 1) n<br />

n<br />

un<br />

n n n n!<br />

x<br />

n<br />

3( n 1) 3<br />

lim 1 lim 1 lim 1 1 3 3<br />

38.<br />

2 1 2<br />

2<br />

u<br />

2 4 6 (2 n) 2( n 1) x n<br />

n 1<br />

2 5 8 (3n<br />

1) (2n<br />

2) 4 x<br />

lim 1 lim 1 x lim 1 1<br />

u<br />

2 2 n<br />

2<br />

n<br />

9<br />

n n 2 5 8 (3n<br />

1) 3( n 1) 1 2 4 6 (2 n)<br />

x<br />

n<br />

| x |<br />

9 R 9<br />

4 4<br />

(3n<br />

2)<br />

39.<br />

2 lim 1 2<br />

1<br />

1 lim ( 1)! n n<br />

un<br />

n x 2 (2 n)! 1 lim ( n 1)<br />

1 2<br />

2(2 2)(2 1) 1 x<br />

x<br />

8<br />

1 x 8 R<br />

u 8<br />

n<br />

n<br />

n<br />

n n<br />

n n 2 2( n 1) ! n!<br />

x<br />

n<br />

40.<br />

2<br />

n<br />

n<br />

1<br />

lim n n n<br />

u 1 lim<br />

n<br />

1 lim<br />

n<br />

n x x 1 x e 1 x e R e<br />

n n<br />

n 1<br />

n<br />

n 1<br />

Copyright<br />

2014 Pearson Education, Inc.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!