SCIENCE MANIA

Important Highlight of PnC

Subject: Mathematics

Made By:
Daksh Mishra
[Admin and Co-Founder of Science Mania]
[Bachelor of Technology, NIT Allahabad]
1. Permutation and Combination:

Permutation: Arrangement

No. of item, r arranged in arrow (order) = r!

Combination: Selection

No. of item, r from ‘n’ distinct items = 𝐶𝑟𝑛

Logic: Select and then arrange

𝑛!
= 𝐶𝑟𝑛 𝑥 𝑟! = (𝑛−𝑟)!𝑟! 𝑥 𝑟 ! = 𝑃𝑟𝑛

2. Total ways of selection :

Number of ways of selecting zero or more objects from n distinct objects = 2𝑛

Number of ways of selecting one or more objects from n distinct objects = 2𝑛 − 1

Number of ways of selecting zero or more objects from n identical objects= n+1

Number of ways of selecting one or more objects from n identical objects = n

3. Bag method and Alternative method:

Bag method: There are n distinct number of person or objects, from which n1,
n2…. so on, no. of object from n distinct item are grouped together, so no. of
ways of formation is:

= ( 𝒏 − 𝒏𝟏 − 𝒏𝟐 … − 𝒏𝒛 + 𝒁) (𝒏𝟏 )! (𝒏𝟐 )! … … (𝒏𝒛 )! whereas, Z= no. of group

item

We can learn this concept through two examples. Now, moving to first
instance.

First instance:
No. of word can be made from word ‘PENCIL’ such that:
a) When N and C are always together
 b) When N should come before C and N &C should be together

Let’ see part ‘a’ of first instance, in this case, no of group item (Z) is one which has 2
elements (N, C)
= (6 – 2 + 1) (2)! = 240
Such that N should always come before C (second part), then
= (6 – 2 + 1) (1!) = 120 ………. (permutation under constraint)

Second Instance (Alternative Method)

In how many ways 6 boys and 5 girls can sit in a row such that no 2 girls sit together.
So, we can solve this method by alternative method
|B|B|B|B|B|B|

= 𝐶57 𝑋 5 ! 𝑋 4!

4. Derangement:

𝟏 𝟏 𝟏 (−𝟏)𝒓 𝟏
D = r! ( 𝟏 − 𝟏! + − 𝟑! … + )
𝟐! 𝒓!

𝑫𝟎 = 𝟏
𝑫𝟏 = 𝟎
𝑫𝟐 = 𝟏
𝑫𝟑 = 𝟐
𝑫𝟒 = 𝟗
𝑫𝟓 = 𝟒𝟒

For instance, A person writes letters to five friends and addresses the corresponding
envelopes. In how many ways can the letter be placed in the envelopes so that: a) All
letters are in the wrong envelopes
b) At least three of them are in the wrong envelopes.
Part a) 𝐷5 𝐶55 = 44
Part b) 3 letter wrong + 4 letter wrong + 5 letter wrong
= 𝐷3 𝐶35 + 𝐷4 𝐶45 + 𝐷5 𝐶55 = (10)(2) + (5)(9) + (1)(44) = 109

5. Number Theory: Part 1 (Exponent of Prime)

We can calculate the exponent of prime using GIF method. Let us take
calculate of exponent of 7 in 100!

100 100 100

𝐸7 (100!) = [ ]+[ ]+[ ]
7 49 343

= 14 + 2 + 0 = 16

Now, lets proceed to another instance, find no. of zeros in 70!

For no. of zeros, we have to calculate exponent of their prime factor separately
(2 and 5)

70 70 70 70 70 70
𝐸2 (70!) = [ ]+[ ]+[ ]+ [ ]+[ ]+[ ]
2 4 8 16 32 64
= 35 + 17 + 8 + 4 + 2 + 1 + 0 = 67

70 70 70
𝐸5 (70!) = [ ]+[ ]+[ ]
5 25 125
= 14 + 2 = 16

No. of Zeros = min (𝐸2 (70!), 𝐸5 (70!) ) = 16

6. Number Theory: Part 2 (Divisor Concept)

We can understand concept of divisor using one illustration. Let’s take one
number, N= 12, so we can 12 as a factor of:

𝟏𝟐 = 𝟐𝟐 𝒙 𝟑 = 𝟐𝒑 𝑨𝒒 𝑩𝒓 …

No of divisor = (p+1) (q+1) (r+1) ... = (2+1) (1+1) … = 6

No of Even Divisor = (p) (q+1) (r+1) …. = (2) (1+1) =4

For even divisor, it must be divided by at least one factor of 2, total case will be p
(power of p)
No of Odd Divisor = (q+1) (r+1) … = (1+1) = 2

For odd divisor, it must not be divided by 2, so there will ONLY ONE case in
power of 2 which is ZERO.

Sum of divisor = (20 + 21 … + 2𝑝 )( 𝐴0 + 𝐴1 + 𝐴2 … + 𝐴𝑞 ) ( 𝐵 0 + 𝐵1 … 𝐵 𝑟 )

= (20 + 21 + 22 )(30 + 31 ) = 28

Sum of even divisor = (21 … + 2𝑝 )( 𝐴0 + 𝐴1 + 𝐴2 … + 𝐴𝑞 ) ( 𝐵0 + 𝐵1 … 𝐵 𝑟 )

For sum of even divisor, exclude the ONE case from sum of divisor which is the
zeroth power of 2.

Sum of odd divisor = (20 )( 𝐴0 + 𝐴1 + 𝐴2 … + 𝐴𝑞 ) ( 𝐵0 + 𝐵1 … 𝐵 𝑟 )

For sum of odd divisor, include only ONE case from summation of different
power of 2 in sum of divisor which is the zeroth power of 2.

Let’s proceed to take another number to understand complex concept related to

divisor theory,

𝑁 = 25 𝑥 34 𝑥 57 𝑥 72 = 2𝑝 𝐴𝑞 𝐵 𝑟 …

Number of divisor divisible by 5 = (p+1) (q+1) … (r) … (t+1) = (5+1) (4+1) (7)
(2+1) = 630

For divisor to be divisible by 5, it must be divided by at least one factor of 5

excluding one case of 5 (zeroth power of 5)

Number of divisor divisible by 10 = (5) (4+1) (7) (2+1) = 510

For divisor to be divisible by 10, it must be divided by at least one factor of each
prime factor excluding two cases of 10 (zeroth power of 5 and 2 both).

For No. of ways of representing N as product of two numbers

𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑑𝑖𝑣𝑖𝑠𝑜𝑟
=
2
𝑖𝑓 𝑁 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑝𝑒𝑟𝑓𝑒𝑐𝑡 𝑠𝑞𝑢𝑎𝑟𝑒
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑑𝑖𝑣𝑖𝑠𝑜𝑟+1
= 2
𝑖𝑓 𝑁 𝑖𝑠 𝑎 𝑝𝑒𝑟𝑓𝑒𝑐𝑡 𝑠𝑞𝑢𝑎𝑟𝑒
 Q. A natural number has a prime factorisation given by 𝒏 = 𝟐𝒙 𝟑𝒚 𝟓𝒛 , where y
𝟓
and z are such that y+z=5 and 𝒚−𝟏 + 𝒛−𝟏 = 𝟔 , 𝒚 > 𝒛. Then the number of odd
divisors of n, including 1, is:

[JEE Main 2021]

7. Two theorems of PnC: Exclusivity and Inclusivity

First theorem: Number of combinations of n different things taken r at a time

when p particular thing are always included,

𝑛−𝑝
= 𝐶𝑟−𝑝

This theorem is also known as Inclusivity.

Second theorem: Number of combinations of n different things taken r at a time

when p particular thing is always excluded,

𝑛−𝑝
= 𝐶𝑟

This theorem is also known as Exclusivity.

For instance, find the total numbers of ways of selecting 11 players out of 15
player such that:
(a) when M.S. Dhoni and Yuvraj Singh are always included
(b) when Shubham Gill and Virat Kohli are always excluded

part (a), No of ways of selecting

𝑛−𝑝
= 𝐶𝑟−𝑝 = 𝐶913

part (b), No of ways of selecting

= 𝐶𝑟𝑛−𝑝 = 𝐶11
13

8. Summation of Numbers:
 Case 1: Let’s take n, no. of digit such as 𝑥1 , 𝑥2 , 𝑥3 … 𝑥𝑛 with no repetition and
without zero, then sum of all number made from n-digit, will be:

= (111 … n times) (𝑥1 + 𝑥2 + 𝑥3 … + 𝑥𝑛 ) (𝑛 − 1)!

Case 2: Let’s take n, no. of digit such as 𝑥1 , 𝑥2 , 𝑥3 … 𝑥𝑛 with Zero included but no
repetition allowed, then sum of all number made from n-digit, will be:

= [Case 1] - (111 … [n-1] times) (𝑥1 + 𝑥2 + 𝑥3 … + 𝑥𝑛 ) (𝑛 − 2)!

Case 1: Let’s take n, no. of digit such as 𝑥1 , 𝑥2 , 𝑥3 … 𝑥𝑛 with repetition such as

𝑥1 𝑟𝑒𝑝𝑒𝑎𝑡𝑒𝑑 𝑛1 , 𝑥2 𝑟𝑒𝑝𝑒𝑎𝑡𝑒𝑑 𝑛2 and so on, then sum of all number made from n-
digit, will be:

= (111 … n times) (𝑥1 + 𝑥2 + 𝑥3 … + 𝑥𝑛 ) (𝑛 − 1)!/𝑛1! 𝑛2!

9. PnC in 2-D geometry:

Illustration 1: There are 10 points in a plane such that:

a) No. of line such that no two points are collinear

= 𝐶210

b) No. of line such that 4 points are collinear

= 𝐶210 − 𝐶24 + 1

c) No. of triangle possible such 4 point are collinear

= 𝐶310 − 𝐶34
d) No. of quadrilateral such that 4 points are collinear

= 𝐶410 − 𝐶44

Illustration 2: There are 10 points in a plane of which no 3 points are collinear

and 4 points are concyclic. The number of different circles that can be drawn through
3 points:
 = 𝑪𝟏𝟎 𝟒
𝟑 − 𝑪𝟑 + 𝟏

Illustration 3: There are 3 co-planar parallel lines. If any n points are taken on
each of the lines, the max. no. of triangles with vertices as these points:
Case 1: One vertex on each line
= 𝐶1𝑛 𝑥 𝐶1𝑛 𝑥 𝐶1𝑛

Case 2: 2 vertices on one line and 1 from another:

= (𝐶2𝑛 𝑥 𝐶12𝑛 ) 𝑥 3

Max. no. of triangle = Case 1 + Case 2

Illustration 4: The number of triangles whose vertices are at vertices of an

octagon but none of whose sides happen to come from the sides of the octagon
Total triangle possible
= 𝐶38
One side common
= 𝐶18 𝑥 𝐶14
Two side common
=8

So, no. of triangle according to condition of question

= 𝐶38 −𝐶18 𝑥 𝐶14 − 8 = 16

Illustration 5: No. of integer enclosed by x+y = 21, x=0, and y=0, will be =

(𝒏 − 𝟏)(𝒏 − 𝟐) 𝟏𝟗
= 𝟐𝟎 𝒙 = 𝟏𝟗𝟎
𝟐 𝟐
10. Total way of distribution and Beggar Methods:

Let us understand this with one illustration. There are 5 multiple choice questions
with 4 options each of which one is correct. In how many ways it can be
answered such that all question’s answer is not correct?

Total ways of answering = 45 = 1024

When all question is not answered correctly, then no. of ways = 45 − 1 =

= 1024 − 1 = 1023

Now, let’s proceed to another instance, find the no. of ways in which n distinct
balls can be put into 3 boxes so that no two boxes are empty.

Suppose, 1 distinct ball have three option to put into any of 3 boxes

so for n distinct ball, no. of ways for distribution will be 3𝑛

Such that other two boxes don’t remain empty, then

Finally, no. of ways will be 3𝑛 − 3

What if ball is identical instead of distinct, then we will apply beggar method such
that no two boxes remain empty, so

𝑛−1
= 𝐶𝑟−1 = 𝐶2𝑛−1

If any one or two boxes can remain empty, then beggar formula for this condition
will be:

𝑛+𝑟−1
= 𝐶𝑟−1 = 𝐶2𝑛+2

Illustration 1: The no. of ways in which the examiner can assign 30 marks to 8
questions giving not less than 2 marks to any question, is:

First, assigned 2 marks to all question (8 x 2 =16) and then, apply beggar method
to rest of 14 marks (30-16) such that some question may or may not be assigned
one more mark, so

14+8−1 21
= 𝐶8−1 = 𝐶𝑟−1
11. Integer problem under constraint: Beggar problem

Illustration 1: Find a number of positive solutions of x+y+z less than or equal to

10.

𝑥 + 𝑦 + 𝑧 ≤ 10
𝑥 + 𝑦 + 𝑧 + 𝑤 = 10

Every variable must be greater than or equal to 1, then no. of + integral solution
will be
= 𝐶310

Illustration 2: The number of points in space whose each coordinate is a negative

integer such that x+y+z+12=0

x+y+z = -12; 𝑥, 𝑦, 𝑧 ∈ ℤ −

X+Y+Z = 12; X= -x, Y= -y, Z= -z and 𝑋, 𝑌, 𝑍 ∈ ℤ +

So, no. of positive integral solutions for X, Y, Z (negative for x, y, z) will be

= 𝐶211 = 55

12. Circular Permutation:

For n, no. of objects, arranged in a circular path, no. of ways of arranging is:

= (n-1)!

Illustration: 20 people are invited to a party. 2 particular people sit on either side
of the host. Find the no. of ways.

According to the question, P1, H, and P2 should be together such two particular
sit on either side of the host.

Then, by beggar method, no. of a group will be 19 (21-3+1)

So, by circular permutation, no. of such arrangement is (19-1)! X 2! = 18! X 2!

13. Dictionary problem and Finding Rank (With trick):

Case 1: Finding the rank of a word with a non-repetitive letter, for example,
MOTHER
 Case 2: Finding the rank of a word with repetitive letters, for example, MNNIT

14. PnC for finding no. of one-one function:

For a function defined as A(m) → B(n) whereas A and B are 2 sets consisting of m
and n elements respectively.

Then, no. of one-one function is

𝑛
= 𝐶𝑚 x m!
Basic Standard Illustration

Illustration 1: For a set of 5 true/ false questions, no student has written all correct
answers, and two students have given the same sequences of answers. What is the
maximum no. of students in the class for this to be possible?

Total Sequences possible = 25

Excluding one case of answering all questions correctly, then no. of max student possible
= 32 – 1 = 31

Illustration 2: Four dice are rolled. The number of ways in which at least one dice
shows 3:

= Total ways – no 3
= 64 − 54
= (62 − 52 )(62 + 52 )
= (6+5) (36+25) = 671

Illustration 3: 2 different packs of cards are shuffled together. Cards are dealt equally
among 4 players, each getting 13 cards. The number of ways in which a player get his
cards if no two cards are from the same suit with same denomination
There are a total of 104 cards. Out of which, 52 cards are distinct. Each card can draw
from two different packs (2 cases possible for each distinct card), so no. of ways

52
= 𝐶13 𝑋 213

Illustration 4: The number of different matrices that can be formed with elements
0,1,2,3 and each matrix having 4 elements, is:
There are 3 possible orders [ 2x2, 1x4, 4x1].
The element of the Matrix of each order can be filled in 44 ways.

So, the total no. of matrices possible is 3 𝑥 44

Illustration 5: The total number of 4-digit numbers in which the digits are in
descending order is:
Only one arrangement is possible while choosing any 4 numbers such that they are in
descending order, so no. of 4 digits is

= 𝐶410
For ascending order, zero cannot be in the first place of 4-digit no. So, no. of 4 digits
possible with one arrangement is
= 𝐶49

Illustration 6: If n objects are arranged in a row, then, the number of ways of selecting 3
objects such that no two of them are next to each other
So, by bag method, no. of the group is n-3+1 ([p1, S (space), p2], p3, p4, p5 … ]

By beggar method, no. of way selecting 3 objects is

= 𝐶3𝑛−2
Illustration 7: The number of 6-digit numbers possible that can be made with digits
0,1,2,3,4,5 so that even digits occupy odd places

= (3! -2!) x 3! = 24

Illustration 8: The total number of times the digit 3 will be written when listing from
1 to 1,000

Case 1: 3 appears exactly one:

= 𝐶13 𝑥 9 𝑥 9

Case 2: 3 appears exactly twice:

= 𝐶23 𝑥 9
Case 3: 3 appears exactly thrice:
=1

Illustration 9: At an election, a voter can vote for any number of candidates not
greater than the number to be elected. There are 10 candidates and 4 to be elected. If a
voter votes for at least one candidate, then the number of ways in which he can vote

= 𝐶110 + 𝐶210 + 𝐶310 + 𝐶410 = 385

Illustration 10: There are 3 sections in a question paper each containing 5 questions.
A candidate has to solve only 5 questions choosing at least one question from each
section. In how many ways can we do this?

= 3 x (𝐶15 𝑥 𝐶15 𝑥 𝐶35 ) + 3 x (𝐶15 𝑥 𝐶25 𝑥 𝐶25 ) = 2250

Illustration 11: 18 guests have to be seated half on each side of a long table. Four
particular guests desire to sit on one particular side and 3 others on the other side.
The number of ways in which the seating can be made:

First, make 4 people sit on one side and 3 on the other side, then the rest of 11 people
can sit on either side of the table such that
= (𝐶511 𝑥 𝐶66 𝑥 9! 𝑥 9!)

Illustration 12: It is required to seat 7 men and 3 women in a row such that women
occupy even places. How many such arrangements are there?
5
= (𝐶33 𝑥 3! 𝑥 𝐶77 𝑥 7!)

Illustration 13: The total number of five-digit numbers with at least one repeating
digit:

= Total 5-digit number – None

= 9 x 10 x 10 x 10 x10 – 9 x 9 x 8 x 7 x 6 = 62784
**********************