Abstract

We show that the uniqueness of the Gosper–Petkovšek representation of rational functions can be utilized to give a simpler version of Gosper’s algorithm. This approach also applies to Petkovšek’s generalization of Gosper’s algorithm, and its q -analogues by Abramov–Paule–Petkovšek and Böing–Koepf.

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