A Method of Verifying Partition Congruences by Symbolic Computation
Number Theory
2021-12-08 v1
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.
Cite
@article{arxiv.2004.02193,
title = {A Method of Verifying Partition Congruences by Symbolic Computation},
author = {Cristian-Silviu Radu and Nicolas Allen Smoot},
journal= {arXiv preprint arXiv:2004.02193},
year = {2021}
}
Comments
To appear in the Journal of Symbolic Computation