Team
math

Permutation and Combination Calculator

Permutations and combinations are fundamental counting techniques in probability and statistics. Permutations measure the number of ways to arrange objects in a specific order, while combinations count selections where order is irrelevant. This calculator computes both values instantly from your sample parameters, revealing how many distinct arrangements or groupings are possible from a given set. Essential for lottery odds, tournament scheduling, and combinatorial problem-solving.

Last updated:

Creators Mateusz Mucha, BEng
7,685 people find this calculator helpful

Permutations vs. Combinations: Core Distinctions

Permutations and combinations solve fundamentally different counting problems. A permutation is an ordered arrangement: selecting 3 people from 5 for a podium (1st, 2nd, 3rd place) yields 60 different permutations because ABC differs from BCA. Order matters absolutely.

A combination is an unordered selection: choosing the same 3 people for a committee yields just 10 combinations because ABC and BCA represent the same group. Order is irrelevant.

Consider a deck of cards. The number of ways to deal a 5-card hand is a combination problem (13 million possibilities). The number of ways to arrange those 5 cards in a sequence is a permutation problem (much larger). Both calculations answer "how many?" but in different contexts.

Real-world applications clarify the distinction: lottery draws use combinations (your ticket matches 6 numbers regardless of order), while sprint race medals use permutations (first-place finisher matters). Probability calculations often require one or the other—using the wrong method produces nonsensical results.

Permutation and Combination Formulas

Both calculations rely on factorial notation, where n! means multiplying all positive integers up to n (for example, 5! = 5 × 4 × 3 × 2 × 1 = 120).

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

Permutations: P(n,r) = n! / (n−r)!

  • n — Total number of distinct objects available for selection
  • r — Number of objects you are selecting or arranging from the set

How to Calculate Step-by-Step

For combinations:

  1. Identify n (total objects) and r (objects to choose)
  2. Calculate n! using the factorial function
  3. Calculate r! and (n−r)!
  4. Divide: n! by the product of r! and (n−r)!

Example: Choosing 3 people from 8 for a committee. C(8,3) = 40,320 / (6 × 120) = 56 possible committees.

For permutations:

  1. Identify n (total objects) and r (objects to arrange)
  2. Calculate n! and (n−r)!
  3. Divide: n! by (n−r)!

Example: Arranging 3 people from 8 as president, vice president, and treasurer. P(8,3) = 40,320 / 120 = 336 possible arrangements.

For large values, scientific notation (mantissa and exponent) displays results that exceed standard number formats. A result of 2.4 × 10³² means 2.4 followed by 32 zeros.

Common Calculation Pitfalls

Avoid these frequent mistakes when determining permutations or combinations:

  1. Confusing order relevance — The trickiest error is selecting the wrong formula. Ask yourself: does the arrangement sequence matter for the problem? If you're assigning job titles (manager, assistant, intern), use permutations. If you're selecting members for a committee with equal status, use combinations. Getting this wrong reverses your answer by orders of magnitude.
  2. Impossible parameter values — Values where r > n (selecting more objects than available) produce undefined results. Similarly, negative numbers yield no meaningful combinatorial interpretation. Ensure r ≤ n and both are non-negative integers before calculating.
  3. Mishandling repetition scenarios — The formulas provided assume no repetition—each object is distinct and selected at most once. If you're choosing with replacement (like rolling dice multiple times), different formulas apply. Lottery tickets, tournaments, and committee selections typically prohibit repetition; manufacturing quality control or password creation problems often involve repetition.
  4. Factorial overflow in manual calculation — Hand-calculating 20! or higher becomes impractical (20! exceeds 2 trillion). Always use a calculator for factorials beyond 12!. Off-by-one errors in factorial computation are common when done manually, cascading into wrong final answers.

Practical Applications and Real-World Contexts

Combinations dominate selection problems: lottery games (pick 6 from 49), hand selection in poker (2.6 million five-card hands), test question selection (how many ways to choose 5 questions from a 20-question bank), and clinical trial recruitment (how many ways to select 50 patients from 500 volunteers).

Permutations govern sequencing and arrangement: ranking competitors (1st, 2nd, 3rd in a race), scheduling shifts (assigning 5 staff to specific time slots), password generation (distinct characters in a sequence), and seating arrangements (who sits where at a table).

Probability calculations frequently combine both: the chance of winning a lottery equals 1 divided by the number of possible combinations. Tournament bracket predictions multiply permutations across multiple rounds. DNA sequencing uses combinations to identify genetic marker patterns.

Frequently Asked Questions

Why are permutations always larger than combinations for the same n and r?

Permutations count every distinct arrangement, while combinations group identical sets regardless of order. Since each combination encompasses multiple permutations (specifically, r! permutations per combination), the permutation total scales accordingly. For instance, C(5,3) = 10, but P(5,3) = 60—exactly 6 times larger (3! = 6). This ratio grows as r increases, which is why arrangement problems yield vastly larger numbers than selection problems.

Can you explain factorials in simple terms?

A factorial (n!) multiplies every positive whole number from n down to 1. For example, 4! = 4 × 3 × 2 × 1 = 24. Factorials grow explosively: 10! is already 3.6 million. By convention, 0! equals 1 (a special definition that makes formulas work cleanly). Factorials are essential because they count the total permutations of n distinct objects—there are exactly n! ways to arrange n items in a line.

When would I use combinations in real life?

Combinations apply whenever selection order doesn't affect the outcome. Buying lottery tickets (matching 6 numbers regardless of order), forming teams from a roster, choosing ingredients for a recipe, selecting courses for a degree, or picking songs for a playlist all use combinations. Any context where you ask "which items?" rather than "in what order?" suggests combinations. Medical diagnostics often combine symptoms (presence or absence matters, not sequence), and marketing surveys select random samples using combinations to ensure representative coverage.

What's the difference between calculating combinations with and without repetition?

The formulas shown here assume no repetition—each object is chosen at most once. Without repetition, choosing 2 items from {A, B, C} gives 3 combinations: AB, AC, BC. With repetition allowed (like selecting toppings where you can choose the same topping multiple times), the formula changes to C(n+r−1, r), and you'd get 6 combinations: AA, AB, AC, BB, BC, CC. Password creation and die-rolling problems typically allow repetition, while lottery draws and committee selection prohibit it.

How do I interpret very large numbers shown in scientific notation?

Scientific notation compresses enormous numbers into readable form. A result displayed as 3.5 × 10⁴⁸ means 3.5 followed by 48 zeros—roughly 350 quadrillion quadrillion quadrillion. The mantissa (3.5) shows significant digits, and the exponent (48) indicates the magnitude. For practical purposes, these astronomical numbers demonstrate why certain probability events are vanishingly unlikely: if there are 10⁶⁰ possible lottery outcomes, the chance of winning with one ticket is roughly one in a nonillion.

Why can't permutations or combinations be negative or zero?

Negative results contradict the definition: you cannot arrange or select a negative quantity of objects. Zero combinations or permutations would occur if r > n (impossible to choose more items than exist) or if n = r = 0 (selecting nothing from nothing). The minimum meaningful result is 1, representing the single way to select all n objects or the sole arrangement when r = 1. The formulas automatically prevent invalid inputs; attempting to calculate them produces undefined expressions (negative factorials don't exist).

More math calculators (see all)

Isosceles Trapezoid Calculator Relative Change Calculator GCF Calculator Slope Percentage Calculator Cos 2 Theta Calculator Fraction Calculator Factorial Calculator Area of a Hemisphere Calculator