The partition function in arithmetic progressions (Q1271230): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:45, 5 March 2024

scientific article
Language Label Description Also known as
English
The partition function in arithmetic progressions
scientific article

    Statements

    The partition function in arithmetic progressions (English)
    0 references
    0 references
    21 June 1999
    0 references
    Extending some of his own earlier work, the author makes the following conjecture, which is a refinement of a conjecture by Subbarao: Conjecture 2: If \(t\) is prime, let \(r\) be an integer such that \(24r\not\equiv 1\pmod t\). Then there exist infinitely many \(M\) such that \(M\equiv r\pmod t\) and \(p(M)\) is odd. Using the theory of modular forms, he proves that conjecture 2 holds for a set of primes whose density exceeds \(1- 10^{-1500}\).
    0 references
    partition function
    0 references
    arithmetic progressions
    0 references
    conjecture by Subbarao
    0 references
    modular forms
    0 references

    Identifiers