Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am asked:

Prove that if n+1 distinct numbers are selected from the first 2n positive integers {1,2,3,...,2n-1,2n} then at least two of the n+1 numbers are co-prime where n is a positive integer

I know 32 divides evenly into 64 and 96, but 32 is bigger than 16 and 20 so could not even divide. However 3+2=5 which can't get smaller.

How can I prove this?

share|cite|improve this question
It might be easier to show that two of the numbers are adjacent. – Dave Radcliffe Nov 13 '12 at 3:23
up vote 2 down vote accepted

Divide the set into n disjoint subsets as such:


By the pegionhole principle, if you select n+1 numbers 2 of them must be in one of the above subsets. These 2 are coprime. (This is beacuse for all positive integers i,i+1 are coprime)

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.