Wednesday, December 13, 2017

inequality - Elementary central binomial coefficient estimates




  1. How to prove that 4n4n<(2nn)<4n3n+1 for all n > 1 ?


  2. Does anyone know any better elementary estimates?




Answer



Here are some crude bounds:



12n(2nn)122n34n+1,n1.






We begin with the product representations
(2nn)122n=12nn1j=1(1+12j)=nj=1(112j),n1.




From
n1j=1(1+12j)2=n1j=1(1+1j+14j2)n1j=1(1+1j)=n,
we see that
((2nn)122n)2=1(2n)2n1j=1(1+12j)214n2n=14n,n1.
so by taking square roots, (2nn)122n12n.



On the other hand, nj=1(1+12j)(112j)=nj=1(114j2)34,

so that (using the lower bound above), we have
(2nn)122n=nj=1(112j)34n+1.



Alternatively, multiplying the different representations we get
n[(2nn)122n]2=12n1j=1(114j2)(112n).
It's not hard to show that the right hand side increases from 1/4 to 1/π for n1.






Edit: You can get better bounds if you know Wallis's formula:




2n[(2nn)14n]2=123234542n12n22n12n=12nj=2(1+14j(j1))



(2n+1)[(2nn)14n]2=123234542n12n22n12n2n+12n=nj=1(114j2)



By Wallis's formula, both middle expressions converge to 2π.
The right hand side of the first equation is increasing, while the right hand
side of the second equation is decreasing. We conclude that




1π(n+1/2)(2nn)14n1πn.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...