Newman's conjecture for the partition function modulo integers with at least two distinct prime divisors
Abstract: Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that [ p(n)\equiv r \pmod{M}. ] For a positive integer $d$, let $B_{d}$ be the set of positive integers $M$ such that the number of prime divisors of $M$ is $d$. In this paper, we prove that for each positive integer $d$, the density of the set of positive integers $M$ for which Newman's Conjecture holds in $B_{d}$ is $1$. Furthermore, we study an analogue of Newman's Conjecture for weakly holomorphic modular forms on $\Gamma_0(N)$ with nebentypus, and this applies to $t$-core partitions and generalized Frobenius partitions with $h$-colors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.