Scribd
Upload
100 views4 pages

Permutations & Combinations Exercise 1 (C)

The document contains 20 questions related to permutations and combinations. It provides worked out solutions showing the step-by-step calculations for arriving at the number of possible arrangements or selections for each question. The questions cover a range of permutation and combination problems including seating arrangements, selecting people from a group, counting numbers with certain properties, forming words and palindromes, and calculating divisors and coefficients of expansions.

Uploaded by

Yash Shanbhag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100 views4 pages

Permutations & Combinations Exercise 1 (C)

The document contains 20 questions related to permutations and combinations. It provides worked out solutions showing the step-by-step calculations for arriving at the number of possible arrangements or selections for each question. The questions cover a range of permutation and combination problems including seating arrangements, selecting people from a group, counting numbers with certain properties, forming words and palindromes, and calculating divisors and coefficients of expansions.

Uploaded by

Yash Shanbhag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

PERMUTATIONS & COMBINATIONS

Exercise 1(C)
Q.1 [8]
The 2 specific persons can be allotted a seat in 2 2 2 ways (2 ways to chose side, 2 to chose
adjacent seats & 2 to arrange them).
Now remaining 4 seats can be allotted in
5
4
P ways.
Number of possible seating arrangements =
5
4
2 2 2 P i.e. 8 5! .
Q.2 [8]
Number of ways in which r people can be selected out of '

n

' people sitting in a row, if no two
of them are consecutive =
n r 1
r
C
+
.
Hence
n 2
n 2
P C

= .
Now ( )( )
n 1 n 2
3 3
C C 15 n 2 n 3 45 or n 8

= = = .
Q.3 [52]
Possible digits can be{ 3,3,2}, {3,2,2} or {2,3,x} where x can be any of {0,1,4,5,6,7,8,9}.
In first two cases number of numbers will be 3 each.
In third case if 0 is not taken, then number of numbers will be 7 3! .
If 0 is taken as one digit then number of numbers will be 2 2 .
Total number of numbers = 6 + 42 + 4 = 52.
Q.4 [35]
+ + + + + +
Put the 6 + signs at a gap each. Any 4 gaps out of these 7 gaps can be selected in
7
4
C ways to
put the 4 signs.
Hence number of arrangements =
7
4
C or 35.
Q.5 [8]
For the first letter we have 3 choices A, B & C and for rest of the places 2 choices each.
Hence an n lettered word can be formed in
n 1
3 2

ways.
Now
n 1
3 2

= 384 gives n = 8.

Q.6 [10]

In adjoining Venn diagram
x + y + z = 9
Number of teachers who own none of three =
50 (21 x y) (14 x z) (13 y z) x y z 1.
= 50 (49 x y z) = 10.


Q.7 [12]
To move ahead from A 3 choices.
To move ahead of B/C/D 2 choices.
To move ahead from next point 2 choices.
Hence total number of ways 3 2 2 or 12 ways.
Q.8 [21]
One Green ball (GRRRRR) 6 ways
Two Green balls (GGRRRR) 5 ways
Three Green balls (GGGRRR) 4 ways
Four Green balls (GGGGRR) 3 ways
Five Green balls (GGGGGR) 2 ways
Six Green balls (GGGGGG) 1 way.
All possible ways to fix 6 boxes = 1 + 2 + 3 + + 6 = 21.
Q.9 [82]
Exponent of 13 in 1000! =
2
1000 1000
76 5 or 81
13 13
( (
+ = +
( (

.
Hence if
n
1000!
13
is not an integer, then n must be at least 82.
Q.10 [36]
Rectangles of size 1 2 = 8,
Rectangles of size 1 3 = 7,
Rectangles of size 1 4 = 6,

Rectangles of size 1 9 = 1.
Total number of non congruent rectangles = 1 + 2 + 3 + + 8 = 36.
Q.11 [23]
7056 =
4 2 2
2 3 7 , hence 7056 has (4 + 1)(2 + 1)(2 + 1) or 45 divisors.
Thus we can write 7056 as a product of two factors in 23 ways.
Q.12 [10]
Number of subsets containing 3 elements in which 3 is the least element =
n 3
2
C


Number of subsets containing 3 elements in which 7 is the greatest element =
6
2
C
Number of subsets containing 3 elements in which 3 is the least element as well as 7 is the
greatest element =
3
2
C
Hence number of subsets containing 3 elements in which 3 is the least element or is the greatest
element =
n 3
2
C

+
6
2
C 3.
Now
( )( )
2
n 3 n 4
15 3 33 n 7n 30 0 or n 10
2

+ = = = .
Q.13 [32]
Longest possible chord will be the diameter through P, of length 26.
Shortest possible chord will be perpendicular to diameter through P, of
length 10 units.
Possible lengths between 10 & 26 are 11, 12, 13, , 25.
There will be two chords of each of these lengths and one chord each of
length 10 & 26. Total number of chords = 2 15 2 + or 32.

Q.14 [2]
20
C
0

20
C
1
+
20
C
1

20
C
2
+ ... +
20
C
19

20
C
20
= coefficient of x
19
in the expansion of ( ) ( )
20 20
1 x x 1 + + .
= coefficient of x
19
in ( )
40
1 x + =
40 40
19 21
C or C . As r 20 hence r 21. > =
Q.15 [50]


In adjoining Venn diagram
(75 x y) + (45 z x) + (30 y z) + x + y + z + 5 = 100.
Hence x + y + z + 5 = 50.


Q.16 [50]
Number of ways in which room A can be filled in
n
n 25
A C 25! ways = .
49
n n 1 25
A A C 25!

=
( )
( )
( )
( )
( )
n n 1 49
25 25 25
C C C
n 1 !
n! 49!
25! n 25 ! 25! n 26 ! 25!24!
n 1 !
49!
or n 50
n 25 ! 25!

= =


Q.17 [41]
108900 = 2
2
3
2
5
2
11
2
.
Now number of divisors of 108900 = (1 + 2)
4
or 81.
Hence number of ways to write 108900 as a product of two factors = 41.
Q.18 [56]
Getting more than 25% marks means getting more than 3 marks out of maximum 12 marks.
(i) All 6 questions correct(12 marks) 1 way (5 correct means all 6 correct).
(iii) 4 correct 2 wrong(6 marks)
6
4
C ways.
(iv) 3 correct 3 wrong(3 marks)
6
3
C 2 ways(3 wrong answers can be marked in 2 ways).
Total number of ways = 1 + 15 + 40 or 56.
Q.19 [9]
To form a k letter palindrome we need to chose only 1
st
, 2
nd
& 3
rd
letter each in k ways.
4
th
& 5
th
digits must be same as 1
st
, 2
nd
digits.
Hence number of ways to form a palindrome = k
3
.
k
3
= 729 k = 9.
Q.20 [15]
Let there be n players.
2 players who withdraw after 3 games will play 6 matches.
Remaining (n 2) players will play
n 2
2
C

matches.
Hence
n 2
2
C 6 84

+ = or
2
n 5n 150 0 = .
Therefore n = 15.

You might also like