For $k\leq n$, how do I prove that ${2n \choose n}(1-\frac{k}{n})^{k}\leq{2n \choose n+k}$?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|
Hint: If $0\lt a\leqslant b$, then $\dfrac{a}b\leqslant\dfrac{a+1}{b+1}$. Application: The hint yields $\dfrac{n-k}n\leqslant\dfrac{n-k+i}{n+i}$ for every $i\geqslant0$. Multiplying these inequalities for $1\leqslant i\leqslant k$, one gets $$ \left(\frac{n-k}n\right)^k\leqslant\frac{n-k+1}{n+1}\frac{n-k+2}{n+2}\cdots\frac{n}{n+k}=\frac{n!\,n!}{(n-k)!(n+k)!}. $$ Hence, $$ {2n\choose n}\left(\frac{n-k}n\right)^k\leqslant\frac{(2n)!}{n!\,n!}\,\frac{n!\,n!}{(n-k)!(n+k)!}=\frac{(2n)!}{(n-k)!(n+k)!}={2n\choose n+k}. $$ |
|||
|
|
