Timeline for bound for binomial coefficients
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2010 at 6:41 | vote | accept | Vagabond | ||
| S Jun 14, 2010 at 6:41 | vote | accept | Vagabond | ||
| Jun 14, 2010 at 6:41 | |||||
| Jun 12, 2010 at 12:06 | answer | added | Vladimir Dotsenko | timeline score: 4 | |
| Jun 12, 2010 at 10:55 | vote | accept | Vagabond | ||
| S Jun 14, 2010 at 6:41 | |||||
| Jun 12, 2010 at 10:14 | answer | added | Wadim Zudilin | timeline score: 4 | |
| Jun 12, 2010 at 9:47 | history | edited | Wadim Zudilin | CC BY-SA 2.5 |
typos fixed
|
| Jun 12, 2010 at 8:38 | comment | added | Wadim Zudilin | The first and obvious approach is to use induction on $n$. In dx.doi.org/10.1007/s11139-006-0075-1 (see also arXiv.org/abs/math/0304021) I had a similar estimate; there however the deal was bout the beta-integral. So, if you take the reciprocal of both sides you can use the estimate from that paper (it's quite sharp). | |
| Jun 12, 2010 at 8:29 | comment | added | Vagabond | I did try Stirling's approximation but am unable to get this expression. | |
| Jun 12, 2010 at 7:55 | comment | added | alext87 | Surely this is homework question. I did a course this year and that was the first question on the first problem sheet. | |
| Jun 12, 2010 at 7:50 | comment | added | S. Carnahan♦ | Have you tried Stirling's approximation? | |
| Jun 12, 2010 at 7:17 | history | asked | Vagabond | CC BY-SA 2.5 |