论文标题
关于与整数值多项式有关的猜想
On a conjecture related to integer-valued polynomials
论文作者
论文摘要
使用以下$ _4f_3 $转换公式$ \ sum_ {k = 0}^{n} { - x-1 \ oflece k}^2 {x \ x \ select n-k}^2 = \ sum_ {k = 0} Zeilberger的算法可以证明，我们证实了Z.-W的最近猜想的一些特殊情况。太阳在整数值多项式上。
Using the following $_4F_3$ transformation formula $$ \sum_{k=0}^{n}{-x-1\choose k}^2{x\choose n-k}^2=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}^2{x+k\choose 2k}, $$ which can be proved by Zeilberger's algorithm, we confirm some special cases of a recent conjecture of Z.-W. Sun on integer-valued polynomials.
