Permutation & Combination Calculator

Calculate permutations P(n,r), combinations C(n,r), and factorials (!)

Calculation Type

Formula Preview

P(10, 3) = 10! / (10 - 3)!
📐

Waiting for Calculation

Enter parameters and click "Calculate" to see results

Permutation & Combination Formula Reference

Permutation

P(n, r) = n! / (n - r)!
Number of ways to arrange r elements selected from n distinct elements
Example: P(5, 3) = 5! / (5-3)! = 60

Combination

C(n, r) = n! / [r! × (n - r)!]
Number of different combinations when selecting r elements from n distinct elements
Example: C(5, 3) = 5! / [3! × 2!] = 10
C(n, r) = C(n, n - r)
Symmetry property of combinations

Factorial

n! = n × (n-1) × (n-2) × ... × 1
The factorial of a positive integer n is the product of all positive integers less than or equal to n
Example: 5! = 5 × 4 × 3 × 2 × 1 = 120
0! = 1
The factorial of 0 is defined as 1

Application Scenarios

🎲

Probability Calculations

Calculate winning probabilities in lotteries and games of chance

🔐

Cryptography

Calculate possible password combinations and assess security strength

🧬

Genetics

Calculate possibilities of gene combinations

📊

Statistical Analysis

Calculate possibilities for sample selection and experimental design

🏆

Competition Rankings

Calculate possibilities for competition rankings and award distributions

🎯

Decision Analysis

Analyze various possible outcomes of multi-option decisions

What Are Permutations and Combinations?

Permutations and combinations are fundamental concepts in combinatorial mathematics used to count the number of possible arrangements or selections from a set. Understanding what is the difference between permutation and combination is essential: permutations consider order while combinations do not. These mathematical tools are widely applied in probability theory, statistical analysis, cryptography, genetics, tournament scheduling, and many other fields where counting possible outcomes is necessary. A permutation calculator helps determine ordered arrangements, while a combination calculator calculates unordered selections from a larger set.

Permutation

Definition: A permutation is an arrangement of r elements selected from a set of n distinct elements where the order matters. The permutation formula calculates all possible ordered sequences.

Key Feature: Order is important. AB and BA are counted as two different permutations.

Example:P(5, 3) = 5!/(5-3)! = 60Choosing 3 books from 5 and arranging them on a shelf yields 60 different ordered arrangements.

Combination

Definition: A combination is a selection of r elements from a set of n distinct elements where the order does not matter. The combination formula calculates all possible unordered groups.

Key Feature: Order is irrelevant. AB and BA are considered the same combination.

Example:C(5, 3) = 5!/(3!×2!) = 10Choosing 3 books from 5 to take home without caring about order yields 10 different selections.

Three Calculation Modes

Permutation P(n, r)
P(n, r) = n! / (n - r)!

Calculate rankings, password arrangements, seating plans, and any scenario where order matters. Use this permutation calculator for ordered selections.

Combination C(n, r)
C(n, r) = n! / [r! × (n - r)!]

Calculate lottery odds, team selections, sampling without order, and any scenario where only group membership matters. The combination calculator handles unordered selections.

Symmetry property: C(n, r) = C(n, n - r)
Factorial n!
n! = n × (n-1) × (n-2) × ... × 1

Calculate full permutations, mathematical probabilities, and recursive algorithm foundations. The factorial calculator provides quick computations for any non-negative integer.

Special case: 0! = 1

How to Use This Permutation Combination Calculator

Using our permutation and combination calculator is straightforward. First, select your calculation type: permutation P(n,r), combination C(n,r), or factorial n!. Next, enter the values for n (total number of elements) and r (number of elements to select) in the input fields. Choose your preferred calculation mode and display format from the options provided. The tool instantly computes results with detailed step-by-step explanations showing how the permutation and combination formula is applied. You can switch between exact values, approximate values, and scientific notation depending on your needs.

Common Applications

Probability Statistics

Calculate winning odds, event likelihoods, and expected outcomes in statistical analysis

Password Security

Evaluate password strength by calculating total possible character combinations

Genetic Biology

Determine possible gene combinations and inheritance pattern probabilities

Tournament Planning

Arrange competition schedules and calculate award distribution scenarios

Sampling Surveys

Determine sample selection methods and calculate possible survey combinations

Decision Analysis

Analyze possible outcomes in multi-option decision-making processes

Frequently Asked Questions

What is the difference between permutation and combination?

The key difference is that permutation considers order while combination does not. In permutations, the arrangement ABC is different from CBA. In combinations, selecting items A, B, and C is the same regardless of order. Use the permutation formula P(n,r) = n!/(n-r)! when order matters, and the combination formula C(n,r) = n!/[r!(n-r)!] when only group membership matters.

When should I use this permutation calculator?

Use the permutation calculator when you need to count ordered arrangements, such as determining the number of possible PIN codes, arranging books on a shelf, calculating race finish orders, or any scenario where the sequence of selection matters. The permutation and combination calculator handles both ordered and unordered counting problems.

How does the combination calculator work?

The combination calculator applies the combination formula C(n,r) = n!/[r!(n-r)!] to count the number of ways to select r items from n items without regard to order. It computes factorials, divides appropriately, and displays the result along with step-by-step work showing how the calculation is performed.

What is the formula for nPr and nCr?

The formula for nPr (permutations) is n!/(n-r)!, which counts ordered selections. The formula for nCr (combinations) is n!/[r!(n-r)!], which counts unordered selections. The relationship between them is nPr = nCr × r!, meaning permutations equal combinations multiplied by the number of ways to arrange the selected items.

Can I calculate large factorials with this tool?

Yes, our factorial calculator can handle large values of n. For very large numbers, the tool provides scientific notation and approximate values to maintain accuracy while keeping results readable. The tool supports exact values for moderate-sized inputs and switches to approximations when numbers become extremely large.

How are permutations and combinations used in real life?

Permutations and combinations have numerous real-world applications including calculating lottery probabilities, determining password security strength, planning tournament brackets, analyzing genetic inheritance patterns, designing statistical experiments, and solving logistics problems. Any situation requiring counting possible outcomes can benefit from the permutation and combination formula approach.