Appeared in J. Comp. Appl. Math. 39 (1992) 379-382 .

Petkovsek's famous algorithm can always decide about the close-formness of a hypergemetric sum, but if you have at least one extra parameter, you can often prove it directly, using asymptotics.

(Plain ) .tex version (6 pages)

Note: The present Plain TeX version was obtained by applying my TroffToTeX translator to the original Troff source file

Doron Zeilberger's List of Papers