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.
(In reply to re: The solution is in the problem.==>not so
by Ady TZIDON)
I agree, it should be 26-50.
Otherwise it's fine; there's no need to gild the lily.
Posted by broll
on 2016-11-25 21:37:49