Vela

Let be a sequence of primes such thatMust

Worked, still open.

number theory · open · formalized (Lean) · 0 attempts

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

It is Erdős–Graham problem #455, and as far as the current literature records, nobody knows whether every prime sequence with **nondecreasing gaps** [ q_{n+1}-q_n\ge q_n-q_{n-1} ] must satisfy [ \lim_{n\to\infty}\frac{q_n}{n^2}=+\infty. ] ([Erdős Problems][1])

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 11 · open (literature)

theorem erdos_455: answer(sorry) ↔ ∀ q : ℕ → ℕ, StrictMono q →
    (∀ n, (q n).Prime ∧ q (n + 2) - q (n + 1) ≥ q (n + 1) - q n) →
    Tendsto (fun n : ℕ => (q n : ℝ) / n ^ 2) atTop atTop
formal-conjectures/455.lean ↗

status

open

notary

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

finding.noted · reviewer:will-blair · 2 days

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.