Let N be the set of distinct letters in the word “Nassau” and be the set of distinct letters in the word “Suffolk.” a. Find the set (N U S) – (N ∩ S) b. List all the subsets of N.
Do you know the set of N and S?
No I believe that's what I have to figure out as well. I'm just confused as to why the question is asking for both sets to be a set of N @geerky42
Pretty sure N is set of distinct letters in the word “Nassau” and S is set of distinct letters in the word “Suffolk.”
whoops! you're right. S= set of Suffolk
@geerky42 So would the set of N = {n, a, s, u} and S= {s, u, f, o, l, k}?
That's right.
Here, N U S means set that contains all elements from either N or S. N ∩ S means set that contains elements from BOTH set N and S.
So N U S = {n, a, s, u, f, o, l, k}, right? And N ∩ S = {s,u}
Here (N U S) – (N ∩ S) is a set that contains elements from N U S that is NOT in N ∩ S Can you figure what (N U S) – (N ∩ S) is?
is it {n, a, f, o, l, k} ? @geerky42
Join our real-time social learning platform and learn together with your friends!