Scale-free analysis and the prime number theorem
From MaRDI portal
Publication:4931723
DOI10.1142/S0218348X10004853zbMATH Open1209.11083arXiv1001.1490OpenAlexW2963645413MaRDI QIDQ4931723FDOQ4931723
Authors: Dhurjati Prasad Datta, Anuja Roy Choudhuri
Publication date: 30 September 2010
Published in: Fractals (Search for Journal in Brave)
Abstract: We present an elementary proof of the prime number theorem. The relative error follows a golden ratio scaling law and respects the bound obtained from the Riemann's hypothesis. The proof is derived in the framework of a scale free nonarchimedean extension of the real number system exploiting the concept of relative infinitesimals introduced recently in connection with ultrametric models of Cantor sets. The extended real number system is realized as a completion of the field of rational numbers under a {em new} nonarchimedean absolute value, which treats arbitrarily small and large numbers separately from a finite real number.
Full work available at URL: https://arxiv.org/abs/1001.1490
Recommendations
Cites Work
- Statistical mechanics of complex networks
- Riemann's zeta function
- Internal set theory: A new approach to nonstandard analysis
- A new class of scale free solutions to linear ordinary differential equations and the universality of the golden mean \((\sqrt 5-1)/2=0.618033\dots \)
- Non-Archimedean scale invariance and Cantor sets
- Higher derivative discontinuous solutions to linear ordinary differential equations: a new route to complexity?
Cited In (3)
This page was built for publication: Scale-free analysis and the prime number theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931723)