Generalized Ramanujan Primes
Nadine Amersi, Olivia Beckwith, Steven J. Miller, Ryan Ronan and, Jonathan Sondow

TL;DR
This paper introduces a generalized concept of Ramanujan primes parameterized by c, proves their asymptotic behavior, and explores their distribution, revealing striking deviations from probabilistic models like the Cramer model.
Contribution
It generalizes Ramanujan primes with a parameter c, establishes their asymptotic distribution, and analyzes their distributional properties, highlighting significant deviations from probabilistic predictions.
Findings
R_{c,n} exists for all n and c
R_{c,n} asymptotically behaves like p_{n/(1-c)}
The fraction of c-Ramanujan primes converges to 1-c
Abstract
In 1845, Bertrand conjectured that for all integers , there exists at least one prime in . This was proved by Chebyshev in 1860, and then generalized by Ramanujan in 1919. He showed that for any , there is a (smallest) prime such that for all . In 2009 Sondow called the th Ramanujan prime and proved the asymptotic behavior (where is the th prime). In the present paper, we generalize the interval of interest by introducing a parameter and defining the th -Ramanujan prime as the smallest integer such that for all , there are at least primes in . Using consequences of strengthened versions of the Prime Number Theorem, we prove that exists for all and all , that as , and…
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
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · History and Theory of Mathematics
