On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm (Q2229716)

The certain results from the theory of Riemann surfaces can be used to check the equality of two given modular functions by checking the equality of only a finite number of coefficients. Considering this fact, \textit{C.-S. Radu} [J. Symb. Comput. 68, Part 1, 225--253 (2015; Zbl 1356.11072)] designed an algorithm to detect identities of a class studied by Ramanujan and later by Kolberg. In this paper, the author provide an implementation of this algorithm using Mathematica.