Permutation and combination are two fundamental concepts in combinatorics that help us count the number of ways objects can be arranged or selected. While they may seem similar at first glance, the critical distinction lies in whether the order of selection matters. In everyday decision-making, from forming a committee to arranging books on a shelf, understanding when to apply each principle is essential for solving problems accurately. This article dives deep into permutation and combination examples with answers, offering clear step-by-step solutions, scientific explanations, and practical applications designed to build your confidence and mastery of these topics.
The Core Distinction: When Order Matters
Before solving problems, it is vital to grasp the conceptual difference between permutations and combinations. A permutation refers to an arrangement of objects in a specific order. Changing the order creates a new permutation. To give you an idea, the arrangements ABC and BAC are considered different permutations of the same three letters. Even so, in contrast, a combination is a selection of objects where the order does not matter. Here, ABC and BAC represent the same combination because only the chosen members matter, not their sequence.
This distinction is not merely academic; it directly affects how we count possibilities. In probability, statistics, and computer science, misidentifying whether order matters can lead to incorrect calculations. Throughout this article, we will explore various scenarios, provide worked examples, and reinforce the logic behind each method Easy to understand, harder to ignore..
Worth pausing on this one And that's really what it comes down to..
Permutation Examples with Answers
Example 1: Arranging Books on a Shelf Question: How many different ways can 5 distinct books be arranged on a shelf?
Solution: Since the books are distinct and the order in which they are placed on the shelf matters, this is a permutation problem. We are arranging all 5 books, so we need the number of permutations of 5 distinct items, which is calculated as 5 factorial (5!).
$5! = 5 \times 4 \times 3 \times 2 \times 1 = 120$
Answer: There are 120 different ways to arrange the 5 books on the shelf.
Example 2: Forming a Three-Digit Code Question: How many distinct three-digit codes can be formed using the digits 0-9 if no digit is repeated?
Solution: Here, the order of digits matters (a code of 123 is different from 321), and we are selecting 3 digits from 10 without repetition. This is a permutation of 10 items taken 3 at a time, denoted as P(10, 3) or 10₃P.
The formula for permutations without repetition is:
$P(n, r) = \frac{n!}{(n-r)!}$
Applying this:
$P(10, 3) = \frac{10!Now, }{(10-3)! } = \frac{10!}{7!
Answer: 720 distinct three-digit codes are
possible.
Example 3: Seating Arrangements with Restrictions Question: In how many ways can 4 boys and 3 girls be seated in a row of 7 chairs if the 3 girls must sit together?
Solution: Treat the block of 3 girls as a single "unit." We now have 4 boys + 1 girl-block = 5 units to arrange. These 5 units can be arranged in $5!$ ways. Within the girl-block, the 3 girls can be arranged among themselves in $3!$ ways. By the Fundamental Counting Principle, we multiply these values.
$5! \times 3! = (120) \times (6) = 720$
Answer: There are 720 possible seating arrangements.
Example 4: Permutations with Repetition (The Word Problem) Question: How many distinct arrangements (permutations) can be made using all the letters of the word "BANANA"?
Solution: The word "BANANA" has 6 letters total: B (1), N (2), A (3). Since letters repeat, we use the formula for permutations of a multiset:
$\frac{n!}{n_1! \times n_2! \times \dots \times n_k!}$
$\frac{6!}{1! \times 2! \times 3!
Answer: 60 distinct arrangements can be formed.
Combination Examples with Answers
Example 5: Forming a Committee Question: A club has 12 members. How many different committees of 4 members can be formed?
Solution: A committee is an unordered group; selecting Alice, Bob, Carol, and Dave is the same committee as selecting Dave, Carol, Bob, and Alice. This is a combination problem: choosing 4 from 12 without regard to order, denoted as $C(12, 4)$ or $\binom{12}{4}$ Simple as that..
The formula for combinations is:
$C(n, r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}$
Applying this:
$\binom{12}{4} = \frac{12!}{4! \times 8!
Answer: 495 different committees can be formed.
Example 6: Poker Hands (5-Card Draw) Question: How many distinct 5-card poker hands can be dealt from a standard 52-card deck?
Solution: The order in which cards are dealt does not change the hand. We are selecting 5 cards from 52.
$\binom{52}{5} = \frac{52!}{5! \times 47!
Answer: There are 2,598,960 possible distinct 5-card hands.
Example 7: Selection with "At Least One" Condition Question: A bag contains 5 red balls and 7 blue balls. In how many ways can you select 3 balls such that at least one is red?
Solution: It is often easier to calculate the complement (the opposite scenario) and subtract from the total. Total ways to select 3 balls from 12: $\binom{12}{3} = 220$. Ways to select 3 balls with no red balls (i.e., all 3 are blue): $\binom{7}{3} = 35$. Ways with at least one red = Total ways - All blue ways.
$220 - 35 = 185$
Answer: 185 ways.
Mixed Scenarios: Deciding Between Permutation and Combination
Real-world problems often require identifying the correct principle before calculating.
Example 8: Passwords vs. Lottery Numbers Scenario A: A password requires 4 distinct characters chosen from {A, B, C, D, E, F}. Scenario B: A lottery requires picking 4 winning numbers from a drum of 6 balls labeled {A, B, C, D, E, F}.
Analysis:
- Scenario A (Password): Order matters. "ABCD" unlocks the device; "BACD" does not. This is a Permutation: $P(6, 4) = 360$.
- Scenario B (Lottery): Order does not matter. If the winning numbers are {A, B, C, D}, a ticket with {D, C, B, A} wins. This is a Combination: $C(6, 4) = 15$.
**Example 9: Assigning Distinct
Example 9: Assigning Distinct Roles vs. Selecting a Team Scenario A: A manager must assign 3 distinct roles—Project Lead, Designer, and Tester—to 3 employees chosen from a pool of 10. Scenario B: A manager must select a 3-person task force from a pool of 10 employees.
Analysis:
- Scenario A (Distinct Roles): The positions are unique. Assigning Alice as Lead, Bob as Designer, and Carol as Tester produces a different outcome than Alice as Designer, Bob as Lead, and Carol as Tester. Order/Assignment matters. This is a Permutation: $P(10, 3) = 10 \times 9 \times 8 = 720$.
- Scenario B (Task Force): The three selected members are equals; there are no titles. The group {Alice, Bob, Carol} is identical to {Carol, Alice, Bob}. Order does not matter. This is a Combination: $C(10, 3) = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120$.
Advanced Counting: Permutations with Repetition and Identical Items
So far, we have assumed all items are distinct. What happens when objects are indistinguishable?
Example 10: Arranging Letters with Repetition (The "MISSISSIPPI" Problem) Question: How many distinct 11-letter "words" (arrangements) can be formed using all the letters in "MISSISSIPPI"?
Solution: There are 11 total letters. Even so, there are 4 I's, 4 S's, 2 P's, and 1 M. Swapping two identical S's does not create a new arrangement. The formula for permutations of a multiset is:
$\frac{n!}{n_1! \times n_2! \times \dots \times n_k!}$
Where $n$ is the total number of items, and $n_1, n_2, \dots, n_k$ are the frequencies of each distinct item.
$\frac{11!Because of that, }{4! \times 4! In real terms, \times 2! \times 1!
Answer: 34,650 distinct arrangements.
Example 11: Circular Permutations Question: In how many ways can 6 people sit around a circular table? (Two seatings are considered the same if everyone has the same neighbors).
Solution: In a line, $6! = 720$ arrangements exist. Around a circle, rotations are identical. We fix one person as a reference point (anchor) to break the rotational symmetry. We then arrange the remaining 5 people relative to that anchor Easy to understand, harder to ignore..
$(6-1)! = 5! = 120$
Answer: 120 distinct seating arrangements Easy to understand, harder to ignore..
Summary Decision Framework
When facing a new counting problem, run through this mental checklist:
| Question | Yes $\rightarrow$ | No $\rightarrow$ |
|---|---|---|
| Does order matter? | Permutation ($P(n,r)$ or $n!$) | Combination ($C(n,r)$) |
| **Are items repeated/identical?Because of that, ** | Divide by factorial of counts (Multiset Permutation) | Standard formulas apply |
| **Is it a circle/ring? Now, ** | Use $(n-1)! Still, $ (fix one position) | Linear arrangement |
| **Are there restrictions? ** (e.g., "A and B must sit together") | Treat restricted group as a single "block" first, then arrange internally. |
Quick Reference Card:
- Permutation: $P(n, r) = \frac{n!}{(n-r)!}$ (Order matters, no repetition)
- Combination: $C(n, r) = \frac{n!}{r!(n-r)!}$ (Order irrelevant, no repetition)
- Permutation with Repetition: $n^r$ (Order matters, repetition allowed, e.g., PIN codes)
- Multiset Permutation: $\frac{n!}{n_1! n_2! \dots}$ (Arranging a set with duplicates)
- Circular Permutation: $(n-1)!$ (Arranging around a fixed circle)
Conclusion
Mastering permutations and combinations is less about memorizing formulas and more about developing a structural intuition for order and identity. The critical pivot point in almost every problem is the question: "If I swap two selected items, has the outcome changed?" If the answer is yes, you are in the realm of permutations; if no, combinations are your tool Worth keeping that in mind..
By systematically breaking complex scenarios into these fundamental categories—linear vs. circular, distinct vs. identical, restricted vs. unrestricted—you transform intimidating counting problems into straightforward arithmetic But it adds up..
experiments, or scheduling tournament brackets, the principles remain consistent. The key is recognizing patterns: look for anchors in circular problems, identify blocks when constraints bind elements together, and always account for overcounting when identical items or symmetries are present Worth knowing..
Remember that practice with varied examples builds fluency. Start by classifying each problem type, then apply the corresponding framework. Over time, you will develop an instinct for which approach fits, making even detailed counting challenges manageable. With this foundation, you are equipped to tackle advanced topics like probability theory, graph enumeration, and algorithmic complexity with confidence.
