Problem

Source: Bulgarian MO 2003: P4

Tags: combinatorics unsolved, combinatorics



A set $A$ of positive integers is called uniform if, after any of its elements removed, the remaining ones can be partitioned into two subsets with equal sum of their elements. Find the least positive integer $n>1$ such that there exist a uniform set $A$ with $n$ elements.