Pith. sign in

REVIEW 1 cited by

Mertens' Proof of Mertens' Theorem

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 math/0504289 v3 pith:2VNHSQGO submitted 2005-04-14 math.HO math.NT

classification math.HOmath.NT
keywords mertensproofmethodsmoderntheorembettercomparecomputations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit numerical error estimates and computations of the Mertens "constant," both of which are missing from modern expositions. In as much as his strategy and techniques are quite different from today's methods, his original methods deserve to be better known.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Proof of Existence of Integers Excluding Two Residue Values in a Specific Range

    math.NT 2025-01 reject novelty 3.0 of 10

    The preprint asserts an existence result about integers avoiding two residues modulo primes, but the provided derivations only compute product asymptotics and do not prove the asserted existence.

Pith tools