Permutations and Combinations – NCERT Class 11 Mathematics Chapter 6 – Counting Principles, Problems, and Application Scenarios

Discusses the fundamental principle of counting, meaning and types of permutations and combinations, their formulas, properties, differences, solved examples, word problems, circular permutations, and real-life applications.

Updated: 22 seconds ago

Categories: NCERT, Class XI, Mathematics, Permutations, Combinations, Counting Principles, Chapter 6
Tags: Permutations, Combinations, Counting Principles, Factorial, Circular Permutations, Word Problems, Application, Formula, NCERT Class 11, Mathematics, Chapter 6
Post Thumbnail
Permutations and Combinations: Class 11 NCERT Chapter 6 - Ultimate Study Guide, Notes, Questions, Quiz 2025

Permutations and Combinations

Chapter 6: Mathematics - Ultimate Study Guide | NCERT Class 11 Notes, Questions, Examples & Quiz 2025

Full Chapter Summary & Detailed Notes - Permutations and Combinations Class 11 NCERT

Overview & Key Concepts

  • Chapter Goal: Counting techniques for arrangements (permutations) and selections (combinations); fundamental principle, factorial, nPr, nCr. Exam Focus: Arrangements without repetition, signals, codes. 2025 Updates: Emphasis on distinct vs. identical objects, binomial coefficients. Fun Fact: Bernoulli's work; applications in probability. Core Idea: Multiplication rule for sequential choices. Real-World: Codes, seating, lotteries. Ties: Builds on sets; leads to probability. Expanded: Examples from PDF, factorial table, permutation diagrams.
  • Wider Scope: Systematic counting without listing.
  • Expanded Content: Permutations with/without repetition, identical objects, combinations intro.

6.1 Introduction

Suitcase lock example: 9P3 sequences after first digit 7. Introduces need for efficient counting.

6.2 Fundamental Principle of Counting

  • Multiplication Rule: If m ways for event A, n for B, total m×n. General: m×n×p for three.
  • Examples: Mohan: 3 pants × 2 shirts = 6. Sabnam: 2 bags × 3 tiffins × 2 bottles = 12.

Box 1: Visual Tree Diagram (Pants-Shirts)

Tree: P1→S1/S2, P2→S1/S2, P3→S1/S2 (6 branches).

6.3 Permutations

  • Definition: Arrangements where order matters. Ex: ROSE words: 4! = 24.
  • Distinct Objects: \( ^nP_r = \frac{n!}{(n-r)!} \), 0 ≤ r ≤ n.
  • With Repetition: \( n^r \).
  • Factorial: n! = 1×2×...×n, 0! = 1.
  • Identical Objects: \( \frac{n!}{n_1! n_2! \dots} \). Ex: ROOT: 4!/2! = 12.

Box 2: Factorial Table

nn!Example
01Empty arrangement
11Single
36ABC: 6 perms
424ROSE: 24
5120Flags: 120

Simple Way: n! = n × (n-1)!.

Summary

  • Principle: Multiply choices. Perms: Order matters, use factorial. Combos: Later, order doesn't.
  • Applications: Codes, arrangements.

Why This Guide Stands Out

Math-focused: nPr derivations, examples with trees. Free 2025 with MathJax.

Key Themes & Tips

  • Aspects: Principle, perms distinct/repeated/identical.
  • Tip: Factorial for no repetition; divide for identical.

Exam Case Studies

3-digit codes from 1-5, no repeat: 5P3=60.

Project & Group Ideas

  • Tree diagrams for seating arrangements.
  • Python code for nPr calculator.