Euler Product Sieve
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7QXI6YRIrecord.jsonopen to challenge →
classification
math.NT
keywords
eulerproductriemannauthorhypothesissieveallowsapproximations
read the original abstract
We study a class of approximations to the Riemann zeta function introduced earlier by the second author on the basis of Euler product. This allows us to justify Euler Product Sieve for generation of prime numbers. Also we show that Bounded Riemann Hypothesis (stated in a paper by the fourth author) is equivalent to conjunction the Riemann Hypothesis + the simplicity of zeros. 16 pages.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.