当前位置:
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
中文翻译:
通过Wilf-Zeilberger方法证明超同余
更新日期:2021-04-30
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 , where stands for the Legendre symbol, and 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方法和符号求和算法在差分环设置中证明了超同余。也就是说,对于任何素数, 在哪里 代表勒让德(Legendre)符号,并且 是欧拉多项式。这证实了Z.-W最近猜想的特殊情况。周日(Sun,2019,(2.18))。