Permutation and Combination Calculator

The Complete Guide to Permutations and Combinations

In the world of statistics and probability, we often need to count the number of ways things can be arranged or selected. **Combinatorics** is the field of mathematics that deals with counting, and two of its most fundamental concepts are **permutations** and **combinations**. While they sound similar, they are used in different scenarios depending on one crucial factor: whether the order of selection matters.

The Building Block: Factorials (!)

Before diving into permutations and combinations, one must understand the factorial. A factorial, denoted by `n!`, is the product of all positive integers up to `n`. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By definition, 0! = 1.

Permutations: When Order Matters

A permutation is an arrangement of items in a specific order. Think of it as a lineup or a sequence. If you are choosing `r` items from a total of `n` items, and the order in which you choose them creates a different outcome, you are dealing with a permutation.

Classic Example: Arranging medals in a race. If you have 10 runners, the number of ways you can award gold, silver, and bronze medals is a permutation, because the outcome {Runner A (Gold), Runner B (Silver)} is different from {Runner B (Gold), Runner A (Silver)}.

The Permutation Formula (nPr)

Combinations: When Order Doesn't Matter

A combination is a selection of items where the order does not matter. Think of it as a group or a subset. If you are choosing `r` items from a total of `n` items, and different arrangements of the same items are considered the same outcome, you are dealing with a combination.

Classic Example: Forming a committee. If you are choosing a 3-person committee from a group of 10 people, the committee {Alice, Bob, Carol} is exactly the same as the committee {Carol, Alice, Bob}.

The Combination Formula (nCr)

You'll notice this is just the permutation formula divided by `r!`. This division by `r!` removes all the redundant arrangements that are counted in permutations.

The Key Difference: A Simple Analogy

Imagine you have 3 letters: A, B, C. How many 2-letter arrangements can you make?

• Permutations (Order Matters): AB, BA, AC, CA, BC, CB. There are **6** permutations (3P2 = 3! / (3-2)! = 6).
• Combinations (Order Doesn't Matter): {A, B}, {A, C}, {B, C}. There are only **3** combinations (3C2 = 3! / (2! * (3-2)!) = 3).

Real-World Applications

• Probability Theory: Permutations and combinations are the foundation for calculating the probability of events, especially in games of chance like card games and lotteries. You can explore this further with our Probability Calculator.
• Computer Science: Used in algorithms for sorting, scheduling, and cryptography. The number of possible passwords of a certain length is a permutation problem.
• Statistics: In study design, combinations are used to determine the number of possible sample groups that can be drawn from a population. This is related to the concepts in our Sample Size Calculator.
• Logistics and Operations: Businesses use permutations to figure out the most efficient routes for deliveries (the "Traveling Salesman Problem").