Timeline for Sum of 'the first k' binomial coefficients for fixed $N$
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2017 at 13:55 | review | Suggested edits | |||
| Aug 18, 2017 at 14:25 | |||||
| Oct 4, 2011 at 0:59 | comment | added | J. M. isn't a mathematician | The second bit has an argument that is nearer the expansion center 0 for the Gaussian hypergeometric series, so it stands to reason that the convergence is a bit faster. Also, one no longer needs to add terms of different signs... | |
| Oct 4, 2011 at 0:57 | comment | added | J. M. isn't a mathematician | I would not be so harsh in saying that the hypergeometric form is "not useful"; for instance, one can apply a Pfaff transformation, dlmf.nist.gov/15.8.E1 , to yield the identity $${}_2 F_1\left({{1 \quad m-n+1}\atop{m+2}}\mid-1\right)=\frac12 {}_2 F_1\left({{1 \quad n+1}\atop{m+2}}\mid\frac12\right)$$ | |
| Mar 5, 2010 at 22:05 | history | edited | Mariano Suárez-Álvarez | CC BY-SA 2.5 |
Escape the latex
|
| Mar 5, 2010 at 19:21 | history | answered | Jacques Carette | CC BY-SA 2.5 |