Overview
Finite counting problems ask for all objects satisfying a description. Finding several examples is not enough: the method must establish completeness and avoid duplicates. Sometimes a repeating arithmetic pattern is easiest; sometimes a structured list is small enough to inspect; sometimes overlapping forbidden groups make inclusion-exclusion efficient. We will compare those choices across integer, selection and survey problems.
Correct a double count in a union
Among integers from 1 through 80, there are thirteen multiples of 6 and eight multiples of 10. Adding gives twenty-one, but the multiples of both numbers were counted twice. Those are the multiples of their least common multiple 30: two values in the interval. Subtracting one duplicate count for each gives 13 + 8 − 2 = 19.
The same structure appears in a survey of 70 readers: 32 read poetry, 28 read drama and 14 read both. The number reading at least one is 32 + 28 − 14 = 46. The question asks for neither, so take the complement, 70 − 46 = 24. The number 46 is a correct union count but the wrong final target. Write whether you are counting “at least one,” “both” or “neither” before choosing the final operation.
Combine arithmetic conditions into a repeating list
To count even integers from 0 through 50 that leave remainder 1 on division by 3, begin with the remainder class and retain even members. The eligible values are 4, 10, 16, 22, 28, 34, 40 and 46. They repeat every six units because parity repeats every two and the remainder repeats every three.
There are eight values. Neither endpoint contributes an additional one: 0 has the wrong remainder and 50 does too. The answer 17 counts a broader remainder pattern without imposing evenness. A systematic list is efficient here because the interval is short and the repeating step is clear. Its completeness follows from the combined period, not just from having found a plausible string of numbers. Checking the next value beyond the interval confirms where to stop.
Organize selections before imposing a linked exclusion
Four distinct numbers are selected from 1 through 8 with sum 18, and 2 and 7 may not both be present. Because order does not matter, list each selection increasingly. There are eight increasing quadruples with the required sum; three contain both 2 and 7, completed by pairs (1,8), (3,6) or (4,5).
Removing those gives five allowed selections: (1,3,6,8), (1,4,5,8), (1,4,6,7), (2,3,5,8) and (3,4,5,6). Organizing by the smallest selected number makes a complete hand list possible without counting permutations of the same set. The answer eight solves only the sum condition; three counts the excluded sets. The “not both” rule permits either 2 or 7 individually, so removing every set containing either number would be too restrictive.
An increasing-list convention is doing mathematical work. It ensures that the same chosen set cannot reappear under a different order, while the fixed first element organizes the remaining search. Within each first-element group, the required sum determines a smaller target for the remaining entries. If a proposed next entry already makes that target too small or too large, the branch can be ruled out rather than guessed away.
Restore an overlap subtracted twice
A panel chooses three projects from A through F. Selecting A requires B, and C and D cannot both be selected. Of twenty unrestricted triples, six contain A without B and four contain both C and D. The triple {A,C,D} violates both rules, so subtracting both forbidden groups removes it twice. Restore it once: 20 − 6 − 4 + 1 = 11 allowed sets.
The alternative ten misses that restoration. This is the same union principle used for multiples, now applied to forbidden rather than desired objects. For transfer, decide whether the allowed set is easiest to construct directly or obtain by removing violations. Name each forbidden class precisely, including the direction of an implication. Then check their intersections before subtracting. In practice, give a concrete example of any overlap you restore; that example explains the correction more clearly than an unexplained plus sign in a counting formula.
Apply the method to a new case
In a class of 30 students, 18 study French, 15 study Latin, and 7 study neither. How many study both languages? First find the union: 30 − 7 = 23 students study at least one language. Inclusion-exclusion gives 18 + 15 − both = 23, so both = 10. Then French only is 8 and Latin only is 5. Check the disjoint categories: 8 + 10 + 5 + 7 = 30. Subtracting 7 from the sum 33 would not correct the double counting of students in both groups. 'Neither' determines the size of the union; it is not the overlap. A four-region diagram makes the distinction visible and lets you verify that every region is nonnegative. If a derived region were negative, the supplied counts would be inconsistent rather than a reason to ignore that region.