Rule of sum

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
A collection of five dots and one of zero dots merge into one of five dots.
5+0=5 illustrated with collections of dots.

In combinatorics, the rule of sum[1][2][verification needed] or addition principle[3][4] is a basic counting principle. Stated simply, it is the intuitive idea that if we have A number of ways of doing something and B number of ways of doing another thing and we can not do both at the same time, then there are A + B ways to choose one of the actions.[1][3]

Five shapes split into a group of three shapes and one of two shapes.
3+2=5 illustrated with shapes.[relevance questioned]

More formally, the rule of sum is a fact about set theory.[verification needed] It states that sum of the sizes of a finite collection of pairwise disjoint sets is the size of the union of these sets. That is, if are pairwise disjoint sets, then we have:[3][4]

Simple example[edit]

A person has decided to shop at one store today, either in the north part of town or the south part of town. If they visit the north part of town, they will shop at either a mall, a furniture store, or a jewelry store (3 ways). If they visit the south part of town then they will shop at either a clothing store or a shoe store (2 ways).

Thus there are 3+2=5 possible shops the person could end up shopping at today.[citation needed]

Inclusion–exclusion principle[edit]

A series of Venn diagrams illustrating the principle of inclusion-exclusion.
A series of Venn diagrams illustrating the principle of inclusion-exclusion.

The inclusion–exclusion principle (also known as the sieve principle[3]) can be thought of as a generalization of the rule of sum in that it too enumerates the number of elements in the union of some sets (but does not require the sets to be disjoint). It states that if A1, ..., An are finite sets, then[3]

References[edit]

  1. ^ a b Leung, K. T.; Cheung, P. H. (1988-04-01). Fundamental Concepts of Mathematics. Hong Kong University Press. ISBN 978-962-209-181-8.
  2. ^ Penner, R. C. (1999). Discrete Mathematics: Proof Techniques and Mathematical Structures. World Scientific. ISBN 978-981-02-4088-2.
  3. ^ a b c d e Biggs, Norman L. (2002). Discrete Mathematics. India: Oxford University Press. pp. 91, 112. ISBN 978-0-19-871369-2.
  4. ^ a b "enumerative combinatorics". planetmath.org. 22 March 2013. Archived from the original on 23 July 2014. Retrieved 14 August 2021.

See also[edit]