2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/142593Given 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 coefficients.13 pagesClassical Analysis and ODEsCombinatorics33F10; 05A19Converging to Gosper's Algorithmtext