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: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsFirst thoughts (spoiler?)Steve Herman2014-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 (19)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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