Guo and Liu's congruences for the sums S_n^(r) and T_n^(r)

At least 10 years old · documented by

Let nn and rr be positive integers, let pp be a prime, and define

Sn(r)=∑k=0n(nk)2(2kk)(2k+1)r,S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r, Tn(r)=∑k=0n(nk)2(2kk)(2k+1)r(−1)k.T_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r(-1)^k.

Guo and Liu's congruence conjecture. One has

∑k=0n−1Sk(2r)≡0(modn2),\sum_{k=0}^{n-1}S_k^{(2r)}\equiv0\pmod{n^2}, ∑k=0n−1Tk(2r)≡0(modn2),\sum_{k=0}^{n-1}T_k^{(2r)}\equiv0\pmod{n^2}, ∑k=0p−1Tk(2)≡p22(5−3(p5))(modp3).\sum_{k=0}^{p-1}T_k^{(2)}\equiv\frac{p^2}{2}\left(5-3\left(\frac{p}{5}\right)\right)\pmod{p^3}.

These conjectured congruences are among the results proved in the paper, confirming the claims for all indicated positive integers and primes.

References

Primary source

Guo-Shuai Mao, “Proof of some congruence conjectures of Guo and Liu”, arXiv:1511.06221 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.