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

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

Uploaded February 2026 | Updated September 2026, 2 weeks ago

Robin Wilson's ninth talk on the equations that make mathematics takes us to the arrangements and combinations of objects, their history and their application.

You can watch other episodes in the series here: youtube.com/playlist?list=PL4d5ZtfQonW0yqeFK__FirrjjmcQFpyye

Robin's book 'Sum Stories: Equations and their origins' is available here: amazon.co.uk/Sum-Stories-Equations-Their-Origins/dp/0199607907

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

Introduction to University Mathematics: Lecture 4 - Oxford Mathematics 1st Year Student Lecture

Set Theory - What is Set Theory and what is it for? Oxford Mathematics 3rd Year Student Lecture

Machine v Maths

Once upon a time

Mathematical salad dressing

Subjective science

The Tower of Babel - Episode 1

Pi and maths

Algebraic Curves, Lecture 2: More on projective geometry. 3rd Year Student Lecture

Milky White

Pluto

Oxford Mathematics |

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