A fast algorithm for proving terminating hypergeometric identities

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1072-1075
Number of pages4
JournalDiscrete Mathematics
Volume306
Issue number10-11
DOIs
StatePublished - May 28 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'A fast algorithm for proving terminating hypergeometric identities'. Together they form a unique fingerprint.

Cite this