⚖️ Permutation vs Combination Calculator

Total number of items available
Number of items to select

Permutation vs Combination: The Fundamental Difference

The key difference between permutations and combinations is whether the order of selection matters. This distinction leads to dramatically different calculations and applications.

Permutations refer to arrangements where the order is important. For example, when determining seating arrangements or passwords, changing the order creates a new permutation. The formula for permutations of n items taken r at a time is:
P(n, r) = n! / (n - r)!

Combinations, on the other hand, are selections where the order does not matter. This applies to situations like choosing team members or lottery numbers, where the grouping matters more than the order within. The formula for combinations of n items taken r at a time is:
C(n, r) = n! / (r! × (n - r)!)

Understanding this difference is crucial when solving problems in probability, statistics, and combinatorics. For hands-on practice and quick calculations of combination sums, try our Tool to Calculate Combination Sums, which efficiently handles a variety of permutation and combination problems.

Quick Reference

🎲 Combinations C(n,r)

Order Doesn't Matter

Formula: C(n,r) = n! / (r!(n-r)!)

Example: ABC = BAC

Use: Selection, teams, groups

Detailed Examples with Explanations

Example 1: Selecting 3 People from 5 for Different Purposes

Permutation Scenario

Task: Select President, Vice President, Secretary

Why Order Matters: Different roles require different arrangements

Calculation: P(5,3) = 5!/(5-3)! = 120/2 = 60

Result: 60 different ways to assign roles

Combination Scenario

Task: Select 3 people for a committee

Why Order Doesn't Matter: All committee members are equal

Calculation: C(5,3) = 5!/(3!×2!) = 120/12 = 10

Result: 10 different committees possible

Example 2: Working with Letters A, B, C, D, E

Task: Choose 3 letters

Permutations (Order Matters)

Examples:

  • ABC, ACB, BAC, BCA, CAB, CBA
  • ABD, ADB, BAD, BDA, DAB, DBA
  • ... and so on

Total: P(5,3) = 60 arrangements

Combinations (Order Doesn't Matter)

Examples:

  • ABC (same as ACB, BAC, etc.)
  • ABD (same as ADB, BAD, etc.)
  • ABE, ACD, ACE, ADE, BCE, BCD, BDE, CDE

Total: C(5,3) = 10 combinations

Mathematical Relationship

Key Formula Relationship

P(n,r) = C(n,r) × r!

This means:

  • Permutations = Combinations × Ways to arrange selected items
  • Each combination can be arranged in r! different ways
  • Therefore, permutations are always ≥ combinations (for r > 1)

Example: For n=5, r=3:

P(5,3) = C(5,3) × 3! = 10 × 6 = 60

Each of the 10 combinations can be arranged in 3! = 6 ways

When to Use Which Formula

🎯 Use Permutations For:

  • Rankings: 1st, 2nd, 3rd place
  • Arrangements: Seating plans, order of events
  • Sequences: Password combinations, lock codes
  • Assignments: Job roles, positions
  • Schedules: Order of presentations

🎲 Use Combinations For:

  • Team Selection: Choosing team members
  • Committees: Equal-role group formation
  • Sampling: Research subjects selection
  • Card Games: Poker hands, bridge deals
  • Lottery: Number selection problems

Common Applications Comparison

🏆 Sports Tournament

Permutation: Assigning 1st, 2nd, 3rd place medals to 8 runners → P(8,3) = 336 ways

Combination: Selecting 3 runners to advance to finals from 8 → C(8,3) = 56 ways

🃏 Card Games

Permutation: Dealing 5 specific cards in a specific order → P(52,5) = 311,875,200 ways

Combination: Getting any 5-card hand (poker hand) → C(52,5) = 2,598,960 ways

👥 Business Meeting

Permutation: Seating 4 people in specific chairs around a table → P(4,4) = 24 ways

Combination: Selecting 4 people to attend from 10 employees → C(10,4) = 210 ways

Special Cases and Edge Cases

Important Special Cases

When r = 1

P(n,1) = C(n,1) = n

Order doesn't matter when selecting only 1 item

When r = n

P(n,n) = n!, C(n,n) = 1

Only one way to select all items, many ways to arrange them

When r = 0

P(n,0) = C(n,0) = 1 (by convention)

There's exactly one way to select nothing

Frequently Asked Questions

Ask yourself: "Does the order matter?" If yes, use permutations (P). If no, use combinations (C). Think about whether rearranging your selection would create a different outcome.
Because P(n,r) = C(n,r) × r!. Since r! ≥ 1 for all non-negative integers r, permutations count all the different arrangements of each combination, making the result larger or equal.
Both P(n,r) and C(n,r) equal 0 when r > n, because you cannot select more items than are available. This is mathematically consistent and logically sound.
Pizza toppings: Choosing 3 toppings from 10 available is C(10,3) = 120 combinations. But if you're arranging 3 different colored books on a shelf, that's P(3,3) = 6 permutations because order matters.

Other Related Calculator

Basic Combination Calculator(nCr)

Calculate the number of ways to choose r items from n items without regard to order.

Try Calculator

Sum of Combinations Calculator

Calculate the sum of all possible combinations of a given set of numbers.

Try Calculator

Subset Sum Calculator

Find all subsets of numbers that add up to a target sum without repetition.

Try Calculator

Multiset Combination Calculator

Find the number of ways to choose items with repetition allowed.

Try Calculator

Combination Sum Calculator

Find the total sum of all possible combinations of chosen items.

Try Calculator

Riemann Sum Calculator

Approximate the area under a curve using left, right, or midpoint Riemann sums.

Try Calculator

Sum of Squares Calculator

Compute the sum of squared numbers, sequences, or datasets.

Try Calculator

Sum of Series Calculator

Find the total of arithmetic, geometric, or custom series.

Try Calculator

Partial Sum Calculator

Calculate the sum of the first n terms of a sequence or series.

Try Calculator

Infinite Sum Calculator

Determine convergence and value of infinite series.

Try Calculator

Find the Sum Calculator

Quickly calculate the sum of numbers, sequences, or formulas.

Try Calculator