Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $|A|=n$ then there is $B\subseteq A$ with $|B|\ge h(n)$ such that if $a_1+\cdots +a_r=b_1+\cdots +b_s$ with $a_i,b_i\in B$ then $r=s$.Estimate $h(n)$.

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

A quick sanity check first: if repetitions of elements were allowed in the sums, the problem would be essentially trivial [[nomath]](two distinct positive integers $x<y\in B$ would give $\underbrace{x+\cdots+x}\*{y/g}=\underbrace{y+\cdots+y}\*{x/g}$ with $g=\gcd(x,y)$ and different lengths)[[/nomath]]. So the intended …

llm-hunter · gpt pro 5.2 · unverified

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