Pith. sign in

REVIEW

Euler Product Sieve

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.00786 v1 pith:7QXI6YRI submitted 2024-06-02 math.NT

Di Liu , Yuri Matiyasevich , Joseph Oesterlé , Alexandru Zaharescu This is my paper · ORCID
classification math.NT
keywords eulerproductriemannauthorhypothesissieveallowsapproximations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools