ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥5p\ge 5 be a prime and let nn be a positive integer. Let EmE_m denote the mm-th Euler number, and let Em(x)E_m(x) and Bm(x)B_m(x) denote the Euler and Bernoulli polynomials of degree mm, respectively. Z.-W. Sun's conjecture. The following four congruences hold:

16nn2(2nn)2(∑k=0np−1(2kk)216k−(−1p)∑k=0n−1(2kk)216k)≡−4p2Ep−3(modp3),\frac{16^n}{n^2{2n\choose n}^2}\left(\sum_{k=0}^{np-1}\frac{{2k\choose k}^2}{16^k}-\left(\frac{-1}{p}\right)\sum_{k=0}^{n-1}\frac{{2k\choose k}^2}{16^k}\right) \equiv -4p^2E_{p-3}\pmod{p^3}, 27nn2(2nn)(3nn)(∑k=0np−1(2kk)(3kk)27k−(−3p)∑k=0n−1(2kk)(3kk)27k)≡−32p2Bp−2(13)(modp3),\frac{27^n}{n^2{2n\choose n}{3n\choose n}}\left(\sum_{k=0}^{np-1}\frac{{2k\choose k}{3k\choose k}}{27^k}-\left(\frac{-3}{p}\right)\sum_{k=0}^{n-1}\frac{{2k\choose k}{3k\choose k}}{27^k}\right) \equiv -\frac{3}{2}p^2B_{p-2}\left(\frac{1}{3}\right)\pmod{p^3}, 64nn2(2nn)(4n2n)(∑k=0np−1(2kk)(4k2k)64k−(−2p)∑k=0n−1(2kk)(4k2k)64k)≡−p2Ep−3(14)(modp3),\frac{64^n}{n^2{2n\choose n}{4n\choose 2n}}\left(\sum_{k=0}^{np-1}\frac{{2k\choose k}{4k\choose 2k}}{64^k}-\left(\frac{-2}{p}\right)\sum_{k=0}^{n-1}\frac{{2k\choose k}{4k\choose 2k}}{64^k}\right) \equiv -p^2E_{p-3}\left(\frac{1}{4}\right)\pmod{p^3}, 432nn2(3nn)(6n3n)(∑k=0np−1(3kk)(6k3k)432k−(−1p)∑k=0n−1(3kk)(6k3k)432k)≡−20p2Ep−3(modp3).\frac{432^n}{n^2{3n\choose n}{6n\choose 3n}}\left(\sum_{k=0}^{np-1}\frac{{3k\choose k}{6k\choose 3k}}{432^k}-\left(\frac{-1}{p}\right)\sum_{k=0}^{n-1}\frac{{3k\choose k}{6k\choose 3k}}{432^k}\right) \equiv -20p^2E_{p-3}\pmod{p^3}.

These conjectures extend known supercongruences for truncated hypergeometric series and connect their pp-adic behavior with Euler numbers, Euler polynomials, and Bernoulli polynomials. Their general validity for all primes p≥5p\ge5 and positive integers nn is not established in the supplied source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.