A method of verifying partition congruences by symbolic computation (Q2229703)

The methods developed by \textit{A. O. L. Atkin} [Glasg. Math. J. 8, 14--32 (1967; Zbl 0163.04302)], \textit{P. Paule} and \textit{C.-S. Radu} [Adv. Math. 230, No. 3, 819--838 (2012; Zbl 1300.11104)], \textit{C.-S. Radu} [J. Symb. Comput. 68, Part 1, 225--253 (2015; 1356.11072)] and others to actually prove conjectures involving infinite families of restricted partition congruences can be very difficult to verify for a number of individual cases, even with a computer. In this paper, the authors provide a more efficient way to verify a very large number of family of such congruences.