Yagel Numbers

The Mersenne × Primorial Grid

A Yagel number of order k and exponent n pushes the sieve idea behind Mersenne numbers ("exclude divisibility by 2") to its logical extreme:

Yk(n)=pk1#pkn1=235pk1pkn1,k,n1

where pk is the k-th prime and pk1# the primorial of its predecessor. Both constants are dictated by the prime sequence itself — the family has no free parameters and is indexed purely by the lattice point (k,n). Two classical families appear as the boundary of the grid: row k=1 consists of the Mersenne numbers 2n1, and column n=1 of the primorial numbers pk#1. The companion face Yk+(n)=pk1#pkn+1 (the second kind) carries the Euclid and Fermat forms on its edges.

Three structural properties drive everything: Yk(n)1(modq) for every prime qpk — the maximal built-in small-prime sieve for the base; no exponent is ever algebraically disqualified, so every lattice cell is a live candidate (unlike the Mersenne row); and Yk(n)+1 is fully factored by construction, so every prime in the family admits a fast deterministic certificate.

A Lucas–Lehmer-type test for every row

Primality of Yk(n) is decided by a single V-only Lucas ladder — an n-fold iteration of the degree-pk Chebyshev-type map xVpk(x). For k=1 the map is x22 and the criterion collapses to the classical Lucas–Lehmer test verbatim. The cost is about two multiplications per bit, and the output is a proof, not a probability. The observed prime density across the grid matches the sieve-adjusted expectation exactly — no free parameters, in aggregate and row by row.

Running that machinery forward produced 5,735 certified Yagel primes — including p5#1344763+1 with 49,867 digits, a complete certified census of both faces for k1000 (every cell to 5,000 digits), and 31 twin pairs with both members proven. Explore any cell of the grid on the datasets page — it computes the exact value in your browser.

The full theory, statistics, and discovery history are presented in the living edition of the paper.