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: ( You must be logged in to post comments.)

Subject	Author	Date
re(3): @ Steve - toward reasonable proof	Steve Herman	2016-11-29 08:18:48
re(2): @ Steve - toward reasonable proof	Ady TZIDON	2016-11-28 23:06:14
re: @ Steve - toward reasonable proof	Steve Herman	2016-11-28 17:24:31
@ Steve - toward reasonable proof	Ady TZIDON	2016-11-28 14:19:05
re: Inelegant proof?	Charlie	2016-11-28 08:05:55
Inelegant proof?	Steve Herman	2016-11-27 16:34:11
re(3): The solution is in the problem.==>not so	Ady TZIDON	2016-11-26 02:20:07
re(2): The solution is in the problem.==>not so	broll	2016-11-25 21:37:49
re: The solution is in the problem.==>not so	Ady TZIDON	2016-11-25 17:09:13
The solution is in the problem.	broll	2016-11-25 13:26:35

Please log in:

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

Chatterbox:


perplexus dot info