English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Rough Primes: How Mathematicians Used Fuzziness to Defeat Precision

Forum topic · ✨步子哥 · 2026-08-16

Summary

In 2024, mathematicians Ben Green and Mehtaab Sawhney proved a 2018 conjecture by John Friedlander and Henryk Iwaniec: infinitely many primes take the form p² + 4q², where p and q are themselves prime. This extends a line of inquiry begun by Fermat in 1640 (infinitely many primes that are sums of two squares, proved by Euler) and advanced in the 1990s by Friedlander and Iwaniec with primes of the form a² + b⁴. Traditional sieve methods fail under such heavy constraints, so Green and Sawhney took an indirect route: they first proved the result for 'rough primes'—numbers with no small prime factors—which are easier to analyze than true primes. They then used Gowers norms, a tool developed by Timothy Gowers for measuring randomness in sequences, together with a 2018 result by Terence Tao and Tamar Ziegler linking Gowers norms to Type I/II sums, to show rough primes and true primes are interchangeable for this counting problem. The proof, posted as arXiv:2410.04189, illustrates how deliberately loosening precision—similar to coarse-graining in physics—can reveal structure that exact methods miss.

Rough Primes: How Mathematicians Used Fuzziness to Defeat Precision

During a coffee break at a mathematics conference in Edinburgh in July 2024, Mehtaab Sawhney—fresh out of graduate school—met Ben Green, whose result from twenty years earlier was, in Sawhney's words, "one of the things that brought me into this field." Green was equally impressed: "Mehtaab is an extraordinary mathematician. He knows everything."

They decided to collaborate. All they needed was the right problem. Within weeks, they would solve the final piece of a puzzle planted 384 years earlier—and the key tool would come from a field that seemed unrelated to primes.

Fermat's Seed

In 1640, Pierre de Fermat conjectured in the margin of a letter that infinitely many primes can be written as the sum of two perfect squares:

  • 13 = 2² + 3²
  • 29 = 2² + 5²
  • 41 = 4² + 5²
  • A century later, Leonhard Euler proved it. Mathematicians then began a game: tighten the constraints and see whether primes survive.

    In the 1990s, John Friedlander and Henryk Iwaniec proved infinitely many primes of the form a² + b⁴ (a square plus a fourth power). In 2018, they posed a trickier question:

    > If p and q must themselves be prime, are there infinitely many primes of the form p² + 4q²?

    Two examples: 41 = 5² + 4×2² and 149 = 7² + 4×5², where 5, 2, 7, 5, 41, and 149 are all prime.

    Green captured the difficulty in one line:

    "The more you constrain a set, the harder it is to find primes inside it."

    Why It's Hard

    Primes are like pearls scattered sparsely on a beach, with no obvious pattern. Fermat asked whether infinitely many pearls exist; Euler said yes. The Friedlander–Iwaniec conjecture asks whether pearls can be built from two smaller pearls—p² + 4q² requires p and q themselves to be prime.

    Standard tools break down here. Mathematicians usually count primes with *sieve methods*, filtering out composites. But with constraints this strong, the sieve's mesh must be so fine that the sieve becomes unusable.

    After days of blackboard discussions in Oxford, Green and Sawhney hit a wall on the traditional path. Then they had a strange idea.

    Rough Primes: Blurry Pearls

    If you can't count true primes, can you count numbers that are "almost prime"?

    A rough prime is simply a number not divisible by the first few small primes (2, 3, 5, 7). Between 1 and 200 there are 50 rough primes: 46 are true primes, and 4 are false positives—121 (= 11²), 143 (= 11×13), 169 (= 13²), 187 (= 11×17).

    Rough primes are slightly more numerous than true primes, but their distribution is far better behaved.

    "Rough primes are a set we understand much, much better," Sawhney said.

    Green and Sawhney first proved that infinitely many numbers of the required form are sums involving two rough primes—a relatively easier step. But could this transfer to true primes?

    Gowers Norms: A Forgotten Ruler

    Rough primes and true primes are different sets, so the rough version doesn't automatically imply the true one. Green and Sawhney needed to show the two sets are "equivalent" for their problem—specifically, that they yield the same Type I and Type II sums.

    The answer came from an unexpected place. In the early 2000s, Timothy Gowers (later a Fields medalist) developed Gowers norms, which measure how random or structured a sequence is. As Sawhney put it: "As an outsider, it's almost impossible to see that these things are related."

    But in 2018, Terence Tao and Tamar Ziegler proved a landmark result connecting Gowers norms to Type I/II sums. By coincidence, earlier that year Sawhney had independently developed a technique using Gowers norms to compare sets—for a completely unrelated problem.

    All the pieces existed. Green and Sawhney assembled them: using Gowers norms, they showed rough primes and true primes have identical Type I/II sums, so the rough version translates back to the true version.

    The Friedlander–Iwaniec conjecture was proved: infinitely many primes have the form p² + 4q² with p and q both prime.

    Seeing Through Blur

    The most striking aspect of this story is not the result but the method. Mathematics prizes precision—proved or not—yet Green and Sawhney saw the truth only after giving up exactness.

    True primes are like stars in the night sky: visible individually, but patternless. Rough primes are the out-of-focus version—the stars become blurry blobs, but the constellations come into view.

    This echoes coarse-graining in physics: you deliberately abandon microscopic detail to see macroscopic laws. You cannot track the 10²³ molecules in a drop of water, but fluid mechanics doesn't need you to.

    Gowers norms are themselves a blurring tool: they don't tell you what a sequence looks like, only how random it is—and that is enough to decide whether two sets are interchangeable for counting purposes.

    Asked about the result, Tamar Ziegler offered a moving metaphor:

    "It's like being a parent: when you let your children grow freely, they do mysterious and unexpected things."

    Her "child" was the Gowers norm—the 2018 connection to number theory bore fruit six years later that she never anticipated.

    The Power of Relaxation

    AI and engineering face the same dilemma: when exact solutions are too expensive, use an approximation.

  • Linear programming relaxation turns integer programs into continuous problems—and can still yield optimal solutions.
  • Surrogate models approximate expensive black boxes, powering Bayesian optimization.
  • Probing doesn't say what each neuron does, only what information a layer encodes—yet this coarse view suffices to understand model behavior.
  • Green and Sawhney's proof shows this is not laziness—it is strategy. When a problem is too precise to attack, try blurring it. In a fuzzy world, the path becomes clear.

    Fermat planted a seed in 1640. Three hundred eighty-four years later, two mathematicians—with a forgotten ruler and some "almost prime" numbers—finally saw it bloom.

    ---

    References:

  • Green, B., & Sawhney, M. (2024). *Primes of the form p² + nq²*. arXiv:2410.04189
  • Howlett, J. (2024). "Mathematicians Uncover a New Way to Count Prime Numbers." Quanta Magazine, December 11.
  • Columbia News (2025). "A Math Professor Has a New Finding on Primes." April 22.
  • Friedlander, J., & Iwaniec, H. (2018). Conjecture on primes of the form p² + 4q².

Tags

#number-theory#prime-numbers#ben-green#mehtaab-sawhney#gowers-norms#sieve-methods#fermat#mathematics

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178633543