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

preprint2011arXivOpen access

Abstract

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime pp 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.