Q1: If and then

(A)

(B)

(C)

(D)
Q1: If and then
(A)

(B)

(C)

(D)

Solution:
Q2: Let be such that for all and are
in A.P., then the minimum value of is:
(A) 0

(B) 4

(C) 3

(D) 2
Q2: Let be such that for all and are
in A.P., then the minimum value of is:
(A) 0

(B) 4

(C) 3

(D) 2
Solution:

Applying inequality, we get

Also, Applying inequality, we get

Adding (1) and (2), we get

Thus, minimum value of is 3.

Q3: The inverse of the function , is

(A)

(B)

(C)

(D)
Q3: The inverse of the function , is

(A)

(B)

(C)

(D)
Solution:

Put
Applying componendo-dividendo on both sides
Q4: Let be a function which satisfies f (x + y) = f (x) + f (y) If f (1)

= 2 and then the value of n, for which g (n) = 20, is :

(A) 9

(B) 5

(C) 4

(D) 20
Q4: Let be a function which satisfies f (x + y) = f (x) + f (y) If f (1)

= 2 and then the value of n, for which g (n) = 20, is :

(A) 9

(B) 5

(C) 4

(D) 20
Solution:

f (1) = 2 ; f (x + y) = f (x) + f (y)

x=y=1 f (2) = 2 + 2 = 4
x = 2, y = 1 f (3) = 4 + 2 = 6
g (n) = f (1) + f (2) + …….. + f (n – 1)
= 2 + 4 + 6 + ……. + 2 (n – 1)
Q5: Let R1 and R2 be two relations defined as follows :
and
where Q is the set of all rational numbers. Then
:
(A) R1 is transitive but R2 is not transitive

(B) R1 and R2 are both transitive

(C) R2 is transitive but R1 is not transitive

(D) Neither R1 nor R2 is transitive

Q5: Let R1 and R2 be two relations defined as follows :
and
where Q is the set of all rational numbers. Then
:
(A) R1 is transitive but R2 is not transitive

(B) R1 and R2 are both transitive

(C) R2 is transitive but R1 is not transitive

(D) Neither R1 nor R2 is transitive

Solution:

For
Let

is not transitive
For
Let

is not transitive.
Q6: If where N is the set of all

natural numbers, then the value of is :

(A)

(B)

(C)

(D)
Q6: If where N is the set of all

natural numbers, then the value of is :

(A)

(B)

(C)

(D)
Solution:

f (x + y) = f (x) f (y)
Put x = 1, y = 1
f (2) = (f (1))2
Put x = 2, y = 1
f (3) = f (2) . f (1) = f ((1))3
Put x = 2, y = 2
f (4) = f ((2))2 = f ((1))4
f (n) = (f (1))n
Q7: For a suitably chosen real constant a, let a function, be defined by
. Further suppose that for any real number
Then is equal to:
(A) –3

(B) 3

(C)

(D)
Q7: For a suitably chosen real constant a, let a function, be defined by
. Further suppose that for any real number
Then is equal to:
(A) –3

(B) 3

(C)

(D)
Solution:
Q8: Let A = {a,b,c} and B = {1,2,3,4}. Then the number of elements in the set
and is not one-one is_____
Q8: Let A = {a,b,c} and B = {1,2,3,4}. Then the number of elements in the set
and is not one-one is_____
19.00

Solution:

C = {f : and f is not one-one}

Case-I: If f (x) = 2, then number of function = 1
Case-II: If f (x) = 2 for exactly two elements then total number of many-one function
Case-III: If f (x) = 2 for exactly one element then total number of many-one functions
Total number of elements in set C = 19
Q9: Let and be defined as

Then the number of possible functions such that is

(A)

(B)

(C)

(D)
Q9: Let and be defined as

Then the number of possible functions such that is

(A)

(B)

(C)

(D)

Solution:

when is even
So total number of functions from to
Q10: Let be a
relation, then the equivalence class of (1, –1) is the set :
(A)

(B)

(C)

(D)
Q10: Let be a
relation, then the equivalence class of (1, –1) is the set :
(A)

(B)

(C)

(D)

Solution:

As the distance from origin of the point is so the locus of all the points at distance is .
Hence the equivalence class containing for the relation
Q11: Let such that and be any
arbitrary function. Which of the following statements is NOT true?
(A) If is onto, then is one-one

(B) is one-one

(C) If is onto, then

(D) If is one-one, then is one-one

Q11: Let such that and be any
arbitrary function. Which of the following statements is NOT true?
(A) If is onto, then is one-one

(B) is one-one

(C) If is onto, then

(D) If is one-one, then is one-one

Solution:

Since is one-one, therefore will also be one-one.

Q12: Let be defined as and be defined as

.Then the composition function is

(A) One-one but not onto

(B) Both one-one and onto

(C) Neither one-one nor onto

(D) Onto but not one-one

Q12: Let be defined as and be defined as

.Then the composition function is

(A) One-one but not onto

(B) Both one-one and onto

(C) Neither one-one nor onto

(D) Onto but not one-one

Solution:

One-one, into
Q13: Let be defined by
Let be given as Then, the sum of all the values of x for which
is equal to.
(A) 2

(B) 7

(C) 5

(D) 3
Q13: Let be defined by
Let be given as Then, the sum of all the values of x for which
is equal to.
(A) 2

(B) 7

(C) 5

(D) 3

Solution:

The required term is 5

Q14: Let A = {2, 3, 4, 5, ..., 30} and ‘ ’ be an equivalence relation on A × A, defined by (a, b)
(c, d), if and only if ad = bc. Then the number of ordered pairs which satisfy this
equivalence relation with ordered pair (4, 3) is equal to :
(A) 6

(B) 5

(C) 8

(D) 7
Q14: Let A = {2, 3, 4, 5, ..., 30} and ‘ ’ be an equivalence relation on A × A, defined by (a, b)
(c, d), if and only if ad = bc. Then the number of ordered pairs which satisfy this
equivalence relation with ordered pair (4, 3) is equal to :
(A) 6

(B) 5

(C) 8

(D) 7

Solution:

Total number of elements = 7

Q15: The inverse of is :
(A)

(B)

(C)

(D)
Q15: The inverse of is :
(A)

(B)

(C)

(D)

Solution:

So,
Q16: Let be defined by . Then the value of for which
for all is ?
(A) No such exists

(B) 5

(C) 6

(D) 8
Q16: Let be defined by . Then the value of for which
for all is ?
(A) No such exists

(B) 5

(C) 6

(D) 8

Solution:

Let

Now,

From equation (i) and (ii)

Clearly, .
Q17: Let be defined as

for al .
Then which of the following statements is true ?
(A) gogog = g

(B) There exists an onto function such that fog = f

(C) There exists a one-one function such that fog = f

(D) There exists an function such that gof = f

Q17: Let be defined as

for al .
Then which of the following statements is true ?
(A) gogog = g

(B) There exists an onto function such that fog = f

(C) There exists a one-one function such that fog = f

(D) There exists an function such that gof = f

Solution:

for

Similarly

So
(2) If and f is an onto function such that then
One of its possibilities is by taking as onto function

(3) If and f is a one-one function such that then

but
(4) As

So,
So .
Q18: Let be defined as
Then, the value of

is equal to:
(A)

(B)

(C)

(D)
Q18: Let be defined as
Then, the value of

is equal to:
(A)

(B)

(C)

(D)
Solution:

So,

Thus
Now is natural number
Thus
Q19: Let N be the set of natural numbers and a relation R on N be defined by
Then the relation R is:
(A) reflexive and symmetric, but not transitive

(B) reflexive but neither symmetric nor transitive

(C) an equivalence relation

(D) symmetric but neither reflexive nor transitive

Q19: Let N be the set of natural numbers and a relation R on N be defined by
Then the relation R is:
(A) reflexive and symmetric, but not transitive

(B) reflexive but neither symmetric nor transitive

(C) an equivalence relation

(D) symmetric but neither reflexive nor transitive

Solution:

Now, so reflexive
But not symmetric & transitive
See, (3,1) satisfies but (1,3) does not.
Also (9,3) & (3,1) satisfies but (9,1) does not
Q20: Consider function and such that
exists, then:
(A) and both are one-one

(B) is onto and is one-one

(C) is one-one and is onto

(D) and both are onto

Q20: Consider function and such that
exists, then:
(A) and both are one-one

(B) is onto and is one-one

(C) is one-one and is onto

(D) and both are onto

Solution:

exists is bijective must be bijective.

must be one-one and ‘g’ must be onto.
Q21: Which of the following is not correct for relation on the set of real numbers?
(A) is reflexive and symmetric.

(B) is symmetric but not transitive.

(C) is reflexive but not symmetric.

(D) is neither transitive nor symmetric.

Q21: Which of the following is not correct for relation on the set of real numbers?
(A) is reflexive and symmetric.

(B) is symmetric but not transitive.

(C) is reflexive but not symmetric.

(D) is neither transitive nor symmetric.

Solution:

Note that and satisfy

is symmetric but not transitive.
Q22: Let be a function such that for every
. If then is equal to:
(A) 36

(B) 6

(C) 18

(D) 54
Q22: Let be a function such that for every
. If then is equal to:
(A) 36

(B) 6

(C) 18

(D) 54

Solution:

Put

Put

Put
Q23: If and then the value of

the expression is _____.

Q23: If and then the value of

the expression is _____.

2.00

Solution:

(i) + (ii)
Q24: Let Then the number of possible functions such
that for every and is equal to _____
Q24: Let Then the number of possible functions such
that for every and is equal to _____
490.00

Solution:

Put
Put

Put

can take any value

Total
Q25: Let be a polynomial of degree 3 such that for . Then
the value of is equal to ___________
Q25: Let be a polynomial of degree 3 such that for . Then
the value of is equal to ___________
26.00

Solution:

put
we get
Now put in equation (1)

put

.
Q26: Suppose that the function satisfies f (x + y) = f (x) f (y) for all x, y R and f

(1) = 3. , then n is equal to ........

Q26: Suppose that the function satisfies f (x + y) = f (x) f (y) for all x, y R and f

(1) = 3. , then n is equal to ........

5.00

Solution:

Put
Put
..
..
..
Similarly
Q27: The number of one-one function f : {a, b, c, d} {0, 1, 2, ........., 10} such that 2f (a) – f
(b) + 3f (c) + f (d) = 0 is .................... .
Q27: The number of one-one function f : {a, b, c, d} {0, 1, 2, ........., 10} such that 2f (a) – f
(b) + 3f (c) + f (d) = 0 is .................... .
31.00

Solution:

2f (a) + 3f (c) = f (d) – f (b)

Using fundamental principle of counting
Number of one-one function is 31
Q28: Let be a function defined by .
If the function the greatest integer less than or equal
to g (1) is ................ .
Q28: Let be a function defined by .
If the function the greatest integer less than or equal
to g (1) is ................ .
2.00

Solution:
Q29: Let satisfy If
, then is equal to .............. .
Q29: Let satisfy If
, then is equal to .............. .
248.00

Solution:

Put y = 2

............. (i)

............ (ii)
solving eq. (i) and (ii), we get

from equation (i), we get

Now,

= 248
Q30: Let be a function defined
Then is equal to ………….. .
Q30: Let be a function defined
Then is equal to ………….. .
99.00

Solution:
Q31: Let S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Define

as

Let be a function such that

, then

g (10) ((g (1) + g (2) + g (3) + g (4) + g (5)) is equal to:

Q31: Let S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Define

as

Let be a function such that

, then

g (10) ((g (1) + g (2) + g (3) + g (4) + g (5)) is equal to:

190.00

Solution:

g (10) . [g (1) + g (2) + g (3) + g (4) + g (5)]

= 10 . [1 + 6 + 2 + 7 + 3] = 190
Q32: Let and be relations on the set {1, 2,..., 50} such that
is prime and is an integer}
and is a prime and or 1}.
Then, the number of elements in is .................. .
Q32: Let and
be relations on the set {1, 2,..., 50} such that
is prime and is an integer}
and is a prime and or 1}.
Then, the number of elements in is .................. .
8.00

Solution:

Here,
Now p can take values
and
We can calculate no. of elements is R, as

And rest for all other two elements each

Similarly for
Q33: Let Then the number of elements in the set
is onto and
is
Q33: Let Then the number of elements in the set
is onto and
is
37.00

Solution:

(1, 1), (1, 4), (4, 1), (2, 4), (4, 2), (3, 4), (4, 3), (4, 4) – all have one choice for image.
(2, 1), (1, 2), (2, 2) – all have three choices for image.
(3, 2), (2, 3), (3, 1), (1, 3), (1, 3), (3, 3) – all have two choices for image.
So the total functions
Case 1 : None of the pre-images have 3 as image
Total function
Case 2 : None of the pre-images have 2 as image
Total function
Case 3 : None of the pre-images have either 3 or 2 as image
Total functions
Total onto functions
Q34: Let and be two real polynomials of degree 2 and 1 respectively. If
and then the value of
is ............ .
Q34: Let and be two real polynomials of degree 2 and 1 respectively. If
and then the value of
is ............ .
18.00

Solution:

So,

Ans. 18
Q35: The number of functions f, from the set
to the set
such that for every is ………… .
Q35: The number of functions f, from the set
to the set
such that for every is ………… .
1440.00

Solution:

Total number of such function

Q36: The domain of the function is

(A)

(B)

(C)

(D)
Q36: The domain of the function is

(A)

(B)

(C)

(D)
Solution:

after taking intersection

after taking intersection of each solution

Q37: Let be a function such that for natural numbers

and . If , then the value of for which holds, is

(A) 2

(B) 3

(C) 4

(D) 6
Q37: Let be a function such that for natural numbers

and . If , then the value of for which holds, is

(A) 2

(B) 3

(C) 4

(D) 6
Solution:

From (1)

--
--
--

from (2)

Hence
Q38: Let be defined as If is a function such
that , then is equal to ................ .
(A)

(B)

(C)

(D)
Q38: Let be defined as If is a function such
that , then is equal to ................ .
(A)

(B)

(C)

(D)
Solution:

increasing function
invertible
is inverse of

put
Q39: Let If for all , then
is equal to:
(A)

(B)

(C)

(D)
Q39: Let If for all , then
is equal to:
(A)

(B)

(C)

(D)

Solution:
Q40: Let , . If is the range
of the function then is equal to:
(A) 11

(B)

(C)

(D)
Q40: Let , . If is the range
of the function then is equal to:
(A) 11

(B)

(C)

(D)

Solution:

is a dec. function

Range :
Q41: Let be defined as and be
defined as Then the function is :
(A) one-one but not onto function

(B) onto but not one-one function

(C) both one-one and onto function

(D) neither one-one nor onto function

Q41: Let be defined as and be
defined as Then the function is :
(A) one-one but not onto function

(B) onto but not one-one function

(C) both one-one and onto function

(D) neither one-one nor onto function

Solution:

even function
Hence f (g (x)) is many one function

Range :-
Hence, Range Co-domain f (g (x)) is into function.
Q42: Let a function be defined by

then, is
(A) One-one but not onto

(B) Onto but not one-one

(C) Neither one-one nor onto

(D) One-one and onto

Q42: Let a function be defined by

then, is
(A) One-one but not onto

(B) Onto but not one-one

(C) Neither one-one nor onto

(D) One-one and onto

Solution:

Note that for any element, it will fall into exactly. one of these sets.

Corresponding to that , we will get exactly one value of .

Thus, is one – one & onto
Q43: Let and
Then on
(A) Both and are equivalence relations

(B) Neither nor is an equivalence relation

(C) is an equivalence relation but is not

(D) is an equivalence relation but is not

Q43: Let and
Then on
(A) Both and are equivalence relations

(B) Neither nor is an equivalence relation

(C) is an equivalence relation but is not

(D) is an equivalence relation but is not

Solution:

For
(i) Reflexive relation

(ii) Symmetric relation

(iii) Transitive relation

but
For
(i) Reflexive relation

(ii) Symmetric relation

(iii) Transitive relation

but
Q44: Let be a quadratic polynomial such that . If one of the roots
of is then the sum of the roots of is equal to :
(A)

(B)

(C)

(D)
Q44: Let be a quadratic polynomial such that . If one of the roots
of is then the sum of the roots of is equal to :
(A)

(B)

(C)

(D)

Solution:

Sum of roots
Q45: Let a set where for
Define the relation R from A to A by if and only if
}. Then, R is :
(A) Reflexive, symmetric but not transitive

(B) Reflexive, transitive but not symmetric

(C) Reflexive but not symmetric and transitive

(D) An equivalence relation

Q45: Let a set where for
Define the relation R from A to A by if and only if
}. Then, R is :
(A) Reflexive, symmetric but not transitive

(B) Reflexive, transitive but not symmetric

(C) Reflexive but not symmetric and transitive

(D) An equivalence relation

Solution:

A = {1, 2, 3}
R = {(1, 1), (1, 2), (1, 3) (2, 1), (2, 2), (2, 3) (3,1), (3, 2) (3, 3)}
Q46: The total number of functions, such that
is equal to :
(A) 60

(B) 90

(C) 108

(D) 126
Q46: The total number of functions, such that
is equal to :
(A) 60

(B) 90

(C) 108

(D) 126

Solution:

Here can be 2, 3, 4, 5, 6

cases

cases

cases

cases
Total number of cases
Q47: The number of bijective function
such that is ……….. .
(A)

(B)

(C)

(D)
Q47: The number of bijective function
such that is ……….. .
(A)

(B)

(C)

(D)

Solution:

As function is one-one and onto, out of 50 elements of domain set 17 elements are following restriction

So number of ways
Q48: Let and be two relations defined on by and
then
(A) is an equivalence relation but not

(B) is an equivalence relation but not

(C) both and are equivalence relations

(D) neither nor is an equivalence relation

Q48: Let and be two relations defined on by and
then
(A) is an equivalence relation but not

(B) is an equivalence relation but not

(C) both and are equivalence relations

(D) neither nor is an equivalence relation

Solution:

For reflexive which is true.

For symmetric
If
If
Then but is not true
not transitive relation.
is not equivalence
if it does not implies
is not equivalence relation
Q49: Let be functions defined by where is the
maximum of the powers of those primes such that divides a, and for
all Then, the function is
(A) one-one but not onto

(B) onto but not one-one

(C) both one-one and onto

(D) neither one-one nor onto

Q49: Let be functions defined by where is the
maximum of the powers of those primes such that divides a, and for
all Then, the function is
(A) one-one but not onto

(B) onto but not one-one

(C) both one-one and onto

(D) neither one-one nor onto

Solution:

Where is max of powers of prime P such that divides a. Also

Many one does not contain 1

into function
Ans (d) [neither one-one nor onto]
Q50: The domain of the function
,
where is the greatest integer function, is :
(A)

(B)

(C)

(D)
Q50: The domain of the function
,
where is the greatest integer function, is :
(A)

(B)

(C)

(D)
Solution:

So,
Q51: For consider a relation R on N given by is a
multiple of 7}. The relation R is an equivalence relation if and only if :
(A)

(B) is a multiple of 4

(C) 4 is the remainder when is divided by 10

(D) 4 is the remainder when is divided by 7

Q51: For consider a relation R on N given by is a
multiple of 7}. The relation R is an equivalence relation if and only if :
(A)

(B) is a multiple of 4

(C) 4 is the remainder when is divided by 10

(D) 4 is the remainder when is divided by 7

Solution:

For R to be reflexive

when divided by 7, remainder is 4.

R to be symmetric

Which holds when is multiple of 7

(as did earlier)
R to be transitive

and

Which is true again when divisible by 7, i.e. when divided by 7, remainder is 4.

Q52: Let and be three positive real numbers. Let
and be such that for all If
be in arithmetic progression with mean zero, then the value of

is equal to :

(A) 0

(B) 3

(C) 9

(D) 27
Q52: Let and be three positive real numbers. Let
and be such that for all If
be in arithmetic progression with mean zero, then the value of

is equal to :

(A) 0

(B) 3

(C) 9

(D) 27

Solution:

Consider a case when then

Q53: Let be such that and . If
, then is equal to
(A)

(B)

(C)

(D) 4
Q53: Let be such that and . If
, then is equal to
(A)

(B)

(C)

(D) 4

Solution:

(ii) – (iii)
put in equation (i)