Sieve Procedure for the Möbius prime-functions, the Infinitude of Primes and the Prime Number Theorem

Abstract

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding Möbius prime-function, which in the limit of infinitely large primes becomes identical to the original Möbius function. Discussing this limit we present two simple proofs of the Prime Number Theorem. In the framework of this approach we give several proofs of the infinitude of primes.

arXiv comment16 pages, critically reviewed both proofs of the Prime Number Theorem, added details and new results

References in corpus (1)

• Formulas for Positive, Negative and Zero Values of the Möbius Function

Cited by in corpus (1)

• Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof