2000 character limit reached
On the Density of Prime Imbalances in the Unit Interval
Published 1 Jun 2025 in math.GM | (2506.12063v1)
Abstract: We prove that the set of normalized differences between primes, defined as $S = {(p-q)/(p+q) : p > q \text{ are primes}}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative bounds, relying on elementary results from prime number theory including Bertrand's postulate and explicit bounds on prime gaps in long intervals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.