All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Disjointification (Posted on 2004-04-04)
Given N possibly overlapping sets, give formulas that specify, using intersections and complements of the given sets, N disjoint sets with the same union as the original N sets. The sets that result are to be the same as the given sets in the case where the given sets are already disjoint.

 See The Solution Submitted by Richard Rating: 3.1667 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Solution? Too simple? | Comment 10 of 12 |
(In reply to Solution? Too simple? by Jer)

The union of two sets is the same as the complement of the intersection of their complements (DeMorgan's law). And yes, the last condition rules out just taking the union as the first set and using all empty sets for the rest -- your example motivated adding that last condition, in fact.

As a hint, try just two sets to start.

 Posted by Richard on 2004-04-05 13:24:58

 Search: Search body:
Forums (1)