Talk:Central binomial coefficient

Useful Bounds

I added a simple lower bound to the page. It's not the most accurate, but it's elegant, easy to prove, and it's a lot better than the bound used for the proof of Bertrand's postulate. A proof of this bound (aside from Stirling's formula) can be found at http://foolproof.pbwiki.com/Central+Binomial+Coefficient+Minimum . -Xylune (talk) 06:19, 4 August 2008 (UTC)

And I just finished proving an upper bound and have added this as well. http://foolproof.pbwiki.com/Central+Binomial+Coefficient+Maximum -Xylune (talk) 22:14, 4 August 2008 (UTC)

Added a pair of bounds more precise than the first pair. See the website above for proofs. -Xylune (talk) 05:47, 8 August 2008 (UTC)

Improving notation

For

$${\binom {2n}{n}}=(-1)^{n}4^{n}{\binom {-1/2}{n}}$$

can we write

$${\binom {2n}{n}}=4^{n}{\binom {n-1/2}{n}}$$

instead. It's not as intuitive as $-{\tfrac {1}{2}}$ from ${\frac {1}{\sqrt {1-x}}}$, but does eliminate the double minus.

Darcourse (talk) 08:51, 28 December 2021 (UTC)