Vela

erdős #17 · cluster primes

← #16 · #18 (packet.json; erdosproblems.com)

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_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

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}.Infinite
formal-conjectures/17.lean ↗

oeis

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 6646c48f3d2963ae94739163d07fb8fcc874e4375a09c76e266f32a6f8bb1bba

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.