MathDB
Removing any element:Separated into 2 subsets with same sum

Source: Bulgarian MO 2003: P4

May 22, 2014
combinatorics unsolvedcombinatorics

Problem Statement

A set AA 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>1n>1 such that there exist a uniform set AA with nn elements.