# An inequality involving binomial coefficients

For $k\leq n$, how do I prove that ${2n \choose n}(1-\frac{k}{n})^{k}\leq{2n \choose n+k}$?

-

## 1 Answer

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}.$$

-

Thank you, Didier. – bscptn Jan 11 '12 at 2:20
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 7, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.7379537224769592, "perplexity_flag": "middle"}