Waste less time on Facebook — follow Brilliant.

Proof note

Pick \(n\) integers from \(1\) to \(100\). Find with proof the minimum \(n\) such that for any set you choose of \(n\) integers in the range, this set may be divided into two disjoint subsets which have equal sums of elements.

Hint: Pigeons.

Note by Dylan Pentland
1 year, 4 months ago

No vote yet
1 vote


Sort by:

Top Newest

Well, for \(n\le 99\) you can always find a subset of \(\{1, 2, \ldots , 100\}\) such that the sum of the elements of the subset is odd, so I guess the answer is \(100\)? Daniel Liu · 1 year, 3 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...