当前位置: X-MOL 学术J. Symb. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Proof of a supercongruence via the Wilf–Zeilberger method
Journal of Symbolic Computation ( IF 0.7 ) Pub Date : 2021-04-28 , DOI: 10.1016/j.jsc.2021.04.001
Guo-Shuai Mao

In this paper, we prove a supercongruence via the Wilf–Zeilberger method and symbolic summation algorithms in the setting of difference rings. That is, for any prime p>3,n=0(p1)/23n+1(8)n(2nn)3p(1p)+p34(2p)Ep3(14)(modp4), where (p) stands for the Legendre symbol, and En(x) are the Euler polynomials. This confirms a special case of a recent conjecture of Z.-W. Sun (Sun, 2019, (2.18)).



中文翻译:

通过Wilf-Zeilberger方法证明超同余

在本文中,我们通过Wilf-Zeilberger方法和符号求和算法在差分环设置中证明了超同余。也就是说,对于任何素数p>3ñ=0p-1个/2个3ñ+1个-8ñ2个ññ3p-1个p+p342个pËp-31个4国防部p4 在哪里 p 代表勒让德(Legendre)符号,并且 ËñX是欧拉多项式。这证实了Z.-W最近猜想的特殊情况。周日(Sun,2019,(2.18))。

更新日期:2021-04-30
down
wechat
bug