Vela

Let be minimal such that, for any of size , in any interval of consecutive integers there exist distinct such that .Obtain good bounds for , or even an asymptotic formula.

Worked, still open.

number theory · open · possible · 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

Let me rewrite your $f(n)$ in the language that makes the combinatorics visible, and then I’ll give the best unconditional bounds I know (and what’s believed to be the truth).

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

open

notary

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

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.