Register to reply

Set of n+1 integers from 2n

by asdf1234
Tags: integers, solved
Share this thread:
morphism
#2
Feb16-08, 07:48 PM
Sci Advisor
HW Helper
P: 2,020
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
#3
Feb16-08, 10:20 PM
P: 4
[deleted by user]


Register to reply

Related Discussions
Expressions of integers Calculus & Beyond Homework 5
Lecture notes regarding integers ? General Math 11
How to use Big Integers? Programming & Computer Science 3
Integers mod p Linear & Abstract Algebra 4
Consecutive integers problem Introductory Physics Homework 1