PERMUTATIONS & COMBINATIONS Rg.
2019 - 2021
EXERCISE - 3
SUBJECTIVE TYPE
1. In how many ways can 2n people be seated, n at a round table and n in a row?
2. Find the number of selections of 5 cards from a pack such that all 4 suits are present.
3. There are 17 people including A and B. In how many ways can be 12 of them be chosen if both A and B are
not chosen together?
4. In how many ways can 3 distinct numbers be chosen from amongst 1 to 30 so that their sum is even ?
5. In how many ways can 27 distinct books be distributed among A, B, C so that C gets half as much as A and
B together?
6. 20 lines are drawn in a plane. No two lines are parallel and no three are concurrent. Show that they di-
vide the plane into 211 disjoint parts.
7. In how many ways can a 12 step staircase be climbed taking 1 step or 2 steps at a time?
8. Each side of an equilateral ABC is divided into 6 equal parts. The corresponding points of subdivison are
joined. Find the number of equilateral triangles oriented the same way as ABC.
9. Let n = 106. Evaluate log10 d .
d |n
10. How many arrangements of the 9 letters a, b, c, p, q, r, x, y, z are there such that y is between x and z ? (Any
two, or all three, of the letters x, y, z , may not be consecutive.)
11. From amongst 8 married couples , a team is to be selected for a mixed doubles match. Find the total number
of teams in which spouses are not included.
12. Let n = 180. Find the number of positive integral divisors of n2, which do not divide n.
13. How many arrangements of the letters of MISSISSIPPI have no consecutive S’s ?
14. Find the number of ways of keeping 2 identical kings on an 8 8 chess-board so that they are not in
adjacent squares. (Two squares are adjacent when they have a common side.)
15. A coin is tossed 10 times. Find the number of outcomes in which 2 heads are not successive.
16. There are 11 seats in a row. Five people are to be seated. Find the number of seating arrangements, if
i) the central seat is to be kept vacant ;
and ii) for every pair of seats symmetric with respect to the central seat , one seat is vacant.
17. Take a convex octagon in which no two diagonals are parallel and no three are concurrent inside the
polygon. Find the number of intersection points, lying inside the polygon, of the diagonals .
18. How many hexagons can be constructed by joining the vertices of a quindecagon (15 sides) if none of the
sides of the hexagon is also the side of the 15-gon.
19. There are five distinguishable pairs of gloves to be given to 5 persons. Each person must get a left glove and
a right glove . Find the number of distributions so that no person gets a proper pair.
CENTERS: MUMBAI / DELHI /AKOLA /LUCKNOW / NASHIK / PUNE / NAGPUR / BOKARO / DUBAI # 63
PERMUTATIONS & COMBINATIONS Rg. 2019 - 2021
20. Six distinguishable marbles are to be distributed into 3 distinguishable boxes. Find the number of distributions
so that no box is empty.
21. Find the number of (m + n) - digit sequences with m 0’S and n 1’S such that no two 1’S are adjacent, n m +1.
22. Find the number of ways to pave a 1 7 rectangle by 1 1, 1 2, 1 3 tiles, if tiles of the same size are
indistinguishable.
23. Find the number of seating arrangements of 6 persons at three identical round tables if every table must be
occupied.
24. All the 5 digit numbers, formed by permuting the digits 1, 2, 3, 4 and 5 are arranged in the increasing order.
Find : -
i) the rank of 35421 ii) the 100th number.
25. Show that the number of positive integral divisors of 111 ... 1(2010 times) is even.
26. Let n = 26. 34. 52 .74 . Find the number of positive integral divisors of n which are greater than n .
1 1 1
27. Find the number of ordered pairs (x, y) of positive integers such that .
x y 100
28. How many increasing 3 term arithmetic progressions can be formed whose terms are from amongst 1, 2, 3,
... , 100 ?
29. How many unordered pairs {a , b} of positive integers a and b are there such that lcm (a, b)= 1,26,000?
(Note : An unordered pair {a, b} means {a, b} = {b, a})
30. P is a 21 sided regular polygon. There are exactly 21C3 = 1330 triangles whose vertices are vertices of P. How
many of these triangles are :- (i) acute ? (ii) isosceles ?
(Isosceles include equilateral.)
31. Two n-digit integers (leading 0 allowed) are said to be equivalent if one is a permutation of the other. Thus
10075 and 01057 are [Link] the number of 5-digit integers such that no two are equivalent.
32. Use a combinatorial argument to prove that
(2n 1)!
( nC1)2 + 2 ( nC2 )2 + 3 ( nC3 )2 + . . . + n ( nCn )2 =
((n 1) ! )2
33. Let T(n) denote the number of non-congruent triangles with integer side lengths and perimeter n.
Thus T(1) = T(2)=T(3)=T(4) = 0, while T(5) = 1. Prove that:-
i) T(2006) < T(2009) ii) T(2005) = T(2008)
34. Find the number of different ways of painting a cube by using a different colour for each face from six
available colours.
(Any two colour schemes are called different if one cannot coincide with the other by a rotation of the cube.)
35. Take a ABC. Take n points of sub-division on side AB and join each of them to C. Likewise, take n points
of sub-division on side AC and join each of them to B. Into how many parts is ABC divided ?
CENTERS: MUMBAI / DELHI /AKOLA /LUCKNOW / NASHIK / PUNE / NAGPUR / BOKARO / DUBAI # 64
PERMUTATIONS & COMBINATIONS Rg. 2019 - 2021
36. A positive integer n has the decimal representation n = d1 d2 ... dm .
(a) n is called ascending if 0 < d1 d2 ... dm
(b) n is called strictly ascending if
0 < d1 < d2 < ... < dm.
Find the total number of type (a) and type (b) numbers, which are less than 109.
n
n
37. Prove that Pr = [n ! e –1] , where [ ] is the step function.
r 1
(Hint : You will need the series representation of e.)
38. Show that the combinatorial number 2nCn is even for all n.
39. Show that 23n . 3n divides (4n !) for all n.
40. Prove that 2n divides (n + 1) (n + 2) ... (2n) for all n.
n 1
41. Prove (combinatorially) that 2k 2n 1 .
k 0
(Hint : Let 1 m n. How many subsets of {1, 2, ... , n} have m as the maximal element ?)
42. Let N(k) = {1, 2, ... , k}. Find the number of :-
i) functions from N(n) to N(m) ;
ii) one-to-one functions from N(n) to N(m) , n m.
iii) strictly increasing functions from N(n) to N(m), n m
iv) non- decreasing functions from N(n) to N(m).
43. Let 1 n r. The Stirling number of the first kind, S(r, n), is defined as the number of arrangements of r
distinct objects around n identical circular tables so that each table contains atleast one object.
a) Show that :- i) S(r, 1) = (r – 1)! ;
ii) S(r, r –1) = rC2 , r 2 ;
CENTERS: MUMBAI / DELHI /AKOLA /LUCKNOW / NASHIK / PUNE / NAGPUR / BOKARO / DUBAI # 65