Congruences involving gn(x)=∑k=0n(nk)2(2kk)xkg_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k

preprint2016arXivOpen access

Abstract

Define gn(x)=∑k=0n(nk)2(2kk)xkg_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k for n=0,1,2,...n=0,1,2,.... Those numbers gn=gn(1)g_n=g_n(1) are closely related to Apéry numbers and Franel numbers. In this paper we establish some fundamental congruences involving gn(x)g_n(x). For example, for any prime p>5p>5 we have ∑k=1p−1gk(−1)k≡0(modp2)and∑k=1p−1gk(−1)k2≡0(modp).\sum_{k=1}^{p-1}\frac{g_k(-1)}{k}\equiv 0\pmod{p^2}\quad{and}\quad\sum_{k=1}^{p-1}\frac{g_k(-1)}{k^2}\equiv 0\pmod p. This is similar to Wolstenholme's classical congruences ∑k=1p−11k≡0(modp2)and∑k=1p−11k2≡0(modp)\sum_{k=1}^{p-1}\frac1k\equiv0\pmod{p^2}\quad{and}\quad\sum_{k=1}^{p-1}\frac{1}{k^2}\equiv0\pmod p for any prime p>3p>3.

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.