arXiv Analytics

Sign in

arXiv:0912.1280 [math.NT]AbstractReferencesReviewsResources

Congruences involving binomial coefficients and Lucas sequences

Zhi-Wei Sun

Published 2009-12-07, updated 2009-12-14Version 5

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4 (mod 5), p=13,17 (mod 30), and p=7,23 (mod 30) respectively, where {F_n} is the Fibonacci sequence. We also raise several conjectures.

Comments: 23 pages. The current Th. 1.4 is new
Categories: math.NT, math.CO
Subjects: 11B65, 11A07, 11B39, 05A10
Related articles: Most relevant | Search more
arXiv:0805.0563 [math.NT] (Published 2008-05-05, updated 2010-04-01)
New congruences for central binomial coefficients
arXiv:0911.2415 [math.NT] (Published 2009-11-12, updated 2011-08-02)
On congruences related to central binomial coefficients
arXiv:0709.1665 [math.NT] (Published 2007-09-11, updated 2011-06-02)
On some new congruences for binomial coefficients