AES Encryption Explained: How It Works and Why It Matters
Jun 23, 2026
Calculate nCr (combinations) and nPr (permutations) with step-by-step formula.
Permutations (nPr) count the number of ways to arrange r items from a set of n items where order matters. For example, the number of ways to arrange 3 books from 10 on a shelf.
Combinations (nCr) count the number of ways to select r items from a set of n items where order does not matter. For example, the number of ways to choose 3 team members from 10 candidates.
nCr (combinations) counts selections where order does not matter. nPr (permutations) counts arrangements where order matters. nPr is always larger than nCr for the same n and r (when r > 1).
When r is larger than n, both nCr and nPr are 0 because you cannot choose or arrange more items than available.
Values up to 170 are supported. Beyond that, factorial results exceed JavaScript's maximum safe integer (Number.MAX_SAFE_INTEGER).
Blog
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026