Congruences for Franel numbers

preprint2013arXivOpen access

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*}

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.