Calculator

Permutations (nPr):
Combinations (nCr):
Factorial (n!):

Concepts & Formulas

What are Permutations?

Permutations (nPr) represent the number of ways to arrange ‘r’ items from a set of ‘n’ items where order matters.

nPr = n! / (n – r)!

Example: Arranging 3 books out of 5 on a shelf. The order matters.

What are Combinations?

Combinations (nCr) represent the number of ways to choose ‘r’ items from a set of ‘n’ items where order does not matter.

nCr = n! / [r! × (n – r)!]

Example: Selecting 3 team members out of 5 candidates. Order doesn’t matter.

Practical Examples

🔒 Combination Lock
A lock with 3 dials, each with 10 digits. Since order matters, this is a permutation: 10P3 = 10 × 9 × 8 = 720 possible combinations.
👥 Committee Selection
Selecting 4 people from 10 for a committee. Since order doesn’t matter, this is a combination: 10C4 = 210 possible committees.
🏆 Podium Positions
Selecting 1st, 2nd, and 3rd place from 8 runners. Order matters: 8P3 = 8 × 7 × 6 = 336 possible outcomes.
🍕 Pizza Toppings
Choosing 3 toppings from 8 available. Order doesn’t matter: 8C3 = 56 possible pizza combinations.