What Is A Union B Union C?
A Union B Union C is the set of all elements that appear in at least one of the three sets A, B, or C. It is written $A \cup B \cup C$ and read aloud as "A union B union C." The symbol $\cup$ is the union operator, and stacking two of them simply extends the idea from two sets to three.
An element goes into $A \cup B \cup C$ if it is in A, or in B, or in C, or in any combination of them. It only needs to belong somewhere. An element is left out only when it is in none of the three.
Take three small sets:
$$A = {1, 2, 3, 4}, \quad B = {3, 4, 5, 6}, \quad C = {5, 6, 7, 8}$$
Collecting everything that appears in at least one set, and listing each element once, gives:
$$A \cup B \cup C = {1, 2, 3, 4, 5, 6, 7, 8}$$
The shared elements 3, 4, 5, and 6 still appear only once in the answer. A set never repeats an element, and that single rule is the reason counting the union takes more care than a plain sum. For the two-set starting point, see the union of sets.
How Do You Write A Union B Union C In Set Notation?
The union of three sets is defined by a single membership condition. In set-builder form:
$$A \cup B \cup C = {, x : x \in A \ \text{or}\ x \in B \ \text{or}\ x \in C ,}$$
Read it as "the set of all $x$ such that $x$ is in A, or in B, or in C." The word "or" here is inclusive: an element that sits in two or all three sets still satisfies the condition, and still joins the union exactly once.
Because "or" does not care about grouping, the union of three sets can be built two equal ways:
$$(A \cup B) \cup C = A \cup (B \cup C) = A \cup B \cup C$$
This is why union is associative, and why the three-set union is usually written flat, with no brackets at all. You can union A with B first, or B with C first, and land on the same set either way.
What Is The A Union B Union C Venn Diagram?
A three-set Venn diagram draws A, B, and C as three overlapping circles, splitting the space into eight regions: seven inside the circles and one outside all of them. The union $A \cup B \cup C$ is every region inside at least one circle, which is all seven of the inner regions shaded together. For the two-set version and how to read overlaps, see the Venn diagram guide.
Naming the seven regions makes both the picture and the formula easier to hold in your head.
Table: The seven regions of a three-set Venn diagram, all of which make up the union.
Region | Belongs to | In plain words |
|---|---|---|
1 | A only | in A, not B, not C |
2 | B only | in B, not A, not C |
3 | C only | in C, not A, not B |
4 | A and B only | in both A and B, not C |
5 | B and C only | in both B and C, not A |
6 | A and C only | in both A and C, not B |
7 | A and B and C | in all three sets |
The union is regions 1 through 7 combined. The eighth region, the space outside every circle, is the only part left out, and it is exactly the complement of the union.
What Is The A Union B Union C Formula?
To count the elements of $A \cup B \cup C$, add the three set sizes, subtract each pairwise overlap once, then add the triple overlap back:
$$n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(A \cap C) + n(A \cap B \cap C)$$
This rule is the inclusion-exclusion principle for three sets. The notation $n(A)$ means the number of elements in set A, and $A \cap B$ is the intersection of sets, the elements A and B share. The two-set version, $n(A \cup B) = n(A) + n(B) - n(A \cap B)$, is the same idea one step down; see the A union B formula for that case.
The order of the pairwise terms does not matter, since $n(A \cap C)$ and $n(C \cap A)$ count the same elements. What matters is the pattern of signs: plus for single sets, minus for pairs, plus for the triple.
How Do You Solve A Union B Union C Problems?
Work each problem in two moves: check which quantities you are given, then place them into the formula with the right signs.
Example 1: Count with all seven quantities given
In a class survey, 25 students like cricket (set A), 20 like football (set B), and 15 like chess (set C). The overlaps are $n(A \cap B) = 8$, $n(B \cap C) = 6$, and $n(A \cap C) = 5$, with $n(A \cap B \cap C) = 3$ liking all three. How many students like at least one of the three?
Substitute into the formula:
$$n(A \cup B \cup C) = 25 + 20 + 15 - 8 - 6 - 5 + 3$$
Add the singles, then apply the corrections:
$$n(A \cup B \cup C) = 60 - 19 + 3 = 44$$
Final answer: 44 students like at least one of the three activities.
Example 2: Solve for a missing triple overlap
Suppose $n(A \cup B \cup C) = 90$, with $n(A) = 50$, $n(B) = 40$, $n(C) = 30$, $n(A \cap B) = 15$, $n(B \cap C) = 10$, and $n(A \cap C) = 12$. Find $n(A \cap B \cap C)$.
Put the known values in and let the triple overlap be $x$:
$$90 = 50 + 40 + 30 - 15 - 10 - 12 + x$$
$$90 = 120 - 37 + x$$
$$90 = 83 + x$$
$$x = 7$$
Final answer: $n(A \cap B \cap C) = 7$. As a sanity check, 7 is no larger than any pairwise overlap (15, 10, 12), which it must not be, because the triple overlap sits inside each pair.
What Is The Complement Of A Union B Union C?
The complement $(A \cup B \cup C)'$ is everything in the universal set that lies outside all three sets, the single unshaded region of the Venn diagram. By De Morgan's laws, the complement of a union equals the intersection of the complements:
$$(A \cup B \cup C)' = A' \cap B' \cap C'$$
In counting form, if the universal set has $n(U)$ elements, then:
$$n\big((A \cup B \cup C)'\big) = n(U) - n(A \cup B \cup C)$$
Returning to Example 1, if the whole class has 50 students, then $50 - 44 = 6$ students like none of cricket, football, or chess. For the operator on its own, see the complement of a set.
Why Does The A Union B Union C Formula Work?
The formula exists to fix over-counting. If you simply add $n(A) + n(B) + n(C)$, every element that sits in an overlap gets counted more than once, so the total is too big. The alternating signs repair this exactly.
Follow one element through the formula, based on how many sets it belongs to:
In one set only: counted once in the singles, touched by no correction. Net count: 1. Correct.
In exactly two sets: counted twice in the singles ($+1 +1$), then subtracted once by that pair's term. Net count: $2 - 1 = 1$. Correct.
In all three sets: counted three times in the singles, subtracted three times by the three pairwise terms, then added back once by $+n(A \cap B \cap C)$. Net count: $3 - 3 + 1 = 1$. Correct.
That last line is the whole reason the triple term is added back. After subtracting the three pairs, an element in all three sets has been removed completely, counted zero times, so one copy has to be restored. Every element, no matter how many sets it lives in, ends up counted exactly once. The signs are not a recipe to memorise; they are the bookkeeping that guarantees each element is weighed a single time.
Who Discovered The Inclusion-Exclusion Principle?
The counting rule behind $A \cup B \cup C$ grew out of gambling problems long before it became part of set theory. Mathematicians studying games of chance needed to count outcomes that could satisfy several conditions at once, and the alternating add-subtract pattern kept surfacing.
Two other names sit alongside da Silva in this story:
Abraham de Moivre (1667–1754, France and England) used the underlying add-subtract idea in the early 1700s while working on problems of probability and games of chance, the earliest appearance of the pattern in print.
James Joseph Sylvester (1814–1897, England) published his own formulation in 1883, which is why the result is sometimes called the da Silva or Sylvester formula. You can read more in the Daniel da Silva biography at the MacTutor archive.
Where Is A Union B Union C Used In The Real World?
Counting a union of overlapping groups is one of those tools that quietly runs under a lot of everyday technology.
Databases and search: a query for records matching any of three conditions is a union, and a database that summed three separate counts would over-report by exactly the overlaps, so inclusion-exclusion corrects the total.
Media and advertising: finding how many distinct people saw a campaign across TV, video, and social channels is a union of three audiences, and de-duplicating the shared viewers is inclusion-exclusion in action.
Public health: estimating how many people carry at least one of several risk factors combines overlapping groups, where naive addition would badly overstate the at-risk population.
Probability: the chance that at least one of three events happens uses the same alternating pattern applied to probabilities instead of counts.
Survey analysis: when respondents can pick more than one option, the number who chose at least one is a union, not a sum of the columns.
One counting rule handles club sign-ups, ad audiences, health screening, and search results. Fields that never talk to each other lean on the same short formula.
What Are The Most Common A Union B Union C Mistakes?
Three errors account for most lost marks on union-of-three-sets questions, verified against inclusion-exclusion error guides and combinatorics study notes.
Adding the three set sizes and stopping
Where it slips in:
A student writes $n(A \cup B \cup C) = n(A) + n(B) + n(C)$ and treats the union like a plain total.
Don't do this:
Do not sum the three counts on their own. That counts every shared element two or three times and inflates the answer.
The correct way:
Subtract each pairwise overlap once, then add the triple overlap back, following the full inclusion-exclusion formula.
Forgetting to add back the triple overlap
Where it slips in:
A student remembers to subtract the three pairwise intersections but drops the final $+ n(A \cap B \cap C)$ term.
Don't do this:
Do not end the formula after the subtractions. Elements in all three sets have then been removed entirely and counted zero times.
The correct way:
Always restore the centre region with $+ n(A \cap B \cap C)$, so an element in all three sets is counted exactly once.
Confusing union with intersection
Where it slips in:
A student swaps $\cup$ and $\cap$, and reports the elements common to all three sets instead of the elements in at least one.
Don't do this:
Do not read $\cup$ as "and." Union is "or," the whole shaded picture; intersection is "and," the small centre.
The correct way:
Match the symbol to the word: $\cup$ (union) means at least one set, $\cap$ (intersection) means every set at once. The union is always at least as large as any single set.
Practice Problems On A Union B Union C
Work each one, then check against the answer that follows.
Given $A = {a, b, c}$, $B = {c, d}$, and $C = {d, e, f}$, find $A \cup B \cup C$.
(Answer: ${a, b, c, d, e, f}$.)With $n(A) = 30$, $n(B) = 25$, $n(C) = 20$, $n(A \cap B) = 10$, $n(B \cap C) = 8$, $n(A \cap C) = 7$, and $n(A \cap B \cap C) = 4$, find $n(A \cup B \cup C)$.
(Answer: $30 + 25 + 20 - 10 - 8 - 7 + 4 = 54$.)From the numbers 1 to 20, let A be the multiples of 2, B the multiples of 3, and C the multiples of 5. Find $n(A \cup B \cup C)$.
(Answer: $10 + 6 + 4 - 3 - 1 - 2 + 0 = 14$.)A group has 60 people. If $n(A \cup B \cup C) = 52$, how many are in none of the three sets?
(Answer: $60 - 52 = 8$.)If $n(A \cup B \cup C) = 100$, $n(A) = 60$, $n(B) = 45$, $n(C) = 35$, $n(A \cap B) = 20$, $n(B \cap C) = 15$, and $n(A \cap C) = 10$, find $n(A \cap B \cap C)$.
(Answer: $100 = 140 - 45 + x$, so $x = 5$.)
Where Should You Go Next After A Union B Union C?
The union of three sets opens straight into the rest of set theory, and a few natural doors follow from here.
Operations on sets. See union sitting beside intersection, difference, and complement as one connected toolkit.
Types of sets. Finite, infinite, equal, and disjoint sets change how the union behaves, especially when overlaps vanish.
Complement of a set. Go deeper on De Morgan's laws and the region outside the union.
If your child is building these foundations, a live Bhanzu trainer teaches set operations starting from the picture, the overlapping circles, before the formula, in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content