On the solutions of three-variable Frobenius-related problems using order reduction approach (Q2238444)

The authors Frobenius-related problems with three variables. They propose algorithms for finding the number of solutions of the equation \(px+qy+lz=n\) for fixed \(p\), \(q\), \(l\ge 1\). They call their methods ``order reducing methods'', where the ``order'' means the number of variables. One of the main results is the following statement (a part of the Theorem 2). Let \(M(p,q,l,n)\) be the number of solutions of equation \(px+qy+lz=n\), and let \((p,q)=u.\) Then \[N(p,q,l,n)=\sum_{\substack{0\le z\le [n/l]\\ u\mid (n-zl)}}(1+M(z)),\] where \[M(z)=\max\left\{-1,\frac{u}{ pq}(n-zl-pa_1(z)-qb_1(z))\right\},\] \(a_1(z)\) and \(b_1(z)\) are the smallest nonnegative integers satisfying \[ pa_1(z)\equiv (n-zl)\pmod{ q},\quad qb_1(z)\equiv (n-zl)\pmod{ p}, \] respectively.