Professional Documents
Culture Documents
Wilf Zeilberger Pair
Wilf Zeilberger Pair
W H A T
I S . . .
Akalu Tefera
(1)
k=n
2n
n+k
!3
P
Let S(n) = k F(n, k). To show S(n) = 1 for all
n n0 , it suffices to show that
(1)
3n!
= 3.
n!
508
If r (n) is not nice, then the more general algorithm of Zeilberger guarantees that it is holonomic
(a solution of a linear recurrence equation with
polynomial coefficients).
The WZ algorithm is implemented in Zeilbergers Maple package EKHAD, available from
http:// www. math. rutgers. edu/~zeilberg/,
and the built-in SumTools package in Maple. A
Mathematica package written by Peter Paule and
Markus Schorn is also available.
Example. Suppose we want to prove:
!
!2
n
X
2n
n
=
.
n
k
k=0
2
n
Applying the WZ algorithm to the summand k
yields a WZ-pair (F, G), where
2
n
k
F(n, k) = 2n , G(n, k) = R(n, k)F(n, k) and
n
k2 (3n + 3 2k)
.
2(n + 1 k)2 (2n + 1)
Doubling the fun! Besides getting a very short
proof for any given summation identity, one can
discover a new identity from a WZ-pair. Here is
how. Suppose the identity
X
F(n, k) = r (n), (n n0 ),
J
X
j=0
R(n, k) =
nn0
nn0
G(n, k) =
jk1
n 1,
X
1 n1
1 if k 2
.
=
0 otherwise
2n k 2
aj (n)S(n) = 0
j=0
n=1
Further Reading
[1] M. Petkovek, H. S. Wilf, and D. Zeilberger, A = B,
A. K. Peters, Wellesley, MA, 1996.
[2] H. Wilf and D. Zeilberger, Rational function certify
combinatorial identities, J. Amer. Math. Soc. 3 (1990),
147-158.
where
April 2010
509