Congruences involving binomial coefficients and Lucas sequences

arXiv0912.1280MaRDI QIDQ6216613FDOQ6216613

Authors: Zhi-Wei Sun 

Publication date: 7 December 2009

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 $su{m}_{k=0}^{p-1}{F}_k\ast 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.

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Binomial coefficients; factorials; (q)-identities (11B65) Sums of squares and representations by other particular quadratic forms (11E25)

This page was built for publication: Congruences involving binomial coefficients and Lucas sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6216613)