On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares

This paper proves that for every integer $n \geq 1$, the interval between consecutive squares $(n^2, (n+1)^2)$ contains an integer with at most three prime factors, improving the previous bound of four by combining finite verification up to $10^{31}$ with explicit sieve-theoretic arguments.

The Gist

Imagine the number line as an infinite highway stretching out forever. On this highway, prime numbers are like rare, golden islands. They are the building blocks of all other numbers, but they are scattered sparsely and unpredictably.

For over a century, mathematicians have been obsessed with a specific question about these islands: If you look at the stretch of road between two perfect squares (like between 100 and 121, or 1,000,000 and 1,000,000 + 2,000 + 1), is there always at least one golden island (a prime number)?

This is known as Legendre's Conjecture. It sounds simple, but it is incredibly hard to prove. It's like trying to prove that every single mile of a specific type of highway has a gas station, even though you can't see the whole highway at once.

The Problem: The "Prime" Gap

The author of this paper, Peter Campbell, admits that proving there is always a prime number in these intervals is currently impossible with our best tools. It's like trying to find a needle in a haystack, but the haystack keeps growing.

So, instead of looking for a "pure" prime (which has only one factor: itself), Campbell decided to look for "almost primes."

Think of an almost prime as a "near-miss" or a "hybrid" vehicle.

• A Prime is a pure electric car (1 factor).
• An Almost Prime is a car with a small engine and a battery (2 or 3 factors). It's not pure, but it's very close.

The question changes from: "Is there always a pure electric car in this stretch?" to "Is there always a car with at most 3 parts in this stretch?"

The Previous Best Attempt

Before this paper, the best anyone had done was to prove that there is always a car with at most 4 parts in these intervals. It was a good start, but mathematicians wanted to get closer to the "pure" ideal. They wanted to prove there was always a car with 3 parts or fewer.

The Solution: A Two-Pronged Attack

Campbell's paper is like a master detective story that uses two different strategies to solve the case, depending on how big the numbers are.

1. The "Small Numbers" Strategy: The Super-Computer Check

For the "small" stretches of the highway (numbers up to a certain huge limit), the proof relies on brute force computation.

• The Analogy: Imagine checking every single house on a small street to see if it has a mailbox. You can't do this for the whole world, but for a small neighborhood, you can send a robot to check every single door.
• The Trick: The author didn't just check for primes. He used a clever trick involving "semi-primes" (numbers made of exactly two primes). He showed that if a prime doesn't exist in a specific small gap, you can construct a number with just two factors that fits perfectly in that gap. This allowed him to verify the rule for numbers up to a massive limit ($10^{31}$), which is far beyond what a human could count.

2. The "Large Numbers" Strategy: The Sieve

For the "huge" numbers (where computers can't check every single one), the author uses a mathematical tool called a Sieve.

• The Analogy: Imagine you have a giant bucket of sand (all the numbers in the interval). You want to find a specific type of grain. You pour the sand through a series of sieves (mesh screens).
  • The first sieve removes numbers divisible by 2.
  • The second removes numbers divisible by 3.
  • And so on.
• The Innovation: Previous mathematicians used a standard sieve that was a bit "clunky" for this specific shape of interval (the space between squares). Campbell adapted a newer, more sophisticated sieve technique (using "logarithmic weights," which is like adding a special lubricant to the sieve so it catches the right grains more efficiently).
• The Result: By tuning the mesh size of the sieve perfectly, he proved that even in the vast, uncharted territory of huge numbers, you can never empty the bucket completely. There will always be at least one "grain" left that has 3 or fewer prime factors.

The "Square" vs. "Cube" Challenge

The paper mentions that this problem is harder for "squares" (like $n^2$) than for "cubes" ($n^3$).

• The Analogy: Think of the interval between squares as a narrow alleyway. It's so tight that there's very little room to maneuver.
• Think of the interval between cubes as a wide boulevard. There's plenty of space to find a prime.
• Because the "alleyway" (squares) is so narrow, the mathematical tools have to be much more precise. Campbell had to tweak the tools specifically for this narrow space, rather than just using the tools designed for the wide boulevard.

The Big Takeaway

Peter Campbell didn't solve the ultimate mystery (proving there is always a pure prime). But he took a giant leap forward.

He proved that in every single gap between two consecutive squares, no matter how large the numbers get, there is always a number that is "almost" prime—specifically, a number made of at most 3 prime building blocks.

It's like saying: "We can't guarantee there's a gas station on every mile of this highway, but we can guarantee there's always a car with a spare tire and a full tank within the next mile." It's a massive step toward understanding how numbers are distributed in the universe.

Technical Summary

Here is a detailed technical summary of the paper "On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares" by Peter Campbell.

1. Problem Statement

The paper addresses a variation of Legendre's Conjecture, which posits that for every integer $n \ge 1$, the interval $(n^2, (n+1)^2)$ contains at least one prime number. While Legendre's conjecture remains unproven even under the Riemann Hypothesis, this paper investigates a relaxed version: determining the smallest integer $k$ such that every interval $(n^2, (n+1)^2)$ contains an integer $a$ with at most $k$ prime factors (counted with multiplicity), denoted as $\Omega(a) \le k$.

• Context:
  • Brun (1920) showed $k=11$ for sufficiently large $n$.
  • Chen (1973) improved this to $k=2$ for sufficiently large $n$.
  • Dudek and Johnston (2023) proved an explicit result for all $n \ge 1$ with $k=4$.
• Goal: To improve the explicit bound for all $n \ge 1$ from $k=4$ to $k=3$.

2. Methodology

The proof employs a hybrid approach combining computational verification for small values of $n$ and explicit analytic sieve theory for large values. The methodology adapts techniques previously used for intervals between consecutive cubes to the more difficult square-interval setting.

A. Finite Verification (Small $n$)

For the range $n^2 \le 10^{31}$, the author provides a computational proof that the interval contains an integer with at most 2 prime factors ($\Omega(a) \le 2$).

• Strategy:
  • For $n \le 7.05 \times 10^{13}$, the result relies on existing computations by Sorenson and Webster verifying the existence of primes in these intervals.
  • For $7.05 \times 10^{13} < n$such that$n^2 \le 10^{31}$, the author constructs a **semiprime**$pq$within the interval. This is achieved by selecting a specific prime$p$such that the rescaled interval for$q$is large enough to guarantee a prime exists within known maximal prime gap bounds (specifically, gaps below$6.8 \times 10^{19}$are known to be$\le 1724$).

B. Analytic Argument (Large $n$)

For $n^2 \ge 10^{31}$, the proof utilizes Richert's weighted sieve combined with the explicit linear sieve of Bordignon, Johnston, and Starichkova.

• Set Definition: The set $A$ is defined as the integers in the interval $(N, N + 2\sqrt{N})$ where $N=n^2$. The size of this set is approximately $2\sqrt{N}$.
• Weighted Sifting: The author defines a weighted sifting function $W(A, P, z)$ using Richert's logarithmic weights. This allows for a lower bound on the count of integers with $\Omega(a) \le k$.
• Key Adaptations from Cube-Intervals:
  • The geometry of square intervals is "tighter" (length $\approx 2\sqrt{N}$) compared to cube intervals (length $\approx 3N^{2/3}$). This reduces flexibility in parameter choices.
  • The author adapts the scale of the sieve parameters. Where cube-interval proofs used a scale of $N^{2/3}$, this proof uses a scale of $\sqrt{N}$ (exponent $1/2$).
  • Proposition 3.5 provides a new explicit upper bound for the weighted sifting sum tailored to the square-interval set $A(N)$.
  • Lemma 4.3 verifies the "square-factor condition" ($Q_0(c, \delta)$), ensuring that the loss from excluding elements with square factors in the intermediate prime range is negligible.

3. Key Contributions

1. Improvement of Explicit Bounds: The paper proves that for every integer $n \ge 1$, there exists an integer $a \in (n^2, (n+1)^2)$ such that $\Omega(a) \le 3$. This improves upon the previous best result of $\Omega(a) \le 4$.
2. Extension of Finite Verification: The computational verification range is extended to $n^2 \le 10^{31}$, significantly reducing the range requiring analytic proof compared to previous works.
3. Adaptation of Richert's Weights: The paper successfully adapts Richert's logarithmic weights (previously used for cubes) to the square-interval setting. This demonstrates that the weighted sieve framework is robust enough to handle the tighter constraints of square intervals.
4. Explicit Constants: The proof is fully explicit, providing concrete values for all parameters (e.g., $k=3$, $k_1=8$, $k_2=3.17$, $\epsilon = 1.13 \times 10^{-3}$) and error terms, making the result verifiable without asymptotic assumptions.

4. Results

• Theorem 1.1: For every integer $n \ge 1$, the interval $(n^2, (n+1)^2)$ contains an integer $a$ with $\Omega(a) \le 3$.
• Numerical Outcome: In the final optimization step, the author shows that the lower bound for the count of such integers, $r_3(A)$, is strictly positive ($r_3(A) > 0.0249 \frac{\sqrt{N}}{\log X}$) for $N \ge 10^{31}$.

5. Significance and Limitations

• Significance: This result represents a significant step toward Legendre's conjecture by narrowing the gap between the known existence of almost-primes and the conjectured existence of primes. It demonstrates the power of combining modern computational number theory (prime gap records) with explicit sieve methods.
• Limitations: The author notes that reaching $k=2$ (proving the existence of a semiprime or prime for all $n$) appears beyond the current framework.
  • The current argument relies on Type I information (linear sieve estimates).
  • Achieving $k=2$ would likely require Type II information (bilinear forms) or significantly more extensive finite verification, as the error terms in the current linear sieve approach are insufficient to guarantee a semiprime in the tight square intervals for very large $n$.

In summary, Campbell's paper provides a rigorous, explicit proof that the "prime gap" between consecutive squares is small enough to guarantee the presence of an integer with at most three prime factors, refining the landscape of short-interval prime distribution.