Combination Calculator (nCr)
Count how many ways to choose r items from n (order doesn't matter).
Combinations count the number of ways to select a group when the order of selection doesn't matter.
The math behind it
nCr = n! ÷ (r! × (n − r)!). It's computed iteratively here to avoid overflow on large factorials.
Worked example
Lottery: choose 6 from 49 → 49C6 = 13,983,816 combinations.
FAQ
Combination vs permutation?
Combinations ignore order; permutations count ordered arrangements (so there are always more permutations).