Question: Prove that if we select 101 integers from the set S = {1, 2, 3, . . . , 200}, there exist m, n in
Prove that if we select 101 integers from the set S = {1, 2, 3, . . . , 200}, there exist m, n in the selection where the greatest common divisor of m and n is 1. Hint: Prove by the Pigeonhole Principle
Step by Step Solution
There are 3 Steps involved in it
To solve this problem using the Pigeonhole Principle we need to prove that among any 101 integers se... View full answer
Get step-by-step solutions from verified subject matter experts
