Did you know? If 25 students take one club and 18 take another, you cannot conclude that 43 different students attend at least one club. Some may belong to both. The hidden challenge is not addition; it is understanding how many times the same person has been counted.
This is the central idea of inclusion–exclusion, a key addition to counting in the Singapore–Cambridge H3 Mathematics (9820) syllabus. For a JC2 learner looking for an H3 Mathematics tutor in Bukit Timah, the real skill is learning to identify overlapping sets, account for repeated counting and defend the formula rather than treating a Venn diagram as a shortcut.
Quick answer: For finite sets A and B, |A∪B|=|A|+|B|−|A∩B|. For three finite sets, add each individual size, subtract every pairwise intersection, then add back the triple intersection. This alternating correction works because elements are counted with different multiplicities according to how many sets they belong to.
Jump straight to the useful part
- Why two sets need subtraction
- Full worked club example
- The three-set formula
- Sixty students and three overlapping clubs
- Count multiples without double-counting
- Bounded stars and bars
- Derangements as an extension
- Ten short learning clinics
- Common mistakes and validation
- H3 revision and tutorial checklist
- FAQs
- Official references and connected guides
Why the two-set formula needs a correction
Let A be the students attending Art Club and B the students attending Debate Club. The expression |A|+|B| counts everybody in A and everybody in B. A student who attends both appears twice. Every student who attends exactly one appears once.
Subtracting |A∩B| removes one of the two copies of each shared student. The resulting count is exactly the number of distinct students in A or B or both, which is |A∪B|.
This proof-by-contribution is often clearer than memorising a diagram. Test one student who belongs only to A: the formula counts them once. Test someone only in B: once. Test someone in both: twice minus once, which is once. Someone in neither contributes zero.
The word ‘or’ in mathematics typically allows both unless otherwise stated. The union A∪B therefore means in A, in B or in both. The phrase ‘exactly one’ asks for the exclusive portions and requires a different final count.
When answering a problem, draw the Venn diagram if it helps, but always decide what the question wants: union, intersection, exactly one, only one particular set or neither.
Full worked example: two clubs
Question: In a group of 40 students, 25 attend Art Club, 18 attend Debate Club and 9 attend both. How many attend at least one club, and how many attend neither?
The union is |A∪B|=25+18−9=34. Therefore 34 students attend one or both clubs. Since the group contains 40 students, 6 attend neither.
To check, divide the union into disjoint regions. Art only has 25−9=16 students, Debate only has 18−9=9 students, and both has 9. These regions sum to 16+9+9=34. Adding the six who attend neither returns the full group of 40.
If the question instead asked how many attend exactly one club, the answer would be 16+9=25. We could also compute 25+18−2×9=25: the shared students must be removed entirely rather than counted once.
Three overlapping sets: why the triple gets added back
For three sets A, B and C, the inclusion–exclusion formula is |A∪B∪C|=|A|+|B|+|C|−|A∩B|−|A∩C|−|B∩C|+|A∩B∩C|.
Why the final plus sign? Someone in all three sets is first counted three times. The three pairwise subtractions remove that person three times, leaving zero. Add the triple intersection once so that person counts exactly once.
A person in exactly two sets is initially counted twice, then removed once through the one relevant pair, so the final contribution is one. A person in exactly one set is counted once and never adjusted. A person in no set contributes zero.
The formula also makes a useful diagnostic for uncertain data. If a proposed set of counts produces an impossible negative number of students in an exclusive region, either the inputs are inconsistent or the interpretation of pairwise intersections is wrong.
The official 9820 syllabus includes the inclusion–exclusion principle as additional probability and counting content, but the formula is also a general reasoning technique for correcting overlaps in many finite counting problems.
Worked example: sixty students and three clubs
Question: Among 60 students, 29 belong to club A, 25 to B and 20 to C. There are 12 in A and B, 10 in A and C, 8 in B and C, and 5 in all three. Each pair count includes the five students in all three. How many belong to at least one club?
Apply the formula: |A∪B∪C|=29+25+20−12−10−8+5 =74−30+5 = 49. Thus 60−49=11 students belong to none.
How many belong to exactly two clubs? Subtract the five triple members from each pair count: A∩B only is 12−5=7, A∩C only is 10−5=5, and B∩C only is 8−5=3. Therefore exactly two clubs have 7+5+3=15 students.
How many belong to exactly one? A only is 29−12−10+5=12; B only is 25−12−8+5=10; C only is 20−10−8+5=7. Their total is 29.
Check the complete partition: exactly one (29) + exactly two (15) + exactly three (5) + none (11) =60. That final equality is a powerful error check: every student must appear in exactly one of those four mutually exclusive groups.
A number-theory application: count multiples from 1 to 100
How many positive integers at most 100 are divisible by two or three? There are ⌊100/2⌋=50 multiples of two and ⌊100/3⌋=33 multiples of three.
Numbers divisible by both two and three are multiples of six; there are ⌊100/6⌋=16. Therefore the count divisible by two or three is 50+33−16=67. The count divisible by neither is 100−67=33.
Now include divisibility by five as a third property. We have 50 multiples of two, 33 of three and 20 of five. The pairwise intersections are multiples of 6, 10 and 15, numbering 16, 10 and 6 respectively. The triple intersection is multiples of 30, numbering three.
So the count divisible by at least one of 2,3,5 is 50+33+20−16−10−6+3=74. The count divisible by none is 26.
This is the same set logic as the club example, but the overlap is determined through least common multiples. The connection is useful: an H3 problem can blend congruences, divisibility and combinatorics even if the topic heading suggests only one area of mathematics.
Upper bounds in stars-and-bars distributions
Consider ten indistinguishable counters placed in three labelled boxes, with no box permitted to hold more than four. Without capacity restrictions, stars and bars counts all nonnegative solutions of x+y+z=10: C(12,2)=66.
Let A be the bad allocations where the first box receives at least five. Writing x=5+u gives u+y+z=5, so |A|=C(7,2)=21. By symmetry there are 21 violations for the second box and 21 for the third.
But some allocations are counted twice as violations. If the first two boxes each contain at least five, they must contain exactly five each and the third box zero: the intersection has one outcome. Each of the three pairs of violating boxes similarly shares exactly one outcome. Three simultaneous violations are impossible because they would require at least 15 counters.
Apply inclusion–exclusion to the bad outcomes: 21+21+21−1−1−1=60. Therefore the valid allocations number 66−60=6.
Check by listing the only possible occupancy patterns: permutations of (4,4,2) give three outcomes and permutations of (4,3,3) give three more. This second method verifies the count and shows how stars and bars naturally combines with inclusion–exclusion when upper bounds are present.
An advanced extension: permutations with no fixed points
Suppose three people each receive one of three different labelled envelopes, and nobody may receive their own. This is a small derangement problem: count permutations with no fixed points.
There are 3!=6 total permutations. For person i, let Aᵢ be the permutations in which person i receives their own envelope. Each |Aᵢ|=2!=2, so the three single counts sum to six.
For any chosen pair of people both receiving their own envelopes, the last envelope is forced as well, leaving one permutation. The three pair intersections contribute three in total. All three people receiving their own envelopes also contributes one permutation.
Apply inclusion–exclusion to remove permutations with at least one fixed point: 6−6+3−1=2. The two valid arrangements are the cyclic swaps in opposite directions.
More generally, for n labelled objects, derangements can be counted by Σ from j=0 to n of (−1)ʲ C(n,j)(n−j)!. This extension illustrates how the alternating correction of intersections scales beyond two or three sets. The general method matters more than memorising the formula.
Ten short original counting clinics
1. Two overlapping clubs
If |A|=25, |B|=18 and |A∩B|=9, then |A∪B|=34.
2. Neither club
In a group of 40 with 34 in at least one club, 40−34=6 are in neither.
3. Exactly one
For the same clubs, 25+18−2×9=25 attend exactly one club.
4. Three sets
With singles 29,25,20; pairwise 12,10,8; triple 5, the union is 49.
5. Exactly two clubs
For those three sets, the exact-two count is (12−5)+(10−5)+(8−5)=15.
6. Divisible by 2 or 3
Among 1,…,100 the count is 50+33−16=67.
7. Divisible by 2, 3 or 5
Among 1,…,100 the union is 103−32+3=74 and the complement contains 26.
8. Codes containing zero
Four-digit PIN strings allow leading zeros. Those containing at least one zero number 10⁴−9⁴=3439.
9. Bad bounded distributions
Ten identical counters in three labelled boxes with each count at most four give 66−63+3=6 valid distributions.
10. Three-item derangements
Six total permutations minus those with fixed positions gives 6−6+3−1=2 derangements.
Four frequent mistakes that can change the answer
First, forgetting to subtract the overlap when adding two set sizes. Second, subtracting the triple intersection without adding it back in a three-set problem. The signs have a reason: they adjust how often each object is counted.
Third, assuming the given A∩B count means ‘A and B but not C’. In standard set notation it includes any member also in C. If the problem says ‘exactly A and B’, that is a different region. Read the wording closely.
Fourth, using inclusion–exclusion with sets that are not defined precisely. In a capacity problem, define each bad set as an explicit inequality such as x≥5, then identify pair and triple intersections with the same variables and constraints.
A useful check is to see whether the sum of disjoint categories reproduces the total population. Another is to solve a very small case by listing outcomes. If the formula and a careful enumeration disagree, look for missed intersections or a changed definition.
How to practise at JC2 H3 level
During the first session, prove the two-set identity by explaining each person’s or object’s contribution. Then derive the three-set formula with the same logic. Do not merely copy its plus and minus signs.
During the next session, solve a three-club example in which all pairwise counts include the triple intersection. Compute exactly one, exactly two, exactly three, at least one and none, and check that the disjoint categories total the group.
Next, apply inclusion–exclusion to multiples of small integers and to allocations with capacity limits. Finally, try a simple derangement problem. The aim is to recognise the shared mechanism in settings that look unrelated.
A strong H3 tutor will ask, ‘Which outcomes were counted twice?’ and ‘What is the intersection of those bad sets?’ These questions diagnose whether the student understands the proof rather than only the arithmetic.
The eduKateSG immutable small-group Mathematics reference near Sixth Avenue MRT describes a three-student Secondary 1 programme. It does not confirm current JC2 H3 lessons; please check current advanced mathematics tutoring arrangements directly.
Frequently asked questions
Is inclusion–exclusion part of H3 Mathematics 9820?
Yes. The published Singapore–Cambridge H3 Mathematics syllabus explicitly lists the inclusion–exclusion principle under additional probability and counting content.
Why do we add the triple intersection back?
An element in all three sets is added three times and subtracted three times in pair corrections. Adding the triple intersection once leaves the required single count.
Does A∩B include people also in C?
Yes. Standard pairwise intersection A∩B includes anyone who belongs to both A and B, whether or not they also belong to C.
Can inclusion–exclusion work with stars and bars?
Yes. Stars and bars counts unrestricted allocations, and inclusion–exclusion removes allocations that violate one or more bounds, correcting for overlaps among bad sets.
How can a student self-check the result?
Partition the population into disjoint regions and verify they sum to the total. For small distributions, enumerate all outcomes to cross-check the formula.
Official syllabus and connected articles
The 2026 SEAB H3 Mathematics 9820 syllabus lists inclusion–exclusion and the bijection principle under additional counting content. Students in a later examination year should check the 2027 A-Level syllabus index.
Develop the matching distribution technique in bijections and stars and bars, then connect divisibility counting to modular arithmetic and congruences. For a broader proof foundation, revisit pigeonhole and combinatorial reasoning.