Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

bijection

A pairing between two sets that matches every element of one to exactly one element of the other, with nothing left over.

A bijection between finite sets A and B is a pairing that is both one-to-one (no element of B paired twice) and onto (every element of B is paired); it forces |A|=|B|.

Examples

  • Subsets of an n-set pair with length-n binary strings, so there are 2^n subsets.

Read the full section →
Graph settings

Calculator