The partition function in arithmetic progressions
From MaRDI portal
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}\).
Recommendations
Cited in
(20)- Arithmetic properties of the partition function
- Shifted distinct-part partition identities in arithmetic progressions
- Parity of sums of partition numbers and squares in arithmetic progressions
- Partitions into \(k\)th powers of terms in an arithmetic progression
- On the density of the odd values of the partition function and the t-multipartition function
- Recurrence sequences connected with the \(m\)-ary partition function and their divisibility properties
- Congruence restricted modular forms
- Parity of the coefficients of certain eta-quotients
- scientific article; zbMATH DE number 5832993 (Why is no real title available?)
- A proof of Subbarao's conjecture
- PARITY OF THE PARTITION FUNCTION IN ARITHMETIC PROGRESSIONS, II
- Computing the integer partition function
- scientific article; zbMATH DE number 5577844 (Why is no real title available?)
- Partitions Approximated by Finite Cosine-Series
- ON THE PARITY OF PARTITION FUNCTIONS
- Non‐vanishing of the partition function modulo odd primes l
- scientific article; zbMATH DE number 2156405 (Why is no real title available?)
- A COMPLETE SOLUTION OF THE PARTITION OF A NUMBER INTO ARITHMETIC PROGRESSIONS
- DIVISIBILITY OF THE PARTITION FUNCTION BY POWERS OF AND
- Distribution of parity of the partition function in arithmetic progressions
This page was built for publication: The partition function in arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271230)