How can I find all the ways to divide a set of 12 distinct integers into 3 subsets each containing 4 of the integers?
Suppose the integers are {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} then I want to output all sets A, B and C that each have 4 elements.
One possibility is A = {1, 2, 3, 4} , B = {5, 6, 7, 8} and C = {9, 10, 11, 12}
I don't want repeats (for example A = {5, 6, 7, 8} , B = {1, 2, 3, 4} and C = {9, 10, 11, 12} counts as a repeat since the 3 sets are the same but in a different order)
Bookmarks