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.
(In reply to
computer solution by Charlie)
Ch, it is not a d2 question.
Set A may consist of 2 elements in 4 distinct ways: (0,7) (1,6) (2,5) (3,4),- for each of these sets are numerous distinct distributions of elements in B and C 1-7 (1 member in B - 7 in C)- 8 ways to chose ,,,, . 2-6 .....28 ways. 3-5.. 56 ways
etc etc etc etc etc
just till now 4*(8+28+56), much more than 9 !
...I am not going to solve now..leave it to you,
Please reconsider.
re: computer solution HINTS
