Permutation and Combination Calculator

Calculate permutations (nPr), combinations (nCr), and factorials with detailed step-by-step solutions. Perfect for combinatorics problems, probability calculations, and mathematical analysis.

How to use: Select calculation type (Permutations, Combinations, or Factorial), enter your values for n and r, and click calculate to get comprehensive results with explanations and formulas.

Permutation & Combination Calculator

Formula: nPr = n! / (n-r)!
Example: Arranging 5 people in 3 chairs = 5P3 = 60 ways
Total items to choose from
Items to arrange (order matters)
Formula: nCr = n! / (r! × (n-r)!)
Example: Choosing 3 people from 5 = 5C3 = 10 ways
Total items to choose from
Items to select (order doesn't matter)
Formula: n! = n × (n-1) × (n-2) × ... × 2 × 1
Example: 5! = 5 × 4 × 3 × 2 × 1 = 120
Calculate factorial of this number
Combinatorics Calculation Results

Understanding Permutations and Combinations

Permutations and combinations are fundamental concepts in combinatorics, the branch of mathematics dealing with counting, arrangement, and selection. These concepts are essential for solving problems in probability, statistics, computer science, and many real-world applications involving arrangements and selections.

Understanding the difference between permutations and combinations is crucial: permutations consider order important, while combinations do not. This distinction determines which formula to use for different types of counting problems.

Key Formulas

Permutations (nPr)

nPr = n! / (n-r)!

Number of ways to arrange r items from n items (order matters)

Combinations (nCr)

nCr = n! / (r! × (n-r)!)

Number of ways to choose r items from n items (order doesn't matter)

Factorial (n!)

n! = n × (n-1) × (n-2) × ... × 2 × 1

Product of all positive integers from 1 to n

Permutations vs Combinations

Permutations: Order matters. Used when arranging items where different orders create different outcomes. Example: arranging people in a line, password creation, race positions.
Combinations: Order doesn't matter. Used when selecting items where different orders create the same outcome. Example: choosing team members, lottery numbers, selecting toppings.

When to Use Each

Problem Type Use Formula Example
Arranging objects in orderPermutationnPrSeating arrangements
Selecting without orderCombinationnCrChoosing committee members
Password creationPermutationnPrDifferent letter orders matter
Lottery number selectionCombinationnCrOrder drawn doesn't matter
Race finishing positionsPermutationnPr1st, 2nd, 3rd place different
Pizza topping selectionCombinationnCrOrder of selection irrelevant

Factorial Properties

Definition: n! = n × (n-1) × (n-2) × ... × 2 × 1

Special Cases:

Calculation Examples

Permutation Example: How many ways can 5 people be arranged in 3 chairs?

5P3 = 5! / (5-3)! = 5! / 2! = 120 / 2 = 60 ways

Combination Example: How many ways can 3 people be chosen from 5?

5C3 = 5! / (3! × 2!) = 120 / (6 × 2) = 120 / 12 = 10 ways

Common Applications

Field Application Type Used Why
Computer ScienceAlgorithm analysisBothComplexity calculations
ProbabilityEvent countingBothCalculating likelihood
GeneticsDNA sequence analysisPermutationOrder of bases matters
Quality ControlSample selectionCombinationOrder of selection irrelevant
CryptographyKey generationPermutationOrder affects security
Game TheoryStrategy combinationsBothDepends on game rules

Relationship Between Permutations and Combinations

Key Relationship: nPr = nCr × r!

This makes sense because:

Pascal's Triangle and Combinations

Pascal's Triangle displays combination values:

Row n contains the values nC0, nC1, nC2, ..., nCn

Each number is the sum of the two numbers above it

Properties and Identities

Combination Properties:

Permutation Properties:

Problem-Solving Strategy

Step 1: Identify if order matters

Step 2: Identify n (total items) and r (items to select/arrange)

Step 3: Apply the appropriate formula

Step 4: Verify your answer makes sense

Advanced Concepts

Repetition Allowed:

Circular Permutations: (n-1)! ways to arrange n objects in a circle

Multiset Permutations: n! / (n₁! × n₂! × ... × nₖ!) for objects with repetitions

Tip: Always ask yourself: "Does changing the order create a different outcome?" This simple question will guide you to the correct formula and approach for any combinatorics problem.