liveBook · Manning

Binomial coefficient

As explained in Timeless Algorithms, The Foundational Ideas

A binomial coefficient counts the number of ways to choose a specified number of items from a larger set, without regard to order.

The binomial coefficient, written “n choose k,” counts how many ways k successes can occur among n trials, regardless of order. In the binomial probability formula, it counts the success-and-failure sequences that yield the same number of successes; the multiplication rule gives the probability of each sequence. section 2.3.6

Counting trial outcomes

For trials such as purchases, positive test results, or coin tosses, the coefficient counts the distinct sequences with a specified number of successes. section 2.3.6

P(k successes in n trials)= (nk) × pk × (1-p)n-k

The coefficient multiplies the probability of one sequence to account for all sequences with k successes. section 2.3.6

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines the coefficient and explains its role in counting trial sequences within the binomial probability formula.
Examples
Uses purchases, positive test results, and coin tosses as examples of trial outcomes.
What you can do after
Understand how the coefficient counts sequences that produce a specified number of successes.
How it connects
Connects binomial coefficients to combinatorics, binomial probability, and likelihood.

Also explained in

Compare how 4 books explain binomial coefficient →

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.