Sum of combinations from k to n

  • Thread starter Ediliter
  • Start date
  • #1
2
0
I have been trying to figure out a formula for the sum of combinations. For example:

[itex]\sum[/itex]nk=0([itex]\frac{n}{k}[/itex]) = 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.

Thank you in advance.
 

Answers and Replies

  • #2
Stephen Tashi
Science Advisor
7,401
1,368
I don't know any nice formula for [itex] \sum_{k=0}^m \binom{n}{k} [/itex] 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.
 
  • #3
525
5
The sum could be expressed in terms of the incomplete beta function, e.g. using the cdf of the binomial distribution with p=1/2.
 
  • #4
315
1
For large n the binomial distribution is approximated by a normal distribution, so if you only want a close approximation you could use that.
 

Related Threads on Sum of combinations from k to n

Replies
2
Views
4K
  • Last Post
Replies
12
Views
41K
  • Last Post
Replies
2
Views
2K
Replies
0
Views
5K
Replies
13
Views
5K
Replies
2
Views
519
Replies
3
Views
5K
Replies
2
Views
743
  • Last Post
Replies
22
Views
22K
  • Last Post
Replies
8
Views
1K
Top