A fast algorithm for proving terminating hypergeometric identities (Q913796): Difference between revisions

This is a very brief description of an algorithm developed by the author for verifying identities for terminating hypergeometric series. A fuller account of this procedure with examples of its use to both prove and discover such identities can be found in ``WZ pairs certify combinatorial identities'' (preprint) by Herbert Wilf and Doron Zeilberger.''