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
2 years, 6 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

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 - 2 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...