What is the Solution to Finding a Set of n+1 Integers from 2n?

[asdf1234]

[SOLVED] Set of n+1 integers from 2n

[deleted by user]

 

[morphism]

Classical pigeonhole argument. Write the set {1,2,...,2n} as a union of nice subsets, like those of the form {2k, 4k, 6k, ...} where k is an odd integer in {1,2,...,2n}. To apply the pigeonhole principle, we want these subsets to be disjoint. Can you find a way to do this?

 

[asdf1234]

[deleted by user]