Let be defined as
, for all
Then which of the following statements is true?
We begin by rewriting the definition of the given function in the language of congruence-classes because this will make every later step completely transparent. For any natural number we can write or for a unique . Using this unique representation we have
So, whenever or , the value of is simply , while for the value becomes . Placing the three cases side by side we see that every set
forms a closed cycle under :
Because the cycle length is exactly three, applying three times brings us back to the starting point:
In compact notation this is written as . Therefore is the identity, while itself is not the identity (no natural number is fixed). We will now test each option one after another.
Testing Option A. We must find a surjective (onto) function satisfying
Let us first analyse the algebraic condition. Substituting the three possible forms of we get
Combining the three equalities we obtain the single rule
In words, each entire 3-cycle must be sent to one and the same value. But we are still free to choose which value that is, for every individual cycle. A very convenient (and classical) choice is
Now we check surjectivity. Given any natural number , set (allowed because ). Then , so lies in the image. Thus the function hits every natural number, i.e. it is onto. Because the function also satisfies the required equality, Option A is true.
Testing Option B. The same algebraic argument used above tells us that any with must be constant on each 3-cycle. Hence there will always be at least three distinct inputs having the same output, immediately contradicting the definition of a one-one (injective) function. Therefore Option B is false.
Testing Option C. We have already observed that , so
because no element is fixed by . Hence is incorrect, making Option C false.
Testing Option D. Here we seek an such that . Writing this out we have
This means every value taken by must be a fixed point of . Yet we saw earlier that possesses no fixed point at all. Consequently no such can exist, and Option D is also false.
Only Option A survives every check. Hence, the correct answer is Option A.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.