2000 character limit reached
On a supercongruence conjecture of Z.-W. Sun
Published 30 Mar 2020 in math.NT and math.CO | (2003.14221v2)
Abstract: In this paper, we partly prove a supercongruence conjectured by Z.-W. Sun in 2013. Let $p$ be an odd prime and let $a\in\mathbb{Z}{+}$. Then if $p\equiv1\pmod3$, we have \begin{align*} \sum_{k=0}{\lfloor\frac{5}6pa\rfloor}\frac{\binom{2k}k}{16k}\equiv\left(\frac{3}{pa}\right)\pmod{p2}, \end{align*} where $\left(\frac{\cdot}{\cdot}\right)$ is the Jacobi symbol.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.