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.
Good observation.
Be careful when interchanging limits and functions. You have to justify why this can be done, like that the limit exists and the function is continuous. As such, there is work that needs to be done first.
I don't understand how you made this limit.
Can yo please elaborate the last three steps? I don't get it
Integral of lnx is xlnx-x so ln4-2 , -2 is missing
We know that S ( n ) = ( n 2 n ) is the largest of the n + 1 binomial coefficients ( 0 2 n ) , ( 1 2 n ) ,...., ( 2 n 2 n ) . Also, the sum of all binomial coefficients is 2 2 n = 4 n So 4 n ≥ S ( n ) ≥ 2 n + 1 4 n .
Therefore 4 ≥ S ( n ) n 1 ≥ ( 2 n + 1 ) n 1 4 . The squeeze theorem now gives our result, as lim n → ∞ ( 2 n + 1 ) n 1 = 1 .
+1. This solution is the most elementary and doesn't rely on other 'well-know results'.
Please explain me how can you write (n+1)S > 4^n . @Shourya Pandey
Log in to reply
I think he meant to write S ( n ) ≥ 2 n + 1 4 n , since there are 2n+1 binomial coefficients. However, the solution still works (e.g., lim n → ∞ ( 2 n + 1 ) n 1 = 1 ).
The logic behind the inequality is that if you have A numbers summing up to B, then B is at most A times the largest of the numbers. More discretely, you can write an inequality with a particular member of the A numbers on one side, and the maximum on the other, and then add up all of the inequalities to get the desired result.
Since 2n choose n is the largest of these binomial coefficients, we have the given inequality.
We have ( n 2 n ) = ( n ! ) 2 ( 2 n ) ! . Subbing Stirling and simplifying gives us n → ∞ lim ( n 2 n ) 1 / n = n → ∞ lim π 1 / 2 n n 1 / 2 n 4 . As n approaches infinity π 1 / 2 n approaches 1 . Also n 1 / 2 n approaches 1 because n grows linearly while 2 n -th root reduces exponentially. So the answer is 4 .
Yup. It's a pretty well-known result that ( n 2 n ) = O ( 4 n ) .
Log in to reply
but what is O here?????? any thing multiplied by 0 is 0.........is it zero?????
The approximation of the central binomial coefficient by { 4 / sqrt (pi n) } as n --> infinity
Problem Loading...
Note Loading...
Set Loading...
Another approach O f solving this is by Definite Integration as Limits of sum. But here we can't see any summation .In problems with exponents l n is the key.
Let A = n → ∞ lim ( n 2 n ) 1 / n
Taking l n both sides we get l n ( A ) = l n ( n → ∞ lim ( n 2 n ) 1 / n ) l n ( A ) = n → ∞ lim l n ( ( n 2 n ) 1 / n ) l n ( A ) = n → ∞ lim n 1 l n 1 . 2 . 3 . . . . n ( n + 1 ) ( n + 2 ) . . . ( n + n ) l n ( A ) = n → ∞ lim n 1 ( l n 1 n + 1 + l n 2 n + 2 + l n 3 n + 3 + . . . . . + l n n n + n ) l n ( A ) = n → ∞ lim n 1 r = 1 ∑ n l n r ( n + r ) l n ( A ) = ∫ 0 1 l n ( x 1 + x ) d x l n ( A ) = l n ( 4 ) A = 4