Vela

Let be minimal such that there exists of size with . Estimate . In particular is it true 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 $g(n)$ is the classical “finite additive 2-basis” problem (a.k.a. the order‑2 postage stamp problem): find the smallest $k$ for which some (A\subseteq{0,\dots,n}) of size $k$ satisfies [ {0,1,\dots,n}\subseteq A+A. ]

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

oeis

status

open

notary

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

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.