Zeta functions and asymptotic additive bases with some unusual sets of primes

preprint2015arXivOpen access

Abstract

Fix δ∈(0,1]δ\in(0,1], σ0∈[0,1)σ_0\in[0,1) and a real-valued function ε(x)\varepsilon(x) for which lim sup⁡x→∞ε(x)≤0\limsup_{x\to\infty}\varepsilon(x)\le 0. For every set of primes P{\mathcal P} whose counting function πP(x)π_{\mathcal P}(x) satisfies an estimate of the form πP(x)=δ π(x)+O(xσ0+ε(x)),π_{\mathcal P}(x)=δ\,π(x)+O\bigl(x^{σ_0+\varepsilon(x)}\bigr), we define a zeta function ζP(s)ζ_{\mathcal P}(s) that is closely related to the Riemann zeta function ζ(s)ζ(s). For σ0≤12σ_0\le\frac12, we show that the Riemann hypothesis is equivalent to the non-vanishing of ζP(s)ζ_{\mathcal P}(s) in the region {σ>12}\{σ>\frac12\}. For every set of primes P{\mathcal P} that contains the prime 22 and whose counting function satisfies an estimate of the form πP(x)=δ π(x)+O((log⁡log⁡x)ε(x)),π_{\mathcal P}(x)=δ\,π(x)+O\bigl((\log\log x)^{\varepsilon(x)}\bigr), we show that P{\mathcal P} is an asymptotic additive basis for N{\mathbb N}, i.e., for some integer h=h(P)>0h=h({\mathcal P})>0 the sumset hPh{\mathcal P} contains all but finitely many natural numbers. For example, an asymptotic additive basis for N{\mathbb N} is provided by the set {2,547,1229,1993,2749,3581,4421,5281…}, \{2,547,1229,1993,2749,3581,4421,5281\ldots\}, which consists of 22 and every hundredth prime thereafter.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.