arXiv · 2004.02193
A Method of Verifying Partition Congruences by Symbolic Computation
Abstract
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed to efficiently check a very large number of cases of such conjectures. This allows substantial evidence to be collected for a given conjecture, before a complete proof is attempted.
Explore related subjects
Keep this discovery
Cristian-Silviu Radu, Nicolas Allen Smoot. 2020-04-05. A Method of Verifying Partition Congruences by Symbolic Computation. https://arxiv.org/abs/2004.02193
Cite the original work for its findings. Save a collection to share your selection of sources.