On two congruence conjectures (Q2280080)

This paper proves two pretty congruences and one super-congruence in an elementary manner. The congruences proved modulo an odd prime \(p\) are: \[ \sum_{n=0}^{p-1} (5n+1) \binom{4n}{2n} \equiv - \bigg(\frac{p}{3}\bigg), \] \[ \sum_{n=0}^{p-1} (3n+1) \binom{4n}{2n} \equiv - \frac{1}{5} \bigg(\frac{p}{5}\bigg).\] For an odd prime \(p\), the authors prove the following super-congruence modulo \(p^4\). It is known that the sequence of numbers \[ C_n = \sum_{k=0}^n \binom{2k}{k}^2 \binom{2n-2k}{n-k}^2 \] arises as coefficients of solutions to Calabi-Yau type equations. Then, the authors' super-congruence asserts: \[ \sum_{n=0}^{p-1} \frac{n}{32^n} C_n \equiv -2p^3 E_{p-3}\pmod{p^4} \] where \(E_{p-3}\) is the \((p-3)\)rd Euler number.