If set A has n elements, then number of functions that can be deined from A into A is
| A. | n2 |
| B. | n! |
| C. | nn |
| D. | n |
|
Option: C Explanation : Click on Discuss to view users comments. |
If f : Z → Z be defined as f(x) = x2 , x ∈ Z, then function f is
| A. | bijection |
| B. | injection |
| C. | surjection |
| D. | None of these |
|
Option: D Explanation : Click on Discuss to view users comments. |
'Subset' relation on a set of sets is
| A. | a partial ordering |
| B. | an equivalence relation |
| C. | transitive and symmetric only |
| D. | transitive and anti-symmetric only |
|
Option: A Explanation : Click on Discuss to view users comments. |
The correspondence f : N → N is such that
f(x) = y and for x= p1e1, p2e2,...pkek where pi are distinct primes and integers ei>1, if y = ei + e2 +...+ek, then
| A. | f is not a function |
| B. | f is an onto function |
| C. | f is an 1 - 1 function |
| D. | f is neither 1 - 1 nor onto function |
|
Option: B Explanation : Click on Discuss to view users comments. |
