Timeline for Lower bound for sum of binomial coefficients?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2011 at 12:59 | vote | accept | user13006 | ||
| Feb 16, 2011 at 12:59 | |||||
| Feb 16, 2011 at 12:58 | comment | added | user13006 | Honestly, I only need a bound off by a polynomial factor since the exponential ones dominate, so the original that I started with would be fine. But it's become a sort of personal quest to find the "real" answer -- since I use Chernoff so much, and I know Stirling can be made extremely tight, I thought there should be an answer. I figured it's also something that should be answered somewhere on mathoverflow. So, this is what I started with, but I'd like to be able to get $k$ close to $1/2$. | |
| Feb 16, 2011 at 8:08 | history | edited | Anthony Quas | CC BY-SA 2.5 |
deleted 1 characters in body
|
| Feb 16, 2011 at 7:34 | history | answered | Anthony Quas | CC BY-SA 2.5 |