Algorithms for enumeration problem of linear congruence modulo \(m\) as sum of restricted partition numbers (Q2258125)

Denote the set of solutions of the congruence \(x_1+x_2+\dots+x_r\equiv c\pmod m\) with arbitrarily fixed \(m,r\in{\mathbb N}\) by \(M_{m,r}(c)\) (\(c=0,1,\dots,m-1\pmod m\)). In [``Enumeration problems for a linear congruence equation'', Taiwanese J. Math. 18, No. 1, 265--275 (2014)], \textit{W.-S. Chou} et al. considered the enumeration of solutions to the congruence \(x_1+x_2+\dots +x_r\equiv c\pmod m\), where \(x_1\leq x_2\leq\dots\leq x_r\), \(m\) and \(r\) are positive integers, and \(c\in{\mathbb Z}_m\), (\(m\geq2\)). From the authors' abstract: `` Due to the lack of a simple computation method for calculating the number of the solution of the congruence, we provide an algebraic and a recursive algorithm for those numbers. The former one can also give a new and simple approach to derive some properties of solution numbers.'' One algorithm is based on Theorem 3.5: Denote by \((i,j)_{m,\ell}\) the multiset of congruence solutions of \(x_1\equiv i\pmod m\), \(x_2+\dots+x_\ell\equiv j\pmod m\), \(x_2\geq x_1\), \(i,j\in{\mathbb Z}_m\). Then \(\left|(i,j)_{m,\ell}\right|=\sum_{k=i}^{m-1}\left|(k,j-k)_{m,\ell-1}\right|\) and \(\left|M_{m,\ell}(j)\right|=\sum_{i=0}^{m-1}\left|(i,j-1)_{m,\ell}\right|= \sum_{i=0}^{m-1}\sum_{k=i}^{m-1}\left|(k,j-i-k)_{m,\ell-1}\right|\).