Identities of nonterminating series by Zeilberger's algorithm

From MaRDI portal



Abstract: This paper argues that automated proofs of identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalsch"utz' summation formula in the non-terminating case this is illustrated.


The Gosper algorithm and in particular the subsequent Zeilberger algorithm and the related WZ method have been extremely successful for an approach by computer algebra to identities involving hypergeometric functions [cf. \textit{M. Petovšek}, \textit{H. S. Wilfe} and \textit{D. Zeilberger}, \(A=B\). Wellesley, MA: A. K. Peters (1996; Zbl 0848.05002)]. But this method remains restricted to the case of identities for the terminating hypergeometric series. The author shows that automated proofs of the identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. It is shown that the method extends to the non-terminating generalization of Saalschütz' summation formula for a terminating Saalschützian \({_3F_2}\) hypergeometric series of argumentation \(1\).





Describes a project that uses

Uses Software






This page was built for publication: Identities of nonterminating series by Zeilberger's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298586)