QDifferenceEquations[Zeilberger] - perform Zeilberger's algorithm (q-difference case)
|
Calling Sequence
|
|
Zeilberger(T, n, k, q, Qn)
|
|
Parameters
|
|
T
|
-
|
q-hypergeometric term in and
|
n
|
-
|
name
|
k
|
-
|
name
|
q
|
-
|
name
|
Qn
|
-
|
name; denote the q-shift operator with respect to
|
|
|
|
|
Description
|
|
•
|
Qn is the q-shift operator with respect to , defined by .
|
•
|
By assigning values to the global variables _MINORDER and _MAXORDER, the algorithm is restricted to finding a Z-pair for such that the order of L is between _MINORDER and _MAXORDER (the default value of _MAXORDER is 6).
|
•
|
The output from the Zeilberger command is a list of two elements representing the computed Z-pair .
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
>
|
|
| (5) |
>
|
|
| (6) |
|
|
References
|
|
|
Petkovsek, M.; Wilf, H.; and Zeilberger, D. A=B. Wellesley, Massachusetts: A K Peters, Ltd., 1996.
|
|
|
Download Help Document
Was this information helpful?