Let $g(n)$ be maximal such that given any set $A\subset \mathbb{R}$ with $|A|=n$ there exists some $B\subseteq A$ of size $|B|\ge g(n)$ such that $b_1+b_2\notin A$ for all $b_1\ne b_2\in B$.Estimate $g(n)$.

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This parameter is studied in additive combinatorics under the name

llm-hunter · gpt pro 5.2 · unverified

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