QuizSolver
  • Bank PO
  • CBSE
  • IIT JEE
 
 

Basic Concepts Of Permutations and Combinations Part 2

Posted on - 17-02-2017

JEE Math PC

IIT JEE

Addition principle:

If one experiment has n possible outcomes and another has m possible outcomes, then there are (m + n) possible outcomes when exactly one of these experiments is performed. In other words, if a job can be done by n methods and by using the first method, can be done in a1 ways or by second method in a2 ways and so on . . . by the nth method in an ways, then the number of ways to get the job done is (a1 + a + ... + an).

Example.1

A college offers 7 courses in the morning and 5 in the evening. Find the number of ways a student can select exactly one course, either in the morning or in the evening.

Solution

The student has seven choices from the morning courses out of which he can select one course in 7 ways.

For the evening course, he has 5 choices out of which he can select one course in 5 ways. .

Hence he has total number of 7 + 5 = 12 choices.

Example.2

A person wants to leave station B. There are three routes from station B to A and four routes from B to C. In how many ways can he leave the station B.

Solution

B → A in 3 ways

B → C in 4 ways


&⇒
He can leave station B in 3 + 4 = 7 ways.

Example.3

How many three digit numbers xyz with x, z < y can be formed

Solution

Obviously 2 £ y £ 9. If y = k, then x can take values from 1 to k – 1 and z can take values from 0 to k-1. .

Thus required number of numbers = .

Bijection Principle :

Generally it is not easy to count the numbers belonging to a very large collection(set) directly. Let us assume that we have a set X and we want to count n(x) ( number of elements in X). And we have another set Y and n(Y) can be counted(easily). Now if there exists one-one and onto relationship from set X to set Y, then n(X) = n(Y) . .

In other words, if X and Y are two finite sets such that there is a bijection ( i.e. one-one onto map) from X to Y , then n(X) = n(Y). .

For example let us take a simple case. The sitting capacity of a class is 30. On a particular day, the class is full then, without actual counting, we can say that the total number of the students present in the class is 30. .

Inclusion-Exclusion Principle:

Let U be a finite set of m elements and p1 , p2 , p3 , . . . ,pr be some properties which the objects of U may or may not have, .

Then the number of elements of U which have at least one of the properties p1, p2, p3, …. ,pr is given by .

= S1 – S2 + S3 – S4 + . . . +(–1)r-1Sr .

and the number of elements of U which have none of the properties p1, p2, p3 , . . . ,pr is given by = m – S1 + S2 – S3 + …. + (– 1) r Sr .

Where Ai denotes the subset of U each of whose elements has the property pi( i = 1, 2, …. , r) and denotes the subset of U none of whose elements has the property pi

Ai Ç A j denotes the set of all elements of U having both properties pi and pj and so on. And Sk denotes the total number of elements of U having any k of the given r properties. .

E.g. S1 = n(A1) + n(A2) + …. + n(Ar) , S2 = n(A1ÇA2) + n(A1Ç A3) +…. + n(A1ÇAr) + n(A2ÇA3) + . . . + n(A2ÇAr) + …. + n(Ar-1 Ç Ar) . .

In particular case:

For r =2 , n(A1ÈA2) = n(A1) +n(A2) – n(A1ÇA2)

For r = 3,

n(A1ÈA2 ÈA3) = n(A1) +n(A2) +n(A3) – n(A1ÇA2) – n(A1ÇA3) – n(A2ÇA3) + n(A1 Ç A2 ÇA3). .

For r = 4, n(A1ÈA2ÈA3ÈA4) = n(A1) +n(A2) +n(A3) + n(A4) – n(A1ÇA2) – n(A1ÇA3) – n(A1ÇA4)

– n(A2ÇA3) – n(A2ÇA4) – n(A3ÇA4)+ n(A1 Ç A2 ÇA3) + n(A1 Ç A2 ÇA4)

+ n(A1 Ç A3 ÇA4) + n(A2 Ç A3 ÇA4) – n(A1ÇA2 Ç A3 ÇA4).

Example.1

Find the number of integers between 1 and 1000, both inclusive

(a) Which are divisible by either of 10, 15 and 25. .

(b) Which are divisible by neither 10 nor 15 nor 25.

Solution:

Let U denote the set of numbers between 1 and 1000 so that n(U) = 1000. Let A,B and C denote the sets of integers divisible by 10, 15 and 25 respectively.

Then n(A) = =100,

n(B) = = 66, and n(C) = = 40 .

S1 = n(A) +n(B) +n(C) = 100 + 66 + 40 = 206

Considering two of the three sets A, B, C, we have

A Ç B = set of integers divisble by 10 and 15

= set of integers divisble by 30 (L.C.M of 10 and 15).


&⇒
n( A Ç B) = .

Similarly, B Ç C = set of integers divisble by 15 and 25

= set of integers divisble by 75 (L.C.M of 15 and 25).


&⇒
n( B Ç C) = .

Similarly, A Ç C = set of integers divisble by 10 and 25

= set of integers divisble by 50 (L.C.M of 10 and 25).


&⇒
n( A Ç C) = .

S2 = 33 + 13 + 20 = 66.

Finally, A Ç B Ç C = set of integers divisble by 10, 15 and 25

= set of integers divisble by 150 (L.C.M of 10, 15 and 25).


&⇒
n( A Ç B Ç C) = .

S3 = 6 .

(a) We have to find the number of integers divisible by either of 10, 15, and 25 i.e. n(AÈ BÈC).

n(AÈ BÈC) = S1 – S2 +S3 = 206 – 66 + 6 = 146 .

(b) The number of integers divisible by neither 10 nor 15, nor 25

= n(U) – n(AÈ BÈC) = 1000 – 146 = 854.

Remark :      

q The number of integers from 1 to n which are divisible by k is ([ .] denotes the greatest integer function). e.g. the number of integers from 1 to 100 which are divisible by 2 and 3 individually are and = 33 respectively.

q The number of natural numbers from 1 to n, which are perfect kth powers, is
[n1/k]. e.g. the number of perfect squares from 1 to 110 is [] = 10.

 
Quadratic Equations - Solved Objective Questions Part 2 for Conceptual Clarity
Quadratic Equations - Solved Objective Questions Part 1 for Conceptual Clarity
Solved Objective Question on Probability Set 2
Solved Objective Question on Probability Set 1
Solved Objective Question on Progression and Series Set 2
Solved Objective Question on Permutations and Combinations Set 3
Solved Objective Question on Permutations and Combinations Set 2
Solved Objective Question on Progression and Series Set 1
Solved Objective Question on Permutations and Combinations Set 1
Quadratic Equations - Solved Subjective Questions Part 4
Quadratic Equations - Solved Subjective Questions Part 2
Quadratic Equations - Solved Subjective Questions Part 3
Quadratic Equations - Solved Subjective Questions Part 1
Solved Subjective Questions on Circle Set 9
Solving Equations Reducible to Quadratic Equations
Theory of Polynomial Equations and Remainder Theorem
Solved Subjective Questions on Circle Set 8
Solving Quadratic Inequalities Using Wavy Curve Methods
Division and Distribution of Objects - Permutation and Combination
Basics of Quadratic Inequality or Inequations

Comments