Permutation Calculator – P(n,r) and Combination C(n,r)

Permutations vs. Combinations: When Order Matters

A permutation is an arrangement of items where order matters. A combination is a selection where order does not matter. This single distinction determines which formula to use — and which problems each formula solves.

Classic example: you have 5 people and need to choose 3. If order matters (e.g., 1st, 2nd, 3rd place in a race), use P(5,3) = 60. If order doesn't matter (e.g., choosing 3 committee members), use C(5,3) = 10. The same selection of Alice, Bob, Carol counts as 1 combination but 6 different permutations (ABC, ACB, BAC, BCA, CAB, CBA).

The ratio P(n,r) / C(n,r) = r! — the number of ways to arrange r items. For r=3, each combination corresponds to 3! = 6 permutations. For r=5, each combination corresponds to 5! = 120 permutations, explaining why the 5-card poker hand count is 311,875,200 ÷ 120 = 2,598,960.

The Formulas: P(n,r) and C(n,r)

Both formulas are based on the factorial function: n! = n × (n−1) × (n−2) × ... × 2 × 1. By convention, 0! = 1.

Permutation formula: P(n,r) = n! / (n−r)!

This counts ordered arrangements. The denominator (n−r)! cancels out the items not chosen. For P(5,3): 5! / (5−3)! = 120 / 2 = 60.

Combination formula: C(n,r) = n! / (r! × (n−r)!)

The additional r! in the denominator removes the ordering of chosen items. For C(5,3): 5! / (3! × 2!) = 120 / (6 × 2) = 10.

Alternative combination notation: C(n,r) is also written as ⁿCᵣ, C(n,r), or the binomial coefficient notation (n choose r) using parentheses. All mean the same thing.

Real-World Examples of Permutations

Permutations apply whenever the arrangement or order of selection matters:

• PIN codes and passwords: A 4-digit PIN from 10 digits (0–9) without repetition has P(10,4) = 5,040 possible codes. With repetition allowed (standard PINs), it's 10⁴ = 10,000 (a different type of counting — ordered selections with replacement).
• Race finishes: In a race with 8 runners, the number of ways to assign 1st, 2nd, and 3rd place is P(8,3) = 8×7×6 = 336.
• Seating arrangements: Arranging 6 people at a round table has (6−1)! = 5! = 120 circular permutations (one seat is fixed to remove rotational equivalents).
• License plates: US-style plates with 3 letters followed by 4 digits: 26³ × 10⁴ = 175,760,000 possible plates (with repetition).
• Book arrangements: Arranging 7 different books on a shelf: 7! = 5,040 ways. Selecting 3 of 7 books in order: P(7,3) = 210 ways.

Real-World Examples of Combinations

Combinations apply when the selection is what matters, not the order:

• Lottery: Powerball requires choosing 5 numbers from 1–69: C(69,5) = 11,238,513 ways. Then choosing 1 Powerball from 1–26 adds × 26 = 292,201,338 total combinations — your odds of winning the jackpot.
• Card hands: 5-card poker hand from 52 cards: C(52,5) = 2,598,960 distinct hands. Specific hand counts: 4 aces = C(4,4)×C(48,1) = 48 hands.
• Committee selection: Choosing a 5-person committee from 20 candidates: C(20,5) = 15,504 ways.
• Pizza toppings: Choosing any 3 toppings from 12 options: C(12,3) = 220 different pizza combinations.
• Investment portfolio: Selecting 4 stocks from a list of 15: C(15,4) = 1,365 possible portfolios.

Pascal's Triangle and Binomial Coefficients

The combination values C(n,r) — also called binomial coefficients — form Pascal's Triangle, where each entry is the sum of the two entries above it:

Pascal's Triangle has remarkable properties: each row sums to 2ⁿ (the total number of subsets of an n-element set). The triangle encodes the coefficients of the binomial expansion: (a+b)³ = 1a³ + 3a²b + 3ab² + 1b³, using the third row of the triangle. The combination C(n,r) counts the number of paths through a grid, the number of subsets of size r from an n-element set, and the coefficients in the binomial theorem.

The symmetry property C(n,r) = C(n, n−r) is visible in Pascal's Triangle — each row reads the same forward and backward. This makes sense: choosing which r items to include is equivalent to choosing which (n−r) items to exclude.

Permutations with Repetition and Multisets

The standard P(n,r) and C(n,r) formulas assume items are distinct and not replaced (no repetition). When the rules change, different formulas apply:

The word "MISSISSIPPI" example illustrates multiset permutations: with 11 letters total (4 S's, 4 I's, 2 P's, 1 M), the number of distinct arrangements is 11! divided by the factorials of each repeated letter count. Without accounting for repeats, you'd overcount each arrangement 4!×4!×2! = 1,152 times.

Permutations and Combinations in Probability

Permutations and combinations are the foundation of classical probability: P(event) = (favorable outcomes) ÷ (total equally likely outcomes). This requires counting both the favorable and total outcomes correctly.

Probability of a royal flush in poker: There are 4 royal flushes (one per suit) out of C(52,5) = 2,598,960 total hands. Probability = 4/2,598,960 ≈ 0.000154% — about 1 in 649,740.

Birthday problem: In a group of n people, the probability at least two share a birthday uses permutations of 365 days: P(no shared birthday) = 365 × 364 × 363 × ... × (365−n+1) / 365ⁿ. For n=23 people, this probability drops below 50%, meaning there's a better-than-even chance of a shared birthday in a room of 23 people — a result most people find surprising.

Anagram probability: In a random arrangement of the letters in "APPLE," the probability of getting "APPLE" specifically is 1/60 (since 5!/2! = 60 distinct arrangements, dividing by 2! for the two P's). The probability of getting any arrangement starting with A is 4!/2! / 5!/2! = 12/60 = 1/5, as expected by symmetry.

Step-by-Step Permutation and Combination Problems

Mastering permutations and combinations requires working through problems systematically. The key decision is always: does order matter? Once that's settled, apply the appropriate formula and simplify. Here are worked examples covering typical problem types.

Problem 1: Race medals. In a race with 12 runners, how many ways can gold, silver, and bronze medals be awarded?
Order matters (gold ≠ silver ≠ bronze), so use P(12,3).
P(12,3) = 12! / (12−3)! = 12 × 11 × 10 = 1,320 ways.

Problem 2: Committee selection. From a class of 20 students, a teacher selects 4 for a project. How many different groups are possible?
Order doesn't matter (any 4 students form the same group), so use C(20,4).
C(20,4) = 20! / (4! × 16!) = (20 × 19 × 18 × 17) / (4 × 3 × 2 × 1) = 116,280 / 24 = 4,845 groups.

Problem 3: Password security. A password requires 2 uppercase letters followed by 4 digits (no repetition allowed). How many passwords are possible?
For letters: order matters, P(26,2) = 26 × 25 = 650.
For digits: order matters, P(10,4) = 10 × 9 × 8 × 7 = 5,040.
Total (by multiplication principle): 650 × 5,040 = 3,276,000 passwords.

Problem 4: Card dealing. From a standard 52-card deck, how many different 5-card hands contain exactly 3 aces?
Choose 3 aces from 4: C(4,3) = 4.
Choose 2 non-aces from 48: C(48,2) = 48 × 47 / 2 = 1,128.
Total: 4 × 1,128 = 4,512 hands with exactly 3 aces.

Problem 5: Circular seating. How many ways can 6 people sit around a round table?
In circular arrangements, one person's position is fixed (to eliminate rotational equivalents), leaving 5 people to arrange: (6−1)! = 5! = 120 ways.
If the table also has distinguishable seats (e.g., one has an armrest), it becomes 6! = 720 (linear permutation).

The multiplication principle: All multi-step counting problems use the fundamental multiplication principle: if step A can be done in m ways and step B can be done in n ways (independently), then both A and B together can be done in m × n ways. This principle underlies all permutation and combination formulas — P(n,r) is just the product n × (n−1) × ... × (n−r+1), and C(n,r) divides by r! to remove the over-counting of order.

When solving any counting problem: (1) Identify if order matters. (2) Check if repetition is allowed. (3) Identify if the items are distinguishable. (4) Break complex problems into sequential steps using the multiplication principle. (5) Apply P(n,r) or C(n,r) as appropriate, or use specialized formulas for circular arrangements, multisets, or repeated elements.

Verification strategies: Always sanity-check combinatorial results. C(n,r) should equal C(n, n−r) by the symmetry property — choosing r items to include is the same as choosing n−r items to exclude. P(n,r) should be divisible by r! (since dividing P(n,r) by r! gives C(n,r)). For small values, you can enumerate possibilities directly to verify a formula gives the right count. Building this intuition for checking your work prevents errors in high-stakes situations like engineering design counts, security parameter calculations, or statistical analysis.

Finally, when the numbers get very large, use logarithms to estimate. log₁₀(P(52,5)) = log₁₀(52!) − log₁₀(47!) = log₁₀(52×51×50×49×48) ≈ 8.494, so P(52,5) ≈ 10^8.494 ≈ 311,875,200 — confirmed. For probability calculations, working in log-probabilities prevents numerical underflow when probabilities are astronomically small (as in shuffled deck arrangements: 52! ≈ 8.07 × 10^67 possible orderings). The ability to reason about these enormous numbers using logarithms and combinatorial intuition is a mark of mathematical maturity and statistical thinking.

Permutations and combinations are taught in precalculus and probability courses because they are the gateway to understanding probability, statistics, and discrete mathematics. Beyond the classroom, they are indispensable in computer science (algorithm analysis, data structure design), genetics (counting genotype combinations), chemistry (molecular isomers), and game design (balance and fairness analysis). Every lottery odds calculation, every password security analysis, every sports ranking system, and every experimental design for clinical trials relies on this fundamental counting theory. Investing the time to truly understand permutations and combinations — not just memorizing the formulas but developing intuition for when to apply each — pays dividends across virtually every quantitative discipline. Use this calculator to check your work, build intuition with different values of n and r, and verify your reasoning on the problems you encounter.