Paper
On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares
Authors
Peter Campbell
Abstract
We prove an explicit almost-prime analogue of Legendre's conjecture. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the previous best result of Dudek and Johnston, who showed that every such interval contains an integer with at most $4$ prime factors. The proof combines a finite verification for $n^2 \leq 10^{31}$, obtained from computations on primes in short intervals between consecutive squares together with explicit bounds on maximal prime gaps, with a fully explicit sieve-theoretic argument for the remaining range. For large $n$, we adapt Richert's logarithmic weights to intervals between consecutive squares and employ an explicit linear sieve of Bordignon, Johnston, and Starichkova.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.10356v1</id>\n <title>On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares</title>\n <updated>2026-03-11T03:10:12Z</updated>\n <link href='https://arxiv.org/abs/2603.10356v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.10356v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>We prove an explicit almost-prime analogue of Legendre's conjecture. Namely, for every integer $n \\geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the previous best result of Dudek and Johnston, who showed that every such interval contains an integer with at most $4$ prime factors. The proof combines a finite verification for $n^2 \\leq 10^{31}$, obtained from computations on primes in short intervals between consecutive squares together with explicit bounds on maximal prime gaps, with a fully explicit sieve-theoretic argument for the remaining range. For large $n$, we adapt Richert's logarithmic weights to intervals between consecutive squares and employ an explicit linear sieve of Bordignon, Johnston, and Starichkova.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.NT'/>\n <published>2026-03-11T03:10:12Z</published>\n <arxiv:comment>15 pages, 0 figures</arxiv:comment>\n <arxiv:primary_category term='math.NT'/>\n <author>\n <name>Peter Campbell</name>\n </author>\n </entry>"
}