Some questions concerning computer-generated proofs of a binomial double- sum identity

DOI10.1006/jsco.1993.1038zbMath0836.05003OpenAlexW1997229336MaRDI QIDQ1332649

George E. Andrews, Paule, Peter

Publication date: 20 February 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/55b4810619869a1778d4ade373366849cb39bbed

zbMATH Keywords

generating functionZeilberger's algorithmbinomial double-sum identity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items

Multiple binomial sums ⋮ Constructing minimal telescopers for rational functions in three discrete variables ⋮ On the summability of bivariate rational functions ⋮ An algorithm for deciding the summability of bivariate rational functions ⋮ A fast approach to creative telescoping ⋮ A note on two identities arising from enumeration of convex polyominoes ⋮ A telescoping method for double summations ⋮ Creative Telescoping for Holonomic Functions ⋮ MultInt, a MAPLE package for multiple integration by the WZ method

Uses Software

• Maple
• Mathematica