The $n$th+1 Prime Number Limit Formulas
Artur Kawalec

TL;DR
This paper introduces a novel derivation of Golomb's limit formula for the next prime number using Euler's product representation of the zeta function, along with new variations involving logarithmic and half-prime formulas.
Contribution
It presents a new derivation method for prime limit formulas and explores variations, expanding the theoretical understanding of prime number generation.
Findings
Derived Golomb's limit formula from Euler's zeta function
Introduced new variations of prime limit formulas
Enhanced theoretical framework for prime number approximation
Abstract
A new derivation of Golomb's limit formula for generating the th prime number is presented. The limit formula is derived by extracting from Euler's prime product representation of the Riemann zeta function in the limit as approaches infinity. Also, new variations of these limit formulas are explored, such as the logarithm and a half-prime formulas for the .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Advanced Mathematical Identities
