perplexus.info :: Just Math : 26 out of 50

26 out of 50 (Posted on 2016-11-25)

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.

No Solution Yet Submitted by Ady TZIDON

Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re(2): The solution is in the problem.==>not so

| Comment 3 of 10 |

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

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info