0% found this document useful (0 votes)
6 views42 pages

Chapter 17

The document contains exercises related to combinatorial mathematics, including evaluating combinations and permutations for various scenarios. It provides detailed solutions for selecting teams, courses, and committees from given groups of individuals. The exercises illustrate the application of combinatorial formulas to solve practical problems in selection and arrangement.

Uploaded by

leninvenkat1234
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views42 pages

Chapter 17

The document contains exercises related to combinatorial mathematics, including evaluating combinations and permutations for various scenarios. It provides detailed solutions for selecting teams, courses, and committees from given groups of individuals. The exercises illustrate the application of combinatorial formulas to solve practical problems in selection and arrangement.

Uploaded by

leninvenkat1234
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Exercise 17.

1. Evaluate the following:


(i) 14
(ii) 12

O T IS
(iii) 35
N A D
CO N
(iv) +1
O UC AA
T IO
PY
Solution:
(i) 14
ED PR

Let us use the formula,


!
=
! !

= 14 and =3
©

So now, value of
!
=
! !
!
14 =
! !
!
14 =
! !
D

!
14 =
! !
× × × !
=
! !
× ×
=
×
= 14 × 13 × 12
= 364

(ii) 12
Let us use the formula,
!
=
! !

O T IS
So now, value of = 12 and = 10
N A D
CO N
!
=
! !
O UC AA
T IO
PY
!
12 =
! !
!
12 =
ED PR

! !
!
12 =
! !
©

× ×
=
! !
×
=

= 6 × 11
= 66
D
(iii) 35
Let us use the formula,
!
=
! !

So now, value of = 35 and = 35


!
=
! !
"!

O T IS
35 =
"! " " !
"! N A D
=

CO N
"! !
O UC AA
T IO
PY
#$ %& , 0! = 1
=1
ED PR

(iv) +1
©

Let us use the formula,


!
=
! !

So now, value of = + 1 and =


!
=
! !
( !
+1 =
D

! ( !
( !
=
! !
(
=

= +1
2. )* +,-. = +,/ , find the value of n.
Solution:
We know that if 0
= then one of the following conditions need
to be satisfied.
(i) 1 = 2
(ii) =1+2
=

O T IS
So from the question 0
, we can say that
12 ≠ 5 N A D
CO N
So, the condition (ii) must be satisfied,
O UC AA
T IO
PY
n = 12 + 5
= 17
ED PR

∴ The value of n is 17.

3. If +,6 = +,/ , 78+9 -.,+ .


©

Solution:
We know that if ;
= <
, then one of the following conditions need to
be satisfied.
(i) p = q
D

(ii) n = p + q
So from the question =
= >
, we can say that
4 ≠6
So the condition (ii) must be satisfied,
=4+6
= 10
Now, we need to find 12
we know the value of n so, 12 = 12
Let us use the formula,
!
=
! !

= 12 and = 10

O T IS
So now, value of
!
=
! !
N A D
CO N
!
12 =
O UC AA
T IO
PY
! !
!
=
! !
ED PR

× × !
=
! !
×
=
©

= 6 × 11
= 66
∴ The value of 12 = 66.

4. If +,-? = +,-. , find .@,+ .


D

Solution;
We know that if ;
= <
then one of the following conditions need
to be satisfied.
(i) p = q
(ii) =1+2
So, from the question = 0
, we can say that
10 ≠ 12
So, the condition (ii) must be satisfied,
= 10 + 12

O T IS
= 22
Now, we need to find 23 N A D
CO N
We know the value of n so, 23 = 23
O UC AA
T IO
PY
00

Let us use the formula,


!
=
ED PR

! !

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


!
=
©

! !
!
=
! !
× !
=
!

= 23
∴ The value of 23 = 23.
D

00
5. If .6,A = .6,.AB@ , 78+9 A.
Solution:
We know that if ;
= <
, then one of the following conditions need
to be satisfied.
(i) p = q
(ii) =1+2
So from the question 24 = 24 , we can say that

O T IS
C 0CB

N A D
CO N
Let us check for condition (i)
D = 2D + 3
O UC AA
T IO
PY
2D − D = −3
D = −3
ED PR

We know that for a combination , ≥ 0 r should be a positive


integer which is not satisfied here,
©

So, the condition (ii) must be satisfied,


24 = D + 2D + 3
3D = 21

D=

D=7
D

∴ The value of x is 7.

6. If -G,A = -G,AB. , find x.


Solution:
We know that if ;
= <
, then one of the following conditions need
to be satisfied:
(i) p = q
(ii) =1+2
So from the question 18 C
= 18 CB0
, we can say that
D ≠D+2

O T IS
So, the condition (ii) must be satisfied,
18 = D + D + 2 N A D
CO N
18 = 2D + 2
O UC AA
T IO
PY
2D = 18 − 2
2D = 16
ED PR

I
D=

=8
©

∴ The value of x is 8.

7. if -J,@K = -J,KB@ , find r.


Solution:
We know that if ;
= <
then one of the following conditions need
D

to be satisfied.
(i) p = q
(ii) =1+2
So from the question 15 = 15 B
we can say that
Let us check for condition (i)
3 = +3
3 − =3
2 =3

We know that for a combination , ≥ 0, r should be a positive


integer which is not satisfied here,

O T IS
So, the condition (ii) must be satisfied.
15 = 3 + + 3 N A D
CO N
15 − 3 = 4
O UC AA
T IO
PY
4 = 12

=
ED PR

=3
∴ The value of r is 3.
©

8. If -G,K − L,@ = L,. , find r.


Solution:
To find r, let us consider the given expression,
8 −7 =7
D

8 = 7 0+ 7
We know that + B
= +1 B

8 =7+1 0B

8 =8
Now, we know that if ;
= <
, then one of the following conditions
need to be satisfied:
(i) p = q
(ii) =1+2
So from the question 8 = 8 , we can say that
Let us check for condition (i)

O T IS
r=3
Let us check for condition (ii)
8=3+ N A D
CO N
=5
O UC AA
T IO
PY
∴ The values of ‘r’ are 3 and 5.
ED PR

9. If -J,K : -J,KN- = 11 : 5, find r.


Solution:
©

Given:
15 : 15 N
= 11 : 5
15 : 15 N
= 11 / 5
Let us use the formula,
!
=
! !
D

5(16 – r) = 11r
80 − 5 = 11
80 = 11 + 5
16 = 80
O
=
I
=5
∴ The value of r is 5.

10. If + + .,G : + − .P6 = JL: -/, find n.


Solution:

O T IS
Given:
+ 2 Q: − 2R= = 57: 16
N A D
CO N
+ 2 Q/ − 2R= = 57/16
O UC AA
T IO
PY
Let us use the formula,
!
=
! !
ED PR

( ! I !
= = 57/16
I ! !O!
( (
= = 57/16
O!
©

T× ×O ×U ×I ×" × × × ×
= +2 +1 −1 =
I
= +2 +1 − 1 = 21 × 20 × 19 × 18
Equating the corresponding terms on both sides we get,
n = 19
∴ The value of n is 19.
D
Exercise 17.2

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 :

O T IS
Number of players = 15
Number of players to be selected = 11
N A D
CO N
By using the formula,
O UC AA
T IO
PY
!
=
! !
"!
=
ED PR

! " !
"!
=
! !
©

"× × × × !
=
! !
"× × ×
=
× × ×

= 15 × 7 × 13
= 1365
∴ The total number of ways of choosing 11 players out of 15 is 1365
D

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

O T IS
Boat party of 8 to be made from 25 boys and 10 girls, by selecting 5
boys and 3 girls.
N A D
CO N
So,
O UC AA
T IO
PY
By using the formula,
!
=
! !
ED PR

"! !
25 × 10 = ×
0 "! " " ! ! !
"! !
= ×
"! ! ! U !
©

"! !
= ×
"! ! !U!
"× × × × × ! ×T×O×U!
= ×
"! ! U! !
"× × × × ×T×O
= ×
"! !
"× × × × ×T×O
D

= ×
"× × × × × ×

= 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.

O T IS
That too out of 5 courses student has to choose, 2 courses are
N A D
CO N
compulsory.
O UC AA
T IO
So they have to choose 3 courses out of 7 courses.

PY
This can be done in 7 0
WXY#.
By using the formula,
ED PR

!
=
! !
U!
7 =
©

! U !
U!
=
! !
U×I×"×
=
! !
U×I×"
=
× ×
D

=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 selcted
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

O T IS
Number of players to be selected = 11
So, the combination is 18
N A D
CO N
O UC AA
T IO
By using the formula,

PY
!
=
! !
I!
=
ED PR

! I !

I!
©

=
! " !
I× "× × × ×
=
!"!

= 4 × 7 × 13 × 12
= 4368
D

(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 Q
!
14 =
Q T! T !
!
=
T!"!
× × × ×
=
"× × × ×

= 7 × 13 × 11 × 2
= 2002

O T IS
(ii) Exclude 2 particular players ?
N A D
CO N
It is told that two players are always excluded.
O UC AA
T IO
PY
Now, we have to select 11 players out of the remaining 14 players as 2
players are already removed.
Number of ways = 14
ED PR

Z
!
14 =
! !
!
©

=
! !
× × × !
=
! !
× ×
=
× ×

= 14 × 13 × 12
D

= 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 in included.
(iii) a particular student in excluded.

O T IS
Solution;
Given:
N A D
CO N
Total number of professor = 10
O UC AA
T IO
PY
Total number of students = 20
Number of ways = ( Choosing 2 professors out of 10 professors) ×
Choosing 3 students out of 20 students
ED PR

= g10 h × g20 h
By using the formula,
!
©

=
! !
! !
10 × 20 = ×
! ! ! !
! !
= ×
!O! ! U!
×T×O! × T× O× U!
= ×
!O! U! !
D

×T × T× O!
= ×
! !
×T × T× O
= ×
× × ×

= 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) ×
%ℎjj#$ k 3 students out of 20 students)
= 3 × 20

O T IS
By using the formula,
!
N A D
=

CO N
! !
O UC AA
T IO T! !

PY
9 × 20 = ×
! T ! ! !
T! !
= ×
!O! ! U!
ED PR

T×O! × T× O× U!
= ×
O! U! !
× T× O
=9×
©

!
× T× O
=9×
× ×
= 9 × 10 × 19 × 6
= 10260 ways
D

(ii) a particular student is included


Number of ways =
lℎjj#$ k 2 1 jm&##j # jno jm 10 1 jm&##j # ×
lℎjj#$ k 2 #onp& o# jno jm 19 #onp& o#
= 10 × 19
By using the formula,
!
=
! !
! T!
= 10 × 19 = ×
! ! ! T !
! T!
= ×
! O ! ! U !
×T×O! T× O× U!
= ×
!O! U! !

O T IS
×T T× O
= ×
! !
N A D
CO N
×T T× O
= ×
× ×
O UC AA
T IO
PY
= 5 × 9 × 19 × 9
= 45 × 171
ED PR

= 7695 ways
©

(iii) a particular student is excluded


Number of ways =
%ℎjj#$ k 2 1 jm&##j # jno jm 10 1 jm&##j # ×
lℎj##$ k 3 #onp& o# jno jm 19 #onp& o#
= 10 0
× 19
By using the formula,
!
D

=
! !

! T!
10 × 19 = ×
0 ! ! ! T !
! T!
= ×
!O! ! I!
×T×O! T× O× U× I!
= ×
!O! I! !
×T T× O× U
= ×
! × ×

= 5 × 9 × 19 × 3 × 17
= 45 × 969
= 43605 ways
∴ The required no. of ways are 51300, 10260, 7695, 43605.

O T IS
N A D
CO N
6. How many different products can be obtained by multiplying
O UC AA
two or more of the numbers 3, 5, 7, 11 ( without repetition) ?

T IO
PY
Solution:
Given that we need to find the no. ways of obtaining a product by
ED PR

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 0
+4 + 4 =

By using the formula,


!
=
! !

= + 4 +1
D

=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

O T IS
Total number of girls = 10
Total number of girls for the competition = 10 + 2 = 12
N A D
CO N
Number of ways = ( no. of ways of selecting 6 boys and 2 girls from
O UC AA
T IO
PY
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)
ED PR

Since, two girls are already selected,


= g12 >
× 8 h + g12 × 8 h + g12 =
×8 h
By using the formula,
©

!
=
! !

g12 >
× 8 h + g12 × 8 h + g12 =
×8 h
! O! ! O!
= qr s ×r st + qr s ×r st +
I !I! O ! ! " !"! O ! !

! O!
qr s ×r st
D

! ! O ! !

! O! ! O! !
= qr s ×r st + qr s ×r st + qr s×
I! !I! I! ! ! U! !"! "! ! O! !

O!
r st
! ! !
× × ×T×O×U O×U × × ×T×O O×U×I
= ur s ×r sv + ur s ×r sv +
I×"× × × × × "× × × × × ×
× × ×T O×U×I×"
ur s×r sv
× × × × × ×

= 924 × 28 + 792 × 56 + 495 × 70


= 25872 + 44352 + 34650
= 104874
∴ The total number of ways of product is 104874 ways.

O T IS
N A D
CO N
8. How many different selections of 4 books can be made from 10
O UC AA
different books, if

T IO
PY
(i) there is no restriction
(ii) two particular books are always selected
ED PR

(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
D

By using the formula,


!
=
! !
!
10 =
! !
!
=
!I!
×T×O×U×I
=
!I!
×T×O×U
=
× × ×

= 10 × 3 × 7
= 210 ways

O T IS
(ii) two particular books are always selected
N A D
CO N
Number of ways = select 2 books out of the remaining 8 books as 2
O UC AA
T IO
PY
books are already selected.
= 8
ED PR

By using the formula,


!
=
! !
O!
8 =
©

! O !
O!
=
! I !
O×U×I!
=
!I!
O×U
=
×

=4×7
D

= 28 ways
(iii) two particular books are never selected
Number of ways = select 4 books out of remaining 8 boks as 2 books are
already removed.
=8
By using the formula,
!
=
! !
O!
=8 =

O T IS
! O !
O!
N A D
CO N
=
! !
O×U×I×"× !
O UC AA
T IO
PY
=
! !
O×U×I×"
=
× × ×
ED PR

=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 :
D

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) ×
j. jm WXY# jm %ℎjj#$ k 5 wXWX # m jx 8 wXWX #
= g4 h × g8 " h
By using the formula.
!
=
! !
! O!
g4 h × g8 " h = r s×r s
! ! O " !"!

O T IS
! O!
= r s×r s
! ! O×" !"!
N A D
CO N
! O!
r s×r s
! ! O " !"!
O UC AA
T IO
PY
! O!
= r s×r s
! ! !"!
O×U×I
= r s × r s
ED PR

× ×
=4 ×4 ×7 ×2
= 224 ways
©

(ii) Two 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 −8
D

I I
By using the formula,
!
=
! !
! O!
12 I
−8 I
= r s×r s
I !I! O I !I!
! O!
= r s×r s
I !I! I !I!

× × ×T×O×U O×U
= r s × r s
I×"× × × × ×
= 11 × 2 × 3 × 2 × 7 − 4 × 7

O T IS
= 924 – 28
N A D
CO N
= 896 ways
O UC AA
T IO
∴ The required no. of ways are 224 and 896.

PY
ED PR

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
D

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)
= g20 I
× 20 "
h + g20 "
× 20 I h
= 2 g20 I
× 20 "
h WXY#
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 question = 10
Questions in part A = 6

O T IS
Questions in part B = 7
Numbers of ways = ( No. of ways of answering 4 questions from part A
N A D
CO N
and 6 from part B) + ( No. of ways of answering 5 questions from part A
O UC AA
T IO
PY
and 5 questions from part B) + ( No. of ways of answering 6 questions
from part and 4 from part B)
= g6 × 7 I h + g6 "
× 7 " h + g6 I
×7 h
ED PR

By using the formula,


!
=
! !
©

= g6 × 7 I h + g6 "
× 7 " h + g6 I
×7 h
I! U! I! U! I!
= qr s ×r st + qr s ×r st + qr s ×
I ! ! U I !I! I " !"! U " !"! I I !I!

U!
r st
U ! !

I! U! I! U! I! U!
= qr s ×r st + qr s ×r st + qr s ×r st
D

! ! !I! !"! !"! !I! ! !

I×" U I U×I U×I×"


= ur s × r sv + ur s × r sv + ur s × r sv
× × × ×

= 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.

O T IS
Solution:
Given:
N A D
CO N
Total number of questions = 5
O UC AA
T IO
PY
Total number of questions to be answered = 4
Number of ways = we need to answer 2 questions out of the remaining 3
ED PR

questions as 1 and 2 are compulsory.


= 3
By using the formula,
©

!
=
! !
!
3 =
! !
!
=
! !
× ×
=
×
D

=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, eachh 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

O T IS
Total number of questions to be answered = 7
Number of ways = ( No. of ways of answering 5 questions from group 1
N A D
CO N
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 2 questions from
O UC AA
T IO
PY
group 1 and 5 from group 2)
= g6 "
× 6 h + g6 × 6 h + g6 × 6 h + g6 × 6 "h
ED PR

By using the formula,


!
=
! !

= g6 × 6 h + g6 × 6 h + g6 × 6 h + g6 × 6 "h
©

"

I! I! I! I! I!
= qr s ×r st + qr s ×r st + qr s ×
I " !"! I ! ! I ! ! I ! ! I ! !

I! I! I!
r st + qr s ×r st
I ! ! I ! ! I " !"!
D

I! I! I! I! I! I!
= qr s ×r st + qr s ×r st + qr s ×r st +
!"! ! ! ! ! ! ! ! ! ! !

I! I!
qr s ×r st
! ! !"!
I I×" I×" I×"× I×"× I×"
= ur s × r sv + ur s ×r sv + ur s ×r sv +
× × × × × × ×
I×" I
ur s × r sv
×

= 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.

O T IS
N A D
CO N
14. There are 10 points in a plane of which 4 are collinear. how
O UC AA
many differrent straight lines can be drawn by joining these points .

T IO
PY
Solution:
Given:
ED PR

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 − 4 0
+1
By using the formula,
!
=
D

! !

! !
= 10 − 4 +1=r s− r s+1
0 ! ! ! !
! !
=r s−r s+1
O! ! ! !
×T ×
=r s−r s+1
× ×
T
= − +1
= 45 – 6 + 1
= 40
∴ The total no. of ways of different lines formed are 40.

O T IS
N A D
CO N
15. Find the number of diagonals of
O UC AA
T IO
PY
(i) a hexagon
(ii) a polygon of 16 sides
ED PR

Solution:
(i) a hexagon
We know that a hexagon has a 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
By using the formula,
!
=
! !
I!
6 =
! I !
D

I!
=
! !
I×"× !
=
! !
I×"
=
×

=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.

O T IS
(ii) a polygon of 16 sides
N A D
CO N
We know that a polygon of 16 sides has 16 angular points. By joining
O UC AA
T IO
PY
those any two angular points we get a line which is either a side or a
diagonal.
So number of lines formed = 16
ED PR

By using the formula,


!
=
! !
©

I!
16 =
! I !
I!
=
! !
I× "×
=
! !
I× "
D

=
×

= 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 −5

O T IS
By using the formula,
N A D
CO N
!
=
! !
O UC AA
T IO
PY
! "!
= 12 −5 = r s−r s
! ! " ! !
ED PR

! "!
= r s−r s
T ! ! ! !
©

× × "×
= r s−r s
× × ×

= 2 × 11 × 10 − 5 × 2
= 220 − 10
= 210
∴ The total no. of triangles formed are 210.
D
Exercise 17.3

1. How many different words, each containing 2 vowels and 3


consonants can be formed with 5 vowels and 17 consonants ?
Solution:

O T IS
Given
Total number of vowels = 5
N A D
CO N
Total number of consonants = 17
O UC AA
T IO
PY
Number of ways = ( No. of ways of choosing 2 vowels from 5 vowels )
× ( No. of ways of choosing 3 consonants from 17 consonants)
= g5 h × g17 h
ED PR

By using the formula,


!
=
©

! !
"! U!
= g5 h × g17 h = r s ×r s
" ! ! U ! !
"! U!
= r s ×r s
! ! ! !
"× U× I× "
=r s×r s
× × ×
D

= 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

O T IS
consonants are 816000.
N A D
CO N
2. There are 10 persons names P- , P. , P@ , … … , P-? . Out of 10 persons,
O UC AA
T IO
PY
5 persons are to be arranged in a line such that is each arrangement
P- must occur whereas P6 and PJ do not occur. Find the number of
ED PR

such possible arrangements.


Solution:
Given:
©

Total persons = 10
Number of persons to be selected = 5 from 10 persons
(z , z , z , … … , z )
It is also told that z should be present and z and z" should not be
present.
We have to choose 4 persons from remaining 7 persons as z is selected
D

and z and z" are already removed.


Number of ways = Selecting 4 persons from remaining 7 persons
=7
By using the formula,
!
=
! !
U!
7 =
! U !
U!
=
! !
U×I ×" × !
=
× ×

O T IS
=7×5
N A D
CO N
= 35
O UC AA
T IO
PY
Now we need to arrange the chosen 5 people. Since 1 person differs
from other.
35 × 5! = 35 × 5 × 4 × 3 × 2 × 1
ED PR

= 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
D

(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)
= g6 h
By using the formula,
!
=
! !
I!
6 =

O T IS
! I !
I!
N A D
CO N
=
! !
I ×" × !
O UC AA
T IO
PY
=
! !
I×"
=
×
ED PR

=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.
D

(ii) all letters are used 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,

O T IS
Number of ways = ( No. of ways of choosing a vowel from 2 vowels)
= g2 h
N A D
CO N
By using the formula,
O UC AA
T IO
PY
!
=
! !
!
2 =
ED PR

! !
!
=
! !

= 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
D

= 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

O T IS
remaining (n- 3) things)
−3 N A D
CO N
= N
O UC AA
T IO
PY
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!
ED PR

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

Total number of words formed is :


= −3 N
×3! × −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 − 3 N
×3! × − 2 !.
D
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

O T IS
Total vowels are = I, O, U, E
Total consonants = N, V, L, T
N A D
CO N
So number of ways to select 3 vowels is 4
O UC AA
T IO
PY
And number of ways to select 2 consonants is 4
Then, number of ways to arrange these 5 letters = 4 ×4 × 5!
ED PR

By using the formula,


!
=
! !
©

!
4 =
! !
!
=
! !
× !
=
!
D

=4

!
4 =
! !
!
=
! !
× × !
=
! !
×
=
×

=2×3
=6
So, by substituting the values we get
4 ×4 × 5! = 4 × 6 × 5!

O T IS
=4×6 × 5×4×3×2×1 N A D
CO N
= 2880
O UC AA
T IO
PY
∴ The no. of words that can be formed containing 3 vowels and 2
consonants chosen from ‘INVOLUTE’ is 2880.
ED PR
©
D
©
ED PR
D
O UC AA
N A D
O T IS
T IO
CO N
PY

You might also like