Gosper's algorithm and Bell numbers
Symbolic Computation
2022-10-26 v1 Combinatorics
Number Theory
Abstract
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.
Cite
@article{arxiv.2210.13520,
title = {Gosper's algorithm and Bell numbers},
author = {Robert Dougherty-Bliss},
journal= {arXiv preprint arXiv:2210.13520},
year = {2022}
}
Comments
13 pages