I had a problem in probability and I've solved the first part. For the second part I need to prove the inequalities :
$$\frac{1}{2\sqrt{n}}\le \frac{(2n)!}{(n!)^2}\cdot\frac{1}{2^{2n}}\le\frac{1}{\sqrt{2n+1}}$$
I tried using Stirling's formula but it looks too complicated in the end. Any help would be appreciated.
Let's see:
$(2n!) = \prod\limits_{k=1..2n;n \text{even}}k*\prod\limits_{k=1...2; n\text{ odd}}k=\prod\limits_{k=1..n}2k\prod\limits_{k=1...2n; n\text{ odd}}k=2^n*n!*\prod\limits_{k=1...2n; n\text{ odd}}k$
So $\frac {(2n)!}{(n!)^2}\cdot \frac 1{2^{2n}} = \frac {\prod\limits_{k=1...2n; n\text{ odd}}k}{n!}*\frac 1{2^n}=\frac {\prod\limits_{k=1...2n; n\text{ odd}}k}{\prod\limits_{k=1...2n; n\text{ even}}k}=\prod\limits_{k=1}^n \frac {2k-1}{2k}$
This becomes $\frac 1{2\sqrt{n}} \le \prod\limits_{k=1}^n \frac {2k-1}{2k} \le \frac 1{\sqrt{2n+1}}$ or $\sqrt{2n+1} \le \prod\limits_{k=1}^n \frac {2k}{2k-1} \le 2\sqrt{n}$. Or $2n+1 \le \prod\limits_{k=1}^n \frac {4k^2}{(2k-1)^2}\le 4n$... which we can probably do by induction.
For $n=1$ then $3 \le 4 \le 4$
If true for $n=k$ then
$2k+1\le \prod\limits_{j=1}^k\frac {4j^2}{(2j-1)^2} \le4k$
$(2k+1)*\frac{4(k+1)^2}{(2k+1)^2}\le \prod\limits_{j=1}^{k+1}\frac {4j^2}{(2j-1)^2} \le 4k*\frac{4(k+1)^2}{(2k+1)^2}$
And $(2k+1)*\frac{4(k+1)^2}{(2k+1)^2}= (2k+1)*\frac {4k^2 + 8k + 4}{4k^2 + 4k+1}=(2k+1)(1 + \frac {4k+3}{4k^2 + 4k + 1})$
$= 2k+ 1 + \frac {2k(4k+3) + 4k+3}{4k^2 + 4k + 1}=2k+1 + \frac {8k^2 + 10k + 3}{4k^2 + 4k + 1}>2k+1 + 2 = 2(k+1) + 1$
while $4k*\frac{4(k+1)^2}{(2k+1)^2} =4k*\frac {4k^2 + 8k + 4}{4k^2 + 4k + 1} = 4k(1 + \frac {4k+3}{4k^2 + 4k + 1})=4k + \frac {16k^2 + 12k}{4k^2 + 4k +1} < 4k + \frac {16k^2 + 16k + 4}{4k^2 + 4k + 1} = 4(k+1)$
So... it is true (with equality only holding on the left side for $n=1$... which makes me a little uneasy).
Obviously this is not what they intended. But it works. I assume they wanted something to do with $\sqrt{2n + 1} = \sqrt{(n+1)^2 - n^2}$ but ... I couldn't seem to work that in.
Oh.... $\sqrt{2n + 1}=\sqrt{(n+1)^2 - n^2} = \sqrt{(n-1)(n+1)}< \sqrt{n^2} = n$. Maybe you can work that in. Well... I don't know.