A fast algorithm for proving terminating hypergeometric identities

Doron Zeilberger

doi:10.1016/j.disc.2006.03.026

A fast algorithm for proving terminating hypergeometric identities

Doron Zeilberger

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	1072-1075
Number of pages	4
Journal	Discrete Mathematics
Volume	306
Issue number	10-11
DOIs	https://doi.org/10.1016/j.disc.2006.03.026
State	Published - May 28 2006
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2006.03.026

Cite this

@article{eaa5665ffe5c4d15aedf9083e61e5f06,

title = "A fast algorithm for proving terminating hypergeometric identities",

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.",

author = "Doron Zeilberger",

year = "2006",

month = may,

day = "28",

doi = "10.1016/j.disc.2006.03.026",

language = "English (US)",

volume = "306",

pages = "1072--1075",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "10-11",

}

TY - JOUR

T1 - A fast algorithm for proving terminating hypergeometric identities

AU - Zeilberger, Doron

PY - 2006/5/28

Y1 - 2006/5/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33744513553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744513553&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.03.026

DO - 10.1016/j.disc.2006.03.026

M3 - Article

AN - SCOPUS:33744513553

VL - 306

SP - 1072

EP - 1075

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 10-11

ER -

A fast algorithm for proving terminating hypergeometric identities

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this