All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
26 out of 50 (Posted on 2016-11-25) Difficulty: 3 of 5
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 proofSteve Herman2016-11-29 08:18:48
Hints/Tipsre(2): @ Steve - toward reasonable proofAdy TZIDON2016-11-28 23:06:14
re: @ Steve - toward reasonable proofSteve Herman2016-11-28 17:24:31
Hints/Tips@ Steve - toward reasonable proofAdy TZIDON2016-11-28 14:19:05
re: Inelegant proof?Charlie2016-11-28 08:05:55
SolutionInelegant proof?Steve Herman2016-11-27 16:34:11
Hints/Tipsre(3): The solution is in the problem.==>not soAdy TZIDON2016-11-26 02:20:07
re(2): The solution is in the problem.==>not sobroll2016-11-25 21:37:49
Hints/Tipsre: The solution is in the problem.==>not soAdy TZIDON2016-11-25 17:09:13
SolutionThe solution is in the problem.broll2016-11-25 13:26:35
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information