Vela

Let be an infinite sum-free set - that is, there are no solutions towith . How small can be? Is it possible that ?

Worked, still open.

additive combinatorics · open · 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 condition is exactly what Erdős called a **sum‑free sequence**: an increasing sequence (a_1 < a_2 < \cdots) such that **no** term is a sum of **distinct** smaller terms. ([Libra][1])

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 331b428b91e3e2fe0028a7c3abf30fc6c8c1a857c689b63a8f1f7b213c77ebc7

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.