Contents

Several months after the end of the ``contest'' described in Section 5, Wilf and Petkovsek [in a paper published in this volume] using the WZ methodology proved in a direct and efficient way the most important special case of (5.1) (namely when

Given the parallelism that we have thus far described between Pfaff
proofs and WZ-proofs, it is natural to ask if, inspired by the success
of Wilf and Petkovsek, we can find a correspondingly easier proof of
the following special case of (5.1). Let **n** and **v** be non-negative
integers with ,

(by [6, p. 30, eq.(1),] (Click here to see this equation) with , ,

Hence the bottom line of (6.2) is proved.

For the top line of (6.2), we proceed using Pfaff's method:

Once (6.4) is established we may set **v = n** and use the bottom
line of (6.2) to conclude

Then by induction on **i** using (6.4) recursively, we conclude
that for :

This, then, is the result obtained by Wilf and Petkovsek and is sufficient to effect the evaluation of the Mills-Robbins-Rumsey determinant in [1].

Contents