45. The no.

o. of five digit number that can be formed by using 1, 2, 3 only ,such that exactly three digit of
the formed numbers are same is _______
(a) 30 (b) 60 (c) 90 (d) 120
46. The no.of ordered pairs of integers (x,y) satisfying the equation x2+6x+y2= 4 is _______
(a) 2 (b) 4 (c) 6 (d) 8
n n n
47. If C4, C5 and C6 are in A.P then the value of n can be _______
(a) 14 (b) 11 (c) 9 (d) 5
48. The straight lines l1,l2,l3 are parallel and lie in the same plane.A total number of m points are taken on
l1, n points on l2, k points on l3. The maximum number of triangles formed with vertices at these
points are _______
(a) m+n+kC3 (b) m+n+kC3- mC3- nC3- kC3
(c) mC3+ nC3+ kC3 (d) m+n+k - m+n+kC3
49. The no. of ways in which the letter of the word "ARRANGE" can be arranged such that both R do
not come together is _______
(a) 360 (b) 900 (c) 1260 (d) 1620
50. A committee of 12 persons is to be formed from 9 women and 8 men in which at least 5
woman have to be included in a committee.Then the no.of committee in which the women
are in majority and men are in majority are respectively
(a) 4784,1008 (b) 2702,3360
(c) 6062,2702 (d) 2702,1008
51. 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= is _______
(a) 2 2n - 2nCn (b) 2n (c) 2n-1 (d) 3n
52. 12 Persons are to be arranged to a round table, If two particular persons among them
are not to be side by side, the total no,of arrangments is : _______
(a) 9(10!) (b) 2(10)! (c) 45(8!) (d) 10 !
53. Nandan gives dinner party to six guests.the no of ways in which they may be selected from
ten friends if two of the friends will not attend the party together is: _______
(a) 112 (b) 140 (c) 164 (d) 146
54. The no, of straight lines that can be drawn out of 10 points of which 7 are collinear is _______
(a) 22 (b) 23 (c) 24 (d) 25
55. The no of ways of arranging the letters AAAAABBBCCCDEEF in a row when no two
c’s are together is: _______
15! 15! 13!
(a) 5!3!3!2! 3! (b) 5!3!3!2! 5!3!2!
13
12! P3 12! 13
(c) (d) 5!3!2! P3
5!3!2! 3!
56. The no of ways in which 10 persons can go in two cars so that there may be 5 in each car,
supposing that two particular persons will not go in the same car is:
1 10 1 8
(a) C5 (b) C5 (c) 2 8 C 4 (d) 8 C4
2 2
192