Exercise 6.6.4

Explain how Lagrange’s Remainder Theorem can be modified to prove

1 1 2 + 1 3 1 4 + 1 5 1 6 + = log ( 2 )

Answers

Let E N ( x ) = log ( 1 + x ) n = 1 ( 1 ) n x n n . The proof presented of Lagrange’s Remainder Theorem assumed that x > 0 to simplify notation, and found a value of c ( 0 , x ) , with the proof for x < 0 being implicit. But we can just ignore x < 0 to state that given x ( 0 , R ) there exists 0 < c < x satisfying

E N ( x ) = f ( N + 1 ) ( c ) ( N + 1 ) ! x N + 1

Now, | f ( N + 1 ) ( c ) | = N ! ( 1 + c ) ( N + 1 ) , so for c < x = 1 we have

| E N ( x ) | 1 N + 1

which converges to 0 as N . Hence the Taylor series is equal to log ( 1 + x ) over at least ( 0 , 1 ) , and we can extend this equality to ( 0 , 1 ] since both log ( 1 + x ) and the Taylor series are continuous at 1 (we established the latter in Exercise 6.5.1). Plugging x = 1 into both equations leaves us with the desired equality.

User profile picture
2022-01-27 00:00
Comments