MathCastle
Proof WritingHard

Proof Writing · Hard problem

Numbers are chosen from {1,2,…,10}\{1, 2, \ldots, 10\}. What is the smallest number of them that guarantees two chosen numbers add up to 1111?

Practice more like this