For two sets and , let denote the set of elements which belong to or but not both. If , then the number of elements in is
For two sets and , let denote the set of elements which belong to or but not both. If , then the number of elements in is
Solution
The symmetric difference A Δ B is the set of elements that belong to either A or B, but not both.
Think of it as "everything that's different between the two sets."
Example: If A = {1, 2, 3} and B = {2, 3, 4}, then A Δ B = {1, 4}
1 is in A but not in B
4 is in B but not in A
2 and 3 are in both sets, so they're excluded
Given: P = {1, 2, 3, 4} and Q = {2, 3, 5, 6}
Elements in P but not in Q: 1, 4
Elements in Q but not in P: 5, 6
Therefore: P Δ Q = {1, 4, 5, 6}
Given: R = {1, 3, 7, 8, 9} and S = {2, 4, 9, 10}
Elements in R but not in S: 1, 3, 7, 8
Elements in S but not in R: 2, 4, 10
Therefore: R Δ S = {1, 2, 3, 4, 7, 8, 10}
Now we find the symmetric difference between our two results:
P Δ Q = {1, 4, 5, 6}
R Δ S = {1, 2, 3, 4, 7, 8, 10}
Elements in (P Δ Q) but not in (R Δ S): 5, 6
Elements in (R Δ S) but not in (P Δ Q): 2, 3, 7, 8, 10
Therefore: (P Δ Q) Δ (R Δ S) = {2, 3, 5, 6, 7, 8, 10}
The number of elements in (P Δ Q) Δ (R Δ S) is 7.
When working with symmetric difference, we always remember that we're looking for elements that appear in one set but not the other. Elements that appear in both sets get "cancelled out"!
Related questions:
CAT 2018 Slot 2
CAT 2018 Slot 1