An improved lower bound for odd integers not of the form p+2a+2b
Abstract
Let x be sufficiently large and \[ N(x)=|\n x:n\ is odd and n p+2a+2b with p a prime and a,b∈ N\|. \] Motivated by Crocker's result \[ N(x) x, \] Erd os repeatedly asked whether there is an absolute constant c0 such that N(x)>c0x. Pan Pan proved in 2011 that \[ N(x) x\!( -C0 x x x ), \] where C0>0 is an absolute constant. We improve on Pan's result by showing that, given any η>0, for all sufficiently large x, \[ N(x)ηx(-(4+η) x x x). \]
0
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.