Computerizing the Andrews-Fraenkel-Sellers Proofs on the Number of m-ary partitions mod m (and doing MUCH more!)
classification
🧮 math.CO
keywords
m-arymuchnumberpartitionsproofsandrewsandrews-fraenkel-sellersarticle
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.