English

Congruences involving binomial coefficients and Lucas sequences

Number Theory 2009-12-14 v5 Combinatorics

Abstract

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 k=0p1Fkbinom(2k,k)/12k\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.

Keywords

Cite

@article{arxiv.0912.1280,
  title  = {Congruences involving binomial coefficients and Lucas sequences},
  author = {Zhi-Wei Sun},
  journal= {arXiv preprint arXiv:0912.1280},
  year   = {2009}
}

Comments

23 pages. The current Th. 1.4 is new

R2 v1 2026-06-21T14:20:32.491Z