New congruences modulo 5 for the number of 2-color partitions (Q2517132): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2015.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W807525068 / rank
 
Normal rank

Revision as of 19:26, 19 March 2024

scientific article
Language Label Description Also known as
English
New congruences modulo 5 for the number of 2-color partitions
scientific article

    Statements

    New congruences modulo 5 for the number of 2-color partitions (English)
    0 references
    14 August 2015
    0 references
    Let \(p_k(n)\) be the number of two-color partitions of \(n\) where parts of the second color are all multiples of \(k\). The generating function for \(p_k(n)\) is \[ \sum_{n \geq 0} p_k(n)q^n = \prod_{n \geq 1} \frac{1}{(1-q^n)(1-q^{kn})}. \] The authors show that for \(k \in \{2,3,4\}\) and \(\ell = 24 - k\) we have the congruence \[ p_k(25n + \ell) \equiv 0 \pmod{5}. \] They also conjecture that the congruence holds for \(k \in \{7,8,17\}\). The proofs employ identities involving the Rogers-Ramanujan continued fraction.
    0 references
    partitions
    0 references
    2-color partitions
    0 references
    congruences
    0 references
    Rogers-Ramanujan continued fraction
    0 references

    Identifiers