Combinatorics: Combinations, Arrangements, and Permutations
Combinatorics studies the ways in which elements can be selected and ordered from a set. This calculator computes permutations, arrangements, and combinations (simple and with repetition), showing the formula and result even for very large numbers.
The Six Operations of Combinatorics
| Type | Order matters? | Repetition? | Formula |
|---|---|---|---|
| Simple permutations | Yes | No | P(n) = n! |
| Permutations with repetition | Yes | Yes | P'(n,k) = n^k |
| Simple arrangements | Yes | No | D(n,k) = n!/(n-k)! |
| Arrangements with repetition | Yes | Yes | D'(n,k) = n^k |
| Simple combinations | No | No | C(n,k) = n!/(k!(n-k)!) |
| Combinations with repetition | No | Yes | C'(n,k) = (n+k-1)!/(k!(n-1)!) |
Practical Examples
Simple permutations: How many ways can 8 people sit at a table? P(8) = 8! = 40,320.
Simple arrangements: How many different podiums (gold, silver, bronze) are possible with 20 athletes? D(20,3) = 20x19x18 = 6,840.
Simple combinations: How many groups of 5 players can be formed from a roster of 25? C(25,5) = 53,130.
The Factorial
The factorial (n!) is the building block of combinatorics. It grows incredibly fast: 5! = 120, 10! = 3,628,800, 52! has 68 digits.