Counting problems - C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Item: Counting problems - C(n, k) = C(n − 1, k) + C(n − 1, k − 1)
Rating: 4
Author: PostSingularity Institute

by Robin Wilson

Formal & Physical Sciences Mathematics PBMathematics PBVCombinatorics and graph theory

🎙 Robin Wilson 👥 736K 📅 February 8, 2026 ⏱ 17 min 👁 2K 📄 science communication 🧭 2026-08-13

Available in: English (current) Français

Keywords

combinationspermutationsPascal's trianglebinomial theoremManhattan problem

Summary

In this talk, Robin Wilson introduces the fundamental concepts of arrangements (permutations) and combinations, tracing their historical origins and applications. He begins with ancient Indian problems involving arrangements of objects, leading to the definition of factorial. He then moves to combinations, citing early examples from Sanskrit medical texts and the work of Varahamihira. The general formula for combinations is derived, and properties such as symmetry and Pascal’s rule are explained. Pascal’s triangle is introduced as a visual representation of binomial coefficients, with a brief history of its appearance in various cultures. The talk concludes with the Manhattan problem, which elegantly illustrates the combination rules through grid paths. Throughout, Wilson emphasizes both algebraic and combinatorial proofs, making the content accessible yet rigorous.

121 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides a solid introduction to combinatorics, with clear explanations and historical context that enrich the understanding of the concepts. The argumentation is logical and well-structured, using concrete examples and visual aids to illustrate abstract ideas. The combinatorial proofs for the two key rules are particularly insightful, offering intuitive justifications beyond algebraic manipulation. The historical anecdotes add value by showing the development of mathematical ideas across cultures.

Scientific Rigor, Source Quality, Title Accuracy

The content is scientifically accurate, and the presenter is a credible authority in mathematics. The talk references historical sources and works, but specific citations are not provided in the video itself. The title accurately reflects the content, focusing on the recurrence relation for combinations. The description includes a link to a playlist of related talks and a book by the author, which serve as additional resources. Overall, the scientific rigor is high for a popular mathematics talk.

160 words

Title / Content Match

The title accurately reflects the content, focusing on the recurrence relation for combinations and its derivation.

Quality & Reliability

8/10

The talk is presented by a recognized mathematician (Robin Wilson) and covers well-established combinatorial principles with historical context. The content is accurate and clearly explained, though it is a popular exposition rather than a peer-reviewed source.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Oxford Mathematics playlist — Series of talks on equations in mathematics.

Concurring Sources

Pascal's triangle — Confirms the properties and history of Pascal's triangle.

Contribution & Novelties

This talk offers a clear and engaging introduction to combinatorics, with a strong emphasis on historical context and combinatorial proofs. It stands out for its accessible explanation of the recurrence relation for combinations, using the Manhattan problem as a concrete application. The historical examples from Indian and Islamic mathematics enrich the narrative.

Pour aller plus loin :

Pascal’s triangle — Overview of the triangle’s properties and history.
Binomial coefficient — Detailed mathematical treatment of binomial coefficients.
Combinatorics — General introduction to the field.

83 words

Radar Profile

The radar profile shows high scores in quantity and quality of information, with a moderate technical level. This indicates a well-balanced educational talk that is both informative and accessible, with strong reliability.

Reliability 8/10