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.


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.)
Hints/Tips re: The solution is in the problem.==>not so | Comment 2 of 10 |
(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.

  Posted by Ady TZIDON on 2016-11-25 17:09:13
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information