A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities -- from Wolfram Library Archive

Title

A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities

Authors

P. Paule

M. Schorn

Journal / Anthology

Journal of Symbolic Computation

Year:

1995

Volume:

Issue:

5-6

Page range:

673-698

Description

Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithm for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation. Mathematica implementations of these algorithms are described. Nontrivial examples are given in order to illustrate the usage of these packages which are available by e-mail request to the first-named author.

Subject

Mathematics > Discrete Mathematics > Combinatorics

Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how »