Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है
SubjectsMathematics
सूत्रों की व्युत्पत्तियाँ और उनके पारस्परिक संबंध
In Class 11 Mathematics, this topic explains how the formulas in Permutations and Combinations are derived and how they are connected. Students learn the meaning of factorial notation, develop the formulas for nPr and nCr from counting principles, and understand why nPr = r! nCr and nCr = nC(n−r). The topic also shows when to use arrangements or selections, helping students apply these relationships logically instead of relying on memorized formulas.
TOPIC PRACTICE
Up to 20 questions from this page. Select your focus, then start.
After (6) boys, (7) gaps are formed, and (5) girls are arranged in them. In exams use the gap method for no two together.
There are (2) patterns for the starting gender and both groups arrange in (5!) ways. In exams do not forget the (2) patterns for equal alternate groups.
Removing circular rotations gives (7!), and divide by (2) when reflection is the same. In exams read the mirror-image condition in necklace problems.
Rotations give the same arrangements at a round table. In exams write ((n-1)!) for circular seating.
The circular arrangement of (5) couple-blocks is (4!) and each block has (2) internal orders. In exams use one less factorial for circular blocks.
Interchanging identical letters does not create a new arrangement. In exams put factorials of repeated letters in the denominator.
(S) appears three times, (T) appears three times, and (I) appears twice. In exams count letter frequencies before word arrangement.
Only (1) of the (3!) possible relative orders of those (3) books is allowed. In exams divide total by (k!) for fixed relative order.
Only one of the (3!) relative orders of these (3) people is valid. In exams handle fixed order restriction by symmetry division.
For an odd number, the last digit must be odd. In exams decide the unit-place condition first in digit problems.
The first digit cannot be (0), and the remaining two places have (6) choices. In exams handle the leading-zero restriction separately.
When repetition is allowed, a selected symbol remains available again. In exams use the power rule for independent positions.
Order matters in passwords and repetition is not allowed. In exams use permutation for ordered slots without repetition.
To form (b^r), choose (r) brackets from (n) brackets. In exams connect binomial coefficients with bracket selection.
The left side adds subsets of every size and the right side gives choose-or-not choices for each object. In exams count subset identities in two ways.
Each r-element selection has exactly one complementary group of \(n-r\) unselected elements. This one-to-one correspondence gives equal counts. Option B describes permutations, where order matters. Exam tip: identify the selected and unselected complementary sets.
Choose a subset and mark one member, or first choose the marked member and freely choose the rest. In exams treat the factor (r) as a marked choice.
First choose the marked pair, then freely choose from the remaining (n-2) objects. In exams choose marked objects first in nested combination sums.
When choosing (r) objects from two groups, (k) objects are taken from the first group. In exams identify Vandermonde in two-group selection.
Choosing (a) objects first and then (b) from the remaining objects is like labelled grouping. In exams convert sequential selections into factorial division.
QUIZ COMPLETE
