English

Congruences for Franel numbers

Number Theory 2015-03-19 v9 Combinatorics

Abstract

The Franel numbers given by fn=k=0n(nk)3f_n=\sum_{k=0}^n\binom{n}{k}^3 (n=0,1,2,n=0,1,2,\ldots) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel numbers. We mainly establish for any prime p>3p>3 the following congruences: \begin{align*}\sum_{k=0}^{p-1}(-1)^kf_k&\equiv\left(\frac p3\right)\ \ (\mbox{mod}\ p^2), \\ \sum_{k=0}^{p-1}(-1)^k\,kf_k&\equiv-\frac 23\left(\frac p3\right)\ \ (\mbox{mod}\ p^2), \\ \sum_{k=1}^{p-1}\frac{(-1)^k}kf_k &\equiv0\ \ (\mbox{mod}\ p^2), \\ \sum_{k=1}^{p-1}\frac{(-1)^k}{k^2}f_k&\equiv0\ \ (\mbox{mod}\ p). \end{align*}

Keywords

Cite

@article{arxiv.1112.1034,
  title  = {Congruences for Franel numbers},
  author = {Zhi-Wei Sun},
  journal= {arXiv preprint arXiv:1112.1034},
  year   = {2015}
}

Comments

12 pages. Final published version

R2 v1 2026-06-21T19:46:37.197Z