Gosper's algorithm and Bell numbers
From MaRDI portal
Publication:6414975
arXiv2210.13520MaRDI QIDQ6414975FDOQ6414975
Authors: Robert Dougherty-Bliss 
Publication date: 24 October 2022
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.
This page was built for publication: Gosper's algorithm and Bell numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414975)
