Lesson 8 — Intermediate

Permutations & Combinations

Combinatorics matlab ginne ki maths — "kitne tarike se ho sakta hai". Is lesson mein seekhenge addition-multiplication principles, permutations (order matter), combinations (sirf selection), circular arrangements aur repeated letters wale special cases — sab worked examples ke saath.

⏱ 16 min• Intermediate• Functions

Counting ke 2 principles

WHAT

Combinatorics ginne ki maths hai. Do principles par sab chalta hai: Addition (koi EK raasta chuno → ways jodo) aur Multiplication (pehle kaam A phir B → ways guna karo).

WHEN

Team chunna, passwords banana, arrangements, probability, scheduling — har jagah counting chahiye. Aptitude exams ka sabse bade marks wala section yahi hai.

WHERE

Placement aptitude, GATE, probability, algorithms (search space) aur database query results — sab counting par chalte hain.

Ek hi line se decide karo: kya dono kaam ek saath ho sakte hain? Haan (AND) → multiplication. Ya koi EK hai (OR) → addition. Ye do rules har question mein lagte hain.

Permutations — order matter karta hai

PERMUTATION = arrangement, order matter karta hai

P(n, r) = n! / (n − r)!   → n cheezon se r chun kar order mein

Example: 5 alag books mein se 2 shelf pe rakhne
P(5, 2) = 5! / 3! = 5 × 4 = 20 tarike

Poora arrange: n! = n × (n−1) × ... × 1
5 books → 5! = 120     (0! = 1 by definition)

Repetition allowed ho toh: n^r
4-digit number, digits repeat = 10^4 = 10000
P ya C kaise decide? Order matter karta hai (pehla captain vs doosra captain, lock ka code 123 vs 321) → permutation. Sirf group chahiye (team, committee) → combination. Question ka ek bhi word ("arrange" vs "select") decide kar deta hai.

Combinations — sirf selection

Combination mein order matter nahi — sirf kaun-kaun chahiye:

COMBINATION = selection, order nahi

C(n, r) = n! / (r! × (n − r)!)  = nCr

Example: 15 khiladiyon mein se 11 ki team (order nahi)
C(15, 11) = C(15, 4) = 1365 tarike
[ C(n, r) = C(n, n−r) — chhota side aasaan ]

Worked: C(5, 2) = 5! / (2! × 3!) = 120 / (2 × 6) = 10

Team chunna = combination
11 khiladiyon ka batting order = permutation = 11!

Ye do line sabse important hain: team = C, batting order = P. Aur identity C(n,r) = C(n,n−r) se calculation aksar chhoti ho jaati hai — 11 ki jagah 4 count karo.

Special cases — circular, repeated letters, division

CIRCULAR arrangement: (n − 1)!  (round table — rotation same)
  6 log round table = 5! = 120

REPEATED letters: n! / (f1! × f2! × ...)
  MISSISSIPPI = 11! / (4! 4! 2!) = 34650
  (M=1, I=4, S=4, P=2 — repeat wale sab factor mein)

DIVISION principle: jab double counting ho, utna divide karo

Identities (yaad rakho):
  C(n, r) = C(n, n − r)
  P(n, r) = C(n, r) × r!
  n! = n × (n − 1)!
  Σ k (1 se n) = n(n + 1)/2

Exercise

Question: C(5, 2) kitna hai? Sirf number daalo.

Question: P(5, 2) kitna hai? Sirf number daalo.

Question: 5 alag books kitne tarike se shelf pe arrange hongi? Sirf number daalo.

Common mistakes

Desi example: Shaadi ki duty aur dance team

Shaadi mein 15 mehmaan hain. Unme se 4 ko sweets-distribution duty chahiye, aur alag se 11 ki dance team banna hai — dono alag formula maangte hain:

text
4 duty chunna (order nahi) = C(15, 4) = 1365
11 ki dance team (order nahi) = C(15, 11) = 1365
Agar duties alag-alag hon (duty1,2,3,4) = P(15,4) = 32760
Order matters? → P. Sirf group? → C.
Exam mapping (Aptitude / GATE / CUET)
  • TCS NQT/aptitude: permutation-combination se 3-5Q fixed.
  • GATE: counting + circular arrangement + identities.
  • CUET: C(n,r) ki identity aur formula direct.
  • Trap: "arrange 5 books" mein C laga dena — arrangement ka matlab hamesha P hota hai.
Lesson complete?

Counting formulas ready. Agla lesson — Pigeonhole Principle — chhota sa principle jo bade bade guaranteed questions 1 line mein solve kar deta hai.

Popular courses: Data Science Course in Lucknow · AI Course in Lucknow · Python Course in Lucknow · Power BI Course · Data Analytics Course