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

asdf1234

[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]

Similar Threads for: [SOLVED] Set of n+1 integers from 2n
Thread	Forum	Replies
[SOLVED] expressions of integers	Calculus & Beyond Homework	5
Integers !!!	General Math	11
How to use Big Integers?	Programming & Comp Sci	3
integers mod p	Linear & Abstract Algebra	4
Integers	Introductory Physics Homework	1

asdf1234	[SOLVED] Set of n+1 integers from 2n Tweet [deleted by user]

morphism Recognitions: Homework Help Science Advisor	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?