A subset $S \subseteq \mathbb{Z}$ is sum-free if no two elements (possibly equal) sum to a third, i.e., $a + b \neq c$ for all $a, b, c \in S$.
Instances For
Key arithmetic fact: when $p \equiv 2 \pmod{3}$ and $p > 2$, the "middle third" $(p/3, 2p/3]$ in $\mathbb{Z}/p\mathbb{Z}$ is sum-free, i.e., the sum of two elements of this interval lies outside it.
Double-counting identity: summing over $t \in \mathbb{Z}/p\mathbb{Z}$ the number of $a \in A$ with $t \cdot a \in B$ equals $|A| \cdot |B|$, when every element of $A$ is nonzero mod $p$.
Erdős' sum-free subset theorem (Theorem 2.2.1, Erdős 1965). Every finite set $A$ of nonzero integers contains a sum-free subset $S \subseteq A$ with $|S| \geq |A|/3$. Proved by dilation modulo a prime $p \equiv 2 \pmod 3$ and averaging over the middle third of $\mathbb{Z}/p\mathbb{Z}$.