2000 character limit reached
Inequalities for binomial coefficients
Published 1 Oct 2013 in math.CO and math.NT | (1310.0353v2)
Abstract: In this paper we prove several inequalities for binomial coefficients. For instance, if $ k$ and $n$ are positive integers such that $n\ge 400$ and $[\frac n5]\le k\le [\frac n2]$, where $[x]$ is the greatest integer not exceeding $x$, then $$\binom nk<\Big(1-\frac{5(k-[\f n5])}{6n2}\Big) \frac{n{n-\f 12}}{kk(n-k){n-k}}.$$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.