A Mathematica version of Zeilberger’s algorithm for proving binomial coefficient identities. 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.
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Kovács, Laura: A complete invariant generation approach for P-solvable loops (2010)
- Kovács, Laura: Reasoning algebraically about P-solvable loops (2008)
- Kovács, Laura: Invariant generation for P-solvable loops with assignments (2008)
- Kovács, Laura: Aligator: A Mathematica package for invariant generation. (System description) (2008)
- Paule, Peter; Schorn, Markus: A \itMathematica version of Zeilberger’s algorithm for proving binomial coefficient identities (1995)