Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Inclusion–exclusion principle
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Counting intersections=== The principle of inclusion–exclusion, combined with [[De Morgan's law]], can be used to count the cardinality of the intersection of sets as well. Let <math>\overline{A_k}</math> represent the complement of ''A<sub>k</sub>'' with respect to some universal set ''A'' such that <math>A_k \subseteq A</math> for each ''k''. Then we have :<math>\bigcap_{i=1}^n A_i = \overline{\bigcup_{i=1}^n \overline{A_i}}</math> thereby turning the problem of finding an intersection into the problem of finding a union.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)