PERMUTATIONS AND COMBINATIONS

📚 Complete Practice Guide: Permutations and Combinations

Permutations and Combinations is an important Class 11 Mathematics chapter for learning how to count outcomes in an organised way. Instead of writing every possible arrangement or selection, students learn formulas and principles that give the answer efficiently. The central idea is to decide whether order matters. If changing the order creates a different outcome, the problem is generally a permutation problem. If the selected group remains the same after changing the order, the problem is generally a combination problem. This worksheet turns that idea into repeated, randomized practice.

1. Fundamental Principle of Counting

Suppose a first activity can be completed in m ways and a second activity can be completed in n ways. If the choices are made successively, the number of combined outcomes is m × n. The same rule extends to several stages: multiply the number of available choices at each stage. This principle is the foundation of password, code, route, outfit and multi-stage selection questions.

2. Factorial Notation

For a positive integer n, factorial is defined by n! = n(n−1)(n−2)…3·2·1. The special value is 0! = 1. Factorials are useful because many permutation and combination expressions contain them. Students should learn to cancel common factors before multiplying large numbers. For example, 8!/6! = 8×7, which is much easier than calculating both factorials separately.

3. Permutations: When Order Matters

A permutation is an arrangement of objects where position or order is significant. The number of arrangements of r objects selected from n distinct objects is ⁿPᵣ = n!/(n−r)!. When all n distinct objects are arranged, the number is n!. Examples include assigning different students to different posts, arranging books on a shelf and creating ordered codes without repetition.

4. Combinations: When Order Does Not Matter

A combination represents a selection rather than an ordered arrangement. The formula is ⁿCᵣ = n!/[r!(n−r)!]. Selecting a committee, choosing a team or picking a group of questions normally uses combinations. A powerful relationship is ⁿPᵣ = r! × ⁿCᵣ. Before applying a formula, ask whether swapping two selected objects changes the result.

5. Important Properties of nCr

Several identities make calculations quicker: ⁿC₀ = ⁿCₙ = 1, ⁿCᵣ = ⁿCₙ₋ᵣ, and ⁿCᵣ + ⁿCᵣ₋₁ = ⁿ⁺¹Cᵣ. The symmetry property is especially useful when r is large. Instead of evaluating a combination with a large lower number, replace r by n−r whenever that is smaller.

6. Arrangements with Restrictions

Restriction questions require extra care. Words such as together, not together, fixed position, first, last, at least and exactly change the counting process. If a set of objects must stay together, the block method can be used: treat the required group as one unit and arrange that unit with the remaining objects. For “not together” conditions, the complement method can often simplify the work: total arrangements minus arrangements in which the objects are together.

7. Repeated Objects

When identical objects occur, simply using n! counts arrangements more than once. If n objects contain repeated groups of p, q and r identical objects, the number of distinct arrangements is n!/(p!q!r!). This formula is commonly applied to arrangements of letters in words. The denominator removes the duplicate arrangements created by swapping identical objects.

8. Circular Permutations

For n distinct objects arranged around a circle, rotations are normally considered identical. Therefore the standard number of circular arrangements is (n−1)!. A useful way to understand this is to fix one object and arrange the remaining n−1 objects around it. Always read the question carefully because special conditions can change the method.

9. Selection and Committee Problems

Committee and team problems are usually combinations because the order of chosen members is irrelevant. If a committee must contain specified numbers from different groups, count each independent selection and multiply. For “at least one” conditions, complementary counting is often efficient: calculate all possible selections and subtract the selections that contain none of the required type.

10. Mixed Applications

Real examination questions may combine two or more ideas. A problem may first ask students to select people and then assign them to posts, in which case a combination may be followed by a permutation. Another problem may involve a restriction and repeated objects together. Break the question into stages, decide whether each stage is an arrangement or selection, and then combine the results using the counting principle.

11. Sub-parts and a Good Solving Routine

For multi-part questions, solve each sub-part separately and label the result clearly. A reliable routine is: (1) identify the objects, (2) decide whether order matters, (3) check repetition, (4) identify restrictions, (5) select the formula, (6) simplify before calculating, and (7) check whether the answer is sensible. This reduces formula-selection mistakes.

12. Common Errors to Avoid

• Using nPr for a committee when order does not matter.
• Forgetting that 0! = 1.
• Using n! for repeated letters without dividing by repeated factorials.
• Forgetting to account for a fixed or restricted position.
• Treating rotations as different in a standard circular permutation.
• Calculating huge factorials directly when cancellation is easier.
• Ignoring words such as “at least”, “exactly”, “together” or “not together”.

13. Formula Sheet

n! = n(n−1)…1   0! = 1   ⁿPᵣ = n!/(n−r)!   ⁿCᵣ = n!/[r!(n−r)!]   ⁿPᵣ = r!ⁿCᵣ   ⁿCᵣ = ⁿCₙ₋ᵣ   circular arrangements = (n−1)!   repeated objects = n!/(p!q!…).

14. How to Use This DigiSadhan Worksheet

Choose the number of questions, question mode, difficulty, timer, sound and sub-topic. Press Start New Test to generate a new set. The worksheet is parameterized and de-duplicated so repeated generation aims to produce a fresh set rather than simply copying a small fixed bank. MCQ choices are independently shuffled so the correct option is not permanently tied to one letter. Enter or select an answer and press Check Answer. The answer remains hidden until that question has been checked. Correct responses turn green, incorrect responses turn red, and optional sound and animations provide immediate feedback. When every question has been checked, the final score and percentage are shown. Use Shuffle Whole Worksheet for another fresh test, Save as PDF for a direct PDF download, or Print for a printer-friendly copy.

Study tip: do one short timed test first, review every mistake, then repeat the same sub-topic at a higher difficulty. Regular practice with both nPr and nCr questions helps students recognise the difference between arrangement and selection quickly.