Class 11 Maths - CBSE

Permutations and Combinations

Permutations and Combinations chapter in Class 11 Mathematics introduces students to the fundamental counting principle, which helps determine the number of ways events can occur without explicitly listing them. A permutation deals with arrangements where order matters, while a combination focuses on selections where order is irrelevant. Mastering this chapter is essential for building a strong foundation in probability and discrete mathematics. For CBSE board exams, this is a high-scoring unit with questions ranging from direct formula application to tricky word problems based on seating arrangements, word formation, and team selection.

Start Learning Free

Key Concepts

Fundamental Principle of Counting

If an event can occur in m different ways, and following it, a second event can occur in n different ways, then the two events in succession can occur in m times n ways.

Factorial Notation

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

Permutations

Each of the arrangements in a definite order that can be formed by taking some or all of a set of objects is called a permutation, where arrangement order is strictly important.

Combinations

Each of the groups or selections that can be made by taking some or all of a number of given things, without regard to the order of objects selected, is called a combination.

Circular Permutations

Arrangements of objects in a circle rather than a line, where the number of permutations of n distinct objects around a circle is given by (n - 1)!.

Important Formulas

n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1
nPr = n! / (n - r)!
nCr = n! / [r! * (n - r)!]
nCr = nCn-r
nCr + nCr-1 = n+1Cr
Circular Permutation of n distinct objects = (n - 1)!

Board Exam Info

In the CBSE Class 11 Mathematics board examinations, the chapter on Permutations and Combinations typically carries around 6 to 8 marks as part of the Algebra unit. Common question types include evaluating factorial expressions, proving combinatorial identities, solving word problems on arrangement of letters (with or without repetition), and selecting teams or geometrical figures under given conditions.

Frequently Asked Questions

How do I know whether to use permutation or combination in a word problem?

Ask yourself if the order of items matters. If rearranging the chosen items creates a new distinct outcome (like passwords or seating), use permutation. If the order does not matter and only the group matters (like selecting a team or handshakes), use combination.

What is the value of 0!?

By definition and mathematical proof involving the gamma function and recurrence relations, the value of 0 factorial (0!) is equal to 1.

Can r be greater than n in nPr or nCr?

No, r can never be greater than n because you cannot select or arrange more items than are actually available in the given set. Therefore, 0 <= r <= n.

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 - CBSE Class 11