Find the union of the sets
Recall the definition. The union contains every element that is in , or in , or in both. It is an inclusive or, so nothing gets thrown away — the union is always at least as big as either set.
Sweep the first set. From take , , and . The running collection is
Sweep the second set, skipping repeats. From \{5,7,8\\}: is already listed, is new, is already listed. A set records only whether an element belongs, never how many times, so duplicates are dropped:
Write the answer in increasing order. Order does not change a set, but listing elements from small to large makes an omission easy to spot:
Check the count. The two sets have and elements, sharing the two elements and . Inclusion-exclusion predicts
and the answer indeed has elements . The union is certainly not the empty set, so choice B is wrong; the answer is choice A with in the box.
Need to solve a different problem like this? Open the solver →