Source authenticated

The Ford-Konyagin-Luca conjecture: the prime factors of p−1p-1 follow the Poisson-Dirichlet law

Theorem 1.1: for every kk and bounded continuous FF on [0,1]k[0,1]^k, the average of F(V1(p),…,Vk(p))F(V_1(p),\ldots,V_k(p)) over primes 3≤p≤x3\le p\le x tends to EF(L1,…,Lk)\mathbb E F(L_1,\ldots,L_k) with (Lj)∼PD(1)(L_j)\sim\mathrm{PD}(1), unconditionally and with equal weight on each prime. The manuscript notes this gives Granville's fixed-uu asymptotic #{p≤x:P+(p−1)≤x1/u}∼π(x)ρ(u)\#\{p\le x:P^+(p-1)\le x^{1/u}\}\sim\pi(x)\rho(u), so a positive proportion of primes have xεx^{\varepsilon}-smooth predecessors for each fixed ε>0\varepsilon>0. No error terms or uniformity as uu grows are claimed. The companion on μ(p−1)=1\mu(p-1)=1 (infinitely many primes with p−1p-1 squarefree with an even number of prime factors) is linked here, not cataloged, since it cites no posing source.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 24, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The Ford-Konyagin-Luca conjecture: the prime factors of $p-1$ follow the Poisson-Dirichlet law · Ford-Konyagin-Luca conjecture (PD law for p-1)

Confidence: Not scored

Registry verification: unreviewed · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Lineage and corrections

This event attributed to Unreleased internal OpenAI model

Companion: Weighted dilation graphs, smooth shifted primes and totient fibers evidence for this event

The Ford-Konyagin-Luca conjecture: the prime factors of p−1p-1 follow the Poisson-Dirichlet law parent of this event

Ford-Konyagin-Luca, Prime chains and Pratt trees (GAFA 2010) evidence for this event

Theorem 1.1: for every kk and bounded continuous FF on [0,1]k[0,1]^k, the average of F(V1(p),…,Vk(p))F(V_1(p),\ldots,V_k(p)) over primes 3≤p≤x3\le p\le x tends to EF(L1,…,Lk)\mathbb E F(L_1,\ldots,L_k) with (Lj)∼PD(1)(L_j)\sim\mathrm{PD}(1), unconditionally and with equal weight on each prime. The manuscript notes this gives Granville's fixed-uu asymptotic #{p≤x:P+(p−1)≤x1/u}∼π(x)ρ(u)\#\{p\le x:P^+(p-1)\le x^{1/u}\}\sim\pi(x)\rho(u), so a positive proportion of primes have xεx^{\varepsilon}-smooth predecessors for each fixed ε>0\varepsilon>0. No error terms or uniformity as uu grows are claimed. The companion on μ(p−1)=1\mu(p-1)=1 (infinitely many primes with p−1p-1 squarefree with an even number of prime factors) is linked here, not cataloged, since it cites no posing source. parent of this event

VibeMathed record: The Ford-Konyagin-Luca conjecture: the prime factors of p−1p-1 follow the Poisson-Dirichlet law evidence for this event

The Ford-Konyagin-Luca conjecture: the prime factors of p−1p-1 follow the Poisson-Dirichlet law evidence for this event

Companion: Prime predecessors with an even number of prime factors evidence for this event

Act on this frontier

Verify, challenge, or extend the result.