New congruences for generalized Frobenius partitions with two or three colors (Q1331991): Difference between revisions

A generalized Frobenius partition of a positive integer \(n\) is a two- rowed array of nonnegative integers \(\left( \begin{smallmatrix} a_ 1 a_ 2\dots a_ r\\ b_ 1 b_ 2 \dots b_ r\end{smallmatrix} \right)\), where the entries in each row are arrranged in nonincreasing order and \(n= r+a_ 1+ \dots+ a_ r+ b_ 1+\dots +b_ r\). \textit{G. E. Andrews} [Mem. Am. Math. Soc. 301 (1984; Zbl 0544.10010)] studied the number \(c\varphi_ m (n)\) of generalized Frobenius partitions of \(n\) into distinct parts with \(m\) colours. He proved that \(c\varphi_ m (n)\equiv 0\bmod m^ 2\) if \(m\) is an odd prime not dividing \(n\). \textit{L. W. Kolitsch} [J. Number Theory 33, 220-223 (1989; Zbl 0679.10014); J. Number Theory 39, 279-284 (1991; Zbl 0734.11052)] introduced \(\overline {c\varphi}_ m (n)\) which denotes the number of generalized Frobenius partitions of \(n\) into distinct parts with \(m\) colours whose order is \(m\) under cyclic permutation of the \(m\) colours. He proves that \(\overline {c\varphi}_ m (n)\equiv 0\bmod m^ 2\). The author [Int. J. Math. Math. Sci. 16, 413-415 (1993; Zbl 0778.11056)] obtained \(\overline {c\varphi}_ m (mn)\equiv 0\bmod m^ 3\) for \(m=5\), 7, 11. In the paper under review the author proves that \(\overline {c\varphi}_ 2 (2n)\equiv 0\bmod 2^ 3\) and \(\overline {c\varphi}_ 3 (3n)\equiv 0\bmod 3^ 4\).