Abstract

A partial proof of the van Hoeij-Abramov conjecture on the algorithm of definite rational summation is given. The results obtained underlie an algorithm for finding a wide class of sums of the form $$\sum\limits_{k = 0}^{n - 1} {R\left( {k,n} \right)} $$ .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call