क्रमचय और संचय

हिंदी में पढ़ें

Chapter: Permutation and Combination

Learning Goals – By the end of this chapter, you will be able to:

Tell instantly when order matters (Permutation) and when it doesn’t (Combination).

Apply the fundamental counting principle without hesitation.

Use nPr and nCr formulas correctly in competitive exams.

Catch the common traps that exam setters love to hide.

The Hook – A Fact That Will Make Your Jaw Drop
Take a standard deck of 52 cards. Shuffle it well. The exact order you now hold has almost certainly never existed in the history of the universe. In fact, the number of possible arrangements (52!) is so huge it dwarfs the number of atoms on Earth. That’s the insane power of Permutation — the simple act of arranging things.

Now imagine you’re selecting 5 cards for a poker hand. The number of possible hands is much smaller because the order you hold them doesn’t matter — that’s Combination. Two ideas, both born from the same everyday question: “How many ways?” This chapter turns that question into your strongest weapon.

I Get It — You’re Confused
If you’ve ever scratched your head thinking, “Is it nPr or nCr here?” — breathe. Nearly every student starts exactly there. Permutation & Combination feels like a messy bundle of factorials. But once you crack the underlying logic, it becomes one of the most satisfying topics in mathematics. And I’m going to walk you through it, step by tiny step, until it clicks.

1. The Mother of All Counting: The Fundamental Counting Principle

Suppose you’re getting ready for a party. You have 3 shirts and 4 pairs of trousers. How many different outfits can you make? You don’t need a formula — just multiply: 3 × 4 = 12 outfits.

That’s the Fundamental Counting Principle: If one task can be done in *m* ways and another in *n* ways, both together can be done in m × n ways. This simple idea is the engine underneath everything we’re about to learn.

Let’s extend it. You also have 2 pairs of shoes. Total outfits? 3 × 4 × 2 = 24. The principle chains as long as you want.

🧠 Active Recall Prompt – Close your eyes. A restaurant offers 3 starters, 5 main courses, and 2 desserts. How many different full-course meals (starter + main + dessert) can a person order? (Answer: 3 × 5 × 2 = 30)

2. When Order Reigns: Permutation

Now, let’s slip into a situation where sequence matters. You are creating a 3-digit password using digits 1,2,3,4 without repetition. How many passwords are possible?

Work it slowly using the fundamental principle.
– For the first digit: you have 4 choices.
– For the second: only 3 left.
– For the third: 2 left.
Total = 4 × 3 × 2 = 24.

This is Permutation — arranging *r* items out of *n* available, where order matters. The notation we use is
𝑛
𝑃
𝑟
n
P
r
​

or
𝑃
(
𝑛
,
𝑟
)
P(n,r), and its formula is:

𝑛
𝑃
𝑟
=
𝑛
!
(
𝑛
−
𝑟
)
!
n
P
r
​

=
(n−r)!
n!
​

Here, n = 4, r = 3 → 4P3 = 4!/(4-3)! = 4!/1! = 24. Exactly what we got.

When you think “password, rank, sequence, arrangement,” think Permutation.

🧠 Active Recall Prompt – You have 6 books and you want to arrange 4 of them on a shelf. How many arrangements? Which formula? (Answer: 6P4 = 6!/(2!) = 360)

3. A Weird Mnemonic to Nail the Difference Forever

Imagine you’re at a crazy party.

Permutation Parade — people are marching in a row. The order of the marchers is everything; swap two people and you get a whole new parade. So P = Parade, order Priority.

Combination Curry — you’re throwing ingredients into a pot. Once they’re in, it’s just a mix. No one cares which went in first. So C = Curry, order Chill.

Picture a loudly dressed man shouting: “Please Carry!”
P for Permutation (Please – position matters).
C for Combination (Carry – put together, sequence doesn’t matter).

Weird, but you won’t forget it.

4. When Order is Just Noise: Combination

Now for the cooler sibling. Your class has 5 students: A, B, C, D, E. You need to choose a 3-member sports committee. Here, committee {A, B, C} is the same as {B, A, C}. Order doesn’t matter. You’re just selecting.

But wait — if we deliberately ignored order, how do we count? Start with permutation and then remove the order duplicates.
Number of ways to arrange 3 out of 5 = 5P3 = 60. But in those 60 arrangements, every 3-person group appears in 3! = 6 different orders. So the number of unique groups = 60 / 6 = 10.

Thus Combination formula:

𝑛
𝐶
𝑟
=
(
𝑛
𝑟
)
=
𝑛
!
𝑟
!
(
𝑛
−
𝑟
)
!
n
C
r
​

=(
r
n
​

)=
r!(n−r)!
n!
​

Here, 5C3 = 5!/(3!2!) = 10. Perfect.

When you hear “team, selection, hand, committee, group,” think Combination.

🧠 Active Recall Prompt – A bag has 7 different fruits. You pick 2 for a smoothie. How many ways? (Answer: 7C2 = 21. Order of picking doesn’t change the smoothie.)

5. The Relationship That Saves You in Exams

Notice something beautiful:
𝑛
𝐶
𝑟
=
𝑛
𝑃
𝑟
𝑟
!
n
C
r
​

=
r!
n
P
r
​

​

. Combination is just permutation divided by the factorial of the number of items selected. This means if you remember nPr, you can always derive nCr. Also,
𝑛
𝐶
𝑟
=
𝑛
𝐶
𝑛
−
𝑟
n
C
r
​

=
n
C
n−r
​

— selecting 3 out of 5 is the same as rejecting 2 out of 5. This symmetry can cut calculation time in half.

🧠 Active Recall Prompt – Calculate 15C12 using the symmetry trick. (Answer: 15C12 = 15C3 = 455)

6. The Traps and How to Sidestep Them

Trap 1: And vs Or. “And” means multiply; “Or” (mutually exclusive) means add.
Example: A password has 3 letters (from 26) followed by 2 digits (from 0-9). The number of passwords = (26 × 25 × 24) and (10 × 9) = 26P3 × 10P2 (no repetition). If repetition is allowed, it becomes 26³ × 10². Spot the “and” — multiply.

Trap 2: Repetition allowed. When repetition is allowed, the number of arrangements of r items from n is simply n^r (if order matters). For combination with repetition, it’s a different formula, but at foundation level simply note that most exam questions will specify “without repetition” unless stated otherwise.

🧠 Active Recall Prompt – A lock has a 3-digit code (0-9, repetition allowed). How many codes? (Answer: 10³ = 1000)

7. Permutation & Combination in One Problem

Sometimes a problem requires both. Example: From 5 boys and 4 girls, we need to form a team of 4 with exactly 2 girls.
– Choose 2 girls from 4: 4C2 = 6.
– Choose 2 boys from 5: 5C2 = 10.
– Now combine these selections (and) → 6 × 10 = 60 ways.
Notice, we used combination for selection; no arrangement here. If the problem asked to line them up after selection, you’d multiply by permutation.

📊 Summary Table

🧠 Active Recall Challenge — 5 Quick Questions

How many ways can 6 people be seated in a row? (6!)

A quiz has 10 questions; you must attempt any 7. How many ways? (10C7)

A car number plate has 2 letters (A-Z, no repeat) and 3 digits (0-9, no repeat). Total plates? (26P2 × 10P3)

What is nC0 for any n? (1)

If nP4 = 12 × nP2, find n. (Hint: use factorial form; n=6)

(Check your answers; if any slipped, revisit the chunk.)

🚀 Review this after 2 days. The brain solidifies learning when you intentionally recall after a gap. Before you go to bed in two days, close this book and write down the formulas for nPr, nCr, and the fundamental principle on a blank sheet. Then teach the “Permutation Parade, Combination Curry” idea to an imaginary friend. That act alone can double your retention.