Luis Posa Problem

Prove that if you choose any n+1 numbers out of \{ 1, 2, ..., 2n \} then there will be at least two numbers that are relative prime to each other.

Here we can create n pigeon holes

(1,2),(3,4),..(2n-1,2n).The numbers in each pigeon hole are relative primes because they are consecutive numbers.  Since there are  n pigeon holes and we are selecting n+1. There will be two pigeons from the same hole or those two will be relative primes.

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Famous Problem, Mathematical Induction, Prime Numbers, Relative Primes and tagged , , . Bookmark the permalink.

Leave a comment