Gosper's algorithm and Bell numbers

10/24/2022

∙

by   Robert Dougherty-Bliss, et al.

∙

0

∙

share

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be “fixed” by multiplying them by a suitable polynomial. We provide an explicit description of a class of such polynomials for simple hypergeometric summands in terms of the Bell numbers.