Computer Sciences > GATE 2014 SET-3 > Functions
Consider the set of all functions f: {0, 1, ..., 2014} → {0, 1, ..., 2014} such that f(f(i)) = i, for all 0 ≤ i ≤ 2014. Consider the following statements:
P. For each such function it must be the case that for every i, f(i) = i.
Q. For each such function it must be the case that for some i, f(i) = i.
R. Each such function must be onto.
Which one of the following is CORRECT?
P. For each such function it must be the case that for every i, f(i) = i.
Q. For each such function it must be the case that for some i, f(i) = i.
R. Each such function must be onto.
Which one of the following is CORRECT?
Correct : b
Similar Questions
g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C.If f(.) and f(g(.)) are onto (...
g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C.If f(.) and f(g(.)) are onto (...
g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C.If f(.) and f(g(.)) are onto (...
Total Unique Visitors
Loading......