2025/10/13 by Han, Hui-Li, Wang, Chen
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2510.11338
In this paper, we study some supercongruences involving the sequence tn(x)=∑k=0n\binomnk\binomxk\binomx+kk2k and solve some open problems. For any odd prime p and p-adic integer x, we determine ∑n=0p-1tn(x)2 and ∑n=0p-1(n+1)tn(x)2 modulo p2; for example, we establish that
∑n=0p-1tn(x)2≡\begincases
(\dfrac-1p)\pmodp2,amp;if 2x≡-1\pmodp,
(-1)⟨ x⟩p\dfracp+2(x-⟨ x⟩p)2x+1\pmodp2,amp;otherwise,
\endcases where ⟨ x⟩p denotes the least nonnegative residue of x modulo p. This confirms a conjecture of Z.-W. Sun.