How we worked it out
Updated as you change the numbers.
- nPr = n! ÷ (n − r)!. nCr = n! ÷ (r! (n − r)!). With repetition: nʳ ordered, C(n + r − 1, r) unordered.
Method and assumptions
Permutations count ordered arrangements; combinations count selections where order doesn’t matter, so nCr = nPr ÷ r!. Results are exact, using whole-number arithmetic of any size.
Questions
How many ways to choose 3 from 10?
120 combinations, or 720 ordered permutations.
Sources
Method and figures checked on . Every worked answer on this page is covered by an automated test. Found a mistake? Tell us.