← All tools/Calculators/Math/Permutation and Combination Calculator
Permutation and Combination Calculator
How many ways to arrange or choose r items from n — with or without repetition.
Permutations P(n, r)
How it works
Without repetition: P(n, r) = n! ÷ (n − r)! = n × (n − 1) × … × (n − r + 1); C(n, r) = P(n, r) ÷ r! With repetition: P = n^r; C = (n + r − 1)! ÷ (r! × (n − 1)!) Computed by multiplication, never by whole factorials, so large n stays exact.
Worked example: from 10 items taken 3 at a time without repetition, P(10, 3) = 10 × 9 × 8 = 720 and C(10, 3) = 720 ÷ 6 = 120. With repetition allowed, P = 10³ = 1,000 and C = C(12, 3) = 220.
Frequently asked questions
What is the difference between a permutation and a combination?
Order matters in a permutation (ABC is different from BAC) but not in a combination (ABC and BAC are the same choice).
Why is C(n, r) smaller than P(n, r)?
Each combination of r items can be arranged in r! orders, so P(n, r) = C(n, r) × r!.
What does “with repetition” mean?
The same item can be picked more than once — like a PIN, where digits can repeat.
Why is r capped by n without repetition?
You cannot pick more distinct items than exist, so r must be no larger than n.
More tools
Tell us what you think
Loving this tool, or stuck on something? Tell us — it takes a minute.
We’ll only use your name and email to reply if needed. The tool and page are filled in for you.