1

SHAURYA 1.0
Permutations and Combinations - Permutations DPP: 3.1

1. If (n + 1)! = 12 × [(n – 1)!] find the value of n. 11. If = LCM of 8! 10! and 12! and h = HCF of 8! 10!
(a) 2 (b) 3
(c) 4 (d) 5 and 12!, then is equal to
h
(a) 132 (b) 11880
2. What is the smallest natural number n such that n! is (c) 11800 (d) None of these
divisible by 990?
(a) 9 (b) 99 12. The number of numbers less than 1000 that can be
(c) 33 (d) 11 formed out of the digits 0, 1, 2, 3, 4 and 5, no digit
being repeated, is
3. If 7pn = 60 7pn–3 then the value of n is (a) 72 (b) 90
(a) 5 (b) 6 (c) 121 (d) 131
(c) 9 (d) 8
13. The total number of words that can be formed using
4. What is the value of r if P (5, r) = P (6, r – 1)? all letters of the word ‘RITESH’ that neither begins
(a) 9 (b) 5 with I nor ends with R, is
(c) 4 (d) 2 (a) 540 (b) 450
(c) 504 (d) 405
5. If 56Pr+6: 54Pr+3 = 30800: 1 then the value of r is
(a) 41 (b) 31 14. Statement-1 A number of four different digits is
(c) 51 (d) 32 formed with the help of the digits 1, 2, 3, 4, 5, 6, 7 in
all possible ways. The number of ways which are
6. Find the number of permutations of the letters of the exactly divisible by 4 is 200.
word ALLAHABAD. Statement-2 A number divisible by 4, if units place
(a) 7560 (b) 7550 digit is also divisible by 4
(c) 6560 (d) 7760 (a) Statement-1 is true, Statement-2 is true
Statement-2 is a correct explanation for
7. What is the number of ways of arranging the letters of Statement-1
the word 'BANANA' so 'that no two N's appear (b) Statement-1 is true, Statement-2 is true;
together? Statement-2 is not a correct explanation for
(a) 40 (b) 60 Statement-1
(c) 80 (d) 100 (c) Statement1 is true, Statement-2 is false
(d) Statement-1 is false, Statement-2 is true
8. What is the number of ways that 4 boys and 3 girls
can be seated so that boys and girls are alternate? 15. There are five points A, B, C, D and E. No three
(a) 12 (b) 72 points are collinear and no four are concyclic. If the
(c) 120 (d) 144 line AB intersects of the circles drawn through the
five points. The number of points of intersection on
9. The number of ways in which 10 candidates the line apart from A and B is
A1, A2, …, A10 can be ranked so that A1 is always (a) 6 (b) 7
above A2 is (c) 8 (d) 9
(a) 11! (b) 5!
10! 16. How many 5-digit telephone numbers can be
(c) 10! (d)
2 constructed using the digits 0 to 9, if each number
starts with 67 and no digit appears more than once?
10. How many numbers greater than 1000000 can be (a) 180 (b) 336
formed using the digits 1, 2, 0, 2, 4, 2, 4? (c) 320 (d) 360
(a) 180 (b) 60
(c) 120 (d) 360

Join our telegram https://t.me/pwdefencewallah

 2

17. In how many different ways can the letters of the 19. If the letters of the word SACHIN arranged in all
word ‘HAPPY’ be arranged? possible ways and these words are written out as in
(a) 60 (b) 180 dictionary, then the word SACHIN appears at series
(c) 120 (d) 360 number
(a) 540 (b) 601
18. How many 3-digit number formed by using digit (c) 860 (d) 430
0, 6, 7, 8, 9
(a) 40 (b) 48 20. The number of integers greater than 6000 that
(c) 16 (d) 12 can be formed using the digits 3, 5, 6, 7 and 8 without
repetition
(a) 192 (b) 160
(c) 154 (d) 72

Join our telegram https://t.me/pwdefencewallah

 3

Answer Key
1. (b) 11. (b)
2. (d) 12. (d)
3. (a) 13. (c)
4. (c) 14. (c)
5. (a) 15. (c)
6. (a) 16. (b)
7. (a) 17. (a)
8. (d) 18. (b)
9. (d) 19. (b)
10. (d) 20. (a)

Join our telegram https://t.me/pwdefencewallah

 4

Hints and Solutions

1. (b) (7 – r) × (6 – r) = 6
Calculation: (7 – r) × (6 – r) = 3 × 2
(n + 1)! = 12 × [(n – 1)!] (7 – r) × (6 – r) = (7 – 4) × (6 – 4)
∵ n! = (n) × (n – 1) × (n – 2) × (n – 3) ... 3 × 2 × 1 r=4
⇒ (n + 1) × (n) × [(n – 1)!] = 12 × [(n – 1)!]
⇒ (n + 1) × (n) = 12 ⇒ n2 + n = 12 5. (a)
Calculation:
⇒ n2 + n – 12 = 0 56
Pr + 6 30800
⇒ (n – 3) (n + 4) = 0 54
=
⇒ n = 3 or, n = –4 Pr +3 1
But, n = –4 is not possible because factorial (!) cannot 56! (30800)  54!
 =
be negative. (56 − r − 6)! (54 − r − 3)!
∴ n = 3 is the correct answer 56 × 55 × (51 – r) = 30800
30800
2. (d)  (51 – r) = = 10  r = 51 – 10 = 41
Calculation: 56  55
We can write 990 = 2 × 3 × 3 × 5 × 11
= 11 × 10 × 9 6. (a)
 If n have a factor of 11, 10 and 9 then it will be Calculation:
divisible by 990 There are 9 letters of which there are 4As, 2 Ls and
∴ Smallest value of n will be 11 because 11! contain rest are all different.
all factors of 990 9!
∴ The required number of arrangements =
So, n! = 11! 4!  2!
3. (a) (1  2  3  4  5  6  7  8  9)
= = 7560
Calculation: (1  2  3  4  1  2)
7
pn = 60 7pn–3
7! 7! 7. (a)
 =60 ×
(7 − n)! (7 − (n − 3))! Calculation:
Due to the repetitions of A and N, the total number of
1 1
 = 60 × 6!
(7 − n)! (10 − n)! permutations will be:
3!2!
1 1 Now, taking out the two N’ s together.
 = 60 ×
(7 − n)! (10 − n)(9 − n)(8 − n)(7 − n)! It is seen as: NNBAAA
⇒ (10 – n) (9 – n) (8 – n) = 5 × 4 × 3 Over here NN are taken as one block.
⇒ (10 – n) (9 – n) (8 – n) = (10 – 5) (9 – 5) (8 – 5) 5!
So, we get:
∴n=5 3!
It is only because of the repetitions of three A’s.
4. (c) 6! 5!
Calculation: Then, the required permutation is: −
3!2! 3!
n! = 60 – 20 = 40
P (n, r) = nPr =
(n − r)!r!
∴ P (5, r) = P (6, r – 1) 8. (d)
5! 6! Calculation:
= The only pattern in which they can sit according to
(5 − r)! (6 − r + 1)! the given sit situation is, BGBGBGB
5! 6  5! Now boys can be arranged among themselves in 4!
=
(5 − r)! (7 − r)! ways and girls among themselves in 3! ways
1 6 So, total number of ways
= = 4! × 3! = 144
(5 − r)! (7 − r)  (6 − r)  (5 − r)!

Join our telegram https://t.me/pwdefencewallah

 5

9. (d) 12, 16, 24, 32, 36, 52, 56, 64, 72, 76.
Calculation: Total 10 ways.
The candidates can be ranked in 10! ways. In half of Now, the remaining two first places on the left of 4-
these ways, A1 is above A2 and in another half, A2 is digit numbers
above A1. are to be filled from remaining 5 digits and this can be
10! done in
So, required number of ways = P (5, 2) = 20 ways.
2
∴ Required number of ways = 20 ×10 = 200
10. (d) ∴ Statement-1 is true and Statement-2 is false.
Calculation:
The numbers have to be greater than 1000000, so they 15. (c)
can begin either with 1, 2 or 4. Calculation:
When 1 is fixed at the extreme left position, the Number of circles through ACD, ACE, ADE intersect
remaining digits to be rearranged will be 0, 2, 2, 2, 4, the line AB = 3 and Number of circles through BCD,
4, in which there are 3, 2s and 2, 4s. BCE, BDE intersect the line AB = 3 and
Thus, the number of numbers beginning with 1 Number of circles through CDE intersects the line
6! AB = 2
= = 60 Hence, number of points of intersection
(3!2!)
=3+3+2=8
6!
The total numbers begin with 2 = = 180
(2!2!) 16. (b)
6! Calculation:
Similarly, the total numbers beginning with 4 = Let ABCDE be a five-digit number.
3!
the first will be two digits of each number are 6 and 7.
= 120
Therefore, the required number of numbers ∴ the number is 67CDE.
= 60 + 180 + 120 = 360 As repetition is not allowed and 6 and 7 are already
taken, the digits
11. (b) available for place C are 0, 1, 2, 3, 4, 5, 8, 9, i.e. eight
Calculation: possible digits.
l = LCM (8!, 10! and 12!) = 12! and Suppose one of them is taken at C, now the digits
h = HCF of 8!, 10! and 12! = 8! possible at place D is 7.
l 12! Similarly, at E, the possible digit is 6.
∴ = = 12 × 11 × 10 × 9 = 11880 Therefore, the total five-digit numbers with given
h 8! conditions = 8 × 7 × 6 = 336.
12. (d) 17. (a)
Calculation: Calculation:
1-digit number less than 1000 = 6 HAPPY = 5 Letter word with letter "P" repeating two
2-digit number less than 1000 = 5 × 5 times
3-digit number less than 1000 = 5 × 5 × 4 So, No. of ways 5 letters word can be arranged with a
So, total number of numbers less than 1000 is 5!
6 + 5 × 5 + 5 × 5 × 4 =131 letter repeating itself 2 times = = 60
2!
13. (c)
Calculation: 18. (b)
All possible word = 6! Calculation:
there are 5! word which is begins with I and 5! word we have 4-digit 0, 6, 7, 8, 9
which is ends with R and 4! word which both So, first place can be filled by 4 way (0 con not be in
So, Required Number =6! – 5! – 5! + 4! = 504 first place)
Second place can be filled by 4 way and third place
14. (c) can be fill by 3 way
Calculation: ∴ Total 3-digit number will be
For the number exactly divisible by 4, then last two = 4 × 4 × 3 = 48
digits must be divisible by 4, the last two digits are

Join our telegram https://t.me/pwdefencewallah

 6

19. (b) 20. (a)

Calculation: Calculation:
Words starting with A, C, H, I, N are each equal to 5! Four-digit numbers can be arranged in
∴ Total words = 5 × 5! = 600 3 × 4! = 72 ways and five-digit numbers can be
The first word starting with S is SACHIN arranged in 5! = 120 ways
∴ SACHIN appears in dictionary at serial number ∴ Number of integers = 72+ 120= 192
601

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if

Join our telegram https://t.me/pwdefencewallah