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.
The
post has nothing to do with proving anything.<o:p></o:p>
The general idea makes sense, but there so many errors in the list
of subsets that I cannot address all of
them.<o:p></o:p>
Lets
mention only a few :<o:p></o:p>
"1"
cannot be a member of any subset of 25 chosen numbers since "1" divides
each of them.<o:p></o:p>
Choosing
"2" precludes choice of ALL even numbers, not only the powers of 2; and so on.<o:p></o:p>
(21,48)
may qualify as an odd couple erroneously introduced into the list. A typo?<o:p></o:p>
If
you want to arrive at acceptable proof,
please read my last post and follow the hints – you are not far away from the correct
path. <o:p></o:p>
@ Steve - toward reasonable proof
