Let A = {1, 3, 7, 9, 11} and B = {2, 4, 5, 7, 8, 10, 12}. Then the total number of one-one maps , such that , is: [2024]
180
480
120
240
(D)
A = {1, 3, 7, 9, 11}, B = {2, 4, 5, 7, 8, 10, 12}
is one-one such that
Since is one-one so so we cannot take (7, 7).
So, for we have 4 choices and for we have 4 choices and remaining 3 elements have 5! choices for mapping to be one-one.
Total number of ways =
[ Pair (2, 12) and (12, 2) will be considered same]
The function is [2024]
both one-one and onto.
neither one-one nor onto.
onto but not one-one.
one-one but not onto.
(B)
Let be a function defined on R. Then the range of the function is equal to : [2024]
(C)
Since, , so we have
Let [] be the greatest integer less than or equal to . Let A be the set of all prime factors of 2310 and The number of one-to-one functions from A to the range of is [2024]
25
24
20
120
(D)
Let where and . Then the function is [2024]
onto.
both one-one and onto.
one-one.
neither one-one nor onto.
(D)
but is not possible.
is neither one-one nor onto as set has only one image i.e. 0.
If the domain of the function is then is equal to: [2024]
140
175
125
150
(D)
Let . If for some , then where denotes the greatest integer less than or equal to is equal to: [2024]
169
121
225
144
(D)
There are two cases arise:
Case I : Let is even (odd)
(even)
Case II : Let is odd
The function ; defined by = the highest prime factor of , is: [2024]
one-one only
both one-one and onto
neither one-one nor onto
onto only
(C)
Given,
the highest prime factor of
For one-one: If
If is not one-one.
For onto : Range = All prime numbers
Co-domain = Set of natural numbers
Range Co-domain is not onto.
Let and be defined as and . Then, the domain of the function is [2024]
If then range of is [2024]
[0, 1)
[0, 3)
(0, 1]
[0, 1]
(D)
Given,
and