Home
/ Science, Engineering & Maths / Combinatorics: Strategies and Methods for Counting / The inclusion/exclusion principle: counting unions
The inclusion/exclusion principle: counting unions
The inclusion/exclusion principle: counting unions
How to count the number of elements of a finite union of sets? This is quite easy when you deal with two sets: just count the number of elements of each of the sets and subtract the number of elements of their intersection (that was counted twice). How about with 3 sets, or even more? Carlo will explain it in the next video.
You can access the content of the video in the PDF file at the bottom of this step.
This article is from the online course:
Combinatorics: Strategies and Methods for Counting
Created by
This article is from the free online
Combinatorics: Strategies and Methods for Counting
Reach your personal and professional goals
Unlock access to hundreds of expert online courses and degrees from top universities and educators to gain accredited qualifications and professional CV-building certificates.
Join over 18 million learners to launch, switch or build upon your career, all at your own pace, across a wide range of topic areas.
