Problem solving: sets and logic
Start a problem on sets with a Venn diagram: name each region (only A, both A and B, only B, neither) and write equations from the data. For two sets n(A ∪ B) = n(A) + n(B) − n(A ∩ B), and the number of elements in neither set is n(U) − n(A ∪ B). For three sets n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C); the “only A” region equals n(A) − n(A ∩ B) − n(A ∩ C) + n(A ∩ B ∩ C). It is convenient to fill in the innermost region — those in all three sets — first. To solve a text argument, first name the simple statements p, q, r, write the logical form, and then check it by a truth table or by a known form (modus ponens, modus tollens and others).
For a school sports day 40 pupils registered: 24 signed up for running, 19 for jumping, and 7 for neither. Those in at least one event number 40 − 7 = 33, so the ones in both are 24 + 19 − 33 = 10.
Organisers plan space and equipment by the number of participants, survey analysts find the overlap of two groups, and marketers avoid counting a repeat customer twice.
On paper draw two overlapping circles and choose two words (for example “school” and “book”). Write the different letters of each word in its own circle, put the shared letters in the overlap, and check the total number of different letters with the formula.
Class survey: each student answers three yes/no questions (for example bicycle, football, chess). The data are placed on a Venn diagram and the number of students in each of the eight regions is found.