PART - I : OBJECTIVE QUESTIONS

Single choice type

1. All the five digits number in which each successive digit exceeds its predecessor are arranged in the
increasing order of their magnitude. The 97th number in the list does not contain the digit
(A) 4 (B) 5 (C) 7 (D) 8
2. No. of diffent squares of any size (side of square be natural no.) which can be made from a rectangle of
size 15 × 8, is -
(A) 456 (B) 120 (C) 228 (D) None of these
3. Number of natural number upto one lakh, which contains 1,2,3, exactly once and remaining digits any time
is -
(A) 2940 (B) 2850 (C) 2775 (D) 2680

4. In a hockey series between team X and Y, they decide to play till a team win ‘m’ match. Then the no. of ways
in which team X wins -
(A) 2m (B) 2mPm (C) 2mCm (D) None of these

5. A gentleman invites a party of m + n (m  n) friends to a dinner & places m at one table and n at
another, the table being round. If the clockwise & anticlockwise arrangements are not to be
distinguished and assuming sufficient space on both tables, then the number of ways in which he can
arrange the guest is
(m  n)! 1 (m  n)! (m  n)!
(A) 4 mn (B) (C) 2 (D) none
2 4 mn 4 mn

6. Given six line segments of length 2, 3, 4, 5, 6, 7 units, the number of triangles that can be formed by
these segments is
(A) 6C3 – 7 (B) 6C3 – 6 (C) 6C3 – 5 (D) 6C3 – 4
7. There are m apples and n oranges to be placed in a line such that the two extreme fruits being both
oranges. Let P denotes the number of arrangements if the fruits of the same species are different
and Q the corresponding figure when the fruits of the same species are alike, then the ratio P/Q has
the value equal to :
(A) nP2. mPm. (n  2) ! (B) mP2. nPn. (n  2) ! (C) nP2. nPn. (m  2) ! (D) none

8. Six cards are drawn one by one from a set of unlimited number of cards, each card is marked with
numbers  1, 0 or 1. Number of different ways in which they can be drawn if the sum of the numbers
shown by them vanishes, is:
(A) 111 (B) 121 (C) 141 (D) none

9. A five 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 repetition in the same word
"MATHEMATICS". The number of ways in which the five letter word can be formed is:
(A) 720 (B) 540 (C) 360 (D) none
More than one choice type
10. Identify the correct statement(s).
(A) Number of zeroes standing at the end of 125 ! is 30.
(B) A telegraph has 10 arms and each arm is capable of 9 distinct positions excluding the position
of rest. The number of signals that can be transmitted is 1010  1.
(C) Number of numbers greater than 4 lacs which can be formed by using only the digits
0, 2, 2, 4, 4 and 5 is 90.
(D) In a table tennis tournament, every player plays with every other player. If the number of
games played is 5050 then the number of players in the tournament is 100.
 PART - II : SUBJECTIVE QUESTIONS
1. Find the no. of functions f : A  B where n(A) = m , n(B) = t , which are non decreasing,

2. Find the number of ways of selecting 3 vertices from a polygon of sides ‘2n+1’ such that centre of polygone
lie inside the triangle.

3. Find the number of intersection points of diagonals of 2009 sides regular polygon, which lie inside the
polygon.

4. In a row, there are n rooms, whose door no. are 1,2,.......,n, initially all the door are closed. A person takes
n round of the row, numbers as 1st round, 2nd round ........ nth round. In each round, he interchage the
position of those door no., whose no is multiple of the round no. Find out after n th round,How many doors
will be open.

5. A operation * on a set A is said to be binary, if x * y  A , for all x, y  A, and it is said to be commutative ,

if x * y = y * x for all x, y  A. Now if A = {a1, a2, ......, an}, then find the following -
(i) Total no. of binary operations of A
(ii) Total no. of binary operation on A such that
ai * aj  a1 * ak, if j  k.
(iii) Total no. of binary operations on A such that ai * aj < ai * aj + 1  i, j

6. The integers from 1 to 1000 are written in order around a circle. Starting at 1, every fifteenth number
is marked (that is 1, 16, 31, .... etc.). This process in continued untill a number is reached which has
already been marked, then find number of unmarked numbers.

7. Show that the number of combinations of n letters together out of 3n letters of which n are a and n are
b and the rest unlike is, (n + 2). 2n  1.

8. If AB and AC be two line segemets and there are m, n points on AB and AC (other then A) . Find the number
of triangle, with vertices on these points

9. Find the no. of ways in which n ‘1’ and n ‘2’ can be arranged in a row that upto any point in the row no. of ‘1’
is more than or equal to no. of ‘2’

10. In how many ways alphabets of the word MIRGESSH can be arrange in the given figure so that no row
remains empty.

11. Find the number of positive integral solutions of x + y + z + w = 20 under the following conditions:
(i) x, y, z, w are whole number
(ii) x, y, z, w are natural number
(iii) x, y, z, w  {1, 2, 3, .........., 10}
(iv) x, y, z, w are odd natural number

12. Find the number of words of 5 letters that can be made with the letters of the word "PROPOSITION".

13. In maths paper there is a question on "Match the column" in which column A contains 6 entries &
each entry of column A corresponds to exactly one of the 6 entries given in column B written randomly.
2 marks are awarded for each correct matching & 1 mark is deducted from each incorrect matching.
A student having no subjective knowledge decides to match all the 6 entries randomly. Find the
number of ways in which he can answer, to get atleast 25 % marks in this question.
14. Find the number of positive unequal integral solution of the equation x + y + z = 20.

15. (i) How many ways can atleast 1 fruit be selected out of 5 Mangoes, 4 Apples, 3 Bananas and three
different fruits.
(ii) How many ways can atleast 2 fruit be selected out of 5 Mangoes, 4 Apples, 3 Bananas and three
different fruits.

16. If we have 3 identical white flowers and 6m identical red flowers. Find the number of ways in which a
garland can be made using all the flowers.

PART - I
1. (B) 2. (A) 3. (A) 4. (D) 5. (C) 6. (A) 7. (A)

8. (C) 9. (B) 10. (BC)

PART - II

1. ( t  m  1)c m ways 2. 2nC2 – 3. nC2 3. 2009

C4 4.  n 5. (i) n n
2
(ii) (n!)n (iii) 1

mn 2n
Cn
6. 800 8. mn   9. 10. 202 × 8!
 2  n 1
11. (i) 23C3 (ii) 19
C3 (iii) 19
C3 – 4.9C3 (iv) 11C8 12. 6890 13. 56 ways
14. 144 15. (i) 959 (ii) 953 16. 3m2 + 3m + 1