Primes in the intervals between primes squared
Kolbj{\o}rn Tunstr{\o}m

TL;DR
This paper investigates the distribution of primes within intervals between consecutive prime squares, proposing conjectures about prime counts, variance, and their relation to the Riemann hypothesis, based on the unique sieving property of these intervals.
Contribution
It introduces new conjectures on prime distribution in prime square intervals and models the prime counting function as a sum of correlated random variables.
Findings
Evidence supporting the conjecture that $\pi_k \\sim |s_k|/ \\log p_{k+1}^2$
Proposal that $\\pi(x)$ can be modeled as a sum of correlated variables
Conjecture that $|\\pi(x)-li(x)|=O(\\sqrt{li(x)})$
Abstract
The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval is fully sieved by the first primes. Here we take advantage of this essential characteristic and present evidence for the conjecture that , where is the number of primes in ; or even stricter, that is both necessary and sufficient for the prime number theorem to be valid in intervals of length . In addition, we propose and substantiate that the prime counting function is best understood as a sum of correlated random variables . Under this assumption, we derive the theoretical variance of , from which we are led to conjecture that . Emerging from our…
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 · Advanced Mathematical Identities · Limits and Structures in Graph Theory
