PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

SINGLE CORRECT:

1. The number of divisors of 3630, which have a remainder of 1 when divided by 4, is

(A) 12 (B) 6 (C) 4 (D) none of these.

2. The number of solutions of the inequation 10Cx-1 > 3.10Cx is

(A) 0 (B) 1 (C) 2 (D) 9

3. Triplet (x, y, z) is chosen from the set {1, 2, 3, …., n}, such that x  y < z. The number of such triplets is
(A) n3 (B) nC3 (C) nC2 (D) none of these

4. The number of positive integral solutions of the equation x1 x2 x3 = 60 is

(A) 54 (B) 27 (C) 81 (D) None of these.

5. For the series 21, 22, 23, ...., k –1, k; the A.M. and G.M. of the first and last number exist in the given
series. If ‘k’ is a three-digit number, then ‘k’ can attain
(A) 5 values (B) 6 values (C) 2 values (D) 4 values

6. Consider a set {1, 2, 3, ….,100}. The number of ways in which a number can be selected from the set so
that it is of the form xy, where x, y,  N and  2, is
(A) 12 (B) 16 (C) 5 (D) 11

7. Number of natural numbers < 2 .104 which can be formed with the digits 1, 2, 3 only is equal to
3 6  2 .3 4  3 3 6  2 .3 4  3 37  1
(A) 2 (B) 2 (C) 2 (D) none of these

8. The sum of the factors of 7! which are odd and are of the form 3t + 1 where t is a whole number, is
(A) 10 (B) 8 (C) 9 (D) 15

9. Number of positive integers n less than 15, for which n! + (n+1)! + (n+2)! is an integral multiple of 49,
is
(A) 3 (B) 4 (C) 5 (D) 6

10. The number of four-digit natural numbers in which odd digits occur at even places and even digits occur
at odd places and digits are in increasing order from left to right,
(A) is less than 36 (B) is greater than 100
(C) lies between 60 and 100 (D) none of these.

11. Consider a set P consisting of n elements. A subset ‘A’ of P is chosen thereafter set ‘P’ is reconstructed
and finally another subset ‘B’ is chosen from P. The number of ways of choosing ‘A’ and ‘B’ such that
(AB)P is
(A) 4n (B) 4n – 3n (C) 4n – 2n (D) None of these

12. The total number of eight-digit numbers, the sum of whose digits is odd, is
(A) 9  107 (B) 5 107 (C) 45  106 (D) 55  106

www.vigyas.in
1
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

13. The sum of the products of the 2n numbers  1,  2,  3, .... ,  n, taking two at a time, is
n2 n  1 n2 n  1 nn  12n  1 nn  12n  1
2 2

(A) 4
(B) – 4
(C) – 6
(D) 6

14. The total number of squares of any size (side being natural numbers) in a rectangle of m  n (m < n),
(m, n  N ) is
m m
(A) (m  1) (3n  m  1) (B) (m  1)
6 2
m  1m  2
(C) 4
(D) None of these

15. A polygon has 44 diagonals. The number of its sides is

(A) 10 (B) 11 (C) 12 (D) 13

16. The sum of the digits in the unit place of all numbers formed with the help of 3,4,5,6 taken all at a time
is
(A) 18 (B) 108 (C) 432 (D) 144

17. Six identical coins are arranged in a row. The number of ways in which the number of tails is equal to
number of heads is
(A) 20 (B) 120 (C) 9 (D) 40

18. The number of ways in which a mixed doubles tennis game can be arranged between 10 players
consisting of 6 men and 4 women is
(A) 180 (B) 90 (C) 48 (D) 12

19. The value of nPr and nCr will be equal when

n
(A) n=r (B) r= 2 (C) r = 1 or n (D) r = 0 or 1

20. The number of ways in which letters of the word ARGUMENT can be arranged so that both the corners
are filled by consonants only is
(A) 3!  5! (B) 14400 (C) 41000 (D) None of these

21. The number of solutions of x1 + x2 + x3 = 51 (x1, x2, x3 being odd natural numbers) is
(A) 300 (B) 325 (C) 330 (D) 350

22. The number of different words (with or without meaning) of 3 letters from the word INDIA is
(A) 30 (B) 27 (C) 33 (D) 60

23. How many six digits numbers can be formed in decimal system in which every succeeding digit greater
than its preceding digit
9 10 9
(A) P6 (B) P6 (C) C3 (D) None of these

www.vigyas.in
2
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

24. There are n numbered seats around a round table. In how many ways can m (m < n) persons sit around
the round table.
(A) n
Cmm! (B) n
Cm (m – 1)!
n
Cm (m  1)!
(C) (D) None of these
2

25. In how many ways can we distribute 5 different balls in 4 different boxes when order is not consider
inside the boxes and empty boxes are not allowed
(A) 120 (B) 150 (C) 240 (D) None of these

26. The number of solutions in positive integers of 2x + 3y = 763 is

(A) 125 (B) 126 (C) 127 (D) 128

27. In a hockey tournament, a total of 153 matches were played. If each team played one match with every
other team, the total number of teams that participated in the tournament were
(A) 20 (B) 18 (C) 16 (D) 14

28. The total number of selections that can be made from n different books each having
r identical copies, taking at least 2 copies of each category (r > 2) is
(A) (n – 1)r (B) rn – 1 (C) nr – 1 (D) (r – 1)n

29. A polygon has 35 diagonals. The number of its sides is

(A) 8 (B) 9 (C) 10 (D) 11

30. If number of divisors of a natural number ‘n’ is 15, then number of solutions (n, m) of
n – m2 = 4, (m I) is
(A) one (B) two (C) zero (D) infinite

31. The number of ordered triplets (x, y, z) of positive integers which are solutions of the equation x + y + z
= 100 is
(A) 5081 (B) 4851 (C) 6005 (D) None of these.

32. The number of flags with three strips in order, that can be formed using 2 identical red,
2 identical blue and 2 identical white strips is
(A) 24 (B) 20 (C) 90 (D) 8

33. The number of subsets of {1, 2, 3, …,n} having least element i and greatest element j, 1  i < j < n is
(A) 2n1 (B) 2ji+1 (C) 2ji+1 (D) none of these

34. The number of ways of arranging six persons (having A, B, C and D among them) in a row so that A, B,
C and D are always in order ABCD (not necessarily together) is
(A) 4 (B) 10 (C) 30 (D) 720

35. The number of ways of selecting two numbers from the set {1, 2, …, 12} whose sum is divisible by 3 is
(A) 66 (B) 16 (C) 6 (D) 8

www.vigyas.in
3
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

36. If nPr = nPr+1 and nCr = nCr-1, then (n, r) are

(A) (2,3) (B) (3,2) (C) (4,2) (D) (4,3)

37. The number of 9-digit numbers that can be formed by using the digits 1,2,3,4 and 5 is
(A) 9
C1 8C2 (B) 59 (C) 9
C5 (D) 9!

38. The number of diagonals that can be drawn by joining the vertices of an octagon is
(A) 28 (B) 48 (C) 20 (D) None of these

39. Number of ways in which 5 identical objects can be distributed in 8 persons such that no person gets
more than one object is
8 8
(A) 8 (B) C5 (C) P5 (D) None of these

40. Number of ways in which 7 girls & 7 boys can be arranged such that no two boys and no two girls are
together is
(A) 12!(2!)2 (B) 7! 8! (C) 2(7!)2 (D) None of these

41. The number of ordered triplets (a, b, c), a, b, c  N, such that a + b + c  20 is

(A) less than 100 (B) less than 1000
(C) equal to 1000 (D) more than 1000

p
42. The number of rational numbers q , where p, q  {1, 2, 3, 4, 5, 6} is
(A) 23 (B) 32 (C) 36 (D) none of these
n
Pr 1 n Pr n Pr 1 b2
43. If   , then
a b c a b  c  is equal to:
1
(A) 1 (B) 2 (C) 2 (D) None
n 1 n 1
44. If Cr 1 : C r :
n
Cr 1  11: 6 : 3 , then nr =
(A) 20 (B) 30 (C) 40 (D) 50

45. Let A {x| x is a prime number and x < 30}. The number of different rational numbers, whose numerator,
and denominator belong to A, is:
(A) 90 (B) 180 (C) 91 (D) 30

46. In the decimal system of numeration of the number of 6-digit numbers in which the sum of the digits is
divisible by 5 is:
(A) 180000 (B) 540000 (C) 5 × 105 (D) None of these

47. Two 4-digits numbers are to be formed such that the sum of the number is also a 4-digit number and in
no place the addition is with carrying. The number of ways of forming the number under above
conditions is:
(A) 554 (B) 220 (C) 454 (D) 36 × 553

www.vigyas.in
4
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

48. The number of odd proper divisors of 3p.6m.21n is:

(A) (p + 1) (m + 1) (n + 1) – 2 (B) (p + m + n + 1) (n + 1) – 1
(C) (p + 1) (m + 1) (n + 1) – 1 (D) None of these

49. In the test there were n questions. In the test 2n–i students gave wrong answer to at least i questions
where i = 1, 2, 3, … n. If the total number of wrong answers given is 2047 then n is:
(A) 12 (B) 11 (C) 10 (D) 13

50. If a, b, c be three natural numbers in AP and a + b + c = 21, then the possible number of values of a, b, c
is:
(A) 15 (B) 14 (C) 13 (D) 16

51. The number of selections of four letters from the letters of the word ASSASSINATION is:
(A) 72 (B) 71 (C) 66 (D) 52

52. A is a set containing n elements. A subset P of A is chosen. The set A is reconstructed by replacing the
elements of P. A subset Q of A is again chosen. The number of ways of choosing P and Q so that P  Q
contains exactly two elements is:
(A) 9nC2 (B) 3n – nC2 (C) nC2 3n-2 (D) 4n – 3n

53. The greatest integer, which divides n! + 1, n  N, n  3 is:

(A) 2 (B) 3 (C) n (D) None of these

54. A 5-letter word is to be formed such that the letters appearing in the odd numbered positions are taken
from the letters which appear without repetition in the word MATHEMATICS. Further, the letters
appearing in the even numbered positions are taken from the letters which appear with repetitions in the
same word MATHEMATICS. The number of different ways the five-letter word can be formed is:
(A) 390 (B) 600 (C) 540 (D) 450

55. If x + 2y + 3z = n and x, y, z are positive integers, then the number of ordered triplets (x, y, z) satisfying
above equation is (n > 6):
(A) nCn–6 (B) nCn–3 (C) n+2C3 (D) None of these

56. In a tournament of cricket there were 12 teams, divided equally in two groups. Teams of each group
played a match against each other. From each group 3 top teams qualified for the next round. In that
round each team played against others once. Four top teams of this round qualified for the semifinal
round, where each team played against the other once. Two top teams of this round went to the final
round, where they played the best of three matches. The minimum number of matches in the tournament
played are (assume that no match abandoned, and winner was decided by first two matches only in the
final):
(A) 54 (B) 53 (C) 38 (D) None of these

57. If ‘n’ is an integer between 0 and 21, then the minimum value of n! (21 – n)! is:
(A) 9! 2! (B) 10! 11! (C) 20! (D) 21!

www.vigyas.in
5
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

58. A closet has 5 pairs of shoes. The number of ways in which 4 shoes can be chosen from it so that there
will be no complete pair is:
(A) 80 (B) 160 (C) 200 (D) None of these

59. Number of ways to choose an ordered pair (a, b) of numbers from the set {1, 2, 3, …., 10} such that |a –
b|  5 is:
(A) 70 (B) 100 (C) 80 (D) 90

60. The number of ways in which the squares of a 8 × 8 chess board can be painted red or blue so that each
2 × 2 squares has two red and two blue squares is:
(A) 29 (B) 29 – 1 (C) 29 – 2 (D) None of these

61. n-similar balls each of weight w when weighted in pairs the sum of the weights of all the possible pairs
is 120 when they are weighted in triplets the sum of the weights comes out to be 480 for all possible
triplets, then n is :
(A) 20 (B) 10 (C) 16 (D) 28

Paragraph (Q.62 to Q.64)

8 players complete in a tournament, everyone plays everyone else just once. The winner of a game gets
1
1, the loser 0 or each gets 2 if the game is drawn. The final result is that everyone gets a different score
and the player placed at second gets the same score as the total of four bottom players.

62. The total of the player placing II was:

1 1
(A) 6 (B) 6 2 (C) 5 2 (D) All of three are possible

63. The result of the game between player placing III and player placing VII was:
(A) player III was the winner (B) player VII was the winner
(C) the game ended in a draw (D) any of the three can happen

64. The total score of the top four players was:

(A) 22 (B) 21 (C) 20 (D) 19

MULTIPLE CORRECT:

65. If m and n are positive integers more than or equal to 2, m > n, then (mn)! is divisible by
(A) (m!)n (B) (n!)m (C) (m + n)! (D) (m - n)!

66. Let n be a positive integer with f(n) = 1! + 2! + 3! + … + n! and P(x), Q(x) be polynomials in x such that
f(n+2) = P(n)f(n+1) + Q(n)f(n) for all n  1. Then
(A) P(x) = x + 3 (B) Q(x) = - x - 2
(C) P(x) = - x - 2 (D) Q(x) = x + 3

www.vigyas.in
6
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)

67. The number of integral solutions of x + y + z = 0 with x, y, z  -5 is

(A) 17C2 (B) 15C10 (C) 17C15 (D) None of these

68. ‘n’ locks and ‘n’ corresponding keys are available. But the actual combination is not known. The
maximum numbers of trials that are needed to assign the keys to their corresponding locks are
n

(A) nC 2 (B)  (k  1)
k 2
(C) n! (D) n+1
C2

69. The number of ways of choosing triplet (x, y, z) such that z  max {x, y} and
x, y, z {1, 2,….., n, n + 1} is :
(A) n+1C3 + n+2C3 (B) n+1C2 + 2(n+1C3) (C) 12 + 22 + …. + n2 (D) 2 (n+2C3) – n+1C2

70. If the numbers n and 3n have the same digit sum. Then:
(A) n is divisible by 3 (B) n is divisible by 9 (C) 3n is divisible by 3 (D) 3n is divisible by 9

71. Number of triplet (x, y, z) such that x  y  z, where x, y, z  {1, 2, 3, ….n} can be equal to :
(A) nC1 + 2nC2 + nC3 (B) n+2C3 (C) nC3 (D) 3nn

72. Number of triangles which can be formed by joining vertices of a regular polygon of n (>5) sides such
that no side is common with the side of polygon is equal to:
n
(B) C3  n  n n  4
n3 n
(A) n  3 C3 (C) n–4C2 + n–3C3 (D) n+2C3.

INTEGER TYPE:

73. The number of ordered pairs (m, n); m, n  {1, 2, 3, …., 20} such that 3m + 7n is a multiple of 10, is
equal to ___________.

74. The number of garlands that can be formed using 3 flowers of 1 kind and 12 flowers of the 2nd kind
is__________.

www.vigyas.in
7
 PERMUTATIONS & COMBINATIONS (CCT – LEVEL 1)
ANSWER KEY
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
B C D A C A A B A A B C C A B
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
B A A D D B C C A C C B D C C
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
B A B C D B B C B C B A A D C
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
A D B B C A C D C D B B A C C
61 62 63 64 65 66 67 68 69 70 71 72 73 74
D A A A ABCD AB AC AB BCD ABCD AB ABC 100 19

www.vigyas.in
8