Combinations, permutations and probability — solved step by step, the way your textbook does it
If you swap the chosen items, do you get a different outcome?
Can the same item be chosen more than once?
How many different words can be made by rearranging the letters. Instead of a word, you can enter how many times each item repeats: 3 2 2.
Enter the probability as a fraction (1/6), a decimal (0.8) or a percentage (80%).
All 36 outcomes: first die — rows, second die — columns
Step-by-step solution
📚 Theory: permutations, combinations and probability
Multiplication rule. If the first choice can be made in n ways and the second in m ways, both together can be made in n·m ways. All the counting formulas come from this: a president, a secretary and a treasurer can be chosen from 25 people in 25·24·23 ways.
The key question: does order matter? Swap the chosen items. If the outcome changes (places, roles, digits of a code), order matters: these are permutations ₙPᵣ = n!/(n − r)!, and arranging all n items gives n!. If the outcome is the same (a team, a set, a hand of cards), order does not matter: these are combinations ₙCᵣ = n!/(r!(n − r)!).
Why divide by r!. Each set of r items can be put in order in r! ways, so there are r! times as many ordered selections: ₙCᵣ = ₙPᵣ/r!. The letters A, B and C give 6 orders but only one combination.
With repetition. If items can be chosen again (digits of a PIN), each of the r places can be filled in n ways: nʳ. Combinations with repetition (4 scoops from 3 flavors) reduce to ordinary ones: ₙ₊ᵣ₋₁Cᵣ. Words from letters with repeats: n! divided by the factorials of the numbers of identical letters — MISSISSIPPI gives 11!/(4!·4!·2!) words.
Classical probability P(A) = n(A)/n(S): n(A) is the number of favorable outcomes, n(S) the number of all equally likely outcomes, and 0 ≤ P(A) ≤ 1. Two dice give 6·6 = 36 outcomes. When “at least one” takes long to count, use the complement: P(A) = 1 − P(A′).
Binomial probability. If an experiment is repeated n times independently and each time succeeds with probability p, the probability of exactly r successes is P(X = r) = ₙCᵣ·pʳ·(1 − p)ⁿ⁻ʳ. The combinations count the ways to choose which of the n trials are the successes.
Common mistakes: using combinations when the roles are different; forgetting to divide by r!; treating “at least one” as “exactly one”; leaving a probability unsimplified or getting one greater than 1; multiplying probabilities instead of counting ways when drawing from a bag.
Frequently asked questions
Is it free to use?
Yes, this calculator is free and needs no sign-up. Everything is calculated right in your browser, not on a server.