Hello, MathGroup
First of all, thanks for your attention.
To be more specific:
It's not too dificult to calculate the solution of the problem:
How many ways, can the set {A,B,C,D,E,F} be separeted into two parts
with three elements in each?
Answer: x = 6!/(2!.3!.3!) = 10
I'm looking for a function to generate all the partitions using
Mathematica 3.0 .
I'm not sure, but I think the package Combinatorica doesn't have a
function to do this.
For example, I'm trying to think up a function f like this one:
In[ ] = f [ {A,B,C,D,E,F},{3,3}]
Out [ ] = { { {A,B,C},{D,E,F} }, { {
A,B,F},{C,D,E}},...................} and so on.
In [ ] = Length[%]
Out [ ] = 10
Please, help me.
Thanks!