From: Brett Calcott (brett_at_coombs.anu.edu.au)
Date: Fri, 14 May 2004 16:25:13 +1200 To: firstname.lastname@example.org
I've found some python solutions to find the set of subsets for a given set,
but how do you find the set of the set of subsets whose union is the given
set and whose intersections is the empty set.
ie. Given a cake divided into 6 unique pieces (0-5), how many different ways
can I distribute the cake so that there are no pieces left. eg.
Is there a name for this problem?
-- Brett Calcott Philosophy Program, RSSS, ANU Canberra, ACT 0200, AUSTRALIA