Counting Possibilities
Combinatorics, Permutations & Combinations
The Human Problem
When there are many possible arrangements or outcomes, how can we count them without listing them all? That is the great leap of combinatorics. It is the birth of systematic counting, moving from tedious enumeration to structural understanding.
CHOICES →
COUNTING →
MULTIPLICATION →
ADDITION →
FACTORIAL →
ARRANGEMENT →
PERMUTATION →
SELECTION →
COMBINATION →
BINOMIAL COEFFICIENT →
COMBINATORICS
The 49 Combinatorial Cells
From Basic Principles to Complex Structure
CELL 01-07
Foundations of Counting
+OR
×AND
- The Counting Question
- Addition Principle (OR)
- Multiplication Principle (AND)
- Fundamental Principle
- Tree Diagrams & Double Counting
- Complementary Counting
CELL 08-10
The Factorial Engine
5!
n(n-1)(n-2)...
- Factorial Definition (n!)
- Factorial as Arrangement Count
- The special case of 0! = 1
CELL 11-13
Permutations
A
B
C
- Order Matters (Arrangements)
- n Objects taken all at once
- ⁿPᵣ Formula & Derivation
CELL 14-20
Complex Arrangements
- Repeated Objects (n!/n₁!n₂!)
- Circular Permutations (n-1)!
- Reflection / Necklace Preview
- Restrictions (Block & Gap Method)
CELL 21-26
Combinations
- Order Does NOT Matter (Selection)
- ⁿCᵣ Formula & Division by r!
- Permutation vs Combination
- Symmetry & Basic Identities
CELL 27-28
Pascal's Triangle
1
11
121
1331
14641
- Recursive Building (ⁿ⁻¹Cᵣ₋₁ + ⁿ⁻¹Cᵣ)
- Binomial Coefficients
- Binomial Theorem Preview
CELL 29-31
Multisets & Distributions
- Combinations with Repetition
- Distributing Identical Objects
- Stars & Bars Technique
CELL 32-37
Advanced Logic & Proof
- Complex Conditions & Casework
- Bijection & Double Counting
- Inclusion-Exclusion Principle
- Pigeonhole Principle
- Derangements Preview
CELL 38-42
Applications
- Probability Foundations
- Computing (Algorithm Complexity)
- Biology (Genetic Combinations)
- Finance & Economics
- Counting Large Spaces
CELL 43-45
The Infinite & Recursive
[
n → ∞
]
- Recursive Counting (aₙ = aₙ₋₁ + aₙ₋₂)
- Connections to Patterns (World 14)
- Generating Functions Preview
CELL 46-49
The Counting Synthesis
- Counting Without Enumeration
- The Three Master Questions
- The Counting Decision Tree
- Counting as Mathematical Structure
Exit Portal
We now know how a rule can generate and count an entire space of possible arrangements. But what happens when we do not know WHICH outcome will occur? Once we map the space of all possibilities, we must assign likelihood to the unknown.