Podium places for 10 runners
P(10, 3) = 720 ways to award gold, silver and bronze; C(10, 3) = 120 ways to pick three runners.
Calculate nPr and nCr, with and without repetition, exactly — even for very large numbers.
Enter your values and select Calculate to see the result.
Runs in your browser — nothing you enter is sent to a server.
Enter the total number of items n and how many you choose, r. A permutation counts arrangements where order matters (1st, 2nd and 3rd place); a combination counts selections where it doesn't (a team of three). The calculator also covers choosing with repetition, and every result is an exact whole number, however large.
P(n, r) = n! ÷ (n − r)!
C(n, r) = n! ÷ (r! (n − r)!)
nr arrangements; C(n + r − 1, r) selections
P(10, 3) = 720 ways to award gold, silver and bronze; C(10, 3) = 120 ways to pick three runners.
C(49, 6) = 13,983,816 possible tickets.
When swapping two chosen items gives a different outcome — rankings, codes and seating orders.
An item can be chosen more than once, like digits in a PIN: 10³ = 1,000 three-digit codes.
You can't pick more different items than exist.
Generate truly random numbers in any range — one or many, whole or decimal, with or without repeats.
Generators
Pick random winners from a list, shuffle it, or split it into random groups.
Generators
Find a percentage of a number, what percent one number is of another, or the percentage change between two values.
Calculators