Exercise 8.20

Exercise 20: The following simple computation yields a good approximation to Stirling’s formula. For m = 1 , 2 , 3 , , define

f ( x ) = ( m + 1 x ) log m + ( x m ) log ( m + 1 )

if m x m + 1 , and define

g ( x ) = x m 1 + log m

if m 1 2 x < m + 1 2 . Draw the graphs of f and g . Note that f ( x ) log x g ( x ) if x 1 and that

1 n f ( x ) dx = log ( n ! ) log n 2 > 1 8 + 1 n g ( x ) dx .

Integrate log x over [ 1 , n ] . Conclude that

7 8 < log ( n ! ) ( n + 1 2 ) log n + n < 1

for n = 2 , 3 , 4 , . Thus

e 7 8 < n ! ( n e ) n n < e .

Answers

The second derivative of log x is x 2 , which is negative for x > 0 , so log x is a “concave” function (i.e., log x is convex). The function f ( x ) is a continuous, piecewise-linear function whose values at the endpoints of the linear segments, f ( m ) for m = 1 , 2 , , equal log m , hence f ( x ) log x by the concavity of log x . Also, g ( x ) is a continuous, piecewise-linear function which is equal to log m at m = 1 , 2 , , and the slope of g ( x ) is equal to the derivative of log x at those points. That is, the linear segments of g ( x ) are tangent to log x at those points, and so log x g ( x ) , also by the concavity of the log x .

1 n f ( x ) dx = m = 1 n 1 m m + 1 ( m + 1 x ) log m + ( x m ) log ( m + 1 ) dx = m = 1 n 1 ( 1 2 ( m + 1 x ) 2 log m + 1 2 ( x m ) 2 log ( m + 1 ) ) | x = m x = m + 1 = 1 2 log 1 + m = 1 n 1 ( log m ) + 1 2 log n = log n ! 1 2 log n 1 n g ( x ) dx = 1 3 2 ( x 1 + log 2 ) dx + m = 2 n 1 m 1 2 m + 1 2 ( x m 1 + log m ) dx + n 1 2 n ( x n 1 + log n ) dx = 1 2 ( x 1 ) 2 | x = 1 x = 3 2 + m = 2 n 1 ( 1 2 m x 2 x + x log m ) | x = m 1 2 x = m + 1 2 + ( 1 2 n x 2 x + x log n ) | x = n 1 2 x = n = 1 8 + m = 2 n 1 ( 1 1 + log m ) + ( 1 2 1 8 n 1 2 + 1 2 log n ) = log n ! 1 2 log n + 1 8 ( 1 1 n ) < 1 n f ( x ) dx + 1 8

Integrating by parts, we have

1 n log x dx = n log n 1 log 1 1 n 1 dx = n log n n + 1

. Hence

1 n g ( x ) dx < 1 n log x dx < 1 n f ( x ) dx log n ! + 1 2 log n 1 8 < n log n + n 1 < log n ! + 1 2 log n

Adding 1 + log n ! 1 2 log n to all sides, we get

7 8 < log n ! ( n + 1 2 ) log n + n < 1 .

And applying exp to all sides, we get

e 7 8 < exp ( log n ! ) exp ( n ) exp ( log ( n n + 1 2 ) ) < e e 7 8 < n ! e n n n n < e e 7 8 < n ! ( n e ) n n < e

User profile picture
2023-08-07 00:00
Comments