2000 character limit reached
A -adic () depth-$5$ supercongruence for Gaussian -th power sums over a square
Published 30 Jan 2026 in math.GM | (2602.00206v1)
Abstract: Let be an odd prime. Define the Gaussian power sum [ \G_n(p)=\sum_{a=1}{p-1}\sum_{b=1}{p-1}(a+b\ii)n\in\ZZ[\ii]. ] We determine $\G_p(p)$ modulo high powers of : if then $$\G_p(p)\equiv p<sup>2(1+\ii)\pmod{p<sup>3},$$ while for we prove the supercongruence [ \G_p(p)\equiv -\frac{p5}{12}(p-1)2(p-2)\,B_{p-3}\,(1-\ii)\pmod{p6}, ] where denotes the -th Bernoulli number. We also formulate several conjectures suggested by extensive computations.
Paper Prompts
Sign up for free to create and run prompts on this paper.