Abstract:
The structure of polynomial solutions to the Gosper’s key equation is analyzed. A method for rapid “extraction” of simple high-degree factors of the solution is given. It is shown that in cases when equation corresponds to a summable non-rational hypergeometric term the Gosper’s algorithm can be accelerated by removing non-essential dependency of its running time on the value of dispersion of its rational certificate.
