Departure question
Find order without counting everythingPort 1 of 16Where two intuitions collide
A few layered choices can outnumber the universe, yet symmetry and recursion fold that explosion into compact formulas.
This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
From "how many possibilities?" to "what must appear?" Card hands, seatings, and lattice paths have different constraints; recurrences, bijections, generating functions, symmetry, and probability count them without duplication. Pascal's triangle is a common name for a binomial-coefficient array with earlier histories in several cultures, and combinatorics extends far beyond it.
n | Coefficients (k=0,1,2,...) |
|---|---|
| 0 | 1 |
| 1 | 1 1 |
| 2 | 1 2 1 |
| 3 | 1 3 3 1 |
| 4 | 1 4 6 4 1 |
| 5 | 1 5 10 10 5 1 |
| 6 | 1 6 15 20 15 6 1 |
Pascal’s triangle — row n contains the coefficients in the expansion of (a+b)ⁿ.
The mathematics of counting possible structures without duplication and proving what must occur even when exhaustive enumeration is impossible.
Q.Choose 2 people from a group of 5
Q.How many 8-bit strings are there?
Ports in time
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
Building on prosodic traditions associated with Pingala, Virahanka, and Gopala, Hemachandra explained a recurrence for rhythms made of one- and two-beat syllables. Its modern Fibonacci connection does not make it the invention of binary notation.
The recorded place matches a canonical map anchor
Continue this scene on the mapPascal linked a coefficient array with combinations, binomial powers, and probability. Earlier versions associated with Jia Xian and Yang Hui and with authors in the Islamic world mean the array itself was not his first invention.
The recorded place matches a canonical map anchor
Continue this scene on the mapEuler compressed routes into graph connectivity in the 1736 bridge problem, then stored whole families of integer-partition counts as coefficients of generating functions in a 1741 manuscript.
The recorded place matches a canonical map anchor
Continue this scene on the mapRamsey-type inevitability, probabilistic existence proofs, and computer-assisted case checking expanded combinatorics from enumeration into a study of unavoidable structure.
The recorded place matches a canonical map anchor
Continue this scene on the mapProbability calculations, cryptographic key-space analysis, RAID parity, coding theory, algorithmic complexity, and entropy in statistical physics.
Curated sources and problems. Bring one discovery back from OEIS, Project Euler, MathOverflow, or arXiv.
No concept belongs to one person
These are not inventor credits. They are different ports: opening a problem, sharpening a language, or carrying it into another world.
Number lenses
These numbers are editorial lenses for the voyage, not required prerequisites.
The first port of combinatorics opens when finite choices can be counted and grouped.
Open the number voyage
Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
Open the number voyage
Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
Open the number voyage
Concept genealogy
Concepts arriving from before
Current port
Combinatorics
Concepts opened from here
Only direct editorial links are shown; this is not a complete learning order or historical influence line.
