Prove the following statement:
In any set of 26 integers chosen from the set of (1,2,3, ...50) there must be at least a pair of numbers such that one of them divides the other.
Generalize.
Why 26 integers?
Assume there were 25 integers; then those from 2650 could be chosen, none of which divides another. As to the 26th number, any integer chosen from 125, must have its multiple by two in those from 2650.
Edited on November 25, 2016, 9:35 pm

Posted by broll
on 20161125 13:26:35 