Permutations vs combinations
Both count how many ways you can pick r items from n, but they differ on order. A permutation counts ordered arrangements (ABC ≠ CBA); a combination counts unordered selections (ABC = CBA).
Here n! (n factorial) is the product 1 × 2 × … × n. Because every combination corresponds to r! orderings, the two are linked by nCr = nPr ÷ r! — there are always at least as many permutations as combinations.
Worked example
From 10 items, choose 3:
When to use each
Use permutations when the sequence matters — race finishing positions, PIN codes, seating a row of people. Use combinations when only the group matters — lottery numbers, a hand of cards, choosing a committee. The calculator keeps results exact for everyday n and switches to high-precision handling for large factorials so the answer stays accurate. Note nPr and nCr require r ≤ n; if r exceeds n the answer is 0.