Class 11 Maths - MAHARASHTRA

Permutations and Combinations

The chapter 'Permutations and Combinations' in Maharashtra Board Class 11 Mathematics introduces students to the fundamental counting principles that form the basis of probability and advanced counting. Permutations deal with situations where the order of arrangement matters, while combinations are used when selection is the only priority without regard to order. Mastering this chapter is crucial for board examinations as it heavily features in word problems, algebraic proofs involving factorials, and lays the groundwork for the Binomial Theorem. Scoring well in this topic requires a clear understanding of when to apply multiplication and addition principles.

Start Learning Free

Key Concepts

Fundamental Principle of Counting

If an operation can be performed in 'm' ways and another following operation in 'n' ways, the total sequence can be done in m × n ways (multiplication principle) or m + n ways (addition principle).

Factorial Notation

The product of all positive integers less than or equal to a given positive integer n, denoted by n! or n, is essential for computing permutations and combinations.

Permutations (Arrangements)

A permutation is an arrangement of a set of objects in a specific linear order. The number of permutations of 'n' distinct objects taken 'r' at a time is denoted by nPr.

Combinations (Selections)

A combination is a selection of items where the order of selection does not matter. The number of ways to choose 'r' objects from 'n' distinct objects is denoted by nCr.

Circular Permutations

Unlike linear arrangements, objects arranged in a circle have no fixed first or last position, making the number of circular arrangements of 'n' objects equal to (n-1)!.

Important Formulas

n! = n × (n-1) × (n-2) × ... × 1
nPr = n! / (n-r)!
nCr = n! / (r! * (n-r)!)
nCr = nC(n-r)
nCr + nC(r-1) = (n+1)Cr
Circular Permutation of n distinct objects = (n-1)!

Board Exam Info

In the Maharashtra State Board (MSBSHSE) Class 11 Mathematics exam, this chapter typically carries around 6 to 8 marks including options. Questions usually range from 1-mark multiple choice questions (MCQs), 2-mark direct formula applications, to 3 or 4-mark word problems based on committee formations, word arrangements, and geometrical properties.

Frequently Asked Questions

How do I know whether to use Permutation or Combination in a word problem?

Ask yourself if the order matters. If rearranging the chosen items creates a new outcome (like passwords, seating arrangements, or ranks), use Permutation. If order does not matter and only the group matters (like forming a team or selecting hands of cards), use Combination.

What is the value of 0!?

By mathematical definition and consistency with formula derivations (like nPn = n! / (n-n)! = n! / 0!), 0! is defined as equal to 1.

Why is circular permutation (n-1)! instead of n!?

In a linear arrangement, the starting point is fixed. In a circle, every arrangement can be rotated 'n' times to look the same. Therefore, we divide the total linear arrangements (n!) by 'n', resulting in (n-1)!.

Learn Permutations and Combinations with Your AI Tutor

10 different ways to study this chapter. Free for 3 chapters per day.

Lecture

Key Points

Interactive

Quiz

Flashcards

Start Learning Free

More Maths Chapters - MAHARASHTRA Class 11