If denotes the set of all subsets of a given set , then the number of one-to-one functions from the set to the set is
- A
- B
- C
- D
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%
41–43 OF 43 · NEWEST FIRST
If denotes the set of all subsets of a given set , then the number of one-to-one functions from the set to the set is
Statement 1: If and be two sets having and elements respectively, where . Then the total number of functions from set to set is . Statement 2: The total number of selections of different objects out of objects is .
Statement 1 is true, Statement 2 is false.
Statement 1 is true, Statement 2 is true, Statement 2 is not a correct explanation of Statement 1.
Statement 1 is false, Statement 2 is true
Statement 1 is true, Statement 2 is true, Statement 2 is a correct explanation of Statement 1.
For real , let , then
is one-one but not onto
is onto but not one-one
is one-one and onto
is neither one-one nor onto