Abstract A Maple package, which includes Radu’s algorithm and other algorithms of modular form tools, is provided. This enables us to prove or discover congruences for some restricted partition functions through building up Ramanujan-Kolberg identities, as well as perform many manipulations related to q-series and modular forms, such as dissection formulas and the Hecke operator. A pair of new partition congruences and their proof were found by this program as examples.
Zhang et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: