author = {William Y. C. Chen and Peter Paule and Husam L. Saad},
title = {{Converging to Gosper's Algorithm}},
language = {english},
abstract = {Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm and Abramov's algorithm for finding rational solutions to linear difference equations with polynomial coeficients.},
number = {08-20},
year = {2008},
month = {December},
note = {Published in: Advances in Applied Mathematics Volume 41, Issue 3, September 2008, Pages 351-364.},
length = {13},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}