29.06.2016 Views

Thomas Calculus 13th [Solutions]

  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

782 Chapter 10 Infinite Sequences and Series<br />

56.<br />

tan<br />

n 1 2n<br />

1<br />

1<br />

3 5 7 9 ( 1) x<br />

x x x x x x<br />

and<br />

3 5 7 9 2n<br />

1<br />

2 n 1<br />

2 2 1<br />

lim x 2n 1 lim 2n<br />

1 tan<br />

2n<br />

1 x 2n<br />

1<br />

n<br />

x n<br />

2n<br />

1<br />

x x<br />

converges for | x | 1; when x 1 we have<br />

n 1<br />

( 1)<br />

n 1<br />

2n<br />

1<br />

which is a convergent series<br />

n<br />

( 1)<br />

2n<br />

1<br />

n 1<br />

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

the series representing<br />

1<br />

tan x diverges for | x| 1<br />

57.<br />

n 1 2n<br />

1<br />

1<br />

3 5 7 9 ( 1)<br />

tan<br />

x x x x<br />

x<br />

1<br />

x x and when the series representing 48 tan 1 has an<br />

3 5 7 9 2n<br />

1<br />

18<br />

6<br />

error less than 1<br />

3 10 , then the series representing the sum 1 1 1 1 1<br />

48 tan 32 tan 20 tan 1 also<br />

18 57 239<br />

has an error of magnitude less than<br />

terms<br />

6<br />

10 ; thus<br />

1<br />

2n<br />

1<br />

18<br />

1<br />

2n<br />

1 310<br />

error 48 n 4 using a calculator 4<br />

6<br />

58. (a)<br />

m k m k 1 m k 1<br />

f ( x) 1 k x f ( x) k k x (1 x) f ( x) (1 x)<br />

k k x<br />

k 1 k 1 k 1<br />

m k 1 m k 1 m k 1 m k<br />

k k x x k k x k k x k k x<br />

k 1 k 1 k 1 k 1<br />

0 1 1<br />

1<br />

m (1) x m k k x k m k k x k m m k k x k m k k x<br />

k<br />

k 2 k 1 k 2 k 1<br />

Note that:<br />

k<br />

m k 1 m k<br />

k k x k 1 k x<br />

2 k 1<br />

( 1) .<br />

Thus,<br />

1<br />

x f x m m k k x k m k k x k m m k 1 k x k m k k x<br />

k<br />

k 2 k 1 k 1 k 1<br />

(1 ) ( ) ( 1)<br />

(b) Let<br />

m k m k m m k<br />

m k 1 k x k k x m k 1 k k k x<br />

k 1 k 1<br />

Note that:<br />

( 1) ( 1) .<br />

m<br />

m m ( m 1) m ( k 1) 1 m ( m 1) ( m k 1)<br />

k 1 ( k 1) k k ( k 1)<br />

k<br />

( k 1)! k!<br />

m ( m 1) ( m k ) m ( m 1) ( m k 1) ( 1) ( 1) ( 1) ( 1)<br />

k m m m k m k k m m m m k m<br />

m k! k! k! k!<br />

k<br />

( ) .<br />

m m k m k m k<br />

Thus, (1 x ) f ( x ) m k 1<br />

( k 1) k k x m m k x m m k x<br />

k 1<br />

m<br />

k<br />

k<br />

k 1 k 1 k 1<br />

m f ( x)<br />

(1 x)<br />

m 1 x m f ( x ) f ( x ) if 1 x 1.<br />

m m 1<br />

m<br />

g x x f x g x m x f x x<br />

( ) (1 ) ( ) ( ) (1 ) ( ) (1 )<br />

m 1 m m f ( x)<br />

m 1 m 1<br />

f x m x f x x m x f x x m f x<br />

(1 x)<br />

( ) (1 ) ( ) (1 ) (1 ) ( ) (1 ) ( ) 0.<br />

(c)<br />

m<br />

m<br />

g ( x) 0 g( x) c (1 x) f ( x) c f ( x) c c(1 x ) . Since<br />

m<br />

(1 x)<br />

f ( x) 1<br />

k<br />

1<br />

m<br />

k<br />

k<br />

x<br />

m k m m<br />

f k<br />

c c f x x<br />

k 1<br />

(0) 1 (0) 1 0 1 (1 0) 1 1 ( ) (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!