Show that if 101 integers are chosen from 1 to 200 inclusive, there must be 2 with the property that one is divisible by the other.

To show that there must be 2 integers with the property that one is divisible by the other.

Given:

101 integers are to be chosen from 1 to 200 inclusive.

Calculation:

Total there are 101 numbers and let us write in the form of 2ab where a= any number and b= some odd number. On trying to do the above thing there will be total 100 choices for b.

According to the pigeonhole principle if N+1 letters were to be placed in N   pigeonholes, then at least one of these pigeonholes must receive more than one letter