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

Home > Numbers
Members' quorum (Posted on 2014-08-07) Difficulty: 3 of 5
Imagine sets S of distinct positive integers such that no subset of each can be found with the sum of its members being divisible by 100.

Chose a set Smnx, possessing such feature, with a maximum number of members and a minimal achievable sum.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts First thoughts (spoiler?) Comment 1 of 1
How about the first 99 integers which equal 1 mod 100?

They would be 1, 101, 201, ... , 9701, 9801
Total = 99*(9801 + 1)/2 = 99*4901 = 485,199 

  Posted by Steve Herman on 2014-08-07 17:07:31
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