Inclusion–exclusion principle

Inclusion–exclusion illustrated by a Venn diagram for three sets

In combinatorics (combinatorial 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

where A and B are two finite sets and |S| indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite). 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-counted elements are those in the intersection of the two sets and the count is corrected by subtracting the size of the intersection.

单词	Principle Of Inclusion and Exclusion
释义	Principle Of Inclusion and Exclusion 英语百科 Inclusion–exclusion principle In combinatorics (combinatorial 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 where A and B are two finite sets and \|S\| indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite). 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-counted elements are those in the intersection of the two sets and the count is corrected by subtracting the size of the intersection.
随便看	fortleonardwood fortlesleyjmcnair fortlet fortlets Fort Lewis fortlewis Fort Lewis College Fort Liard Fort Liberte fortlike Fort Lincoln Fort Lockhart fort louden Fort Loudon Fort Loudoun Lake fortlow Fort Lupton Fort MacArthur Fort MacKay Fort Mackenzie Fort Macleod Fort MacMahon Fort Madison Fortmann Fort Manning

Principle Of Inclusion and Exclusion

Inclusion–exclusion principle