The formula behind it
C(n, r) = n! / (r!(n−r)!)- n
- how many items are available
- r
- how many are selected
Combinations count selections where order is irrelevant. Dividing the permutations by r! collapses the r! orderings of every chosen set into one.
How to use this calculator
- 1
Enter n (the pool) and r (the group size).
- 2
Press Calculate.
- 3
The permutation row shows how much bigger the ordered count would be.
Worked examples
Lottery
C(49, 6) = 13,983,816 possible tickets.
Committee
Choosing 3 of 10 people: C(10,3) = 120 slates.