Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Prove that if select $101$ integers from the set $S = \{1,2,3,...,200\}$, there exist $m,n$ in the selection where $\gcd(m,n) = 1$!

Any hint how to prove this?

share|cite|improve this question
Two must be consecutive. – Robert Cardona Feb 6 '13 at 6:27
Divide $S$ into $100$ pairs in such a way that the members of each pair are relatively prime. – Brian M. Scott Feb 6 '13 at 6:28

Consider the partition of $\{1,2,\ldots,200\}$ into $100$ partitions $$\{1,2\},\{3,4\},\{5,6\}, \ldots,\{199,200\}$$ By pigeon-hole principle, we have two numbers in one partition say $2n-1$ and $2n$. The $\gcd$ of this pair is $1$ since if $d \vert (2n)$ and $d \vert (2n-1)$, then $d \vert (2n-(2n-1))$ i.e. $d \vert 1$. Hence, $$ \gcd(2n-1,2n) = 1$$

share|cite|improve this answer
in the last step.., since d|1 , so the only possibilities of d is 1, so, gcd(2n-1,2n) = 1 , right? – chihiroasleaf Feb 6 '13 at 7:22
@chihiroasleaf Yes. precisely. – user17762 Feb 6 '13 at 7:23

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.