Euler Product Sieve
Number Theory
2024-06-04 v1
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.
Cite
@article{arxiv.2406.00786,
title = {Euler Product Sieve},
author = {Di Liu and Yuri Matiyasevich and Joseph Oesterlé and Alexandru Zaharescu},
journal= {arXiv preprint arXiv:2406.00786},
year = {2024}
}