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.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestWell, 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\)?

Log in to reply