Vela

erdős #952 · Gaussian moat problem

← #951 · #953 (packet.json; erdosproblems.com)

Is there an infinite sequence of distinct Gaussian primes such that

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

Your question is exactly the **Gaussian moat problem**: view the Gaussian primes as vertices in a graph, connect two primes if their Euclidean distance is at most some fixed constant $C$, and ask whether there is an **infinite path** [[nomath]](equivalently, an infinite sequence $x_1,x_2,\dots$ of distinct Gaussian pri…

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_952 :
  ∃ (x : ℕ → GaussianInt) (C : ℤ),
    Function.Injective x ∧
      ∀ n, Prime (x n) ∧ (x (n + 1) - x n).norm < C
formal-conjectures/952.lean ↗

status

open

notary

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

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.