liveBook · Manning

Combinatorics

As explained in Timeless Algorithms, The Foundational Ideas

Combinatorics is the branch of mathematics concerned with counting, arrangement, and selection of discrete objects.

Combinatorics counts arrangements that satisfy a condition. In repeated trials, the multiplication rule gives the probability of one particular ordered sequence; combinatorics accounts for the different sequences with the same total number of successes and failures. Order matters for permutations, but not for combinations. section 2.3.5

One sequence versus a total

Heads, heads, tails, heads, tails is one particular sequence. Asking for three heads and two tails in any order includes many sequences. section 2.3.5

P(H, H, T, H, T)=0.5 × 0.5 × 0.5 × 0.5 × 0.5=(0.5)5=0.03125

This equation gives the probability of one particular ordered coin-toss sequence. section 2.3.5

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Explains the distinction between permutations and combinations but does not derive a general counting formula.
Examples
Uses coin-toss sequences, language-model token sequences, campaign responses, and manufacturing failures as examples.
What it assumes
Assumes the multiplication rule for independent trials and develops the distinction between ordered sequences and unordered success totals.
What you can do after
Understand whether a probability question concerns one ordered sequence or a success total in any order.
How it connects
Connects combinatorics with probability, permutations, combinations, independent trials, and likelihood-based inference.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.