arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.0967math.NTmath.CO
收藏

涉及$g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$的同余

Congruences involving $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$

Zhi-Wei Sun

摘要:

为$n=0,1,2,...$定义$g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$。这些数$g_n=g_n(1)$与Apéry数和Franel数密切相关。本文建立了涉及$g_n(x)$的几个基本同余.例如,对于任何素数$p>5$,我们有$$\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.$$这类似于Wolstenholme对任何素数$p>3$的经典同余$$\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$$。

英文摘要:

Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Apéry numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For example, for any prime $p>5$ we have $$\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 $$\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>3$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑