When does Zeilberger's algorithm succeed?
A terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric term T( n, k) is presented. It is shown that the only information on T( n, k) that one needs in order to determine in advance whether this algorithm will succeed is the rational function T( n, k+1)/ T( n...
Gespeichert in:
| Veröffentlicht in: | Advances in applied mathematics 2003-04, Vol.30 (3), p.424-441 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric term
T(
n,
k) is presented. It is shown that the only information on
T(
n,
k) that one needs in order to determine in advance whether this algorithm will succeed is the rational function
T(
n,
k+1)/
T(
n,
k). |
|---|---|
| ISSN: | 0196-8858 1090-2074 |
| DOI: | 10.1016/S0196-8858(02)00504-3 |