2000 character limit reached
Congruences concerning Jacobi polynomials and Apéry-like formulae
Published 24 Oct 2011 in math.NT | (1110.5308v5)
Abstract: Let $p>5$ be a prime. We prove congruences modulo $p{3-d}$ for sums of the general form $\sum_{k=0}{(p-3)/2}\binom{2k}{k}tk/(2k+1){d+1}$ and $\sum_{k=1}{(p-1)/2}\binom{2k}{k}tk/kd$ with $d=0,1$. We also consider the special case $t=(-1){d}/16$ of the former sum, where the congruences hold modulo $p{5-d}$.
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.