Let . Then the number of one-one functions , where denote the power set of , such that where is
Every JEE Main question on One-one, onto functions and counting functions, one of the ideas inside Functions: 43 questions from 2009–2026, 27 of them in the last five years. Newest first, answer key on every one. Free to read.
Questions
43
Years asked
12
Since
2009
Of the chapter
27%
21–40 OF 43 · NEWEST FIRST
Let . Then the number of one-one functions , where denote the power set of , such that where is
Let a function be defined by
then, is
One-one and onto
One-one but not onto
Onto but not one-one
Neither one-one nor onto
The total number of functions, such that , is equal to
The number of bijective functions if is
The number of one-one functions such that is ______
The number of functions , from the set to the set such that , for every , is _______.
Let . Then the number of elements in the set is onto and is
Let and be defined as
Then the number of possible functions such that is:
Let be defined as
, for all
Then which of the following statements is true?
There exists an onto function such that
There exists a one-one function such that
There exists a function such that
Let such that and be any arbitrary function. Which of the following statements is NOT true?
If is onto, then
If is onto, then is one-one
is one-one
If is one-one, then is one-one
Let denote the total number of one-one functions from a set with 3 elements to a set with 5 elements and denote the total number of one-one functions from the set to the set . Then:
Let . Then the number of bijective functions such that is equal to ___.
Let and . Then the number of elements in the set and is not one-one is...
If the function defined by , is surjective, then is equal to:
Let a function be defined by . Then f is:
not injective but it is surjective
injective only
neither injective nor surjective
None of the above
The number of functions f from onto such that is a multiple of 3, whenever k is a multiple of 4 is:
Let is not a positive integer. Define a function as , then is:
Injective but not surjective
Not injective
Surjective but not injective
Neither injective nor surjective
The function defined as , is:
Invertible
Injective but not surjective
Surjective but not injective
Neither injective nor surjective
The function defined by , where is the set of natural numbers and denotes the greatest integer less than or equal to , is:
one-one but not onto
one-one and onto
neither one-one nor onto
onto but not one-one
Let be defined by , then f is:
one-one but not onto
neither one-one nor onto
both one-one and onto
onto but not one-one