What are Combination and Permutation? Key Differences and Formulas

In mathematics, probability, and statistics, there are two fundamental concepts that frequently appear: Permutation and Combination. Although these two terms are often confused, there is a simple but vital difference between them.

In this article, we will examine the differences between combination and permutation, their use cases, and their mathematical formulas.

The Core Difference: Does Order Matter?

The easiest way to understand the difference between permutation and combination is to ask this question: "Does the order of selection matter?"

• Permutation (Ordering): The order of the elements matters. Even if they consist of the same elements, different arrangements are considered different outcomes.
• Combination (Selecting): The order of the elements does not matter. Only which elements are selected matters.

Let's Explain with an Example:

Imagine you are setting a passcode for a lock. If your code is 1-2-3, entering 3-2-1 will not open the lock because the order is crucial. This is a permutation example.

Now, imagine making a fruit salad. You add banana, strawberry, and apple into a bowl. It doesn't matter which one you put in first; you end up with the exact same fruit salad. This is a combination example.

1. What is Permutation and How to Calculate It?

A permutation is the arrangement of all or part of a set of elements in a specific order.

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

Where:

• n: Total number of elements in the set
• r: Number of elements to select and arrange
• !: Factorial symbol (e.g., 4! = 4 × 3 × 2 × 1 = 24)

Example: Out of 5 runners, in how many ways can we select the first, second, and third-place winners? Here, the order matters because being first is different from being third. P(5, 3) = 5! / (5 - 3)! = 120 / 2 = 60 different outcomes.

2. What is Combination and How to Calculate It?

A combination is a selection of elements from a set without regard to the order of selection.

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

Where:

• n: Total number of elements in the set
• r: Number of elements to select

Example: From a group of 5 people, in how many ways can a 3-member committee be chosen? Here, since there are no ranks or hierarchy among committee members, the order is irrelevant. C(5, 3) = 5! / (3! × (5 - 3)!) = 120 / (6 × 2) = 10 different committees can be formed.

Summary Table

| Feature | Permutation (Ordering) | Combination (Selection) | | :--- | :--- | :--- | | Order Relevance | Order is important. | Order is not important. | | Keywords | Arrangement, Order, Sequence | Selection, Group, Team | | Formula | n! / (n - r)! | n! / (r! × (n - r)!) | | Number of Outcomes| Generally larger. | Generally smaller. |

When deciding which one to use in mathematical problems or programming, always look at whether changing the order of your chosen elements creates a new outcome. If it does, calculate permutations; if it doesn't, calculate combinations.