# Sum of combinations from k to n

I have been trying to figure out a formula for the sum of combinations. For example:

$\sum$nk=0($\frac{n}{k}$) = 2n

But what if you want to sum from any arbitrary k, like 4? I've tried looking at Pascal's triangle for nice values of n and k, but haven't been able to see a pattern. I would really appreciate any help with this. I want to apply this to combinations for large n, which are impractical to compute.

Related Set Theory, Logic, Probability, Statistics News on Phys.org
Stephen Tashi
I don't know any nice formula for $\sum_{k=0}^m \binom{n}{k}$ Your question made me curious and I searched the web. It apparently doesn't know a nice formula either. Perhaps if you give an example of the kind of computation you are trying to do, someone will see a way to compute the result - at least compute it on a computer.