Combinatorics (counting)

Combinatorics, also called counting, is the branch of mathematics devoted to counting the number of possible configurations of a situation. Its founding question can be stated in a few words: in how many ways can such a choice, such an arrangement, such a grouping be made? It is not interested in the value of the objects, but in the count of possibilities.

The central intuition is that before calculating a probability, you need to know how many cases exist. Counting the total number of possible outcomes, then the number of favourable outcomes, then makes it possible to form the ratio that gives a chance. Combinatorics thus provides the numbers that go in the denominator of probabilities, that is, the size of the universe of possibilities.

To carry out these counts, the discipline relies on a few complementary tools. The factorial counts the ways of ordering a complete set. The permutation describes these orders when all the elements are arranged. The arrangement counts partial selections where order matters. The combination counts partial selections where order is ignored. The multiplication principle, which consists in multiplying the independent choices step by step, links all these cases together.

A small numerical example makes the idea concrete. To choose a committee of 2 people from 4 with no hierarchy, combinatorics gives 6 possibilities. If, on the other hand, you assign two distinct roles to those 2 people, order matters and you obtain 12 arrangements. The same starting point leads to two different counts depending on whether order is taken into account or not, and this is precisely what combinatorics knows how to tell apart.

Without this framework, it would be impossible to calculate the exact odds in most games of chance. On a random draw site, combinatorics sheds light on the number of lottery grids as much as the number of running orders of a list of participants or the number of possible shuffles of a deck. It turns a vague intuition of rarity into a precise number, which is the condition for talking seriously about probability.