In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg, in which the generating functions of a partition function over a given set of arithmetic progressions are expressed in terms of Dedekind eta quotients over a given congruence subgroup. These identities include the famous results by Ramanujan which provide a witness to the divisibility properties of $p(5n+4)$, $p(7n+5)$. We give an implementation of this algorithm using Mathematica. The basic theory is first described, and an outline of the algorithm is briefly given, in order to describe the functionality and utility of our package. We thereafter give multiple examples of applications to recent work in partition theory. In many cases we have used our package to derive alternate proofs of various identities or congruences; in other cases we have improved previously established identities.

2015年，Cristian-Silviu Radu设计了一种算法，用于检测Ramanujan和Kolberg研究的一类的身份，其中，在给定的等价子集上，Dedekind eta商表示在给定算术级数上的分区函数的生成函数。 。这些身份包括Ramanujan的著名结果，这些结果证明了Lamanujan的可除性。$p（5ñ+4）$， $p（7ñ+5）$。我们使用Mathematica给出了该算法的实现。首先介绍了基本理论，并简要介绍了算法概述，以描述我们软件包的功能和实用性。此后，我们给出了在分区理论的最新工作中应用的多个示例。在许多情况下，我们已经使用我们的软件包来得出各种身份或同余的替代证明。在其他情况下，我们改善了以前建立的身份。