Evaluate the limit n → ∞ lim n 2 j = 1 ∑ n j ! ( n − j ) ! ( − 1 ) n − j j n − 1 ln j .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice solution.
@Mark Hennings I was very confused in the middle when I got derivative of Stirling numbers of second kind. And I searched the internet but there seems to be nothing. What could be the possible reason according to you?
Log in to reply
I am not aware that there is a continuous version of the Stirling numbers that can be differentiated!
Log in to reply
Yeah. That's how we have defined it. Opens up possibilities though for something like Gamma Function. The limit is surely defined as your solution says.
Log in to reply
@Kartik Sharma – It seems there has been some study of generalised Stirling numbers, as here and in the referred papers. One of the more interesting ideas (Flajolet &) seems to define the numbers by integrating along a Hankel contour.
Problem Loading...
Note Loading...
Set Loading...
We prove by induction that J n ( a ) = ∫ 0 1 ∫ 0 1 ⋯ ∫ 0 1 x 1 + x 2 + ⋯ + x n + a 1 d x 1 d x 2 ⋯ d x n = ( n − 1 ) ! 1 j = 0 ∑ n ( j n ) ( − 1 ) n − j ( a + j ) n − 1 ln ( a + j ) for all n ∈ N and a > 0 . To start with, J 1 ( a ) = ∫ 0 1 x + a d x = ln ( a + 1 ) − ln a If we assume that the formula is correct for J n ( a ) , then J n + 1 ( a ) = ∫ 0 1 J n ( a + x ) d x = ∫ 0 1 ( ( n − 1 ) ! 1 j = 0 ∑ n ( j n ) ( − 1 ) n − j ( a + x + j ) n − 1 ln ( a + x + j ) ) d x = ( n − 1 ) ! 1 j = 0 ∑ n ( j n ) ( − 1 ) n − j [ n 1 ( a + x + j ) n ln ( a + x + j ) − n 2 1 ( a + x + j ) n ] x = 0 1 = n ! 1 j = 0 ∑ n + 1 ( j n + 1 ) ( − 1 ) n + 1 − j ( a + j ) n ln ( a + j ) − n × n ! 1 j = 0 ∑ n + 1 ( j n + 1 ) ( − 1 ) n + 1 − j ( a + j ) n Now j = 0 ∑ N ( j N ) ( − 1 ) j ( N − j ) M = j = 0 ∑ N ( j N ) ( − 1 ) N − j j M is equal to the number of surjective maps from a set with M elements to a set with N elements, and hence is equal to 0 for non-negative integers M < N . Thus it follows that j = 0 ∑ n + 1 ( j n + 1 ) ( − 1 ) n + 1 − j ( a + j ) n = 0 for all a > 0 , and hence J n + 1 ( a ) = n ! 1 j = 0 ∑ n + 1 ( j n + 1 ) ( − 1 ) n + 1 − j ( a + j ) n ln ( a + j ) as required. Putting a = 0 we conclude that J n ( 0 ) = ( n − 1 ) ! 1 j = 1 ∑ n ( j n ) ( − 1 ) n − j j n − 1 ln j = n j = 1 ∑ n j ! ( n − j ) ! ( − 1 ) n − j j n − 1 ln j n ≥ 2
As observed elsewhere , we note that n J n ( 0 ) = ∫ 0 ∞ e − 2 1 t ( t 2 n sinh 2 n 1 t ) n d t for all n ∈ N . Moreover, n → ∞ lim n J n ( 0 ) = ∫ 0 ∞ e − 2 1 t d t = 2 ( ⋆ ) Putting these results together, we deduce that n → ∞ lim n 2 j = 0 ∑ n j ! ( n − j ) ! ( − 1 ) n − j j n − 1 ln j = n → ∞ lim n J n ( 0 ) = 2 making the answer 2 .
Proving the result in ( ⋆ ) that n J n ( 0 ) converges to 2 as n → ∞ needs some careful analysis. If we define g ( x ) = x c o t h x − 1 − ln ( x sinh x ) x > 0 then g ( x ) = cosh x × sinh x x − 1 − ln ( x sinh x ) → 0 x → 0 + while g ′ ( x ) = x 1 − x c o s e c h 2 x = x 1 [ 1 − ( sinh x x ) 2 ] > 0 x > 0 so we deduce that g ( x ) > 0 for all x > 0 . If we now define f ( x ) = ( x sinh x ) x 1 x > 0 then we deduce that f ( x ) f ′ ( x ) = x 1 [ c o t h x − x 1 ] − x 2 1 ln ( x sinh x ) = x 2 g ( x ) > 0 for x > 0 . Thus f ( x ) is an increasing function of x . Thus, for n ≥ 2 and t > 0 , f ( 2 n t ) ( t 2 n sinh 2 n 1 t ) t 2 n e − 2 1 t ( t 2 n sinh 2 n 1 t ) n ≤ f ( 4 t ) ≤ ( t 4 sinh 4 1 t ) t 4 ≤ e − 2 1 t ( t 4 sinh 4 1 t ) 2 = t 2 ( 1 − e − t ) 2 Given this inequality, we can use the Dominated Convergence Theorem to show that lim n → ∞ n J n ( 0 ) = 2 .