If the function is defined by then which of the following statements is TRUE ? [2020]
is one-one, but NOT onto
is onto, but NOT one-one
is BOTH one-one and onto
is NEITHER one-one NOR onto
(3)
and
and
The function , defined by is [2012]
one-one and onto
onto but not one-one
one-one but not onto
neither one-one nor onto
(2)
and
Also,
Let , and be real-valued functions defined on the interval [0, 1] by and If , and denote, respectively, the absolute maximum of , and on [0, 1], then [2010]
and
and
and
(4)
If the functions and are defined on such that
then is [2005]
one-one & onto
neither one-one nor onto
one-one but not onto
onto but not one-one
(1)
and
Since , for any , there is only one value of whether is rational or irrational. Moreover, as , also belongs to . Therefore is one-one onto.
If and then is [2003]
one-one and onto
one-one but not onto
onto but not one-one
neither one-one nor onto
(2)
and
Now,
For range, let
Now,
Let function be defined by for then is [2002]
one-to-one and onto
one-to-one but NOT onto
onto but NOT one-to-one
neither one-to-one nor onto
(1)
Now,
and
Suppose for If is the function whose graph is the reflection of the graph of with respect to the line , then equals [2002]
(4)
If is the reflection of in the line , then it can be obtained by interchanging and in
i.e., changes to
[IMAGE 1199]
Let = {1, 2, 3, 4} and = {1, 2}. Then the number of onto functions from to is [2001]
14
16
12
8
(1)
E = {1, 2, 3, 4} and F = {1, 2}
From E to F we can define, in all, 2 × 2 × 2 × 2 = 16 functions (2 options for each element of E), out of which 2 are into, when all the elements of E either map to 1 or to 2.
Number of onto functions = 16 − 2 = 14
The domain of definition of the function is given by the equation is [2000]
(4)
Let be any function. Define by for all . Then is [2000]
onto if is onto
one-one if is one-one
continuous if is continuous
differentiable if is differentiable
(3)
Since the composition of two continuous functions is continuous, therefore is continuous if is continuous.
Let the set of all relations on the set such that is reflexive and symmetric, and contains exactly 10 elements, be denoted by . Then the number of elements in is ______. [2025]
(105)
[IMAGE 1200]
For relation to be reflexive, all the diagonal elements must be taken.
Out of the remaining 30 elements, there are 15 pairs, and we need 2 pairs such that R contains exactly 10 elements and is both reflexive and symmetric.
Hence, Number of ways
Let be a set with exactly 5 elements and be a set with exactly 7 elements. If is the number of one-one functions from to and is the number of onto functions from to , then the value of is ________. [2018]
(119)
[IMAGE 1201]
Let denote the set of all natural numbers, and denote the set of all integers. Consider the functions and defined by
and
Define for all , and for all .
Then which of the following statement(s) is (are) TRUE? [2025]
is NOT one-one and is NOT onto
is NOT one-one but is onto
is one-one and is onto
is NOT one-one but is onto
Select one or more options
(1, 4)
Let and let be given by Then [2014]
has three real roots if
has only one real root if
has three real roots if
has three real roots if
Select one or more options
(2, 4)
and
Also,
Thus, the graph of will be as shown below.
[IMAGE 1202]
From the graph, it is clear that if
then or has 3 real roots.
If or
then has only one real root.
Options (2) and (4) are the correct options.
The function has a local minimum or a local maximum at [2013]
Select one or more options
(1, 2)
Given:
Critical points of can be obtained by solving
and
which give
Graph of is as follows:
[IMAGE 1203]
From the graph, has local minimum at and and has local maximum at
Let be such that for Then the value(s) of is (are) [2012]
Select one or more options
(1, 2)
or
Match the statements given in Column-I with the intervals/union of intervals given in Column-II. [2011]
| Column-I | Column-II | ||
| (A) | The set { is a complex number, } is |
(p) | |
| (B) | The domain of the function is |
(q) | |
| (C) | If then the set is |
(r) | |
| (D) | If then is increasing in |
(s) | |
| (t) |
(A) → (s), (B) → (t), (C) → (r), (D) → (r)
(A) → (r), (B) → (t), (C) → (r), (D) → (s)
(A) → (r), (B) → (r), (C) → (t), (D) → (s)
(A) → (t), (B) → (r), (C) → (r), (D) → (s)
(1)
(A) → (s), (B) → (t), (C) → (r), (D) → (r)
Then
where,
We should have
We know that
[IMAGE 1204]
Hence,
Also,
[IMAGE 1205]
Hence,
From (i) and (ii), we get
Applying
For to be increasing,
[IMAGE 1206]
Hence,
Let
Match the expressions/statements in Column I with the expressions/statements in Column II and indicate your answer by darkening the appropriate bubbles in the matrix given in the ORS. [2007]
| Column I | Column II | ||
| (A) | If , then satisfies | (p) | |
| (B) | If , then satisfies | (q) | |
| (C) | If , then satisfies | (r) | |
| (D) | If , then satisfies | (s) |
(A) → (q); (B) → (r), (s), (p), (s); (C) → (q), (s); (D) → (r), (s), (p)
(A) → (r), (s), (p); (B) → (q), (s); (C) → (q), (s); (D) → (r), (s), (p)
(A) → (q); (B) → (q), (s), (s); (C) → (r), (s), (p); (D) → (r), (s), (p)
(A) → (q); (B) → (s), (s); (C) → (r), (s); (D) → (r), (s), (p)
(2)
(A) → (r), (s), (p); (B) → (q), (s); (C) → (q), (s); (D) → (r), (s), (p)
(A) If then
Also,
For
(B) If then
and so,
(C) If then
and so,
(D) For
Also,
For ,
Let and be the set of all relations from to that satisfy both the following properties:
(i) has exactly 6 elements.
(ii) For each , we have .
Let and
Let denote the number of elements in a set A. [2024]
Q. If , then the value of is _______.
(20)
Given
Let be a relation such that
Number of elements in
and for each
set of all such relations
[IMAGE 1207]
Total number of ordered pairs such that
= number of elements in
Let and be the set of all relations from to that satisfy both the following properties:
(i) has exactly 6 elements.
(ii) For each , we have
Let and
Let denote the number of elements in a set . [2024]
Q. If the value of is , then is _____.
(36)
Given
Number of elements in
and for each
set of all such relations
If [IMAGE 1208]
Total number of ordered pairs such that
= number of elements in
From above, if range of has exactly one element, then maximum number of elements in will be