erdős #791
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_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
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
links
Create a formalisation here · link
status
open