perplexus.info :: Just Math : Three subsets

Three subsets (Posted on 2014-08-15)

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
Puzzle Thoughts	K Sengupta	2024-03-04 08:18:22
A solution	Math Man	2014-08-23 11:03:32
re: final (?) revision	Ady TZIDON	2014-08-16 11:34:41
final (?) revision	Charlie	2014-08-16 10:41:22
re: another try ( Last correction needed )	Ady TZIDON	2014-08-16 05:21:06
re(2): solution -- now for real?...count again...	Charlie	2014-08-16 00:09:04
another try	Charlie	2014-08-16 00:07:16
re: solution -- now for real?...count again...	Ady TZIDON	2014-08-15 18:23:29
solution -- now for real?	Charlie	2014-08-15 17:07:08
re(3): computer solution	Ady TZIDON	2014-08-15 16:44:57
re: computer solution HINTS	Ady TZIDON	2014-08-15 16:43:48
re(2): computer solution	Charlie	2014-08-15 16:32:20
re: computer solution	Steve Herman	2014-08-15 15:12:38
computer solution	Charlie	2014-08-15 13:06:09

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

Chatterbox:


perplexus dot info