Quantcast
Channel: Sum of 'the first k' binomial coefficients for fixed $N$ - MathOverflow
Viewing all articles
Browse latest Browse all 16

Answer by Jacques Carette for Sum of 'the first k' binomial coefficients for fixed $N$

$
0
0

There is no useful closed-form for this. You can write it down as$$2^N - \binom{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$but that's really just a rewrite of the sum in a different form.


Viewing all articles
Browse latest Browse all 16