CPP - SANKALP_PnC-10-PH-IV

CPP
PERMUTATION & COMBINATIONS – SHEET - 10
All possible Selections
LEVEL-1
Q1. In an election a voter may vote to any any number of candidates not greater than the number of candidates
to be elected. There are 10 candidates and 4 are to be elected. If a voter votes for at least one candidate,
then find the number of ways in which he can vote.

Q2. Find the number of ways in which one or more digits can be selected from the following : 11111 2222 333
44 567.

Q3. If there are 4 oranges , 5 apples , and 6 mangoes in a fruit basket, then find the number of ways,
a person can make a selection of fruits among the fruits in the basket ?

Q4. Find the number of all possible selections of one or more questions from 10 given questions, each question
having an alternative ?
Q5. A committee of 12 is to be formed from 9 women and 8 men. In how many ways this can be done if at
least five women have to be included in the committee? In how many of these committees.
(a) the women are in majority?
(b) the men are in majority?
Q6. A group of students consists of 4 boys and 5 girls. Find the number of ways of selecting a team of at least
3 boys and 4 girls.

Q.7 Find the number of divisors of the number 21600 is _____ and the sum of these divisors is
______.

Q.8 Find the number of ways in which the number 108900 can be resolved as a product of two factors ?

Q.9 Find the number of combination of 16 things , 8 of which are alike and the rest different, taken 8 at a time
?
Q10. From a class containing 2n studenets of which n are boys and remaining n are girls. Find the number of
ways of choosing students such that
(a) number of boys is one more than number of girls
(b) number of boys is 2 more than number of girls
(c) number of boys is k more than number of girls

LEVEL-2
Q1. In a certain test, there are n questions. In this test, 2n-i students gave wrong answers to at least i questions
where i = 1, 2, 3, ...., n. If the total number of wrong answer is 2047, Find n.

Q2. (a) If N = 21600 then find

(i) Total number of divisors
(ii) Total number of proper divisors
(iii) Total number of even divisors
(iv) Total number of odd divisors
(v) Total number of divisors which are multiple of 12 ?
(b) In how many ways 7056 can be resolved as product of two factors .

FIITJEE Ltd., ICES House, Sarvapriya Vihar (Near Hauz Khas Bus Terminal), New Delhi - 16, Ph: 6515949, 6865182, 6854102, Fax: 6513942
CPP - SANKALP_PnC-10-PH-IV

(c) Find the number of ways in which 300300 can be splitted into two factors which are relatively prime.

Q3. Raj has 10 friends and wants to invite them on dinner party. In how many ways can it be done if
(a) any number of friends can be invited?
(b) at least one friend must be invited?
Q4. Consider forming teams of various sizes from group of n persons and selecting a captain and a vice-
captain from each team, prove using the principle of permutations and combinations that 2.1 . nC2 + 3.2
nC + .... + n (n – 1) .nC = n(n–1) 2(n–2)
3 n

Q5. How many combinations you can make from 5 pair of (identical) shoes out of which 2 are brown and the
remaining three are black?

Q6. Given 11 points, of which 5 lie on one circle, other than these 5, no 4 lie on one circle . Then find the
maximum number of circles that can be drawn so that each contains atleast three of the given points is :
Q.7 Two classrooms A and B having capacity of 25 and (n–25) seats respectively.An denotes the number of
possible seating arrangements of room 'A', when 'n' students are to be seated in these rooms, starting from
room 'A' which is to be filled up full to its capacity.
If An – An–1 = 25! (49C25) then find 'n' ?

Q.8 The streets of a city are arranged like the lines of a chess board . There are m streets running North to
South & 'n' streets running East to West . Then find the number of ways in which a man can travel from
NW to SE corner going the shortest possible distance ?
Q9. For each positive integer k,let Sk denotes the increasing arithmetic sequence of integers whose first term
is 1 and whose common diffeence is k. For example, S3 is the sequence 1, 4, 7, 10 ... Find the number of
values of k for which Sk contains the term 361.

Q10. Find the number of positive integers which are divisor of at least one of the numbers 1010 ,157 ,1811

FIITJEE Ltd., ICES House, Sarvapriya Vihar (Near Hauz Khas Bus Terminal), New Delhi - 16, Ph: 6515949, 6865182, 6854102, Fax: 6513942
CPP - SANKALP_PnC-10-PH-IV

ANSWER KEY SHEET - 10 PNC

LEVEL - I
1 Ans = 385
The total number of ways = 10C1 + 10C2+ 10C3+ 10C4
2. Here five 1’s are alike, four 2’s, are alike three 3’s are alike, two 4’s are alike and 5, 6, 7 are diffrent.
Selection from (11111) can be made by 6 ways {such nclude no 1, include one 1, two 1, three 1, four 1,
five 1}. Similarly, selections from (2222) can be made in 5 ways, selection from (333).
can be made in 4 ways, selection from (44) can be made in 3 ways and selections from 5, 6, 7 can be
made in 2 × 2 × 2 ways.
Then total number of combinations
= (5 + 1) (4 + 1) (3 + 1) (2 + 1) 23 - 1 = 6.5.4.3. 8 –1
= 2879 (excluding the case when no letter is selected)
3. 209
4. 310 − 1 [Hint: 1st question can be selected in three ways and so on ]
5. (a) 2702 (b) 1008
6. 30
7. [ Ans. 72, 78120 ]
3× 3 × 3 × 3 +1
8. [ Ans. 41 ] [Hint : 108900 = 22 . 32 . 52 . 112 = = 41 ]
2
9. [ Ans. 256 ]
[Hint: A A A A A A A A D1 D2 ......... D8 ⇒ 8C
0 + 8C1 + 8C2 + ...... + 8C8 = 256 ]
(2n)! (2n)!
10 (a) (n + 1)!(n − 1)! (b) (n + 2)!(n − 2)! (c) 2nCn - k

LEVEL - II
1 n = 11
2. a) (i) 72 (ii) 70 (iii) 60 (iv) 12 (v) 36
b) 23 c) 16
3. (a) Number of ways in which dinner party can be arranged when any number of friends are invited
= 10C0 + 10C1 + 10C2 + ..... + 10C10 = 210
(b) Number of ways in whchi dinner party can be arranged when one or more friends are invited
= 10C1 + 10C2 + ..... + 10C10 = 210 – 1
5 Since the shoes are alike in combinations 1 pair shoe or 2 pair shoe (for brown shoes) and 1, 2, 3 pair of
shoes (for black).
Hence number of combinations = (2 + 1) (3 + 1) = 12
6 156

[ Hint :

⇒ 5C
2 . 6C1 + 6C2 5C1 + 6C3 + 1 = 156 alternatively 11C
3 − 5C3 + 1 ]
7. 50
[Hint: nC .
25 25! – n–1C25 . 25! = 25! 49C25 ⇒ n–1C24 = 49C24 ⇒ n–1 = 49 ⇒ n = 50 ⇒ (A) ]
( m + n − 2) !
8.
( m − 1) ! . ( n − 1) !
[Hint: (m − 1) paths of one kind & (n − 1) paths of other kind, taken all at a time ]
9. 24
10 435

FIITJEE Ltd., ICES House, Sarvapriya Vihar (Near Hauz Khas Bus Terminal), New Delhi - 16, Ph: 6515949, 6865182, 6854102, Fax: 6513942
CPP - SANKALP_PnC-10-PH-IV

FIITJEE Ltd., ICES House, Sarvapriya Vihar (Near Hauz Khas Bus Terminal), New Delhi - 16, Ph: 6515949, 6865182, 6854102, Fax: 6513942