Tag Archives: Erdos

Luis Posa Problem

Posted on January 3, 2015 by Sumant Sumant

Prove that if you choose any numbers out of then there will be at least two numbers that are relative prime to each other. Here we can create pigeon holes .The numbers in each pigeon hole are relative primes because … Continue reading →

Posted in Famous Problem, Mathematical Induction, Prime Numbers, Relative Primes | Tagged , , | Leave a comment