0
$\begingroup$

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.

  • 1
    I'm not sure what is the question, but I am fairly certain that it's not set theory. I have tagged it as elementary set theory, but I'm not 100% convinced that it fits either. Someone else who understands what is asked here please retag or confirm my retag. Thanks.2012-12-08
  • 0
    @AsafKaragila: Hey, it is elementary set theory only. Basic set theory operations may help. But don't know how :(2012-12-08
  • 0
    The word "intersection" comes to mind.2012-12-08

2 Answers 2