How to prove that 4n√4n<(2nn)<4n√3n+1 for all n > 1 ?
Does anyone know any better elementary estimates?
Answer
Here are some crude bounds:
12√n≤(2nn)122n≤34√n+1,n≥1.
We begin with the product representations
(2nn)122n=12nn−1∏j=1(1+12j)=n∏j=1(1−12j),n≥1.
From
n−1∏j=1(1+12j)2=n−1∏j=1(1+1j+14j2)≥n−1∏j=1(1+1j)=n,
we see that
((2nn)122n)2=1(2n)2n−1∏j=1(1+12j)2≥14n2n=14n,n≥1.
so by taking square roots, (2nn)122n≥12√n.
On the other hand, n∏j=1(1+12j)(1−12j)=n∏j=1(1−14j2)≤34,
so that (using the lower bound above), we have
(2nn)122n=n∏j=1(1−12j)≤34√n+1.
Alternatively, multiplying the different representations we get
n[(2nn)122n]2=12n−1∏j=1(1−14j2)(1−12n).
It's not hard to show that the right hand side increases from 1/4 to 1/π for n≥1.
Edit: You can get better bounds if you know Wallis's formula:
2n[(2nn)14n]2=12323454⋯2n−12n−22n−12n=12n∏j=2(1+14j(j−1))
(2n+1)[(2nn)14n]2=12323454⋯2n−12n−22n−12n2n+12n=n∏j=1(1−14j2)
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)14n≤1√πn.
No comments:
Post a Comment