On sums of binomial coefficients and their applications (Q941351): Difference between revisions

The author studies recurrences for the combinatorial sum \({n\brack r}_m=\sum_{k\equiv r\pmod m}\binom nk\) and the alternate sum \(\sum_{k\equiv r\pmod m}(-1)^{(k-r)/m}\binom nk\), where \(m>0\), \(n\geq 0\) and \(r\) are integers. For example, he shows that if \(n\geq m-1\) then \[ \sum_{i=0}^{\lfloor(m-1)/2\rfloor} (-1)^i\binom{m-1-i}{i}{{n-2i}\brack {r-1}}_m=2^{n-m+1}. \] He also applies such results to investigate Bernoulli and Euler polynomials. His approach depends heavily on an identity established by himself [Integers 2, Paper A04, 8 p. (2002; Zbl 0986.05012)].