Computational proofs of congruences for 2-colored Frobenius partitions
In 1994, the following infinite family of congruences was conjectured for the partition function cΦ2(n) which counts the number of 2-colored Frobenius partitions of n: for all n≥0 and α≥1, cΦ2(5αn+λα)≡0(mod5α), where λα is the least positive reciprocal of 12 modulo 5α. In this paper, the first four...
Main Authors: | Dennis Eichhorn, James A. Sellers |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2002-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S0161171202007342 |
Similar Items
-
Congruences involving generalized Frobenius partitions
by: James Sellers
Published: (1993-01-01) -
Congruences involving F-partition functions
by: James Sellers
Published: (1994-01-01) -
Combinatorial Proofs of Congruences
by: Rouse, Jeremy
Published: (2003) -
On congruence properties of the partition function
by: Jayce Getz
Published: (2000-01-01) -
Congruences in ordered pairs of partitions
by: Paul Hammond, et al.
Published: (2004-01-01)