Join Vedantu JEE

Telegram
channel NOW!
Assignments
Notes
Daily Update

https://vdnt.in/JEEVedantu
Permutations and Combinations
Permutations and Combination

1. Fundamental Principle of Multiplication

2. Selection
3. Arrangement
4. Some special Problems
5. Circular arrangements
6. Distribution of Objects
 Fundamental Principle of
Multiplication
Say a “job” is done when subjob-1 & subjob-2 both are done in a
definite order. If number of ways of doing subjob-1 & subjob-2 are
m & n respectively then number of ways of doing the “job” is m × n.
Now, let’s do some basic problems to realize Fundamental Principle
of multiplication
In an exam there are 3 true/ false questions. In how many ways one can
attempt the paper if:
(a) Each question has to be attempted
(b) one can attempt or leave the question
(c) at least one question has to be attempted
In an exam there are 4 true/ false questions. In how many ways one can
attempt the paper if: (a) Each question has to be attempted

Ans: 8
Solution:

Here, each question has to be attempted and job is done when all the 3
questions are answered, also each question has two ways to answer
Thus, using fundamental principle of multiplication (FPM),
Number of ways = 2 × 2 × 2 = 8
In an exam there are 4 true/ false questions. In how many ways one can
attempt the paper if: (b) one can attempt or leave the question

Ans: 27
Solution:

Here either we can leave the question or can attempt the question
So there are three ways of attempting
Thus, using fundamental principle of multiplication (FPM),
Number of ways = 3 × 3 × 3 = 27
In an exam there are 4 true/ false questions. In how many ways one can
attempt the paper if: (c) at least one question has to be attempted

Ans: 26
Solution:

Out of 81 ways obtained in previous part, there

is only one way in which no question is
attempted. So ans is 27 − 1 = 26
How many ordered pairs (a, b) are there such that LCM of a & b is 23 × 52
How many ordered pairs (a, b) are there such that LCM of a & b is 23 × 52

Ans: 35
Solution:
For L.C.M to be 23 × 52
a and b should have one 23 and 52 in them
Possible powers of 2 in ‘a’ and ‘b’ are
(0, 3), (1, 3), (2, 3), (3, 3), (3, 0), (3, 1), (3, 2)
Thus total 7 ways
Similarly for 5, we have
(0, 2), (1, 2), (2, 2), (2, 0), (2, 1)
Thus total 5 ways
⸫ Using Fundamental principle of multiplication (FPM)
Total number of ways = 5 × 7 = 35
There are 6 questions, each having four options. In how many ways they
can be attempted such that no two consecutive questions are marked
with same options.
There are 6 questions, each having four options. In how many ways they
can be attempted such that no two consecutive questions are marked
with same options.

Ans: 972
Solution:
Here, First question can be done in 4 ways
Following it 2nd can be done in 3 ways
Following it 3rd can be done in 3 ways and so on
Remaining 4th, 5th and 6th can be done in 3 ways each

Total number of ways = 4 × 3 × 3 × 3 × 3 × 3 = 972

 JEE Main 22nd July, 2021 Shift-1
If the digits are not allowed to repeat in any number formed by using the
digits 0, 2, 4, 6, 8, then the number of all numbers greater than 10,000 is
equal to
 JEE Main 22nd July, 2021 Shift-1
If the digits are not allowed to repeat in any number formed by using the
digits 0, 2, 4, 6, 8, then the number of all numbers greater than 10,000 is
equal to

Ans: 96
Solution:

⇒ 4 × 4 × 3 × 2 = 96
How many 3 digit numbers less than 600 & divisible by 5 can be formed
using 0, 1, 2, 3, 4, 5, 9
(a) Repetition of digits not allowed (b) Repetition of digits allowed
How many 3 digit numbers less than 600 & divisible by 5 can be formed
using 0, 1, 2, 3, 4, 5, 9
(a) Repetition of digits not allowed
How many 3 digit numbers less than 600 & divisible by 5 can be formed
using 0, 1, 2, 3, 4, 5, 9
(a) Repetition of digits not allowed

Ans: 45
Solution:
For a number to be divisible by 5, it should have 0 or 5 in its one’s place

Case I: Case II:

= 5 × 5 × 1 = 25 numbers = 4 × 5 × 1 = 20 numbers

⸫ Total number = 20 + 25 = 45
How many 3 digit numbers less than 600 & divisible by 5 can be formed
using 0, 1, 2, 3, 4, 5, 9
(b) Repetition of digits allowed
How many 3 digit numbers less than 600 & divisible by 5 can be formed
using 0, 1, 2, 3, 4, 5, 9
(b) Repetition of digits allowed

Ans: 70
Solution:

For a number to be divisible by 5, it should have 0 or 5 in

its one’s place

= 5 × 7 × 2 = 70 numbers
Remark

If in the statement of question, you see “Either or” or “neither

nor” then always try using:
(a) n(A ∪ B) = n(A) + n(B) - n(A ∩ B)
(b) n(AC ∩ BC) = Total - n(A ∪ B)
It’s also called Inclusion-Exclusion principle
 JEE Main 31st Aug, 2021 Shift-2
The number of 4-digit numbers which are neither multiple of 7 nor
multiple of 3 is
 JEE Main 31st Aug, 2021 Shift-2
The number of 4-digit numbers which are neither multiple of 7 nor
multiple of 3 is

Ans: 5143
Solution: A = 4 - digit numbers divisible by 3
A = 1002, 1005, …, 9999.
9999 = 1002 + (n - 1)3
⇒ (n - 1)3 = 8997 ⇒ n = 3000
B = 4 - digit numbers divisible by 7
B = 1001, 1008, …, 9996
⇒ 9996 = 1001 + (n - 1)7
⇒ n = 1286
A ∩ B = 1008, 1029, …, 9996
9996 = 1008 + (n - 1) 21
⇒ n = 429
So, divisible by either 3 or 7
= 3000 + 1286 - 429 = 3857
Total 4-digits numbers = 9000
Required numbers = 9000 - 3857 = 5143
Primarily this chapter is all about:
(1) Selection
(2) Selection and arrangement
(3) Distribution

Result

Number of ways of arranging r-distinct objects at r-places is r!

Result
Number of ways of selecting ‘r’ objects out of n distinct objects
is nCr
Selection
Let’s do some examples on “nCr”
Four couples (husband and wife) decide to form a committee of four
members. Find the number of different committees that can be formed
in which no couple finds a place

A 12

B 14

C 16

D 24
Four couples (husband and wife) decide to form a committee of four
members. Find the number of different committees that can be formed
in which no couple finds a place

A 12

B 14

C 16

D 24
Solution:

The number of committees of 4 gentlemen = 4C4 = 1

The number of committees of 3 gentlemen, 1 wife = 4C3 × 1C1
(∵ after selecting 3 gentlemen only 1 wife is left who can be included)
The number of committees of 2 gentlemen, 2 wives = 4C2 × 2C2
The number of committees of 1 gentleman, 3 wives = 4C1 × 3C3
The number of committees of 4 wives = 1
∴ The required number of committees = 1 + 4 + 6 + 4 + 1 = 16
 JEE Main 8th Jan, 2020 Shift-1
An urn contains 5 red marbles, 4 black marbles and 3 white marbles.
Then the number of ways in which 4 marbles can be drawn so that at the
most three of them are red is ________.
 JEE Main 8th Jan, 2020 Shift-1
An urn contains 5 red marbles, 4 black marbles and 3 white marbles.
Then the number of ways in which 4 marbles can be drawn so that at the
most three of them are red is ________.

Ans: 490
Solution:

0 Red, 1 Red, 2 Red, 3 Red

Number of ways = 7C4 + 5C1. 7C3 + 5C2 . 7C2 + 5C3 . 7C1 = 35 + 175 + 210 + 70 = 490
 JEE Main 2020
There are 3 sections in a question paper and each section contains 5
questions. A candidate has to answer a total of 5 questions, choosing at
least one question from each section. Then the number of ways, in
which the candidate can choose the questions, is

A 2250

B 3000

C 1500

D 2255
 JEE Main 2020
There are 3 sections in a question paper and each section contains 5
questions. A candidate has to answer a total of 5 questions, choosing at
least one question from each section. Then the number of ways, in
which the candidate can choose the questions, is

A 2250

B 3000

C 1500

D 2255
Solution:

Each section has 5 questions.

∴ Total number of selection of 5 questions
= 3 × 5C1 × 5C1 × 5C3 + 3 × 5C1 × 5C2 × 5C2
= 3 × 5 × 5 × 10 + 3 × 5 × 10 × 10
= 750 + 1500
= 2250
In how many ways a team of 11 players can be selected out of 15
players such that:
(a) A particular player is never chosen
(b) Three particular players are always chosen
(c) Two particular players never come together in a team
In how many ways a team of 11 players can be selected out of 15
players such that:
(a) A particular player is never chosen
In how many ways a team of 11 players can be selected out of 15
players such that:
(a) A particular player is never chosen

Ans: 364
Solution:

Since a player is never chosen

Thus, selection will be taken from remaining 14 players

Number of ways = 15 - 1C11 = 14C11 = 364

In how many ways a team of 11 players can be selected out of 15
players such that:
(b) Three particular players are always chosen
In how many ways a team of 11 players can be selected out of 15
players such that:
(b) Three particular players are always chosen
Ans: 495
Solution:

Here 3 players are always chosen

Thus, selection of only 8 players are left out of
remaining 12 players
⸫ Number of ways = 15 - 3C11 - 3 = 12C8 = 495
In how many ways a team of 11 players can be selected out of 15
players such that:
(c) Two particular players never come together in a team
In how many ways a team of 11 players can be selected out of 15
players such that:
(c) Two particular players never come together in a team

Ans: 1794
Solution: Two particular players never come together such that
we can have a team without them or taking any one of
them
Thus, number of ways
 JEE Main 9th Jan, 2019 Shift-1
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys A and B, who refuse to be the members of
the same team, is:

A 500

B 200

C 300

D 350
 JEE Main 9th Jan, 2019 Shift-1
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys A and B, who refuse to be the members of
the same team, is:

A 500

B 200

C 300

D 350
Solution:

Since, the number of ways to select 2 girls is 5C2.

Now, 3 boys can be selected in 3 ways.
(a) Selection of A and selection of any 2 other boys ( except B) in 5C2 ways
(b) Selection of B and selection of any 2 two other boys ( except A) in 5C2 ways
(c) Selection of 3 boys ( except A and B) in 5C3 ways
Hence, required number of different teams
= 5C2 (5C2 + 5C2 + 5C3) = 300
Observation
Total number of selections out of ‘n’ distinct objects is 2n

Method I: nC0 + nC1 + nC2 + … + nCn = 2n

Method II: Every element can be dealt in two ways. Either it

will be selected or not. So, required ways are 2n
Consider a set A = {1, 2, 3, 4}
(a) Find number of subsets
(b) In how many ordered pairs (P, Q) can be made where
P & Q are subsets of A & P ∩ Q = ϕ
(c) How many ordered pairs (P, Q) can be made where P & Q
are subsets of A & P ∩ Q contains exactly one element
Consider a set A = {1, 2, 3, 4}
(a) Find number of subsets
Consider a set A = {1, 2, 3, 4}
(a) Find number of subsets

Ans: 16
Solution:

Given, A = {1, 2, 3, 4}

We need total number of selections

So, number of subsets = 24 = 16

Consider a set A = {1, 2, 3, 4}
(b) In how many ordered pairs (P, Q) can be made where
P & Q are subsets of A & P ∩ Q = ϕ
Consider a set A = {1, 2, 3, 4}
(b) In how many ordered pairs (P, Q) can be made where
P & Q are subsets of A & P ∩ Q = ϕ

Ans: 34
Solution:

Here, every element (let’s say x) can be dealt in

following 3 ways so that P ∩ Q = ϕ

∴ Number of ways = 34
Consider a set A = {1, 2, 3, 4}
(c) How many ordered pairs (P, Q) can be made where P & Q
are subsets of A & P ∩ Q contains exactly one element
Consider a set A = {1, 2, 3, 4}
(c) How many ordered pairs (P, Q) can be made where P & Q
are subsets of A & P ∩ Q contains exactly one element

Ans: 108
Solution:

The one common element can be selected in 4 ways

Remaining 3 elements each can be dealt in 3 ways each

(as in previous part)

⸫ Required number of ways = 4 × 33 = 4 × 27 = 108

Try to observe:
(a) Number of ways of selecting two A’s out of

A, A, A, A is _____

(b) Number of ways of selecting three letters out of

A, A, A, B, B, C, C, C is ______
In how many ways we can select four letters out of ‘ASSASSINATION’
In how many ways we can select four letters out of ‘ASSASSINATION’

Ans: 72
Solution:
Here we have
A ⟶ 3, S ⟶ 4, I ⟶ 2, N ⟶ 2, T ⟶ 1, O ⟶ 1
Four letter selection can be done as
(i) All distinct = 6C4 = 15
(ii) Two alike & two distinct = 4C1 × 5C2 = 40
(iii) Two alike & Two alike = 4C2 = 6
(iv) Three alike & one distinct = 2C1 × 5C1 = 10
(v) All alike = 1
∴ Total number of ways = 72
Now, lets see some geometrical counting problems based on nCr
There are ‘n’ points on a circle
(a) Joining these points, how many lines will be made
(b) Joining these points, how many triangles will be made
(c) Joining these points a polygon is made. Find number of
its diagonals
There are ‘n’ points on a circle
(a) Joining these points, how many lines will be made
Solution:

Two points correspond to one line

Thus from ‘n’ points on a circle

Total number of lines = nC2

There are ‘n’ points on a circle
(b) Joining these points, how many triangles will be made
Solution:

Three non-collinear points correspond to one triangle

Thus, from ‘n’ points on a circle

Total number of triangles = nC3

There are ‘n’ points on a circle
(c) Joining these points a polygon is made. Find number of
its diagonals
Solution:

For a diagonal which is a line we require two points, but

those selection will include sides of polygon also as they
are all formed by selecting two points

⸫ Number of diagonals of ‘n’ sided polygon is nC2 − n

Remark

Remember it as a result, that number of diagonals in n-sided

polygon in nC2− n
Consider 7 points, out of which 4 are collinear. Joining these points how
many lines will be made
Consider 7 points, out of which 4 are collinear. Joining these points how
many lines will be made

Ans: 16
Solution:

Method I
Given 4 points are collinear out of 7 points

Thus lines formed by these 4 points will be same line

Thus, total number of different lines = 7C2 - 4C2 + 1
= 21 - 6 + 1 = 16
Solution:

Method II
Given 4 points are collinear out of 7 points
∴ Total number of lines = 4C2 + 3C1 × 3C1 + 1
= 6 + 9 + 1 = 16
Consider 8 points, out of which 4 are collinear. Joining these points how
many quadrilaterals will be made

A 51

B 53

C 65

D None
Consider 8 points, out of which 4 are collinear. Joining these points how
many quadrilaterals will be made

A 51

B 53

C 65

D None
Solution:

Here for quadrilateral we need 4 points

Thus total number of quadrilateral

Given 6 horizontal & 5 vertical lines, how many rectangles & square will
be made by their intersection
Given 6 horizontal & 5 vertical lines, how many rectangles & square will
be made by their intersection
Given 6 horizontal & 5 vertical lines, how many rectangles & square will
be made by their intersection

Ans: 70
 Solution:

For rectangles
If we select any two horizontal line and any two
vertical lines will get a rectangle
⸫ Total number of rectangles = 6C2 × 5C2

For Squares
One by one squares = 6 × 5
(choosing two consecutive horizontal and vertical lines)
Two by two squares = 5 × 4
(Choosing two horizontal and vertical lines with the gap of one line)
 Solution:

Three by three squares = 4 × 3

(Choosing two horizontal and vertical lines with the gap of two lines)
Four by Four squares = 3 × 2
(Choosing two horizontal and vertical lines with the gap of three lines)
Five by Five squares = 2 × 1
(Choosing two horizontal and vertical lines with the gap of four lines)
⸫ Total number of squares = 6 × 5 + 5 × 4 + 4 × 3 + 3 × 2 + 2 × 1
= 30 + 20 + 12 + 6 + 2
= 70
Now, that we are completely equipped with nCr, let’s do some
examples using selection & arranging both together.
How many four letter words containing ‘G’ can be formed using letters
of DAUGHTER
(a) Repetition not allowed (b) Repetition allowed
How many four letter words containing ‘G’ can be formed using letters
of DAUGHTER
(a) Repetition not allowed
How many four letter words containing ‘G’ can be formed using letters
of DAUGHTER
(a) Repetition not allowed

Ans: 840
Solution: Method I
Four possibilities are there:

i.e. 4 ways and remaining 3 empty positions can be taken by remaining

7 letters in 7 × 6 × 5 ways
⸫ Total number of words = 4 × 7 × 6 × 5 = 840
Solution: Method II

Total number of four letter words formed by 8 letters

= 8 × 7 × 6 × 5 = 1680
All four letters word formed by 7 letters (except G)
= 7 × 6 × 5 × 4 = 840
⸫ Total words which have G = 1680 - 840 = 840
Solution: Method III

Here, G can accommodate in any of the four places, thus G has

4 ways 7 × 6 × 5 ways

Remaining 3 letters will be taken by remaining 7 letters in

⸫ Total number of ways = 4 × 7 × 6 × 5 = 840
How many four letter words containing ‘G’ can be formed using letters
of DAUGHTER
(b) Repetition allowed
How many four letter words containing ‘G’ can be formed using letters
of DAUGHTER
(b) Repetition allowed

Ans: 1695
Solution:
Total number of four letter words from given 8 letters

= 8 × 8 × 8 × 8 = 84

Also, number of four letter words from 7 given letters

(excluding G) = 74

⸫ Total number of words having G

= 84 - 74 = 4096 - 2401 = 1695

Ten different letters of an alphabet are given, words with five letters are
formed from these given letters. Then the number of words which have
at least one letter repeated is

A 69760

B 30240

C 99784

D None of these
Ten different letters of an alphabet are given, words with five letters are
formed from these given letters. Then the number of words which have
at least one letter repeated is

A 69760

B 30240

C 99784

D None of these
Solution:

Total number of words that can be formed = 105.

Number of words in which no letter is repeated = 10P5
So, number of words in which at least one letter is repeated
= 105 - 10P5 = 69760
Next example, is comprising of two very important standard
approaches.
We generally refer them as
(a) Gap method
(b) Block method
In how many ways 7 boys & 4 girls can be arranged in a row such that
(a) No two girls are together (b) All girls are together
(c) Not all girls are together
In how many ways 7 boys & 4 girls can be arranged in a row such that
(a) No two girls are together
Solution:

If four girls (Gi) are arranged between boys (Bi) then they will be
never together if they sit in gaps among boys
So arranging boys first: 7!
We get 8 gaps.
Select 4 gaps for girls: 8C4
Now arrange girls at these gaps: 4!
× B1 × B2 × B3 × B4 × B5 × B6 × B7 ×
⸫ Total number of ways = 8C4, × 4! × 7!
In how many ways 7 boys & 4 girls can be arranged in a row such that
(b) All girls are together
Solution:
Lets ‘tie’ all girls together and make them as one unit

Thus, now we have total 8 things to arrange and girls can

mutually arrange among themselves
⸫ Total number of ways = 8! × 4!
In how many ways 7 boys & 4 girls can be arranged in a row such that
(c) Not all girls are together
Solution:

Not all girls together = Total arrangement – All girls together

= 11! - 8! 4!
 JEE Main 2020
Two families with three members each and one family with four
members are to be seated in a row. In how many ways can they be
seated so that the same family members are not separated?

A 2! 3! 4!

B (3!)3 ⋅ (4!)

C (3!)2 ⋅ (4!)

D 3! (4!)3
 JEE Main 2020
Two families with three members each and one family with four
members are to be seated in a row. In how many ways can they be
seated so that the same family members are not separated?

A 2! 3! 4!

B (3!)3 ⋅ (4!)

C (3!)2 ⋅ (4!)

D 3! (4!)3
Solution:
Now, lets see the number of ways of arrangement if few objects are
alike
Result

Number of ways of arranging p elements in a row if out of ‘p’

objects ‘m’ are alike & ‘n’ are alike & rest are distinct, is given

by
Result

Number of ways of arranging p elements in a row if out of ‘p’

objects ‘m’ are alike & ‘n’ are alike & rest are distinct, is given

by

Eg: (a)

(b)

(c)

(d)
 JEE Main 2020
The number of words (with or without meaning) that can be formed from
all the letters of the word “LETTER” in which vowels never come
together is____.
 JEE Main 2020
The number of words (with or without meaning) that can be formed from
all the letters of the word “LETTER” in which vowels never come
together is____.

Ans: 120
Solution:
 JEE Main 26th Feb, 2021 Shift-1
The number of seven digit integers with sum of the digits equal to 10
and formed by using the digits 1, 2 and 3 only is

A 77

B 42

C 35

D 82
 JEE Main 26th Feb, 2021 Shift-1
The number of seven digit integers with sum of the digits equal to 10
and formed by using the digits 1, 2 and 3 only is

A 77

B 42

C 35

D 82
Solution:
 Some Special Problems
● Derangement
● Dictionary Problem
● Sum of Divisors and Exponent of Prime p in n!
Derangement Problems
Find number of derangements of 4 letters. How many ways are such that
only one letter goes to its own address.

Result

Derangement of n objects
Solution:

Derangement of 4 letters We require any one letters goes to its own

address, such that remaining three will derange
⸫ Number of ways
Dictionary Problems
Find rank of SURAT in dictionary made up of all the words 5 letter words
that can be formed using S, U, R, A, T; each letter used only once
Solution:

The letters of word SURAT in alphabetical order are

A, R, S, T, U
Thus words will be as follows
Solution:

Thus before word SURAT came

We will have

Thus rank of SURAT is 69

 JEE Main 2016
If all the words (with or without meaning) having five letters, formed
using the letters of the word SMALL and arranged as in a dictionary;
then the position of the word SMALL is

A 59th

B 52th

C 58th

D 46th
 JEE Main 2016
If all the words (with or without meaning) having five letters, formed
using the letters of the word SMALL and arranged as in a dictionary;
then the position of the word SMALL is

A 59th

B 52th

C 58th

D 46th
Solution:
Divisors, Sum of Divisors &
Exponent of Prime p in n!
For the number 24 × 32 × 53 find
(a) Number of divisors
(b) Number of proper divisors
(c) Number of even divisors
For the number 24 × 32 × 53 find
(a) Number of divisors
Solution:

Given, number

⸫ Number of divisors
For the number 24 × 32 × 53 find
(b) Number of proper divisors
Solution:

Number of proper divisors

= (4 + 1) (2 + 1) (3 + 1) − 1
= 60 − 1 = 59
For the number 24 × 32 × 53 find
(c) Number of even divisors
Solution:

For even divisors, we should take at least one 2

⸫ Number of even divisors

Find sum of all the divisors of 24 × 32 × 53

Result

Sum of all the divisors of am × bn × cq is

Solution:
Given, number is

⸫ Sum of all the divisors

Find exponent of:
(a) 2 in 50! (b) 3 in 50! (c) 6 in 50!
Find exponent of: (a) 2 in 50!
Solution:
Exponent of 2 in 50!
Find exponent of: (b) 3 in 50!
Solution:

Exponent of 3 in 50!
Find exponent of: (c) 6 in 50!
Solution:

Here, 6 is not prime

Thus exponent of 6 in 50! is minimum of exponent of 2 and 3 in 50!
∴ As solved above

Exponent of 2 in 50! is 47
Exponent of 3 in 50! is 22
∴ Exponent of 6 in 50! is 22
 Circular Arrangements

Result
Number of ways of arranging n distinct objects in a circle
is (n – 1)!
Remark

If clockwise & anticlockwise arrangements are

considered (as in necklace and Garland etc) than number

of arrangements are
Out of 10 beads, of different colour, how many necklace can be made,
containing 4 beads of different colours
Solution:

Out of 10 beads, of different colour,

necklace containing 4 beads are

In how many ways 6 boys & 4 girls can be arranged on circular table
such that
(a) all girls are together (b) no two girls are together
In how many ways 6 boys & 4 girls can be arranged on circular table
such that: (a) all girls are together
Solution:

Keeping all 4 girls together they will act as single person

Thus, number of arrangement on circular table is

In how many ways 6 boys & 4 girls can be arranged on circular table
such that: (b) no two girls are together
Solution:

Here,

There are 6 places between boys where if girls are

arranged then no girls will be together

⸫ Number of arrangements
Distribution of objects
Distribution of distinct objects
Result
Number of ways to distributing ‘n’ distinct objects among
‘m’ persons is mn

Remark

While distributing the distinct objects, always see the

number of options that a given object to be distributed has
Let’s try to understand it through examples
(a) In how many ways 5 distinct chocolates can be distributed among 4
students.
(b) In how many ways 3 distinct chocolates can be distributed among 4
students.
(c) If how many ways 3 distinct chocolates can be distributed among 4
students such that no student gets more than one chocolate.
(a) In how many ways 5 distinct chocolates can be distributed among 4
students.
Solution:

Here each chocolate can be distributed to 4

students in four ways

⸫ Total number of ways = 45

(b) In how many ways 3 distinct chocolates can be distributed among 4
students.
Solution:

Here each chocolate can be distributed to 4

students in four ways

⸫ Total number of ways = 43

(c) If how many ways 3 distinct chocolates can be distributed among 4
students such that no student gets more than one chocolate.
Solution:

Here, 3 students will get one chocolate each

Thus, total number of ways = 4C3 × 3! = 24
To be able to handle upcoming problems of distribution with
constraints, we need to learn “Formation of groups”
Formation of Groups:
Number of ways of forming groups (or packets) is as following:
Formation of Groups:
Number of ways of forming groups (or packets) is as following:
6 distinct books have to be distributed among Ram, Shyam and Gopal.
In how many ways it can be done such that
(a) Ram gets 1 book, shyam gets 2 books & Gopal gets 3 books.
(b) One gets 3 books, one gets 2 books & another one gets 1 book.
(c) Ram gets 4 books while shyam & Gopal gets 1 book each.
6 distinct books have to be distributed among Ram, Shyam and Gopal.
In how many ways it can be done such that
(a) Ram gets 1 book, shyam gets 2 books & Gopal gets 3 books.
Solution:

Ram gets 1 book, shyam gets 2 books and Gopal gets

3 books in
6 distinct books have to be distributed among Ram, Shyam and Gopal.
In how many ways it can be done such that
(b) One gets 3 books, one gets 2 books & another one gets 1 book.
Solution:

Here, any one gets 3 books, one gets 2 books and another
gets 1 book in
6 distinct books have to be distributed among Ram, Shyam and Gopal.
In how many ways it can be done such that
(c) Ram gets 4 books while shyam & Gopal gets 1 book each.
Solution:

Here, Gopal and shyam gets 1 book each, thus

this can be done as
In how many ways 8 passengers can be divided in 3 carriages such
that:
(a) Each carriage contains at least two passengers
(b) no carriage is empty
In how many ways 8 passengers can be divided in 3 carriages such that:
(a) Each carriage contains at least two passengers
Solution:

Since each carriage contain at least two passengers, then possible

cases are (2, 2, 4) or (2, 3, 3)

⸫ Number of ways
In how many ways 8 passengers can be divided in 3 carriages such that:
(b) no carriage is empty
Solution: Method I

No carriage is empty means every carriage has at least one

passenger.
This can be done as
(1, 3, 4), (2, 3, 3), (2, 2, 4), (5, 2, 1) or (6, 1, 1)
⸫ Number of ways
Solution: Method II

Number of ways
= Total number of ways
− (ways when only one carriage is empty)
− (ways when only 2 carriages are empty)
= 38 − 3(28 − 2 ) − 3(1)
Distribution of Alike objects
Distribution of Alike objects
Result
Number of ways of distributing ‘n’ identical objects among
‘r’ persons, if each person may receive any number of
objects is n + r - 1Cr - 1
Distribution of Alike objects
Result
Number of ways of distributing ‘n’ identical objects among
‘r’ persons, if each person may receive any number of
objects is n + r - 1Cr - 1

Eg: 10 Identical one rupee coins can be distributed among 3

beggars in 12C2 ways
Distribution of Alike objects
Result
Number of ways of distributing ‘n’ identical objects among
‘r’ persons, if each person may receive any number of
objects is n + r - 1Cr - 1

Eg: 10 Identical one rupee coins can be distributed among 3

beggars in 12C2 ways

Remark

This result is majorly applied in finding non-negative integral

solutions of equations
Find the number of integral solutions of:
(a) x + y + z = 10 ; x, y, z ≥ 0
(b) x + y + z = 10 ; x ≥ 1, y ≥ 0, z ≥ 0
(c) x + y + z = 10 ; x ≥ 2, y ≥ 1, z ≥ 0
(d) x + y + z = 10 ; x ≥ -2, y ≥ 1, z > 0
(e) x + y + z = 10 ; 1 ≤ x ≤ 3 ; y ≥ 0, z ≥ 0
(f) 2x + y + z = 6 ; x, y, z ≥ 0
Find the number of integral solutions of:
(a) x + y + z = 10 ; x, y, z ≥ 0
Solution:

Given,

⸫ Number of non-negative integral solution

Find the number of integral solutions of:
(b) x + y + z = 10 ; x ≥ 1, y ≥ 0, z ≥ 0
Solution:
Given,

Let

⸫ Number of non-negative integral solution

Find the number of integral solutions of:
(c) x + y + z = 10 ; x ≥ 2, y ≥ 1, z ≥ 0
Solution:
Given,

Let

∴ Number of non-negative integral solution

Find the number of integral solutions of:
(d) x + y + z = 10 ; x ≥ -2, y ≥ 1, z > 0
Solution:

Given,

Let

⸫ Number of non-negative integral solution

Find the number of integral solutions of:
(e) x + y + z = 10 ; 1 ≤ x ≤ 3 ; y ≥ 0, z ≥ 0
Solution: Given,

⸫ x can take values 1, 2, or 3

Case I: x = 1,

⸫ Number of integral solution

Case II: x = 2

⸫ Number of integral solution = 9

Solution:
Case III: x = 3

⸫ Number of integral solution = 8

⸫ Total number of solution = 10 + 9 + 8 = 27
Find the number of integral solutions of:
(f) 2x + y + z = 6 ; x, y, z ≥ 0
Solution:

Given,

⸫ Number of solutions = 3

⸫ Number of solutions = 7

⸫ Number of solution = 1

⸫ Total number of solutions

⸫ Number of solutions = 5
 JEE Main 2020

The total number of 3-digit numbers, whose sum of digits is 10, is____.
Solution:
x + y + z = 10, x ≥ 1, y ≥ 0, z ≥ 0
Let x - 1 = x’
x’ + y + z = 9, x’, y, z ≥ 0
Number of solutions are 9+3-1C2 = 11C2 =55
But for x’ = 9 ⇒ x = 10 which is not possible.
∴ Total required numbers = 55 - 1 = 54
Join Vedantu JEE
Telegram
channel NOW!
Assignments
Notes
Daily Update

https://vdnt.in/JEEVedantu