5 animated scenes - counting ka stage machine, ORDER ka faisala (P vs C), factorial cancel trick, restriction patterns (bundle vs gaps), aur quiz.
Ek kaam STAGES me hota hai (pehle ye, PHIR wo) → choices MULTIPLY. Alag-alag CASES hain (YA TO ye, YA wo) → ADD. Teen stages ke options badlo aur grid dekho - har cell ek possible outcome hai!
P&C ka 80% sawaal isi EK question pe tikka hai: order matter karta hai? HAAN → Permutation (arrange), NAHI → Combination (select). Same objects dono mode me dekho - selection ke baad arrangement kitne extra tareeke deta hai!
ⁿP_r = n!/(n−r)! me neeche wala factorial upar ke tail se CANCEL ho jaata hai. n aur r badlo - strike-through dekho, sirf bache hue terms multiply karo. 8!/5! = 8×7×6 = 336 - bas!
4 consonants (B,C,D,F) + 3 vowels (A,E,I) arrange karne hain. Vowels SAATH rakhne hain? Bundle banao. Koi 2 vowels SAATH nahi? Consonants pehle, vowels GAPS me! Step dabao aur dono strategy dekho:
5 sawaal. Pehla question hamesha: order matter karta hai?
AND (stages saath) → MULTIPLY: m × n × p | OR (cases alag) → ADD: m + n | repetition allowed → har stage pe same choices (n^r) | repeat NAHI → choices ghat-ti hain (n × (n−1) × ...)
n! = n × (n−1) × ... × 2 × 1 | 0! = 1 | cancel trick: 8!/5! = 8×7×6 = 336 | yaad rakho: 1!,2!,6,24,120,720,5040 (1! se 7!)
ⁿP_r = n!/(n−r)! | full line: n! | repetition: n^r | repeating objects: n!/(p!q!) - ALLAHABAD = 10!/(4!2!) = 75600 | circle: (n−1)! | code words: arrange, rank, signals, numbers
ⁿC_r = n!/(r!(n−r)!) | ⁿP_r = ⁿC_r × r! | ⁿC_r = ⁿC_(n−r) | ⁿC_0 = ⁿC_n = 1 | Pascal: ⁿC_r + ⁿC_(r−1) = ⁿ⁺¹C_r | subsets total = 2ⁿ | code words: team, committee, group, hand
saath rakhna? → BUNDLE (ek object banao, andar arrange alag) | kabhi saath nahi? → GAP method (baaki pehle, gaps me daalo) ya total − saath | "at least"? → cases bana ke ADD, ya complement (total − none)
Learn With Rahul - Class 11 Maths Ch 6 Permutations and Combinations Visual Walkthrough