A fast algorithm for proving terminating hypergeometric identities (Reprinted from Discrete Mathematics, vol 80, pg 207-211, 1990)

被引:1
|
作者
Zeilberger, D [1 ]
机构
[1] Drexel Univ, Dept Math, Philadelphia, PA 19104 USA
关键词
D O I
10.1016/j.disc.2006.03.026
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
An algorithm for proving terminating hypergeometric identities, and thus binomial coefficients identities, is presented. It is based upon Gosper's algorithm for indefinite hypergeometric summation. A MAPLE program implementing this algorithm succeeded in proving almost all known identities. Hitherto the proof of such identities was an exclusively human endeavor. (c) 1990 Published by Elsevier B.V.
引用
收藏
页码:1072 / 1075
页数:4
相关论文
共 36 条