2000 character limit reached
Proof of a Conjecture of Cui, Gu and Tang on 18-Colored Generalized Frobenius Partitions
Published 4 Sep 2026 in math.NT and math.CO | (2609.05302v1)
Abstract: Recently, the study of the number of -colored generalized Frobenius partitions, denoted by , has witnessed renewed interest. In this paper, we investigate congruence properties of and . Our main result is a proof of the conjecture of Cui, Gu, and Tang \cite{CGT25} that, for all , . The proof uses a -parametrization together with -series identities and dissections. We also establish congruences for modulo $1024$ and $2048$, and for modulo $8$ and $81$.
Paper Prompts
Sign up for free to create and run prompts on this paper.