Step by step
Calculate combinations, nCr or “n choose r” — the number of ways to pick r items from n when order does not matter — exactly, with the formula and every step shown.
Step by step
A combination counts selections — where the order of the chosen items does not matter.
Type the total number of items n and how many you are choosing r. Both must be non-negative whole numbers, with r no larger than n.
It computes nCr = n! / (r! × (n − r)!). The result is exact, even for large numbers, using BigInt arithmetic and the symmetry nCr = nC(n−r) to keep it precise.
The number of selections appears first, with the working below. If the order of the chosen items does matter, use the Permutation Calculator instead.