Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Can the following expression be reduced to some more simplified expression?

$\sum_{j=0}^{k} \binom{n-a + m-j}{n-a} \times \binom{a-1 + j}{a-1}$

n,m and a are some positive constants with a < n and k < m.

share|cite|improve this question

1 Answer 1

Maple 16 writes it in terms of hypergeometric functions: $${n-a+m\choose n-a}{\mbox{$_2$F$_1$}(a,-m;\,-n+a-m;\,1)}-{n-a+m-k-1 \choose n-a}{a+k\choose a-1} {\mbox{$_3$F$_2$}(1,k+1+a,-m+1+k;\,k+2,-n+a-m+k+1;\,1)}$$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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