Vela

Let be a sequence of primes such that . Is it true thatDoes there exist such a sequence with

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

This is a classical Erdős question about **prime chains**: sequences of primes (p_1<p_2<\cdots) with [ p_{i+1}\equiv 1 \pmod{p_i}. ] In this generality the sequence always exists [[nomath]](Dirichlet gives infinitely many primes $ \equiv 1 \pmod{p_i}$ at each step)[[/nomath]], so the issue is the **slowest possible gro…

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_695 : answer(sorry) ↔
    ∀ {q : ℕ → ℕ},
      StrictMono q →
      (∀ i, (q i).Prime) →
      (∀ i, q (i + 1) % q i = 1) →
      Tendsto (fun k => (q k : ℝ) ^ (1 / k : ℝ)) atTop atTop
formal-conjectures/695.lean ↗

oeis

Linnik's theorem · reference

status

open

notary

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

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.