An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.
Wilf, Herbert S. ; Zeilberger, Doron
Inventiones mathematicae, Tome 110 (1992), p. 575-634 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1992-01-01
EUDML-ID : urn:eudml:doc:144006 
@article{GDZPPN002109786,
     title = {An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.},
     journal = {Inventiones mathematicae},
     volume = {110},
     year = {1992},
     pages = {575-634},
     zbl = {0739.05007},
     url = {http://dml.mathdoc.fr/item/GDZPPN002109786}
}

Wilf, Herbert S.; Zeilberger, Doron. An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.. Inventiones mathematicae, Tome 110 (1992) pp. 575-634. http://gdmltest.u-ga.fr/item/GDZPPN002109786/