Problem

Source: Morrocan TST 2005 (Pb 10)

Tags: combinatorics proposed, combinatorics



Consider the set $A=\{1,2,...,49\}$. We partitionate $A$ into three subsets. Prove that there exist a set from these subsets containing three distincts elements $a,b,c$ such that $a+b=c$