KöMaL 2026 B5502

Let $A$ be a set of real numbers with $n$ elements. Prove that at least $4n-3$ numbers can be written in the form $a-2b+c$ such that $a$, $b$, $c\in A$ not necessarily distinct.