A generalization of Gosperʹs algorithm Original Research Article

We present a derivation of Gosperʹs algorithm which permits generalization to higher-order recurrences with constant least and most significant coefficients. Like Gosperʹs algorithm, the generalized algorithm requires only ‘rationalrs operations (such as gcd and resultant computations) but no factorization.