• Corpus ID: 115177808

Congruences modulo powers of 5 for three-colored Frobenius partitions

  title={Congruences modulo powers of 5 for three-colored Frobenius partitions},
  author={Xinhua Xiong},
  journal={arXiv: Number Theory},
  • Xinhua Xiong
  • Published 27 February 2010
  • Mathematics
  • arXiv: Number Theory
Motivated by a question of Lovejoy \cite{lovejoy}, we show that three-colored Frobenius partition function $\c3$ and related arithmetic fuction $\cc3$ vanish modulo some powers of 5 in certain arithmetic progressions. 
6 Citations

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

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

Infinitely many congruences modulo 5 for 4-colored Frobenius partitions

In his 1984 AMS Memoir, Andrews introduced the family of functions $$c\phi _k(n),$$cϕk(n), which denotes the number of generalized Frobenius partitions of $$n$$n into $$k$$k colors. Recently, Baruah

Congruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors

Several infinite families of congruences for $c\phi_k(n)$ where $k$ is allowed to grow arbitrarily large are proved, relying on a generating function representation which appears in Andrews' Memoir but has gone relatively unnoticed.

Generalized Frobenius partitions with 6 colors

We present the generating function for $$c\phi _6(n)$$cϕ6(n), the number of generalized Frobenius partitions of $$n$$n with $$6$$6 colors, in terms of Ramanujan’s theta functions and exhibit $$2$$2,



Ramanujan-Type Congruences for Three Colored Frobenius Partitions

Abstract Using the theory of modular forms, we show that the three-colored Frobenius partition function vanishes modulo some small primes in certain arithmetic progressions.

Congruences for Frobenius Partitions

Abstract The partition functionp(n) has several celebrated congruence properties which reflect the action of the Hecke operators on certain holomorphic modular forms. In this article similar

Parity of the Partition Function in Arithmetic Progressions, II

Let p(n) denote the ordinary partition function. Subbarao conjectured that in every arithmetic progression r (mod t) there are infinitely many integers N = r (mod t) for which p(N) is even, and

A simple proof of the Ramanujan conjecture for powers of 5.

Ramanujan conjectured, and G. N. Watson proved, that if n is of a specific form then p (n), the number of partitions of «, is divisible by a high power of 5. In the present note, we establish

Congruences for partition functions

The ordinary partition function p(n) and some of its generalizations satisfy some beautiful congruence properties. For instance, Ramanujan proved that for every integer n $$\begin{array}{*{20}c}

Courbes modulaires de genre 1

© Mémoires de la S. M. F., 1975, tous droits réservés. L’accès aux archives de la revue « Mémoires de la S. M. F. » (http:// smf.emath.fr/Publications/Memoires/Presentation.html) implique l’accord

Parity of the partition function in arithmetic progressions.