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: ( You must be logged in to post comments.)
  Subject Author Date
SolutionA solutionMath Man2014-08-23 11:03:32
Solutionre: final (?) revisionAdy TZIDON2014-08-16 11:34:41
Solutionfinal (?) revisionCharlie2014-08-16 10:41:22
Hints/Tipsre: another try ( Last correction needed )Ady TZIDON2014-08-16 05:21:06
re(2): solution -- now for real?...count again...Charlie2014-08-16 00:09:04
another tryCharlie2014-08-16 00:07:16
Hints/Tipsre: solution -- now for real?...count again...Ady TZIDON2014-08-15 18:23:29
solution -- now for real?Charlie2014-08-15 17:07:08
re(3): computer solutionAdy TZIDON2014-08-15 16:44:57
Hints/Tipsre: computer solution HINTSAdy TZIDON2014-08-15 16:43:48
re(2): computer solutionCharlie2014-08-15 16:32:20
re: computer solutionSteve Herman2014-08-15 15:12:38
computer solutionCharlie2014-08-15 13:06:09
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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