Timeline for An optimization problem involving sum of binomial coefficients upto some value
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2011 at 10:05 | comment | added | Brendan McKay | It should be possible to develop precise error bounds on the approximations I gave, which will lead to some precise bounds on where the minimum is that all be valid if $n$ is large enough (going to $\infty$ won't be necessary). Extra terms in the approximations could be added. It would be a bit messy. | |
| Nov 21, 2011 at 9:57 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 305 characters in body
|
| Nov 21, 2011 at 2:49 | comment | added | Norouzi | Thanks! How about if n or s doesn't go to infinity. Can we still say something? | |
| Nov 20, 2011 at 13:18 | history | answered | Brendan McKay | CC BY-SA 3.0 |