Classical combinatorics (other)

Classical combinatorics covers a variety of counting techniques and principles not limited to permutations and combinations. Other important ideas include the Inclusion-Exclusion Principle, the Pigeonhole Principle, and basic recurrence relations. These tools help solve problems where direct counting is difficult.

Important properties

• The Inclusion-Exclusion Principle allows us to count the number of elements in the union of overlapping sets by adding and subtracting the sizes of their intersections.

• The Pigeonhole Principle states that if more objects are placed into fewer boxes, at least one box contains more than one object.

• Recurrence relations describe sequences where each term is defined in terms of previous terms, useful for counting arrangements with constraints.