
Andrew W. answered 06/03/22
Former Computer Science Professor and Google Engineer
This kind of problem is best approached using a Venn diagram, where the universal set U contains sets P and Q, with P and Q overlapping.
Such a Venn diagram will have four regions: (P∪Q)', P-Q, Q-P, and P∩Q. The number of items in each region can be deduced from the quantities given. For instance:
n(P-Q) = n(P) - n(P∩Q) = 63 - 16 = 47
n(Q-P) = n(P'∩Q) = 28
n((P∪Q)') = n(U) - (n(P-Q) + n(P∩Q) + n(Q-P)) = 104 - (47 + 16 + 28) = 13
From the quantities of these four regions, the size of any other region can be constructed by combining them, for example:
n(Q) = n(P∩Q) + n(Q-P) = 16 + 28 = 44