Timeline for Sum of 'the first k' binomial coefficients for fixed $N$
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2015 at 19:40 | comment | added | The Masked Avenger | For small values of k/N, the sum is well approximated by (N+1) choose k, and for slightly larger values by a multiplicative correction of the form (1/(1 - k/N)) . For k near the size of N/c for c an integer not too large, you can use a recursion where the recursive step involves just addition and runs in O(k) time (O(k^2) if you are measuring bit operations). | |
| Jun 10, 2015 at 19:17 | history | edited | Matt | CC BY-SA 3.0 |
no need to initialize i
|
| Jun 10, 2015 at 19:14 | review | First posts | |||
| Jun 10, 2015 at 19:17 | |||||
| Jun 10, 2015 at 19:09 | history | answered | Matt | CC BY-SA 3.0 |