Computerizing the Andrews-Fraenkel-Sellers Proofs on the Number of m-ary partitions mod m (and doing MUCH more!)

Doron Zeilberger, Shalosh B. XIV Ekhad

Publication date: 20 November 2015

Abstract: In this short article, two recent beautiful proofs of George Andrews, Aviezri Fraenkel, and James Sellers, about the mod m characterization of the number of m-ary partitions are simplified and streamlined, and then generalized to handle many more cases, and prove much deeper theorems, with the help of computers, of course.

This page was built for publication: Computerizing the Andrews-Fraenkel-Sellers Proofs on the Number of m-ary partitions mod m (and doing MUCH more!)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6267612)