Computational proofs of congruences for \(2\)-colored Frobenius partitions (Q1607854): Difference between revisions

The second author [Int. J. Math. Math. Sci. 17, 187-188 (1994; Zbl 0922.05004)] conjectured the existence of an infinite family of congruences \[ c\phi_2(5^\alpha n+\lambda_\alpha)\equiv 0\pmod {5^\alpha} \] for the generalized Frobenius partitions \(c\phi_2(m)\) with two colors, where \(\lambda_\alpha\) is the least positive reciprocal of 12 modulo \(5^\alpha\). The case \(\alpha=1\) had previously been established by \textit{G. E. Andrews} [Mem. Am. Math. Soc. 301 (1984; Zbl 0544.10010)]. This paper proves the conjecture for \(\alpha= 1,2,3,4\) and all \(n\geq 0\). The method employs a finitization technique developed by the first author and \textit{K. Ono} [Analytic Number Theory, Vol. 1, Allerton Park, Il., 1995, Progr. Math. 138, 309-321 (1996; Zbl 0852.11056)].