Robert Dougherty Bliss, Rutgers University

Abstract

Computers are now very good at evaluating finite sums in closed form. They can do them almost instantly and can often prove that a sum cannot be evaluated in closed form, like the partial sums of k!. Just like in calculus, we can fix summands that don't yield closed forms by multiplying them by a suitable "summation factor." I will show that this idea, applied to sums of falling factorials, produces sequences of polynomials closely related to the Bell numbers.

Link to video: https://vimeo.com/801007617

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/