On sums of binomial coefficients and their applications

Details On sums of binomial coefficients and their applications On sums of binomial coefficients and their applications

2004-04-21

arxiv.org/abs/math/0404385v3

Discrete Math. 308(2008), 4231-4245

Mathematics

Number Theory

Scientific paper

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For example, we show that if $n\ge m-1$ then $$\sum_{i=0}^{\lfloor(m-1)/2\rfloor}(-1)^i\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)].

Affiliated with

Also associated with

No associations

Rating

On sums of binomial coefficients and their applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On sums of binomial coefficients and their applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On sums of binomial coefficients and their applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18651