partitions

*To*: mathgroup at smc.vnet.net*Subject*: [mg24526] partitions*From*: Jose Prado de Melo <jpmelo at iconet.com.br>*Date*: Mon, 24 Jul 2000 03:04:07 -0400 (EDT)*Sender*: owner-wri-mathgroup at wolfram.com

Hi! MathGroup. I'm a new user of Mathematica 3.0. I'm looking for the solution of this problem: How many ways, can the set {A,B,C,D,E} be separated into two parts with three elements in each? For example, ABF | CDE represents one way to do this, and is considered the same as CDE | ABF, but ACD | BEF is diferent. In this case the solution is 10. Another example: Find all of the partitions of {A,B,C,D,E,F} into three-element parts of 2,2,2. You should find 15 partitions. How can I generate all these solutions using Mathematica 3.0? Thanks!