If U = {3, 4, 5} and U union V = {1,2,3,4,5}
The set V I am told must have the fewest number of members as possible. Am I right in thinking that the members of the set V must be:
V = {1, 2}
The union is defined to be:. So it turns out that there doesn't need to be an overlap between two sets in order to take their union. If there is an overlap, you would count that element just once.
However, if you ended up taking the intersection, it would be empty because there are no common elements.