TY - JOUR

T1 - Computational proofs of congruences for 2-colored frobenius partitions

AU - Eichhorn, Dennis

AU - Sellers, James A.

PY - 2002

Y1 - 2002

N2 - 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 a≥1, cφ 2 (5an+λa)=0 (mod5a), where λa is the least positive reciprocal of 12 modulo 5a. In this paper, the first four cases of this family are proved.

AB - 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 a≥1, cφ 2 (5an+λa)=0 (mod5a), where λa is the least positive reciprocal of 12 modulo 5a. In this paper, the first four cases of this family are proved.

UR - http://www.scopus.com/inward/record.url?scp=17844393646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17844393646&partnerID=8YFLogxK

U2 - 10.1155/S0161171202007342

DO - 10.1155/S0161171202007342

M3 - Review article

AN - SCOPUS:17844393646

VL - 29

SP - 333

EP - 340

JO - International Journal of Mathematics and Mathematical Sciences

JF - International Journal of Mathematics and Mathematical Sciences

SN - 0161-1712

IS - 6

ER -