Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On sums of Apéry polynomials and related congruences (1101.1946v4)

Published 10 Jan 2011 in math.NT and math.CO

Abstract: The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}n\binom nk2\binom{n+k}k2xk\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that $$\sum_{k=0}{p-1}(-1)kA_k(x)\equiv\sum_{k=0}{p-1}\frac{\binom{2k}k3}{16k}xk\pmod{p2},$$ and that $$\sum_{k=0}{p-1}A_k(x)\equiv\left(\frac xp\right)\sum_{k=0}{p-1}\frac{\binom{4k}{k,k,k,k}}{(256x)k}\pmod{p}$$ for any $p$-adic integer $x\not\equiv 0\pmod p$. This enables us to determine explicitly $\sum_{k=0}{p-1}(\pm1)kA_k$ mod $p$, and $\sum_{k=0}{p-1}(-1)kA_k$ mod $p2$ in the case $p\equiv 2\pmod3$. Another consequence states that $$\sum_{k=0}{p-1}(-1)kA_k(-2)\equiv\begin{cases}4x2-2p\pmod{p2}&\mbox{if}\ p=x2+4y2\ (x,y\in\mathbb Z),\0\pmod{p2}&\mbox{if}\ p\equiv3\pmod4.\end{cases}$$ We also prove that for any prime $p>3$ we have $$\sum_{k=0}{p-1}(2k+1)A_k\equiv p+\frac 76p4B_{p-3}\pmod{p5}$$ where $B_0,B_1,B_2,\ldots$ are Bernoulli numbers.

Summary

We haven't generated a summary for this paper yet.