2018/10/22 by Zhang, Yong, Pan, Hao
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1810.09370
Let p be an odd prime and let n be a positive integer. For any positive integer α and m∈\1,2,3\, we have ∑k=0pαn-1((\frac12)k)/(k!)⋅((-4)k)/(mk)≡((m(m-4))/(p))∑k=0^pα-1n-1((\frac12)k)/(k!)⋅((-4)k)/(mk)\pmodp2α, where (x)k=x(x+1)⋯(x+k-1) and ((⋅)/(⋅)) denotes the Legendre symbol. Also, when m=4, ∑k=0pαn-1(-1)k⋅((\frac12)k)/(k!)≡ p∑k=0^pα-1n-1(-1)k⋅((\frac12)k)/(k!)\pmodp2α.