Proving a class of hypergeometric identities by means of generating functions

MaRDI QIDQ4502586zbMATH OpenFDO

Authors Susanna Brogelli, Donatella Merlini, Renzo Sprugnoli

Publication date 17 May 2001

zbMATH Keywords

algorithmsstrange identities

Mathematics Subject Classification ID

Classical hypergeometric functions, ({}_2F_1) (33C05)

Review text

The paper deals with the finite sums \(_2F_1[a_1n+b_1,-n;a_2 n+b_1;\lambda]\). The authors set up an algorithm based upon Lagrange's inversion formula, generating functions, Sylvester's resultant of two polynomials, and Petkovšek's algorithm. The authors' algorithm may, e.g, be used to prove two ``strange sum formulas with \(\lambda= {1\over 9}\) originally conjectured by Gosper and proved by the reviewer [Simon Stevin 60, 329-337 (1986; Zbl 0621.33006)]. Three detailed examples of how the algorithm works are given: one of Gosper's sums and two known evaluations, one with \(\lambda= {8\over 9}\), and one with \(\lambda=-8\). For the entire collection see [Zbl 0941.00013].

Recommendations

• Towards computerized proofs of identities
• scientific article; zbMATH DE number 4006681
• Algorithms for m-fold hypergeometric summation
• Identities of nonterminating series by Zeilberger's algorithm
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities

Cited in

(1)

• scientific article; zbMATH DE number 5073468 (Why is no real title available?)

This page was built for publication: Proving a class of hypergeometric identities by means of generating functions

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