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) r M. \] For a positive integer d, let Bd 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 Bd is 1. Furthermore, we study an analogue of Newman's Conjecture for weakly holomorphic modular forms on 0(N) with nebentypus, and this applies to t-core partitions and generalized Frobenius partitions with h-colors.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.