When does Zeilberger's algorithm succeed? (Q1408263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: When does Zeilberger's algorithm succeed? |
scientific article; zbMATH DE number 1981405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When does Zeilberger's algorithm succeed? |
scientific article; zbMATH DE number 1981405 |
Statements
When does Zeilberger's algorithm succeed? (English)
0 references
15 September 2003
0 references
The author presents a terminating condition of the Zeilberger's algorithm for a given hypergeometric term \(T(n,k)\). Some examples are given.
0 references
Zeilberger's algorithm
0 references
0 references
0.8369187116622925
0 references
0.8175294399261475
0 references
0.8173868656158447
0 references
