erdős #17 · cluster primes
Are there infinitely many primes such that every even number can be written as a difference of primes where ?
Worked, still open.
number theory · open · formalized (Lean) · 0 attempts
machinery: prime-distribution,Hardy-Littlewood,sieve/Brun-Titchmarsh,consecutive-integer-window
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
This is an **open problem** (asked by Erdős). Primes $p$ with your property are called **cluster primes**: an odd prime $p$ such that every even (k\le p-3) can be written as (k=q_1-q_2) with primes (q_1,q_2\le p). ([Wikipedia][1])
candidate solution ↗llm-hunter · gpt 5.2, gpt pro 5.2 · unverified
2 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 11 · open (literature)
theorem erdos_17 : answer(sorry) ↔ {p : ℕ | IsClusterPrime p}.Infiniteformal-conjectures/17.lean ↗oeis
status
open