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.

(In reply to

The solution is in the problem. by broll)

1 .You did not show that in **any set** of 26 integers chosen etc..

2.....from 25-50.. should be **26-50** or **25-49**

3.** ** Avis says : ..............try harder.