inclusion-exclusion principle

(redirected from Sieve principle)

inclusion-exclusion principle

[¦in‚klü·zhən ′eks‚klü·zhən ‚prin·sə·pəl]
(mathematics)
The principle that, if A and B are finite sets, the number of elements in the union of A and B can be obtained by adding the number of elements in A to the number of elements in B, and then subtracting from this sum the number of elements in the intersection of A and B.
References in periodicals archive ?
Their topics include elementary considerations on arithmetic functions, sieve principles and terminology, sifting many residue classes, the linear sieve, combinatorial identities, primes represented by polynomials, and the least prime in an arithmetic progression.