An improved lower bound for odd integers not of the form p+2a+2b
Yuchen DingYu-Chen SunLilu Zhao
所有作者
Yuchen DingYu-Chen SunLilu Zhao
文献摘要
Let x be sufficiently large and N(x)={n≤x:nis odd and n=p+2a+2b with p a prime and a,b∈N}. Motivated by Crocker’s result N(x)≫loglogx, Erd\H os repeatedly asked whether there is an absolute constant c0 such that N(x)>c0x. Pan \cite{Pan} proved in 2011 that N(x)≫xexp(−C0logloglogxloglogloglogxlogx), 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)≫ηxexp(−(4+η)loglogxlogloglogxlogx).