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

Supercongruences for sums involving $\binom ak^m$ (2204.10132v1)

Published 21 Apr 2022 in math.NT and math.CO

Abstract: Let $p$ be an odd prime, and let $a$ be a rational $p$-adic integer with $a\not\equiv 0\pmod p$. In this paper, using WZ method we establish the congruences for $\sum_{k=0}{p-1} \binom ak2(-1)k(1-\frac 2ak)$ modulo $p2$ and $\sum_{k=0}{p-1} \binom akr(1-\frac 2ak)s$ modulo $p4$, where $r\in{3,4}$ and $s\in{1,3}$.

Summary

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