New congruences for central binomial coefficients

From MaRDI portal
Publication:972862

DOI10.1016/J.AAM.2010.01.001zbMATH Open1231.11021DBLPjournals/aam/SunT10arXiv0805.0563OpenAlexW2963096294WikidataQ60692087 ScholiaQ60692087MaRDI QIDQ972862FDOQ972862


Authors: Roberto Tauraso, Zhi-Wei Sun Edit this on Wikidata


Publication date: 21 May 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: Let p be a prime and let a be a positive integer. In this paper we determine and modulo p for all d=0,...,p^a, where m is any integer not divisible by p. For example, we show that if pot=2,5 then sum_{k=1}^{p-1}(-1)^kfrac{�inom{2k}k}k=-5frac{F_{p-(frac p5)}}p (mod p), where F_n is the n-th Fibonacci number and (-) is the Jacobi symbol. We also prove that if p>3 then sum_{k=1}^{p-1}frac{�inom{2k}k}k={8/9} p^2B_{p-3} (mod p^3), where B_n denotes the n-th Bernoulli number.


Full work available at URL: https://arxiv.org/abs/0805.0563




Recommendations




Cites Work


Cited In (70)





This page was built for publication: New congruences for central binomial coefficients

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