Sign inSign in
ConceptMathematics

Combinatorial proof

A proof of an identity by showing that both sides count the same set in two different ways.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Counting principles2Binomial coefficient1Combinations1Combinatorics1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ankur Moitra

    MIT · Undergraduate

    A proof of a mathematical statement that establishes the equivalence of two expressions by showing they count the same set in two different ways.

Lectures that assume it

1

Connections

6

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.