The numbers and are defined as \begin{align*}
R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\
W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We
prove that, for any positive integer and odd prime , there hold
\begin{align*} \sum_{k=0}^{n-1}(2k+1)R_k^2 &\equiv 0 \pmod{n}, \
\sum_{k=0}^{p-1}(2k+1)R_k^2 &\equiv 4p(-1)^{\frac{p-1}{2}} -p^2 \pmod{p^3}, \
9\sum_{k=0}^{n-1}(2k+1)W_k^2 &\equiv 0 \pmod{n}, \ \sum_{k=0}^{p-1}(2k+1)W_k^2
&\equiv 12p(-1)^{\frac{p-1}{2}}-17p^2 \pmod{p^3}, \quad
\end{align*} The first two congruences were originally conjectured by Z.-W.
Sun. Our proof is based on the multi-variable Zeilberger algorithm and the
following observation: where $0\leqslant
k\leqslant n\leqslant m \leqslant 2n$.

生成讲解博客的中文版本

生成AI智能校验的中文版本