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

Home > Just Math
Three subsets (Posted on 2014-08-15) Difficulty: 3 of 5
You are requested to create 3 disjoint sets such that:
1. Their union is a set of 10 digits (i.e. integers from 0 to 9 inclusive).
2. The average value of the members of set A is 3.5.
3. The number of members in B is less than the number of members in C.

How many distinct solutions are there?

Rem: No empty sets.

No Solution Yet Submitted by Ady TZIDON    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: computer solution | Comment 2 of 13 |
(In reply to computer solution by Charlie)

Huh?  Are we doing the same problem?

There are three sets, A and B and C.  B has smaller cardinality than C, not A.  A can have 2 or 4 or 6 elements.  The number of solutions is much, much bigger than 9.  Don't have time to count now, but here's one:

A = {0,7}  B = {1,2,3} C = {4,5,6,8,9}

Edited on August 15, 2014, 3:14 pm
  Posted by Steve Herman on 2014-08-15 15:12:38

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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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