Searching for strange hypergeometric identities by sheer brute force.
Apagodu, Moa, Zeilberger, Doron (2008)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A generalization of Gosper's algorithm to bibasic hypergeometric summation.”
Searching for strange hypergeometric identities by sheer brute force.
Pfaff's method. III: Comparison with the WZ method.
Andrews, George E. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a combinatorial problem of Asmus Schmidt.
Zudilin, W. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Symbolic summation assists combinatorics.
Schneider, Carsten (2006)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Automated proofs for some Stirling number identities.
Kauers, Manuel, Schneider, Carsten (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type.
Paule, Peter (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A high-tech proof of the Mills-Robbins-Rumsey determinant formula.
Petkovšek, Marko, Wilf, Herbert S. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Beukers' integrals and Apéry's recurrences.
Jain, Lalit, Tzermias, Pavlos (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Transformation formulas for terminating Saalschützian hypergeometric series of unit argument.
Bühring, Wolfgang (1995)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
The summation package Sigma: underlying principles and a rhombus tiling application.
Schneider, Carsten (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A Macsyma implementation of Zeilberger's fast algorithm.
Caruso, Fabrizio (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
A fast algorithm for the construction of recurrence relations for modified moments
Stanisław Lewanowicz (1994)
Applicationes Mathematicae
Similarity:
A new approach is presented for constructing recurrence relations for the modified moments of a function with respect to the Gegenbauer polynomials.