Abstract

A terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric term T( n, k) is presented. It is shown that the only information on T( n, k) that one needs in order to determine in advance whether this algorithm will succeed is the rational function T( n, k+1)/ T( n, k).

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