Congruences modulo powers of 3 for 6-colored generalized Frobenius partitions

Abstract

In 1984, Andrews introduced the family of partition functions cφk(n), which enumerate generalized Frobenius partitions of n with k colors. In 2016, Gu, Wang, and Xia established several congruences for cφ6(n) and proposed a conjecture concerning congruences modulo powers of 3 for this function. In this paper, we resolve a revised version of their conjecture by employing an approach analogous to that developed by Banerjee and Smoot.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…