# NCERT Solutions for Class 11 Maths Chapter 7

NCERT Solutions for Class 11 Maths Chapter 7 Permutations and Combinations (क्रमचय और संचय) Exercise 7.1, Exercise 7.2, Exercise 7.3, Exercise 7.4 and Miscellaneous download in PDF free for 2020-21.

NCERT Solutions Offline Apps 2020-21 now updated for new academic session 2020-21. These solutions are applicable for all students of UP Board, CBSE Board and all other boards who are following CBSE Syllabus 2020-2021.## NCERT Solutions for Class 11 Maths Chapter 7

Class: | 11 |

Subject: | Maths |

Chapter 7: | Permutations and Combinations |

### 11th Maths Chapter 7 Solutions

NCERT Solutions for Class 11 Maths Chapter 7 Permutations and Combinations all exercises including miscellaneous are given below for new academic session 2020-21. These NCERT solutions 2020-21 are for CBSE, Uttarakhand Board, Bihar Board, UP Board, MP Board, Gujrat Board and other state board’s students, who are following NCERT Books 2020-21 for their school exams 2020-21. Students can do directly class 12 without appearing in 11th through NIOS Online Admission. It is equally valuable as the other boards.

### 11th Maths Chapter 7 Solutions in English Medium

### 11th Maths Chapter 7 Solutions in PDF

##### What is meant by Permutation?

Permutation: A permutation is an arrangement of a number of objects in a definite order taken some or all at a time.

##### What is meant by Combination?

Combination: Each of the different selections made by choosing some or all of a number of objects, without considering their order is called a combination. The number of combination of n objects taken r at a time where 0 ≤ r ≤ n, is denoted by nCr or C(n, r).

#### Terms on Permutations & Combinations

1. Multiplication Principle (Fundamental Principle of Counting): If an event can occur in m different ways, following which another event can occur in n different ways, then the total no. of different ways of occurrence of the two events in order is m × n.

2. Factorial: Factorial of a natural number n, denoted by n! or n is the continued product of first n natural numbers. n! = n × (n – 1) × (n – 2) × … × 3 × 2 × 1 or equal to n × ((n – 1)!) or equal to n × (n – 1) × ((n – 2)!)

3. Fundamental Principle of Addition: If there are two events such that they can occur independently in m and n different ways respectively, then either of the two events can occur in (m + n) ways.

4. The number of permutation of n different objects taken r at a time where 0 ≤ r ≤ n and the objects do not repeat is denoted by nPr or P(n, r).

##### Feedback & Suggestions

We have updated NCERT Solutions 2020-21 as per suggestions received by users. Hindi Medium solutions for class 11 Maths will be uploaded for academic session 2020-21 free to download. Please provide us feedback so that we can make Tiwari Academy more user friendly.

Download NCERT Books and Offline Apps 2020-21 based on new CBSE Syllabus. Ask your doubts related to NIOS or CBSE Board and share your knowledge with your friends and other users through Discussion Forum.

### Important Questions on 11th Maths Chapter 7

In this case, repetition of digits is not allowed. Here, if units place is filled in first, then it can be filled by any of the given five digits. Therefore, the number of ways of filling the units place of the three-digit number is 5.

Then, the tens place can be filled with any of the remaining four digits and the hundreds place can be filled with any of the remaining three digits.

Hence, by the multiplication principle, the number of ways in which three-digit numbers can be formed without repeating the given digits is 5 × 4 × 3 = 60

Therefore, by multiplication principle, the required number of three digit even numbers is 3 × 6 × 6 = 108

There will be as many flags as there are ways of filling in 2 vacant places _ _ in succession by the given 5 flags of different colours.

The upper vacant place can be filled in 5 different ways by any one of the 5 flags following which, the lower vacant place can be filled in 4 different ways by any one of the remaining 4 different flags.

Thus, by multiplication principle, the number of different signals that can be generated is 5 × 4 = 20

∴ 3! + 4! = 6 + 24 = 30

But 7! = 1 × 2 × 3 × 4 × 5 × 6 × 7 = 5040

Hence, 3! + 4! ≠ 7!

Therefore, the number of words that can be formed using all the letters of the word EQUATION, using each letter exactly once, is the number of permutations of 8 different objects taken 8 at a time,

Which is P (8, 8) =8! .

Hence, required number of words that can be formed = 8! = 40320

Since all the vowels and consonants have to occur together, both (AEIOU) and (QTN) can be assumed as single objects. Then, the permutations of these 2 objects taken all at a time are counted.

This number would be P(2, 2)=2!

Corresponding to each of these permutations, there are 5! permutations of the five vowels taken all at a time and 3! permutations of the 3 consonants taken all at a time.

Hence, by multiplication principle, required number of words = 2! × 5! × 3! = 1440

The 5 men can be seated in 5! ways.

The 4 women can be seated only at the cross marked places (so that women occupy the even places).

M×M×M×M×M

Therefore, the women can be seated in 4! ways.

Hence, possible number of arrangements = 4! × 5! = 24 × 120 = 2880