论文标题
Gosper的算法和钟数
Gosper's algorithm and Bell numbers
论文作者
论文摘要
计算机擅长评估以封闭形式的有限总和，但是有有限的总和没有封闭形式。不产生封闭形式的汇总通常可以通过将它们乘以合适的多项式来``固定''。我们提供了一类此类多项式的明确描述，用于简单的超测量汇编，以钟数。
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.
