With reference to the question, posted by me at Stackoverflow
here, i want to know the mathematical details about the concept.
Below is my question.
In multiple set, which contains Integers, I want to get all those elements, which has no duplicate. i.e. which came only once in union of all the Set. Ex: consider set first contains {2,4,6,8,9}, second set contains {2,8,9} and third set contains {2,4,8,9}. In all these sets, element 6 occurs only once.
Somebody please explain the set theory behind it.