## RD Sharma Solutions Class 11 Maths Chapter 17 â€“ Get Free PDF Updated for 2021-22

**RD Sharma Solutions for Class 11 Maths Chapter 17 – Combinations**Â are given here to help students prepare and score good marks in the board exams. Previously we have studied arrangements of a certain number of objects by taking some of them or all at a time. Each of the different selections made by taking some or all of a number of objects, irrespective of their arrangements, are termed a combination.

Students who wish to study by themselves and solve the exercise problems can use the RD Sharma Class 11 Maths Solutions as the reference material, which is the best resource any student can get. All the solutions are created by subject experts at BYJUâ€™S, keeping in mind the latest CBSE marking patterns. The exercise-wise **RD Sharma Solutions** of these topics are available here in PDF format, which can be easily downloaded by the students.

**Chapter 17 – Combinations** contains three exercises and the RD Sharma Solutions present in this page provide solutions to the questions present in each exercise. Now, let us have a look at the concepts discussed in this chapter.

- Combinations.
- Properties of C(n, r).
- Practical problems on combinations.
- Mixed problems on permutations and combinations.

## Download the pdf of RD Sharma Solutions for Class 11 Maths Chapter 17 – Combinations

### Access answers to RD Sharma Solutions for Class 11 Maths Chapter 17 – Combinations

EXERCISE 17.1 PAGE NO: 17.8

**1. Evaluate the following:**

**(i) ^{14}C_{3}**

**(ii) ^{12}C_{10}**

**(iii) ^{35}C_{35}**

**(iv) ^{n+1}C_{n}**

**(v) **

**Solution:**

**(i) **^{14}C_{3}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = 14 and r = 3

^{n}C_{r} = n!/r!(n – r)!

^{14}C_{3} = 14! / 3!(14 – 3)!

= 14! / (3! 11!)

= [14Ã—13Ã—12Ã—11!] / (3! 11!)

= [14Ã—13Ã—12] / (3Ã—2)

= 14Ã—13Ã—2

= 364

**(ii) **^{12}C_{10}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = 12 and r = 10

^{n}C_{r} = n!/r!(n – r)!

^{12}C_{10} = 12! / 10!(12 – 10)!

= 12! / (10! 2!)

= [12Ã—11Ã—10!] / (10! 2!)

= [12Ã—11] / (2)

= 6Ã—11

= 66

**(iii) **^{35}C_{35}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = 35 and r = 35

^{n}C_{r} = n!/r!(n – r)!

^{35}C_{35} = 35! / 35!(35 – 35)!

= 35! / (35! 0!) [Since, 0! = 1]

= 1

**(iv) **^{n+1}C_{n}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = n+1 and r = n

^{n}C_{r} = n!/r!(n – r)!

^{n+1}C_{n} = (n+1)! / n!(n+1 – n)!

= (n+1)! / n!(1!)

= (n + 1) / 1

= n + 1

**2. IfÂ ^{n}C_{12}Â =Â ^{n}C_{5}, find the value of n.**

**Solution:**

We know that if ^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{n}C_{12}Â =Â ^{n}C_{5}, we can say that

12 â‰ 5

So, the condition (ii) must be satisfied,

n = 12 + 5

n = 17

âˆ´Â The value of n is 17.

**3. IfÂ ^{n}C_{4}Â =Â ^{n}C_{6}, findÂ ^{12}C_{n}.**

**Solution:**

We know that if ^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{n}C_{4}Â =Â ^{n}C_{6}, we can say that

4 â‰ 6

So, the condition (ii) must be satisfied,

n = 4 + 6

n = 10

Now, we need to find ^{12}C_{n},

We know the value of n so, ^{12}C_{n} = ^{12}C_{10}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = 12 and r = 10

^{n}C_{r} = n!/r!(n – r)!

^{12}C_{10} = 12! / 10!(12 – 10)!

= 12! / (10! 2!)

= [12Ã—11Ã—10!] / (10! 2!)

= [12Ã—11] / (2)

= 6Ã—11

= 66

âˆ´Â The value of ^{12}C_{10} = 66.

**4. IfÂ ^{n}C_{10}Â =Â ^{n}C_{12}, findÂ ^{23}C_{n}.**

**Solution:**

We know that if ^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{n}C_{10}Â =Â ^{n}C_{12}, we can say that

10 â‰ 12

So, the condition (ii) must be satisfied,

n = 10 + 12

n = 22

Now, we need to find ^{23}C_{n},

We know the value of n so, ^{23}C_{n} = ^{23}C_{22}

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

So now, value of n = 23 and r = 22

^{n}C_{r} = n!/r!(n – r)!

^{23}C_{22 }= 23! / 22!(23 – 22)!

= 23! / (22! 1!)

= [23Ã—22!] / (22!)

= 23

âˆ´Â The value of ^{23}C_{22} = 23.

**5. IfÂ ^{24}C_{x}Â =Â ^{24}C_{2x + 3}, find x.**

**Solution:**

^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{24}C_{x}Â =Â ^{24}C_{2x + 3}, we can say that

Let us check for condition (i)

x = 2x + 3

2x â€“ x = -3

x = -3

We know that for a combinationÂ ^{n}C_{r}, râ‰¥0, r should be a positive integer which is not satisfied here,

So, the condition (ii) must be satisfied,

24 = x + 2x + 3

3x = 21

x = 21/3

x = 7

âˆ´Â The value of x is 7.

**6. IfÂ ^{18}C_{x}Â =Â ^{18}C_{x + 2}, find x.**

**Solution:**

^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{18}C_{x}Â =Â ^{18}C_{x + 2}, we can say that

x â‰ x + 2

So, the condition (ii) must be satisfied,

18 = x + x + 2

18 = 2x + 2

2x = 18 â€“ 2

2x = 16

x = 16/2

= 8

âˆ´Â The value of x is 8.

**7. IfÂ ^{15}C_{3r}Â =Â ^{15}C_{r + 3}, find r.**

**Solution:**

^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{15}C_{3r}Â =Â ^{15}C_{r + 3}, we can say that

Let us check for condition (i)

3r = r + 3

3r â€“ r = 3

2r = 3

r = 3/2

We know that for a combinationÂ ^{n}C_{r}, râ‰¥0, r should be a positive integer which is not satisfied here,

So, the condition (ii) must be satisfied,

15 = 3r + r + 3

15 – 3 = 4r

4r = 12

r = 12/4

= 3

âˆ´Â The value of r is 3.

**8. IfÂ ^{8}C_{r}Â â€“Â ^{7}C_{3}Â =Â ^{7}C_{2}, find r.**

**Solution:**

To find r, let us consider the given expression,

^{8}C_{r}Â â€“Â ^{7}C_{3}Â =Â ^{7}C_{2}

^{8}C_{r} = ^{7}C_{2} + ^{7}C_{3}

We know thatÂ ^{n}C_{r}Â +Â ^{n}C_{r + 1}Â =Â ^{n + 1}C_{r + 1}

^{8}C_{r}Â =Â ^{7 + 1}C_{2 + 1}

^{8}C_{r}Â =Â ^{8}C_{3}

Now, we know that if ^{n}C_{p}Â =Â ^{n}C_{q}, then one of the following conditions need to be satisfied:

(i) p = q

(ii) n = p + q

So from the question ^{8}C_{r}Â =Â ^{8}C_{3}, we can say that

Let us check for condition (i)

r = 3

Let us also check for condition (ii)

8 = 3 + r

r = 5

âˆ´Â The values of â€˜râ€™ are 3 and 5.

**9. IfÂ ^{15}C_{r}:Â ^{15}C_{r â€“ 1}Â = 11: 5, find r.**

**Solution:**

Given:

^{15}C_{r}:Â ^{15}C_{r â€“ 1}Â = 11: 5

^{15}C_{r} /Â ^{15}C_{r â€“ 1}Â = 11 / 5

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

5(16 – r) = 11r

80 â€“ 5r = 11r

80 = 11r + 5r

16r = 80

r = 80/16

= 5

âˆ´Â The value of r is 5.

**10. IfÂ ^{n + 2}C_{8}:Â ^{n â€“ 2}P_{4}Â = 57: 16, find n.**

**Solution:**

Given:

^{n + 2}C_{8}:Â ^{n â€“ 2}P_{4}Â = 57: 16

^{n + 2}C_{8} /Â ^{n â€“ 2}P_{4}Â = 57 / 16

Let us use the formula,

^{n}C_{r} = n!/r!(n – r)!

(n+2) (n+1) (n) (n-1) / 8! = 57/16

(n+2) (n+1) (n) (n-1) = (57Ã—8!) / 16

(n+2) (n+1) (n) (n-1) = [19Ã—3 Ã— 8Ã—7Ã—6Ã—5Ã—4Ã—3Ã—2Ã—1]/16

(n + 2) (n + 1) (n) (n â€“ 1) = 21 Ã— 20 Ã— 19 Ã— 18

Equating the corresponding terms on both sides we get,

n = 19

âˆ´Â The value of n is 19.

EXERCISE 17.2 PAGE NO: 17.15

**1. From a group of 15 cricket players, a team of 11 players is to be chosen. In how many ways can this be done?**

**Solution:**

Given:

Number of players = 15

Number of players to be selected = 11

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{15}C_{11} = 15! / 11! (15 – 11)!

= 15! / (11! 4!)

= [15Ã—14Ã—13Ã—12Ã—11!] / (11! 4!)

= [15Ã—14Ã—13Ã—12] / (4Ã—3Ã—2Ã—1)

= 15Ã—7Ã—13

= 1365

âˆ´Â The total number of ways of choosing 11 players out of 15 is 1365 ways.

**2. How many different boat parties of 8, consisting of 5 boys and 3 girls, can be made from 25 boys and 10 girls?**

**Solution:**

Given:

Total boys are = 25

Total girls are = 10

Boat party of 8 to be made from 25 boys and 10 girls, by selecting 5 boys and 3 girls.

So,

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{25}C_{5} Ã— ^{10}C_{3} = 25!/5!(25 – 5)! Ã— 10!/3!(10-3)!

= 25! / (5! 20!) Ã— 10!/(3! 7!)

= [25Ã—24Ã—23Ã—22Ã—21Ã—20!]/(5! 20!) Ã— [10Ã—9Ã—8Ã—7!]/(7! 3!)

= [25Ã—24Ã—23Ã—22Ã—21]/5! Ã— [10Ã—9Ã—8]/(3!)

= [25Ã—24Ã—23Ã—22Ã—21]/(5Ã—4Ã—3Ã—2Ã—1) Ã— [10Ã—9Ã—8]/(3Ã—2Ã—1)

= 5Ã—2Ã—23Ã—11Ã—21 Ã— 5Ã—3Ã—8

= 53130 Ã— 120

= 6375600

âˆ´Â The total number of different boat parties is 6375600 ways.

**3. In how many ways can a student choose 5 courses out of 9 courses if 2 courses are compulsory for every student?**

**Solution:**

Given:

Total number of courses is 9

So out of 9 courses 2 courses are compulsory. Student can choose from 7(i.e., 5+2) courses only.

That too out of 5 courses student has to choose, 2 courses are compulsory.

So they have to choose 3 courses out of 7 courses.

This can be done in ^{7}C_{3} ways.

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{7}C_{3} = 7! / 3! (7 – 3)!

= 7! / (3! 4!)

= [7Ã—6Ã—5Ã—4!] / (3! 4!)

= [7Ã—6Ã—5] / (3Ã—2Ã—1)

= 7Ã—5

= 35

âˆ´Â The total number of ways of choosing 5 subjects out of 9 subjects in which 2 are compulsory is 35 ways.

**4. In how many ways can a football team of 11 players be selected from 16 players? How many of these will (i) Include 2 particular players? (ii) Exclude 2 particular players?**

**Solution:**

Given:

Total number of players = 16

Number of players to be selected = 11

So, the combination is ^{16}C_{11}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{16}C_{11} = 16! / 11! (16 – 11)!

= 16! / (11! 5!)

= [16Ã—15Ã—14Ã—13Ã—12Ã—11!] / (11! 5!)

= [16Ã—15Ã—14Ã—13Ã—12] / (5Ã—4Ã—3Ã—2Ã—1)

= 4Ã—7Ã—13Ã—12

= 4368

(i) Include 2 particular players?

It is told that two players are always included.

Now, we have to select 9 players out of the remaining 14 players as 2 players are already selected.

Number of ways = ^{14}C_{9}

^{14}C_{9} = 14! / 9! (14 – 9)!

= 14! / (9! 5!)

= [14Ã—13Ã—12Ã—11Ã—10Ã—9!] / (9! 5!)

= [14Ã—13Ã—12Ã—11Ã—10] / (5Ã—4Ã—3Ã—2Ã—1)

= 7Ã—13Ã—11Ã—2

= 2002

(ii) Exclude 2 particular players?

It is told that two players are always excluded.

Now, we have to select 11 players out of the remaining 14 players as 2 players are already removed.

Number of ways = ^{14}C_{9}

^{14}C_{11} = 14! / 11! (14 – 11)!

= 14! / (11! 3!)

= [14Ã—13Ã—12Ã—11!] / (11! 3!)

= [14Ã—13Ã—12] / (3Ã—2Ã—1)

= 14Ã—13Ã—2

= 364

âˆ´Â The required no. of ways are 4368, 2002, 364.

**5. There are 10 professors and 20 students out of whom a committee of 2 professors and 3 students is to be formed. Find the number of ways in which this can be done. Further, find in how many of these committees:
(i) a particular professor is included.**

**(ii) a particular student is included.**

**(iii) a particular student is excluded.**

**Solution: **

Given:

Total number of professor = 10

Total number of students = 20

Number of ways = (choosing 2 professors out of 10 professors) Ã— (choosing 3 students out of 20 students)

= (^{10}C_{2}) Ã— (^{20}C_{3})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{10}C_{2} Ã— ^{20}C_{3} = 10!/2!(10 – 2)! Ã— 20!/3!(20-3)!

= 10!/(2! 8!) Ã— 20!/(3! 17!)

= [10Ã—9Ã—8!]/(2! 8!) Ã— [20Ã—19Ã—18Ã—17!]/(17! 3!)

= [10Ã—9]/2! Ã— [20Ã—19Ã—18]/(3!)

= [10Ã—9]/(2Ã—1) Ã— [20Ã—19Ã—18]/(3Ã—2Ã—1)

= 5Ã—9 Ã— 10Ã—19Ã—6

= 45 Ã— 1140

= 51300 ways

**(i) **a particular professor is included.

Number of ways = (choosing 1 professor out of 9 professors) Ã— (choosing 3 students out of 20 students)

=Â ^{9}C_{1}Â Ã—Â ^{20}C_{3}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{9}C_{1}Â Ã—Â ^{20}C_{3 }= 9!/1!(9 – 1)! Ã— 20!/3!(20-3)!

= 9!/(1! 8!) Ã— 20!/(3! 17!)

= [9Ã—8!]/(8!) Ã— [20Ã—19Ã—18Ã—17!]/(17! 3!)

= 9 Ã— [20Ã—19Ã—18]/(3!)

= 9Ã— [20Ã—19Ã—18]/(3Ã—2Ã—1)

= 9 Ã— 10Ã—19Ã—6

= 10260 ways

**(ii) **a particular student is included.

Number of ways = (choosing 2 professors out of 10 professors) Ã— (choosing 2 students out of 19 students)

=Â ^{10}C_{2}Â Ã—Â ^{19}C_{2}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{10}C_{2} Ã— ^{19}C_{2} = 10!/2!(10 – 2)! Ã— 19!/2!(19-2)!

= 10!/(2! 8!) Ã— 19!/(2! 17!)

= [10Ã—9Ã—8!]/(2! 8!) Ã— [19Ã—18Ã—17!]/(17! 2!)

= [10Ã—9]/2! Ã— [19Ã—18]/(2!)

= [10Ã—9]/(2Ã—1) Ã— [19Ã—18]/(2Ã—1)

= 5Ã—9 Ã— 19Ã—9

= 45 Ã— 171

= 7695 ways

**(iii) **a particular student is excluded.

Number of ways = (choosing 2 professors out of 10 professors) Ã— (choosing 3 students out of 19 students)

=Â ^{10}C_{2}Â Ã—Â ^{19}C_{3}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{10}C_{2} Ã— ^{19}C_{3} = 10!/2!(10 – 2)! Ã— 19!/3!(19-3)!

= 10!/(2! 8!) Ã— 19!/(3! 16!)

= [10Ã—9Ã—8!]/(2! 8!) Ã— [19Ã—18Ã—17Ã—16!]/(16! 3!)

= [10Ã—9]/2! Ã— [19Ã—18Ã—17]/(3!)

= [10Ã—9]/(2Ã—1) Ã— [19Ã—18Ã—17]/(3Ã—2Ã—1)

= 5Ã—9 Ã— 19Ã—3Ã—17

= 45 Ã— 969

= 43605 ways

âˆ´Â The required no. of ways are 51300, 10260, 7695, 43605.

**6. How many different products can be obtained by multiplying two or more of the numbers 3, 5, 7, 11 (without repetition)?**

**Solution:**

Given that we need to find the no. of ways of obtaining a product by multiplying two or more from the numbers 3, 5, 7, 11.

Number of ways = (no. of ways of multiplying two numbers) + (no. of ways of multiplying three numbers) + (no. of multiplying four numbers)

=Â ^{4}C_{2}Â +Â ^{4}C_{3}Â +Â ^{4}C_{4}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= 12/2 + 4 + 1

= 6 + 4 + 1

= 11

âˆ´Â The total number of ways of product is 11 ways.

**7. From a class of 12 boys and 10 girls, 10 students are to be chosen for the competition, at least including 4 boys and 4 girls. The 2 girls who won the prizes last year should be included. In how many ways can the selection be made?**

**Solution:**

Given:

Total number of boys = 12

Total number of girls = 10

Total number of girls for the competition = 10 + 2 = 12

Number of ways = (no. of ways of selecting 6 boys and 2 girls from remaining 12 boys and 8 girls) + (no. of ways of selecting 5 boys and 3 girls from remaining 12 boys and 8 girls) + (no. of ways of selecting 4 boys and 4 girls from remaining 12 boys and 8 girls)

Since, two girls are already selected,

= (^{12}C_{6}Â Ã—Â ^{8}C_{2}) + (^{12}C_{5}Â Ã—Â ^{8}C_{3}) + (^{12}C_{4}Â Ã—Â ^{8}C_{4})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= (924 Ã— 28) + (792 Ã— 56) + (495 Ã— 70)

= 25872 + 44352 + 34650

= 104874

âˆ´Â The total number of ways of product is 104874 ways.

**8.** **How many different selections of 4 books can be made from 10 different books, if
(i) there is no restriction**

**(ii) two particular books are always selected**

**(iii) two particular books are never selected**

**Solution:**

Given:

Total number of books = 10

Total books to be selected = 4

**(i) **there is no restriction

Number of ways = choosing 4 books out of 10 books

=Â ^{10}C_{4}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{10}C_{4} = 10! / 4! (10 – 4)!

= 10! / (4! 6!)

= [10Ã—9Ã—8Ã—7Ã—6!] / (4! 6!)

= [10Ã—9Ã—8Ã—7] / (4Ã—3Ã—2Ã—1)

= 10Ã—3Ã—7

= 210 ways

**(ii) **two particular books are always selected

Number of ways = select 2 books out of the remaining 8 books as 2 books are already selected.

= ^{8}C_{2}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{8}C_{2} = 8! / 2! (8 – 2)!

= 8! / (2! 6!)

= [8Ã—7Ã—6!] / (2! 6!)

= [8Ã—7] / (2Ã—1)

= 4Ã—7

= 28 ways

**(iii) **two particular books are never selected

Number of ways = select 4 books out of remaining 8 books as 2 books are already removed.

= ^{8}C_{4}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{8}C_{4} = 8! / 4! (8 – 4)!

= 8! / (4! 4!)

= [8Ã—7Ã—6Ã—5Ã—4!] / (4! 4!)

= [8Ã—7Ã—6Ã—5] / (4Ã—3Ã—2Ã—1)

= 7Ã—2Ã—5

= 70 ways

âˆ´Â The required no. of ways are 210, 28, 70.

**9. From 4 officers and 8 jawans in how many ways can 6 be chosen (i) to include exactly one officer (ii) to include at least one officer?**

**Solution:**

Given:

Total number of officers = 4

Total number of jawans = 8

Total number of selection to be made is 6

**(i) **to include exactly one officer

Number of ways = (no. of ways of choosing 1 officer from 4 officers) Ã— (no. of ways of choosing 5 jawans from 8 jawans)

= (^{4}C_{1}) Ã— (^{8}C_{5})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

**(ii) **to include at least one officer?

Number of ways = (total no. of ways of choosing 6 persons from all 12 persons) â€“ (no. of ways of choosing 6 persons without any officer)

=Â ^{12}C_{6}Â â€“Â ^{8}C_{6}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= (11Ã—2Ã—3Ã—2Ã—7) â€“ (4Ã—7)

= 924 â€“ 28

= 896 ways

âˆ´Â The required no. of ways are 224 and 896.

**10. A sports team of 11 students is to be constituted, choosing at least 5 from class XI and at least 5 from class XII. If there are 20 students in each of these classes, in how many ways can the teams be constituted?**

**Solution:**

Given:

Total number of students in XI = 20

Total number of students in XII = 20

Total number of students to be selected in a team = 11 (with atleast 5 from class XI and 5 from class XII)

Number of ways = (No. of ways of selecting 6 students from class XI and 5 students from class XII) + (No. of ways of selecting 5 students from class XI and 6 students from class XII)

= (^{20}C_{6}Â Ã—Â ^{20}C_{5}) + (^{20}C_{5}Â Ã—Â ^{20}C_{6})

= 2 (^{20}C_{6}Â Ã—Â ^{20}C_{5}) ways

**11. A student has to answer 10 questions, choosing at least 4 from each of part A and part B. If there are 6 questions in part A and 7 in part B, in how many ways can the student choose 10 questions?**

**Solution:**

Given:

Total number of questions = 10

Questions in part A = 6

Questions in part B = 7

Number of ways = (No. of ways of answering 4 questions from part A and 6 from part B) + (No. of ways of answering 5 questions from part A and 5 questions from part B) + (No. of ways of answering 6 questions from part A and 4 from part B)

= (^{6}C_{4}Â Ã—Â ^{7}C_{6}) + (^{6}C_{5}Â Ã—Â ^{7}C_{5}) + (^{6}C_{6}Â Ã—Â ^{7}C_{4})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= (15Ã—7) + (6Ã—21) + (1Ã—35)

= 105 + 126 + 35

= 266

âˆ´Â The total no. of ways of answering 10 questions is 266 ways.

**12. In an examination, a student to answer 4 questions out of 5 questions; questions 1 and 2 are however compulsory. Determine the number of ways in which the student can make a choice.**

**Solution:**

Given:

Total number of questions = 5

Total number of questions to be answered = 4

Number of ways = we need to answer 2 questions out of the remaining 3 questions as 1 and 2 are compulsory.

= ^{3}C_{2}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{3}C_{2} = 3!/2!(3 -2)!

= 3! / (2! 1!)

= [3Ã—2Ã—1] / (2Ã—1)

= 3

âˆ´Â The no. of ways answering the questions is 3.

**13. A candidate is required to answer 7 questions out of 12 questions which are divided into two groups, each containing 6 questions. He is not permitted to attempt more than 5 questions from either group. In how many ways can he choose the 7 questions?**

**Solution:**

Given:

Total number of questions = 12

Total number of questions to be answered = 7

Number of ways = (No. of ways of answering 5 questions from group 1 and 2 from group 2) + (No. of ways of answering 4 questions from group 1 and 3 from group 2) + (No. of ways of answering 3 questions from group 1 and 4 from group 2) + (No. of ways of answering 2 questions from group 1 and 5 from group 2)

= (^{6}C_{5}Â Ã—Â ^{6}C_{2}) + (^{6}C_{4}Â Ã—Â ^{6}C_{3}) + (^{6}C_{3}Â Ã—Â ^{6}C_{4}) + (^{6}C_{2}Â Ã—Â ^{6}C_{5})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= (6Ã—15) + (15Ã—20) + (20Ã—15) + (15Ã—6)

= 90 + 300 + 300 + 90

= 780

âˆ´Â The total no. of ways of answering 7 questions is 780 ways.

**14. There are 10 points in a plane of which 4 are collinear. How many different straight lines can be drawn by joining these points.**

**Solution:**

Given:

Total number of points = 10

Number of collinear points = 4

Number of lines formed = (total no. of lines formed by all 10 points) â€“ (no. of lines formed by collinear points) + 1

Here, 1 is added because only 1 line can be formed by the four collinear points.

=Â ^{10}C_{2}Â â€“Â ^{4}C_{2}Â + 1

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= 90/2 â€“ 12/2 + 1

= 45 â€“ 6 + 1

= 40

âˆ´Â The total no. of ways of different lines formed are 40.

**15. Find the number of diagonals of**

**(i) a hexagon**

**(ii) a polygon of 16 sides**

**Solution:**

**(i) **a hexagon

We know that a hexagon has 6 angular points. By joining those any two angular points we get a line which is either a side or a diagonal.

So number of lines formed = ^{6}C_{2}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{6}C_{2} = 6!/2!(6-2)!

= 6! / (2! 4!)

= [6Ã—5Ã—4!] / (2! 4!)

= [6Ã—5] / (2Ã—1)

= 3Ã—5

= 15

We know number of sides of hexagon is 6

So, number of diagonals = 15 â€“ 6 = 9

The total no. of diagonals formed is 9.

**(ii) **a polygon of 16 sides

We know that a polygon of 16 sides has 16 angular points. By joining those any two angular points we get a line which is either a side or a diagonal.

So number of lines formed = ^{16}C_{2}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{16}C_{2} = 16!/2!(16-2)!

= 16! / (2! 14!)

= [16Ã—15Ã—14!] / (2! 14!)

= [16Ã—15] / (2Ã—1)

= 8Ã—15

= 120

We know number of sides of a polygon is 16

So, number of diagonals = 120 â€“ 16 = 104

The total no. of diagonals formed is 104.

**16. How many triangles can be obtained by joining 12 points, five of which are collinear?**

**Solution:**

We know that 3 points are required toÂ draw a triangle and the collinear points will lie on the same line.

Number of triangles formed = (total no. of triangles formed by all 12 points) â€“ (no. of triangles formed by collinear points)

=Â ^{12}C_{3}Â â€“Â ^{5}C_{3}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= (2Ã—11Ã—10) â€“ (5Ã—2)

= 220 â€“ 10

= 210

âˆ´Â The total no. of triangles formed are 210.

EXERCISE 17.3 PAGE NO: 17.23

**1. How many different words, each containing 2 vowels and 3 consonants can be formed with 5 vowels and 17 consonants?**

**Solution:**

Given:

Total number of vowels = 5

Total number of consonants = 17

Number of ways = (No. of ways of choosing 2 vowels from 5 vowels) Ã— (No. of ways of choosing 3 consonants from 17 consonants)

= (^{5}C_{2}) Ã— (^{17}C_{3})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

= 10 Ã— (17Ã—8Ã—5)

= 10 Ã— 680

= 6800

Now we need to find the no. of words that can be formed by 2 vowels and 3 consonants.

The arrangement is similar to that of arranging n people in n places which are n! Ways to arrange. So, the total no. of words that can be formed is 5!

So, 6800 Ã— 5! = 6800 Ã— (5Ã—4Ã—3Ã—2Ã—1)

= 6800 Ã— 120

= 816000

âˆ´Â The no. of words that can be formed containing 2 vowels and 3 consonants are 816000.

**2. There are 10 persons named P _{1}, P_{2}, P_{3} â€¦, P_{10}. Out of 10 persons, 5 persons are to be arranged in a line such that is each arrangement P_{1}Â must occur whereas P_{4}Â and P_{5}Â do not occur. Find the number of such possible arrangements.**

**Solution**:

Given:

Total persons = 10

Number of persons to be selected = 5 from 10 persons (P_{1}, P_{2}, P_{3} â€¦ P_{10})

It is also told that P_{1}Â should be present and P_{4}Â and P_{5}Â should not be present.

We have to choose 4 persons from remaining 7 persons as P_{1}Â is selected and P_{4}Â and P_{5}Â are already removed.

Number of ways = Selecting 4 persons from remaining 7 persons

=Â ^{7}C_{4}

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{7}C_{4} = 7! / 4!(7 – 4)!

= 7! / (4! 3!)

= [7Ã—6Ã—5Ã—4!] / (4! 3!)

= [7Ã—6Ã—5] / (3Ã—2Ã—1)

= 7Ã—5

= 35

Now we need to arrange the chosen 5 people. Since 1 person differs from other.

35 Ã— 5! = 35 Ã— (5Ã—4Ã—3Ã—2Ã—1)

= 4200

âˆ´Â The total no. of possible arrangement can be done is 4200.

**3. How many words, with or without meaning can be formed from the letters of the word â€˜MONDAYâ€™, assuming that no letter is repeated, if
(i) 4 letters are used at a time**

**(ii) all letters are used at a time**

**(iii) all letters are used but first letter is a vowel ?**

**Solution:**

Given:

The word â€˜MONDAYâ€™

Total letters = 6

**(i) **4 letters are used at a time

Number of ways = (No. of ways of choosing 4 letters from MONDAY)

= (^{6}C_{4})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{6}C_{4} = 6! / 4!(6 – 4)!

= 6! / (4! 2!)

= [6Ã—5Ã—4!] / (4! 2!)

= [6Ã—5] / (2Ã—1)

= 3Ã—5

= 15

Now we need to find the no. of words that can be formed by 4 letters.

15 Ã— 4! = 15 Ã— (4Ã—3Ã—2Ã—1)

= 15 Ã— 24

= 360

âˆ´Â The no. of words that can be formed by 4 letters of MONDAY is 360.

**(ii) **all letters are used at a time

Total number of letters in the word â€˜MONDAYâ€™ is 6

So, the total no. of words that can be formed is 6! = 360

âˆ´Â The no. of words that can be formed by 6 letters of MONDAY is 360.

**(iii) **all letters are used but first letter is a vowel ?

In the word â€˜MONDAYâ€™ the vowels are O and A. We need to choose one vowel from these 2 vowels for the first place of the word.

So,

Number of ways = (No. of ways of choosing a vowel from 2 vowels)

= (^{2}C_{1})

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{2}C_{1} = 2! / 1!(2 – 1)!

= 2! / (1! 1!)

= (2Ã—1)

= 2

Now we need to find the no. of words that can be formed by remaining 5 letters.

2 Ã— 5! = 2 Ã— (5Ã—4Ã—3Ã—2Ã—1)

= 2 Ã— 120

= 240

âˆ´Â The no. of words that can be formed by all letters of MONDAY in which the first letter is a vowel is 240.

**4. Find the number of permutations of n distinct things taken r together, in which 3 particular things must occur together.**

**Solution:**

Here, it is clear that 3 things are already selected and we need to choose (r â€“ 3) things from the remaining (n â€“ 3) things.

Let us find the no. of ways of choosing (r â€“ 3) things.

Number of ways = (No. of ways of choosing (r â€“ 3) things from remaining (n â€“ 3) things)

=Â ^{n â€“ 3}C_{r â€“ 3}

Now we need to find the no. of permutations than can be formed using 3 things which are together. So, the total no. of words that can be formed is 3!

Now let us assume the together things as a single thing this gives us total (r â€“ 2) things which were present now. So, the total no. of words that can be formed is (r â€“ 2)!

Total number of words formed is:

^{n â€“ 3}C_{r â€“ 3} Ã— 3! Ã— (r – 2)!

âˆ´Â The no. of permutations that can be formed by r things which are chosen from n things in which 3 things are always together isÂ ^{n â€“ 3}C_{r â€“ 3}Â Ã— 3! Ã— (r â€“ 2)!

**5. How many words each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?**

**Solution:**

Given:

The word â€˜INVOLUTEâ€™

Total number of letters = 8

Total vowels are = I, O, U, E

Total consonants = N, V, L, T

So number of ways to select 3 vowels is ^{4}C_{3}

And numbre of ways to select 2 consonants is ^{4}C_{2}

Then, number of ways to arrange these 5 letters = ^{4}C_{3} Ã— ^{4}C_{2} Ã— 5!

By using the formula,

^{n}C_{r} = n!/r!(n – r)!

^{4}C_{3} = 4!/3!(4-3)!

= 4!/(3! 1!)

= [4Ã—3!] / 3!

= 4

^{4}C_{2} = 4!/2!(4-2)!

= 4!/(2! 2!)

= [4Ã—3Ã—2!] / (2! 2!)

= [4Ã—3] / (2Ã—1)

= 2 Ã— 3

= 6

So, by substituting the values we get

^{4}C_{3} Ã— ^{4}C_{2} Ã— 5! = 4 Ã— 6 Ã— 5!

= 4 Ã— 6 Ã— (5Ã—4Ã—3Ã—2Ã—1)

= 2880

âˆ´Â The no. of words that can be formed containing 3 vowels and 2 consonants chosen from â€˜INVOLUTEâ€™ is 2880.