  
  
Stat 
Members: 3003 Articles: 2'069'436 Articles rated: 2585
05 May 2021 

   

Article overview
 

On sums of binomial coefficients and their applications  ZhiWei Sun
;  Date: 
21 Apr 2004  Subject:  Number Theory; Combinatorics MSCclass: 11B65; 05A19; 11B37; 11B68  math.NT math.CO  Abstract:  In this paper we study recurrences concerning the combinatorial sum $S(n,r)=sum_{kequiv r (mod m)}inom {n}{k}$ and the alternate sum $sum_{kequiv r (mod m)}(1)^{(kr)/m}inom{n}{k}$, where $m>0$, $nge 0$ and $r$ are integers. For example, we show that if $nge m1$ then $$sum_{i=0}^{lfloor(m1)/2
floor}(1)^iinom{m1i}i S(n2i,ri)=2^{nm+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity given by the author [Integers 2(2002)].  Source:  arXiv, math.NT/0404385  Services:  Forum  Review  PDF  Favorites 


No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser CCBot/2.0 (https://commoncrawl.org/faq/)

 



 News, job offers and information for researchers and scientists:
 