Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Conjecture (M. Newman) (p. 295, quoted). "If is an integer, then for every residue class there are infinitely many nonnegative integers for which ."
Good primes (p. 295). A prime is good if for every residue class there is a nonnegative integer with and .
Theorem 3 (p. 295). Let be a good prime. Then Newman's conjecture holds for , and for each residue class ,
Corollary 4 (p. 295, quoted). "Newman's conjecture is true for every prime with the possible exception of ." The paper presents it as the outcome of a computation of good primes, run with code written by J. Haglund and C. Haynal, and does not list the computation's output. It records (p. 295) that Atkin, Newman and Kolberg had verified the conjecture for and , adding that the case is not proved in those papers but follows by an easy modification of their arguments.
Source. K. Ono, Distribution of the partition function modulo , Ann. of Math. (2) 151 (2000), no. 1, 293--307; the definition, Theorem 3 and Corollary 4 on p. 295, the proof of Theorem 3 on pp. 302--303. Pages are the journal's, as printed in the running heads of the copy identified on the source card.
Read depth. Claims checked: the definition, Theorem 3 and Corollary 4 were read clause by clause on the page image. The proof of Theorem 3 was read and followed at the level of its steps; the computation behind Corollary 4 is not printed and was not checked. Nothing here is independently reviewed.
Proof pointer
Pages 302--303. With fixed for each and the product of the primes dividing some , the form lies modulo in the half-integral weight cusp space of level , so Serre's theorem and the Shimura correspondence give a positive proportion of primes with . The formula (11) for , with quadratic reciprocity for the symbol , then makes congruent modulo to times a sign independent of (display (13)), so for every large such these values meet every class. Counting such , which are in number, gives the bound; the bound for comes from Theorem 1.
Dependencies
Theorems 1, 6 and 8 and Proposition 7 of the same paper; Serre's theorem ([S], 6.4) and the Shimura correspondence ([Sh], [Ci], [Ni]).
Bears on
No Erdős problem in this corpus. Newman's conjecture is not one of the problems recorded here.