erdős #792
Let be maximal such that in any with there exists some sum-free subset with , so that there are no solutions towith . Estimate .
Worked, still open.
additive combinatorics · open · possible · 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
[ f(n):=\min_{\substack{A\subset\mathbb Z\ |A|=n}}\ \max{|B|:B\subseteq A,\ B\ \text{sum-free}}, ]
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Green's open problems list · paper
Create a formalisation here · link
status
open