Permutations and Combinations | Class 11 Mathematics Chapter 6 Notes

Interactive Visual Walkthrough

Permutations & Combinations 5 animated scenes mein - AND/OR ka stage machine, ORDER ka faisala (P vs C live counter), factorial cancel trick (strike-through!), restriction lab (BUNDLE vs GAP method step-by-step), aur pattern quiz.

Full screen mein kholo →

Home / Class 11 / Mathematics / Chapter 6

Permutations and Combinations

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

Counting ka superpower — nPr, nCr aur problem patterns

JEE Weightage: HIGH Video: 58 sec Long + Short notes Hindi • English • Hinglish

Concept Shorts — JEE Advanced

MISSISSIPPI Arrangements Repeated Letters - Permutations JEE Advanced

GOL TABLE Permutation: (n-1)! aur NECKLACE ka HALF

VOWELS Saath? BLOCK Trick

Long Notes — Full Explanation

Concept pakka karne ke liye — aaram se padho

Notes language:

1️⃣ Counting Principles — Bina Gine Ginna ⭐

  • Fundamental principle of counting (multiplication) ⭐: ek kaam m ways me, doosra n ways me → DONO saath m × n ways me. (3 shirts × 4 pants = 12 outfits!)
  • Extension: teen cheezein? m × n × p. Passwords, number plates, phone numbers — sab isi se count hote hain.
  • Addition principle ⭐: ek kaam m ways me YA doosra n ways me (dono SAATH nahi) → m + n ways. OR = add, AND = multiply!
  • Example: 4 seater car me 4 log baithne ke ways = 4 × 3 × 2 × 1 = 24 (har seat pe ek-ek choice kam hoti gayi).
  • With/without repetition distinction ⭐: digits repeat allowed → har place pe same choices (10 × 10 × 10); repeat not allowed → choices ghat-ti hain (10 × 9 × 8).

💡 Feel: har "stage" pe kitne options? Multiply karte jao. Stages alag-alag cases hain (ya to ye, ya wo) to add!

2️⃣ Factorial — n! Ka Power

  • n! (n factorial) ⭐: n! = n × (n−1) × (n−2) × ... × 3 × 2 × 1. 5! = 120, 6! = 720.
  • 0! = 1 — definition se! (Ek object ko arrange karne ka ek hi tareeka.) ⭐
  • Key identity: n! = n × (n−1)! — factorial ko chhota tod sakte ho: 7! = 7 × 6!.
  • Simplification trick ⭐: fractions me factorials cancel karo: 8!/5! = 8×7×6 = 336 (5! upar-neeche kat gaya!). Kabhi poora compute mat karo — pehle cancel!
  • (n+1)! = (n+1)n!; n!(n+1) = (n+1)! — rearrangements me kaam aata hai.
  • 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, 6! = 720, 7! = 5040 — ye saat yaad rakho, kaafi hain!

💡 n! = n cheezon ko LINE me lagane ke tareeke. Isliye counting ke har formula me factorial ghoomta hai!

3️⃣ Permutations — Jab ORDER Matter Kare ⭐

  • Permutation: arrangement — order IMPORTANT hai (ABC aur BCA alag-alag!).
  • nPr formula ⭐⭐: n distinct objects me se r ko arrange karne ke ways = ⁿP_r = n!/(n−r)!.
  • Full arrangement: n ko n positions pe: ⁿP_n = n!.
  • Example: 5 books me se 3 ko shelf pe arrange: ⁵P₃ = 5!/2! = 60.
  • With repetition ⭐: n objects, r positions, repetition allowed → n^r (3-digit codes from 5 digits = 5³ = 125).
  • Repeating objects wale arrangements ⭐: n objects me p ek jaise, q doosre jaise → n!/(p! q!). ALLAHABAD (10 letters, 4 A, 2 L) = 10!/(4! 2!) = 75600.
  • Circular permutation: n ko circle me arrange: (n−1)! (ek ko fix kar do — circle ghoom sakta hai!).

🎯 Order matter kare (arrangement, rank, position, seat) → Permutation. Code words: "arrange", "order", "rank", "signals", "numbers banane".

4️⃣ Combinations — Jab Sirf SELECTION Matter Kare ⭐

  • Combination: selection — order IRRELEVANT ({A, B, C} aur {B, C, A} SAME team!).
  • nCr formula ⭐⭐: n distinct me se r select karne ke ways = ⁿC_r = n!/(r!(n−r)!).
  • Connection: ⁿP_r = ⁿC_r × r! — pehle select karo (ⁿC_r), phir arrange (r!). Isliye combination chhota hota hai!
  • Key properties ⭐: ⁿC_r = ⁿC_(n−r) (10 me se 3 chunna = 7 chhodna!); ⁿC_0 = ⁿC_n = 1; ⁿC_1 = n; ⁿC_r + ⁿC_(r−1) = ⁿ⁺¹C_r (Pascal rule!).
  • Example: 11 players me se team of 5? Sirf selection → ¹¹C₅ = 462. Captain bhi decide? ¹¹C₅ × 5 (ya pehle captain 11 ways × ¹⁰C₄).
  • Total subsets connection: ⁿC_0 + ⁿC_1 + ... + ⁿC_n = 2ⁿ (saare possible selections!).

💡 Team, committee, group, selection, hand of cards → Combination. Order ka zikr nahi = order matter nahi karta!

5️⃣ Problem-Solving Strategy — P&C Ke Patterns

  • Pehla sawal ⭐: "Order matter karta hai?" HAAN → permutation, NAHI → combination. Ye ek sawal 80% decide kar deta hai.
  • Restriction problems (together/not together) ⭐: saath rakhna ho to BUNDLE banao (ek object samjho), phir arrange; saath na ho to total − together (complementary counting!).
  • Gap method ⭐: "koi do vowels saath na ho" → pehle consonants arrange, phir gaps me vowels place karo (_C_C_C_ ke gaps!).
  • Committee with conditions: "at least 2 women" → cases banao (2W+3M, 3W+2M, 4W+1M) aur ADD karo (OR = add!).
  • Complementary counting ⭐: "at least one" → total − none. Kabhi-kabhi ulta sochna 10x easy hai!
  • Distribution: identical objects alag boxes me vs distinct objects — type pehchano pehle, formula baad me.

💡 P&C me formula yaad karna nahi, PATTERN pehchanna sikhna hai: together? bundle. Not together? gaps. At least? complement ya cases. Bas!

1️⃣ गणना सिद्धांत — बिना गिने गिनना ⭐

  • गणना का मूल सिद्धांत (गुणन) ⭐: एक कार्य m तरीकों से, दूसरा n से → दोनों साथ m × n तरीकों से। (3 शर्ट × 4 पैंट = 12!)
  • विस्तार: तीन चीजें? m × n × p।
  • योग सिद्धांत ⭐: एक कार्य m से या दूसरा n से (साथ नहीं) → m + n। OR = जोड़, AND = गुणा!
  • उदाहरण: 4 लोगों के 4 सीटों पर बैठने के तरीके = 4 × 3 × 2 × 1 = 24।
  • पुनरावृत्ति ⭐: अनुमति हो → हर स्थान पर समान विकल्प (10 × 10); न हो → विकल्प घटते हैं (10 × 9)।

💡 हर "चरण" पर कितने विकल्प? गुणा करते जाओ। अलग-अलग स्थितियां (या) → जोड़!

2️⃣ क्रमगुणित — n! की शक्ति

  • n! ⭐: n! = n × (n−1) × ... × 3 × 2 × 1। 5! = 120।
  • 0! = 1 — परिभाषा से! ⭐
  • मुख्य सर्वसमिका: n! = n × (n−1)! — 7! = 7 × 6!।
  • सरलीकरण ⭐: भिन्नों में काटो: 8!/5! = 8×7×6 = 336। पहले काटो, बाद में गणना!
  • याद रखो: 1!=1, 2!=2, 3!=6, 4!=24, 5!=120, 6!=720, 7!=5040।

💡 n! = n वस्तुओं को पंक्ति में लगाने के तरीके।

3️⃣ क्रमचय — जब क्रम महत्वपूर्ण हो ⭐

  • क्रमचय (permutation): विन्यास — क्रम महत्वपूर्ण (ABC और BCA अलग!)।
  • ⁿP_r सूत्र ⭐⭐: n भिन्न वस्तुओं में से r को व्यवस्थित करने के तरीके = ⁿP_r = n!/(n−r)!।
  • पूर्ण विन्यास: ⁿP_n = n!।
  • उदाहरण: 5 पुस्तकों में से 3 शेल्फ पर: ⁵P₃ = 5!/2! = 60।
  • पुनरावृत्ति सहित ⭐: n^r।
  • दोहराई वस्तुएं ⭐: n!/(p! q!) — ALLAHABAD = 10!/(4! 2!) = 75600।
  • वृत्तीय क्रमचय: (n−1)! (एक को स्थिर करो!)।

🎯 क्रम महत्वपूर्ण → क्रमचय। संकेत शब्द: "व्यवस्थित", "क्रम", "रैंक"।

4️⃣ संचय — जब केवल चयन महत्वपूर्ण हो ⭐

  • संचय (combination): चयन — क्रम अप्रासंगिक ({A,B,C} = {B,C,A}!)।
  • ⁿC_r सूत्र ⭐⭐: ⁿC_r = n!/(r!(n−r)!)।
  • संबंध: ⁿP_r = ⁿC_r × r! — पहले चुनो, फिर व्यवस्थित करो!
  • गुण ⭐: ⁿC_r = ⁿC_(n−r); ⁿC_0 = ⁿC_n = 1; ⁿC_1 = n; ⁿC_r + ⁿC_(r−1) = ⁿ⁺¹C_r (पास्कल नियम!)।
  • उदाहरण: 11 खिलाड़ियों में से 5 की टीम? ¹¹C₅ = 462।
  • कुल उपसमुच्चय: ⁿC_0 + ... + ⁿC_n = 2ⁿ।

💡 टीम, समिति, चयन → संचय। क्रम का जिक्र नहीं = क्रम अमहत्वपूर्ण!

5️⃣ समस्या-समाधान रणनीति — P&C के पैटर्न

  • पहला प्रश्न ⭐: "क्रम महत्वपूर्ण?" हां → क्रमचय, नहीं → संचय।
  • प्रतिबंध प्रश्न ⭐: साथ रखना हो → बंडल बनाओ; साथ न हो → कुल − साथ (पूरक गणना!)।
  • रिक्ति विधि ⭐: "कोई दो स्वर साथ न हों" → पहले व्यंजन व्यवस्थित करो, फिर रिक्तियों में स्वर।
  • शर्त सहित समिति: "कम से कम 2 महिलाएं" → स्थितियां बनाओ और जोड़ो।
  • पूरक गणना ⭐: "कम से कम एक" → कुल − कोई नहीं।

💡 P&C में पैटर्न पहचानो: साथ? बंडल। साथ नहीं? रिक्तियां। कम से कम? पूरक या स्थितियां।

1️⃣ Counting Principles — Counting Without Counting ⭐

  • Fundamental principle of counting (multiplication) ⭐: if one job can be done m ways and another n ways, then BOTH together can be done m × n ways. (3 shirts × 4 pants = 12 outfits!)
  • Extension: three things? m × n × p. Passwords, number plates, phone numbers — all counted this way.
  • Addition principle ⭐: one job in m ways OR another in n ways (not both together) → m + n ways. OR = add, AND = multiply!
  • Example: 4 people sitting in 4 seats = 4 × 3 × 2 × 1 = 24 (each seat has one fewer choice).
  • Repetition distinction ⭐: repeats allowed → same choices each place (10 × 10 × 10); not allowed → shrinking choices (10 × 9 × 8).

💡 Feel: how many options at each "stage"? Keep multiplying. Separate cases (either this or that)? Add!

2️⃣ Factorial — The Power of n!

  • n! (n factorial) ⭐: n! = n × (n−1) × (n−2) × ... × 3 × 2 × 1. 5! = 120, 6! = 720.
  • 0! = 1 — by definition! (One object can be arranged in exactly one way.) ⭐
  • Key identity: n! = n × (n−1)! — break factorials down: 7! = 7 × 6!.
  • Simplification trick ⭐: cancel factorials in fractions: 8!/5! = 8×7×6 = 336 (the 5! cancels!). Never compute fully — cancel first!
  • Learn these: 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, 6! = 720, 7! = 5040 — these seven cover most problems!

💡 n! = the number of ways to line up n things. That is why factorials show up in every counting formula!

3️⃣ Permutations — When ORDER Matters ⭐

  • Permutation: an arrangement — order is IMPORTANT (ABC and BCA are different!).
  • nPr formula ⭐⭐: arranging r out of n distinct objects = ⁿP_r = n!/(n−r)!.
  • Full arrangement: n objects in n positions: ⁿP_n = n!.
  • Example: arrange 3 of 5 books on a shelf: ⁵P₃ = 5!/2! = 60.
  • With repetition ⭐: n objects, r positions, repetition allowed → n^r (3-digit codes from 5 digits = 5³ = 125).
  • Arrangements with repeating objects ⭐: n objects with p alike and q alike → n!/(p! q!). ALLAHABAD (10 letters, 4 A's, 2 L's) = 10!/(4! 2!) = 75600.
  • Circular permutation: arranging n around a circle: (n−1)! (fix one — the circle can rotate!).

🎯 Order matters (arrangement, rank, position, seat) → Permutation. Code words: "arrange", "order", "rank", "signals", "forming numbers".

4️⃣ Combinations — When Only SELECTION Matters ⭐

  • Combination: a selection — order is IRRELEVANT ({A, B, C} and {B, C, A} are the SAME team!).
  • nCr formula ⭐⭐: selecting r out of n distinct objects = ⁿC_r = n!/(r!(n−r)!).
  • The connection: ⁿP_r = ⁿC_r × r! — first select (ⁿC_r), then arrange (r!). That is why combinations are smaller!
  • Key properties ⭐: ⁿC_r = ⁿC_(n−r) (choosing 3 of 10 = leaving out 7!); ⁿC_0 = ⁿC_n = 1; ⁿC_1 = n; ⁿC_r + ⁿC_(r−1) = ⁿ⁺¹C_r (Pascal's rule!).
  • Example: a team of 5 from 11 players? Selection only → ¹¹C₅ = 462. Captain too? ¹¹C₅ × 5 (or 11 ways for captain × ¹⁰C₄).
  • Total subsets connection: ⁿC_0 + ⁿC_1 + ... + ⁿC_n = 2ⁿ (all possible selections!).

💡 Team, committee, group, selection, hand of cards → Combination. No mention of order = order does not matter!

5️⃣ Problem-Solving Strategy — The Patterns of P&C

  • The first question ⭐: "Does order matter?" YES → permutation, NO → combination. This one question decides 80% of the problem.
  • Restriction problems (together/apart) ⭐: must stay together → make a BUNDLE (treat as one object), then arrange; must not be together → total − together (complementary counting!).
  • Gap method ⭐: "no two vowels together" → arrange the consonants first, then place vowels in the gaps (_C_C_C_ gaps!).
  • Committee with conditions: "at least 2 women" → make cases (2W+3M, 3W+2M, 4W+1M) and ADD them (OR = add!).
  • Complementary counting ⭐: "at least one" → total − none. Sometimes thinking backwards is 10x easier!
  • Distribution: identical objects into boxes vs distinct objects — identify the type first, formula second.

💡 In P&C you do not memorize formulas, you learn to recognize PATTERNS: together? bundle. Apart? gaps. At least? complement or cases. Done!

Short Notes — Quick Revision

Exam se pehle sirf yeh dohrao

Notes language:

Counting ⭐

  • AND (saath) = multiply
  • OR (cases) = add
  • Repeat allowed: n^r

Factorial

  • n! = n×(n−1)×...×1
  • 0! = 1
  • Cancel pehle, compute baad me

Permutation ⭐⭐

  • ⁿP_r = n!/(n−r)!
  • Order matter kare = P
  • Repeats: n!/(p!q!)

Combination ⭐⭐

  • ⁿC_r = n!/(r!(n−r)!)
  • Selection only = C
  • ⁿC_r = ⁿC_(n−r)

Patterns ⭐

  • Together → bundle
  • Not together → gaps/complement
  • At least → cases ya total−none

गणना ⭐

  • AND = गुणा
  • OR = जोड़
  • पुनरावृत्ति: n^r

क्रमगुणित

  • n! = n×...×1
  • 0! = 1
  • पहले काटो

क्रमचय ⭐⭐

  • ⁿP_r = n!/(n−r)!
  • क्रम महत्वपूर्ण = P
  • दोहराव: n!/(p!q!)

संचय ⭐⭐

  • ⁿC_r = n!/(r!(n−r)!)
  • केवल चयन = C
  • ⁿC_r = ⁿC_(n−r)

पैटर्न ⭐

  • साथ → बंडल
  • साथ नहीं → रिक्तियां
  • कम से कम → स्थितियां/पूरक

Counting ⭐

  • AND (together) = multiply
  • OR (cases) = add
  • Repeats allowed: n^r

Factorial

  • n! = n×(n−1)×...×1
  • 0! = 1
  • Cancel first, compute later

Permutation ⭐⭐

  • ⁿP_r = n!/(n−r)!
  • Order matters = P
  • Repeats: n!/(p!q!)

Combination ⭐⭐

  • ⁿC_r = n!/(r!(n−r)!)
  • Selection only = C
  • ⁿC_r = ⁿC_(n−r)

Patterns ⭐

  • Together → bundle
  • Apart → gaps/complement
  • At least → cases or total−none

JEE Practice — 10 Questions

Pehle khud solve karo, phir answer dekho.

Q1 3 shirts aur 5 pants se kitne outfits?
Answer dekho

AND = multiply → 3 × 5 = 15.

Q2 7!/4! simplify karo.
Answer dekho

7×6×5×4!/4! = 7×6×5 = 210 (cancel pehle!).

Q3 5 log kitne tareeke se line me khade ho sakte hain?
Answer dekho

5! = 120 (order matter karta hai — permutation).

Q4 8 players me se 3 ko arrange karna hai (1st, 2nd, 3rd position).
Answer dekho

Order matter → ⁸P₃ = 8!/5! = 8×7×6 = 336.

Q5 10 students me se 4 ki committee?
Answer dekho

Sirf selection → ¹⁰C₄ = 10!/(4!6!) = 210.

Q6 ⁿC_r = ⁿC_(n−r) kyun?
Answer dekho

r chunna = n−r CHHODNA — dono ek hi kaam! (10 me se 3 chunna = 7 chhodna.)

Q7 BANANA ke letters kitne tareeke se arrange honge?
Answer dekho

6 letters, 3 A's, 2 N's → 6!/(3!2!) = 720/12 = 60.

Q8 5 friends ko round table pe arrange karna hai.
Answer dekho

Circular → (5−1)! = 4! = 24.

Q9 'APPLE' me kitne arrangements me dono P saath rahenge?
Answer dekho

PP ko bundle banao → 4 objects (PP, A, L, E) → 4! = 24.

Q10 8 me se 3 select karna hai, lekin Ramesh PAKKA ho. Kitne ways?
Answer dekho

Ramesh fixed → baaki 7 me se 2 chuno → ⁷C₂ = 21.

Agla chapter: Binomial Theorem — notes ready hain.

Comments

Popular posts from this blog

Chemical Bonding and Molecular Structure | Class 11 Chemistry Chapter 4 Notes

Motion in a Straight Line | Class 11 Physics Chapter 2 Notes

Straight Lines | Class 11 Mathematics Chapter 9 Notes