arXiv Analytics

Sign in

arXiv:1302.5708 [math.NT]AbstractReferencesReviewsResources

An Unexpected Congruence Modulo 5 for 4--Colored Generalized Frobenius Partitions

James A. Sellers

Published 2013-02-22Version 1

In his 1984 AMS Memoir, George Andrews defined the family of $k$--colored generalized Frobenius partition functions. These are denoted by $c\phi_k(n)$ where $k\geq 1$ is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all $n\geq 0,$ $c\phi_2(5n+3) \equiv 0\pmod{5}.$ Soon after, many authors proved congruence properties for various $k$--colored generalized Frobenius partition functions, typically with a small number of colors. In 2011, Baruah and Sarmah proved a number of congruence properties for $c\phi_4$, all with moduli which are powers of 4. In this brief note, we add to the collection of congruences for $c\phi_4$ by proving this function satisfies an unexpected result modulo 5. The proof is elementary, relying on Baruah and Sarmah's results as well as work of Srinivasa Ramanujan.

Related articles: Most relevant | Search more
arXiv:1003.1064 [math.NT] (Published 2010-03-04, updated 2010-04-29)
Congruence properties of the function which counts compositions into powers of 2
arXiv:1305.6031 [math.NT] (Published 2013-05-26)
Congruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors
arXiv:1603.09101 [math.NT] (Published 2016-03-30)
Some Congruences of a Restricted Bipartition Function