2
$\begingroup$

Is there a combinatorial identity for the following: $$\sum_{k=0}^{i}\binom{n}{k} $$ for arbitrary integers $n, i$ with $n > i$? If so, what is this identity called?

$\endgroup$
  • 2
    $\begingroup$ Alas, no, except for special values of $i$. $\endgroup$ – vadim123 Feb 20 '14 at 2:51
  • $\begingroup$ These are values like $n$, $n/2$, yes? $\endgroup$ – Ayesha Feb 20 '14 at 3:11
  • $\begingroup$ Right, and also silly things like $0,1,2,3$. $\endgroup$ – vadim123 Feb 20 '14 at 4:33
3
$\begingroup$

Using a CAS, I found this "nice" expression $$\sum_{k=0}^{i}\binom{n}{k}=2^n-\binom{n}{i+1} \, _2F_1(1,i-n+1;i+2;-1) $$ May I suggest we name it, at least for the time being, Ayesha's identity.

$\endgroup$
  • $\begingroup$ Ha. That is a great name. $\endgroup$ – Ayesha Feb 20 '14 at 14:39
  • 1
    $\begingroup$ @Ayesha. This is my pleasure and my gift to you for today ! $\endgroup$ – Claude Leibovici Feb 20 '14 at 14:40

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.