Inclusion–exclusion principle
id:
inclusion-exclusion-principle-205-533675
title:
Inclusion–exclusion principle
text:
In combinatorics, a branch of mathematics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as
- | A ∪ B | = | A | + | B | − | A ∩ B | where A and B are two finite sets and |S | indicates the cardinality of a set S. The formula expresses the fact that the sum of the sizes of the two sets may be too large since some elements may be counted twice. The double-
brand slug:
wiki
category slug:
encyclopedia
description:
Counting technique in combinatorics
original url:
https://en.wikipedia.org/wiki/Inclusion%E2%80%93exclusion_principle
date created:
2003-10-17T04:19:01Z
date modified:
2024-09-10T03:19:29Z
main entity:
{"identifier":"Q849335","url":"https://www.wikidata.org/entity/Q849335"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/39/%D0%92%D0%B5%D0%BD%D0%BE%D0%B2_%D0%B4%D0%B8%D1%98%D0%B0%D0%B3%D1%80%D0%B0%D0%BC.svg","width":250,"height":158}
fields total:
13
integrity:
16