Pith. sign in

REVIEW

On the proof of the Prime Number Theorem using Order Estimates for the Chebyshev Theta Function

Not yet reviewed by Pith; the record is open.

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 2308.07245 v1 pith:QBR7OURY submitted 2023-08-14 math.HO math.NT

On the proof of the Prime Number Theorem using Order Estimates for the Chebyshev Theta Function

classification math.HO math.NT
keywords functionproofshalltextitchebyshevestimatesmathematiciannumber
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we shall study the stellar work of Norwegian mathematician Selberg and Hungarian mathematician Erd\H{o}s in providing an Elementary proof of the well-known \textit{Prime Number Theorem}. In addition to introducing ourselves to the notion of \textit{Arithmetic Functions}, we shall primarily focus our research on obtaining suitable estimates for the \textit{Chebyshev Theta Function} $\vartheta(x)$. Furthermore, we'll try to infer about the asymptotic properties of another function $\rho(x)$, which shall be needed later on in establishing an equivalent statement of our main result. All the mathematical terminologies pertinent to the proof have been discussed in the earlier sections of the text.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.