Solution of question bank on Permutation and Combination

#1

n  n 
 10    15   n  10  15  n  25
   
 27  27!
    351
 25  25! 2 !

#2

n   n
LHS :  
 r  1  r 
n! n!
 
(r  1)! n  r  1! r ! n  r !
n! n!
 
(r  1)! n  r  1  (n  r )! r  (r  1)!  n  r !
n!  1 1
 
(r  1)!(n  r )!  n  r  1 r 
n! r  n  r  1

(r  1)!(n  r )!  (n  r  1)r 
n!  n 1 

(r  1)!(n  r )!  r (n  r  1) 
(n  1)!  n  1
   RHS
r !(n  r  1)!  r 
#3

 15   15 
 3r    r  3   either 3r  r  3 or 3r  r  3  15  r  3
   

1
#4
P(9,5)  5  P(9,4)  P(10, r )
9! 9! 10!
  5 
4! 5! (10  r )!
9! 9! 10  9!
  5 
4! 5  4! (10  r )!
 r  5 on simplification

#5
 n   n  3
 6  :  3   33: 4
   
n! n  3!
 :  33: 4
6! n  6 ! 3! n  6 !
n! 3!(n  6)! 33
  
6! n  6 ! (n  3)! 4
n(n  1)(n  2)(n  3)! 3! 33
  
6! (n  3)! 4
 n(n  1)(n  2)  990
 n3  3n2  2n  990  0
n  11 USE GDC

2
#6
P(56, r  6): P(54, r  3)  30800 :1
56! 54!
:  30800 :1
(50  r )! (51  r )!
56! (51  r )! 30800
  
(50  r )! 54! 1
56  55  54! (51  r )(50  r )!
   30800
(50  r )! 54!
 51  r  10
 r  41

#7
P(n, r )  p(n, r  1)
n! n!
 
(n  r )! (n  r  1)!
n! n!
 
(n  r )(n  r  1)! (n  r  1)!
 n  r  1    (a)
also
n n 
 r    r  1
   
n! n!

r ! n  r ! (r  1)! n  r  1 !
nr 1 r
n  2r  1    (b)
On solving (a) and (b)
n  3& r  2

3
#8
(i)10!
(ii)9!
(iii)8!

(iv)
Total there are 10 letters. When we consider vowels AEUI together as single letter
then we have altogether 7 different letters and they can be arranged in 7! Ways
but vowels themselves can be arranged in 4! Ways but still together, hence using
FPC, WE HAVE
7! 4!ways

(v)
Consider EHP together as single letter. The number of permutations when they
are together will be
8! 3!
Hence number of permutations when they are not together will be
10! 8! 3!
(vi)
Total there are five even places and 4 vowels can be arranged in these five even
places will be P(5,4) and in remaining 6 places, the 6 letters can be arranges in
P(6,6) WAYS.
Hence total number of permutations will be P(5,4)XP(6,6)
(VII)
There are six consonants and 4 vowels.
So first select 3 consonants out of 6 and 2 vowels out of 4 then arrange them.

6 4
 3    2   5!
   

4
#9
Total there are 8 letters of which 5 are vowel and 3 are consonants. In all the
words first place can be occupied by 3 ways and last one with 2 ways. Now still we
have 6 letters left and they can be arranged between those two consonants in 6!
Ways.
Total number of words will be 3  6! 2  4320

#10
(i)
Total there are 4 vowels and 4 consonants.
So there are four odd places which can be occupied by four vowels in 4! Ways and
similarly in the remaining four places 4 consonants can be arranged in 4! Ways.
Total number of words will be 4! 4!  576
(ii)
When four consonants are together. Consider them as a single letter. So
altogether we have 5 different letters and they can be arranged in 5! Ways. But
four consonants themselves can be arranged in 4! Ways.
Hence total words= 5! 4!  2880
(iii)
O and E can be fixed in the beginning and in the end. Remaining six letters can be
arranged in 6! Ways.

5
#11
Six vowels and six consonants.
I-2
T-2
E-3
Remaining five different letters.
Total number of permutations considering the repetition
12!
2! 2! 3!
Now consider all the vowels together as single letter then number of letters are 7
7!
in which a consonant T occurs twice, so total permutations are . Vowels
2!
6!
themselves can be arranged in ways .
2! 3!
7! 6!
Hence total permutations when vowels are together will be  .
2! 2! 3!
Now total permutations when vowels never come together will be
12! 7! 6!
-  =151200
2! 2! 3! 2! 2! 3!
#12
Total there are 14 letters of which we have 5 vowels and 9 consonants.
V-1,I-1,C-3,E-2,H-1,A-1,N-1,L-2,O-1,R-1
Total number of permutations keeping repetition in mind
14!
3! 2! 2!
Number of permutations when vowels are together. Consider them as single
letter so we will have 10 letters in which c repeats three times and L two times.

6
They can be arranged in the following ways. HERE we should note that vowels
themselves can be arranged and E repeats two times.
10! 5!

3! 2! 2!
HENCE number of permutations when vowels are never together will be
14! 10! 5!
-  simplify it
3! 2! 2! 3! 2! 2!

#13
Total there are six letters of which A repeated thrice, N twice and B ones.
Therefore total number of permutations will be
6!
 60
3! 2!

#14
Total there are nine letters of which A is repeated four times and L twice.
Therefore total number of permutations are
9!
 7560
3! 2!

There are five consonants and four vowels all A’s. Out of the five consonants L is
repeating twice. Four vowels can be arranged in four even places in only one way
as all vowels are the same. Five consonants can be arranged in five odd places in
5!
ways.
2!
5!
Therefore total number of words will be  60
2!

7
#15
(a) HARYANA has 7 letters of which A is repeated thrice.
7!
Total number of words =  840
3!
(b) Consider H and N together as single letter. Now total letters are 6 of which
A is repeated thrice.
Therefore total number of permutations when H and N are together will be
6!
 2!  240 (Remember H and N themselves can be arranged in 2! Ways)
3!
© Then there are only five letters left after fixing H and N of which A is repeated
thrice.
5!
 20
3!

#16
(a) Total number of different letters are 8 in the word EXAMINATION. Choosing
8 
4 letters out of 8 can be done in   ways and then arranging them in 4!
4
Ways.

8 
Therefore    4!  1680
4
#17
All will be a four digit numbers. Unit digit should be filled by 5 only as we want
number to be divisible by 5. Remaining two digits in the middle can be filled by
any of the four numbers in P(4,2) ways i.e. 12 ways. Hence there will be 12
numbers.
#18
No zeroes in the beginning so first digit from the left will be filled by 5 ways.
Remaining five places can be filled by any of the five digits in 5! Ways.

8
Hence possible numbers will be 5  5!  600
(i) If unit place is filled with 0 then remaining five numbers can be arranged
in 5! Ways.
Therefore total numbers will be 120.

(ii) Divisible by 5 only when unit place is either 0 or 5.

When unit place is filled with 0 then there will be 5! Numbers. When
unit place is filled with 5 then
4 4 3 2 One One
ways ways ways ways way way
i.e
5

Therefore number of ways will be 96.

Hence total number of ways will be 96  5!  216
(iii) 600- those which are divisible by 5
 600  216  384

#19
The first digit at the left cannot be 0 so this place can be filled in 9 ways with any
of the 9 digits and rest of the 8 places can be filled with 9! Ways.
Hence total 9 digit numbers will be 9  9!
#20
Case1 : Numbers starting by 2 and greater than 23000 will be as follows;
One 3 ways 3 2 1
way as 1 ways ways way
cannot
come
here

Therefore total number of ways are 18

9
Case 2: numbers starting by 3 so first place can be filled in one way and remaining
numbers can be arranged in 4! Ways
Case 3: numbers starting with 4, so that first place is filled in one way and
remaining places in 4! Ways.
Case 4 : Numbers starting with 5 will be also 4!.
Hence total numbers will be = 18+4!+4!+4!=90 numbers.

#21
(i) Even numbers using 1,2,3,4,5

Case 1: Unit place filled by 2 and remaining 4!

Case 2: Unit place filled by 4 and then 4!
Therefore total even numbers will be = 4!+4!=48

(ii) Less than 40,000

This place
can be
filled by 3
ways using
1,2 or 3

Remaining four numbers in 4 places in 4! Ways.

Therefore total numbers less than 40,000 will be 3 4!  72

10
#22
(a)
P(7,4)=840
(b)

Starting with 4 and remaining three places with six digits in P(6,3) WAYS
Starting with 5 again P(6,3) WAYS
Starting with 6 and 7 will be also P(6,3) WAYS.
STARTING WITH 34 WILL BE P(5,2)
SIMILARLY STARTING WITH 35, 36 AND 37 WILL BE ALSO P(5,2) WAYS EACH.
Hence total number of ways will be
P(6,3)  P(6,3)  P(6,3)  P(6,3)  4  P(5, 2)  560

©
CASE1: Unit place filled by 2 and remaini9ngf places in P(6,3) WAYS
CASE 2: Unit place filled by 4 and remaining P(6,3) WAYS
SIMILARLY UNIT PLACE FILLED WITH 6 AND REMAINING P(6,3) WAYS.
Total numbers= 3  P(6,3)  360
(D)
Last two digits are either 25 or 75.
When last two digits are 25 then remaining two digits out of 5 numbers can be
filled in P(5,2) Ways.

11
When last two digits are 75 then remaining 2 digits out of 5 digits can be filled in
P(5,2) WAYS.
Therefore total number of ways will be P(5, 2)  P(5, 2)  40
#23
Here 1000 is excluded but 4000 is included
ALL WILL BE FOUR DIGIT NUMBERS.
CASE 1:
Filled with 1

Thousandth place filled with 1 and remaining three places each with 5 ways as
repetition is allowed.
Therefore 5  5  5  125
But this also includes 1000 hence total numbers will be 125-1=124
Case2 : when thousandth place filled with 2, we have 125 numbers.
Case 3 : when thousandth place filled with 3, again 125 numbers.
Case 4: starting with 4, there will be only one number.
Therefore total numbers are 124 + 125 + 125 + 1= 375
#24
Digits are 0,1,2,3,4,5,6,7,8,9 altogether 10.
In telephone numbers 0 can occur in the beginning.
Six digit telephone number with at least one digit repeated will be
Total six digits numbers – numbers with no digit repeated
= 106  P(10, 6)

12
#25
(a)
Total six numbers are given.
Total numbers will be P(6,4).
ALSO NUMBERS STARTING WITH 0 WILL BE P(5,3).
Therefore total numbers are P(6, 4)  P(5,3)  300
(b)
5 ways 6 ways 6ways 6ways

Therefore total numbers= 5  63

(c)
At least one digit repeated = total numbers- no digit repeated
= 5  63 - 5  5  4  3 =780

#26
Total 8 officials and 4 non-officials are available and we need to choose 5 out of
them.
(a) 3 officials and 2 non-officials
8  4
  
 3  2 

13
 (b)

8 officials 4 non-officials

either 3 2
or 2 3

or 1 4
8  4 8   4 8  4
          
 3   2   2   3  1   4 

(c)
A particular official member is never included means we need to choose five
 11
members out of 11 i.e in  
5 

(d) A particular non-official member is always included means one is already

included and out of 11 now we need to choose remaining 4 members and
 11
this can be done in   ways
4 

# 27
Total 12 to be selected.
Women 9 Men 8

either 5 7
or 6 6

or 7 5
or 8 4

or 9 3
Add all COMBINATIONS to get the answer.

14
 (a)
Women are in majority if selected more than 6 i.e. 7 or 8 or 9
 9  8   9 8   9  8
          
 7   5   8   4   9   3

(b) Men in majority if more than six selected in the committee I.e either 7 or 8
men
Women 9 Men 8

either 5 7
or 4 8

#28
In each section, there are five questions and needs to answer a total of six
questions with a maximum of 4 in any one of the sections
A-5 B-5

EITHER 4 2

OR 3 3

OR 2 4

 5   5   5  5  5   5 
                  200
 2  4  3  3  4  2

15
#29
 2n  1   2n  1   2n  1  2n  1  2n  1  2n  1  2n  1
As (1  1)2 n 1         
0  1  n   n 1   n  2   n  n   2 n  1
 2n  1   2 n  1   2n  1  2n  1   2n  1  2n  1  2n  1
 22 n 1           
 n  1   n  2   n  n   2n  1    0  1  n 
 2n  1   2 n  1   2n  1   2n  1  2n  1  2n  1
 22 n 1              
 n   n 1  0   0  1  n 
 2n  1   2 n  1   2n  1 
 22 n 1  2    
 0  1  n 
 22 n 1  2  63  2  128
n3

Assumed that he would choose at least one book.

#30
Let number selected ne n-2 then number of candidates will be n.
Now a man can vote 1,2,3,----(n-2) candidates.
n  n n 
              56
1   2   n  2
 n  n   n
add         on both sides
 0   n  1  n 
 n  n  n  n   n   n  n  n   n
                  56        
 0  1   2   n  2   n  1  n   0   n  1  n 
2n  56  1  n  1
2n  58  n
n6

16
#31
At least one black cube = all combinations – none of the black
9 6
=       64
   
3 3

Or you can make different cases.

#32
3 points on AB, 4 points on BC and 5 points on AC are collinear and cannot form
any triangle.
 12 
Total number of triangles formed are  
3 

12   3   4   5 
Hence required number of triangles will be             205
 3   3  3   3

#33
B1  B2  B3  B4  B5  B6  B7 

Seven boys can be arranged in 7! Ways and in 8 gaps three girls can be arranged
In P(8,3) WAYS.
Therefore total number of ways will be 7! P(8,3)
#34
SIX PLUS SIGNS ARE ALL IDENTICAL. They can be arranged in one way. Total
gaps between plus signs are 7 and four minus signs can be arranged in P(7,4)
ways.

17
#35
We get a line on joining two points. Total number of sides with n points will be
n
  , but it includes sides also along with diagonals.
2

n n(n  3)
Hence number of diagonals will be    n 
2 2

7
In decagon, there are 10 points so number of diagonals will be 10   35
2

 10 
Number of triangles will be    120
3 

#36
 18 
We need to join two points to get a line. Total number of lines will be   . Five
2 
5
points are collinear so number of lines lost   but there will be one line on
2
joining these five points.
18   5 
(i) Hence number of straight lines will be       1  144
 2   2
18   5 
(ii) Number of triangles will be       806
 3   3

#37
n n n  n
(1  1) n                
 0  1   2   n
n n  n
2n  1             
1   2   n

Required number of combinations of some or all items.

18
#38
Try yourself
#39
(i)
 3  4   5
         60 ways
1  1  1 

(ii)
(23  1)(24  1)(25  1)  3255

(iii)
23  24  (25  1)  3968

#40
There are 9 horizontal and 9 vertical lines on the chess board. To form a
rectangle, we need two horizontal and two vertical lines.
9 9
      1296
 2  2

19
Solution of IB EXAM QUESTIONS
1. (a) There are 3! ways of arranging the Mathematics books, 5! ways
of arranging the English books and 4! ways of arranging the
Science books. (A1)
Then we have 4 types of books which can be arranged in 4! ways. (A1)
3! × 5! × 4 × 4! = 414 720 (M1)A1

(b) There are 3! ways of arranging the subject books, and for each
of these there are 2 ways of putting the dictionary next to the
Mathematics books. (M1)(A1)
3! × 5! × 4! × 3! × 2 = 207 360 A1
[7]
65
2. (a) Boys can be chosen in = 15 ways (A1)
2
5 4
Girls can be chosen in = 10 ways (A1)
2
Total = 15 × 10 = 150 ways A1

(b) Number of ways = 5 × 4 = 20 (M1)A1

20  2 
(c)   A1
150  15 

(d) METHOD 1
1 2
P(T) = ; P(A) = A1
5 5
P(T or A but not both) = P(T) × P(A′) + P(T) × P(A) M1A1
1 3 4 2 11
=     A1
5 5 5 5 25
METHOD 2
5
Number of selections including Fred = 5 ×   = 50 A1
 2
 4
Number of selections including Tim but not Anna =   = 6 A1
 2
Number of selections including Anna but not Tim = 4 × 4 = 16
Note: Both statements are needed to award A1.
6  16 11
P(T or A but not both) =  M1A1
50 25
[10]

20
 3
C 2  6 C1
3. Probability = 9
M1A1A1A1
C3
3  6  3! 6! 3  6  6 3
=   A1
9! 9  8  7 14
[5]

21