Main Article Content
Arithmetic properties for two restricted partitions modulo powers of 5
Abstract
Let pk;3(n) count the number of 2-color partition triples of n where one of the colors appears only in parts that are multiples of k and Bk;ℓ(n) denote the number of (k; ℓ)-regular bipartitions of n. In this paper, we prove two innite families of congruences modulo 5 for p5;3(n), three innite families of congruences modulo powers of 5 for p25;3(n), and six infnite families of congruences modulo powers of 5 for B5;25(n). For instance, for any integers n ≥ 0 and α ≥1, we have
B5;25(52α - 1n +52α - 7) ≡ 0 (mod 5α).
6
and
B5;25(52α - 1n +52α - 7) ≡ 0 (mod 5α).
6
Key words: Partition, congruences, 2-color partition triples, (k; ℓ)-regular bipartitions.