← Latest papers
🔢 mathematics

A parametric family of primes p = km(m+1) + e + 2kq: heuristic laws, conditional theorems, and unconditional primality certificates

This paper investigates the parametric family of primes $p = km(m+1) + e + 2kq$ by establishing rigorous unconditional results—including a 29,998-digit certified prime and the disproof of a spurious zeta-signal correlation—while deriving conditional heuristics and theorems regarding the distribution and minimal parameters of these primes.

Original authors: Hassane Bakkaoui

Published 2026-06-16
📖 6 min read🧠 Deep dive

Original authors: Hassane Bakkaoui

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to find a needle in a haystack, but the haystack is made of numbers, and the needles are prime numbers (numbers like 2, 3, 5, 7, 11 that can only be divided by 1 and themselves).

For centuries, mathematicians have known a simple rule: if you take any prime number bigger than 3, it will always be exactly one step away from a multiple of 6. It's either 6n+16n + 1 or 6n16n - 1.

This paper, written by Hassane Bakkaoui, asks a big question: What happens if we change the rules of the game? Instead of looking at multiples of 6, what if we look at multiples of other numbers (like 10, 14, or 20) and use a special shape called a "pronic number" (numbers like 2, 6, 12, 20 which are m×(m+1)m \times (m+1))?

The author creates a giant, flexible formula to hunt for primes in these new patterns. Here is the breakdown of what they found, using simple analogies.

1. The New Hunting Ground: A Parametric Family

Think of the author's formula as a custom-built fishing net.

  • The Standard Net: The old rule (p=6n±1p = 6n \pm 1) is a net with a fixed mesh size.
  • The New Net: The author's formula (p=km(m+1)+ϵ+2kqp = k \cdot m(m+1) + \epsilon + 2kq) is a net where you can adjust the size of the mesh (kk), the shape of the hole (mm), and the direction you pull the net (ϵ\epsilon).
  • The Goal: For every prime number, the author can find the "perfect fit" in this net. They calculate the smallest "offset" (qq) needed to make the number a prime. This offset is the "distance" from the center of the pattern to the prime.

2. The Three Layers of Discovery

The paper sorts its findings into three "layers" of certainty, like a building with a solid foundation, a middle floor that needs support, and a roof that is just a prediction.

Layer 1: The Solid Foundation (Rigorous/Unconditional)

These are facts the author has proven without needing any guesses.

  • The Fixed Axis: The author proved that for certain settings, the primes are locked into a specific "lane." No matter how you adjust the net, the primes always land on a specific remainder when divided by certain numbers. It's like a train that must stay on a specific track; it can't drift off.
  • The Giant Prime: Using a special sub-family of numbers (where k=3k=3), the author built a 29,998-digit prime number. To put that in perspective, if you wrote this number out, it would fill about 10 pages of text. They didn't just guess it; they built a "certificate" (a mathematical receipt) that proves it is prime beyond any doubt. This was done on a regular laptop in about 3 hours.
  • The "Spurious" Signal: The author tested a previous idea that suggested prime numbers might "dance" to the rhythm of the Riemann Zeta function (a famous, mysterious mathematical object). They used statistical tests (like shuffling a deck of cards) and proved this dance does not exist. The apparent connection was just a statistical illusion, like seeing faces in the clouds. They proved mathematically that the signal vanishes.

Layer 2: The Middle Floor (Conditional)

These findings are very likely true, but they depend on other famous mathematical guesses (like the Riemann Hypothesis) being correct.

  • How far do we have to look? The author calculated how far you usually have to search (the size of qq) to find a prime. If the famous Riemann Hypothesis is true, the search distance grows in a predictable, manageable way.
  • The Average Distance: They found a formula for the "average" distance you need to search. It turns out to be roughly one-quarter of the size of the pattern you are looking at.

Layer 3: The Roof (Heuristic)

These are educated guesses based on computer simulations and patterns, but they haven't been proven yet.

  • The Logarithmic Law: The author suggests that the average distance to find a prime grows very slowly (logarithmically). It's like saying, "Even though the haystack gets huge, you don't have to search that much further to find the next needle."
  • A Universal Constant: They found a geometric constant (C0C_0) that seems to describe the relationship between the size of the prime and the search distance. It's a "magic number" that stays the same across different settings, like a universal law of physics for these prime patterns.

3. What This Paper Does NOT Do

It is important to know what this paper doesn't claim:

  • It does not solve the biggest unsolved problems in math (like proving the Riemann Hypothesis itself).
  • It does not claim to have found a way to generate all prime numbers instantly.
  • It does not suggest this has any immediate use in medicine, engineering, or cryptography (though prime numbers are used in encryption, this specific research is theoretical).

Summary Analogy

Imagine you are a cartographer mapping a new continent.

  • The Rigorous part is you drawing the coastline and proving, "This mountain is definitely here, and this river definitely flows this way." You also found a massive, undisputed city (the 29,998-digit prime).
  • The Conditional part is you saying, "If the climate behaves as we suspect, then the forests will grow to this height."
  • The Heuristic part is you guessing, "Based on the soil, the trees probably grow in this specific pattern."
  • The Negative part is you debunking an old map that claimed there was a "Ghost River" connecting two points. You proved with math and data that the river never existed; it was just a trick of the light.

The Bottom Line:
This paper provides a new, highly structured way to look at prime numbers. It proves some hard facts, makes strong predictions based on those facts, and clears up a misunderstanding about how primes relate to the Riemann Zeta function. It is a map of a specific territory, drawn with extreme care to distinguish between what is known, what is likely, and what is just a guess.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →