Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a new proof of the Prime Number Theorem

Published 30 Mar 2011 in math.GM | (1103.6176v1)

Abstract: A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more simplified manner. Basic properties of some key concepts such as infinitesimals, the associated nonarchimedean absolute values, invariance of measure and cardinality of a compact subset of the real line under an IFS are discussed more thoroughly. Some interesting applications of the formalism in analytic number theory are also presented. The error term as dictated by the Riemann hypothesis also follows naturally thus leading to an indirect proof of the hypothesis.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.