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

Home > Just Math
Disjointification (Posted on 2004-04-04) Difficulty: 3 of 5
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(4): Suggestions from Proposer | Comment 7 of 12 |
(In reply to re(3): Suggestions from Proposer by Charlie)

Thank you for the example. An example (as well as a picture) is worth a thousand words, at least for us who are somewhat mentally handicapped.  Now I understand what you have been griping about. I should have said "N-term sequence of sets" in place of "N sets," since a common interpretation of "N sets" is "N distinct sets." The empty set, by the way, is disjoint from any set, including the empty set, with the usual definition of "disjoint" being "having no element in common."
  Posted by Richard on 2004-04-04 20:49:44

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information