RankRizz
JEE MAIN 2021 · 25 JUL S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — One-one, onto functions and counting functions

Let g:N→Ng : N \to N be defined as
g(3n+1)=3n+2g(3n+1) = 3n+2
g(3n+2)=3n+3g(3n+2) = 3n+3
g(3n+3)=3n+1g(3n+3) = 3n+1, for all n≥0n \ge 0
Then which of the following statements is true?

SOLUTION

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 x∈Nx\in \mathbb N we can write x=3n+1,  3n+2x=3n+1,\;3n+2 or 3n+33n+3 for a unique n≥0n\ge 0. Using this unique representation we have

g(3n+1)=3n+2,g(3n+2)=3n+3,g(3n+3)=3n+1,n≥0.g(3n+1)=3n+2,\qquad g(3n+2)=3n+3,\qquad g(3n+3)=3n+1,\qquad n\ge 0.

So, whenever x≡1(mod3)x\equiv 1\pmod 3 or x≡2(mod3)x\equiv 2\pmod 3, the value of gg is simply x+1x+1, while for x≡0(mod3)x\equiv 0\pmod 3 the value becomes x−2x-2. Placing the three cases side by side we see that every set

{ 3n+1,  3n+2,  3n+3 }\{\,3n+1,\;3n+2,\;3n+3\,\}

forms a closed cycle under gg:

3n+1  →g  3n+2  →g  3n+3  →g  3n+1.3n+1\;\xrightarrow{g}\;3n+2\;\xrightarrow{g}\;3n+3\;\xrightarrow{g}\;3n+1.

Because the cycle length is exactly three, applying gg three times brings us back to the starting point:

g(g(g(x)))=xfor every x∈N.g(g(g(x))) = x\qquad\text{for every }x\in\mathbb N.

In compact notation this is written as g3=id⁡Ng^3 = \operatorname{id}_{\mathbb N}. Therefore g3g^3 is the identity, while gg 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 f:N→Nf:\mathbb N\to\mathbb N satisfying

f(g(x))=f(x)for all x∈N.f\bigl(g(x)\bigr)=f(x)\quad\text{for all }x\in\mathbb N.

Let us first analyse the algebraic condition. Substituting the three possible forms of xx we get

x=3n+1  ⟹  f(g(3n+1))=f(3n+1)  ⟹  f(3n+2)=f(3n+1),x=3n+2  ⟹  f(g(3n+2))=f(3n+2)  ⟹  f(3n+3)=f(3n+2),x=3n+3  ⟹  f(g(3n+3))=f(3n+3)  ⟹  f(3n+1)=f(3n+3).\begin{aligned} x=3n+1 &\;\Longrightarrow\; f\bigl(g(3n+1)\bigr)=f(3n+1) \\[2pt] &\;\Longrightarrow\; f(3n+2)=f(3n+1),\\[6pt] x=3n+2 &\;\Longrightarrow\; f\bigl(g(3n+2)\bigr)=f(3n+2) \\[2pt] &\;\Longrightarrow\; f(3n+3)=f(3n+2),\\[6pt] x=3n+3 &\;\Longrightarrow\; f\bigl(g(3n+3)\bigr)=f(3n+3) \\[2pt] &\;\Longrightarrow\; f(3n+1)=f(3n+3). \end{aligned}

Combining the three equalities we obtain the single rule

f(3n+1)=f(3n+2)=f(3n+3)for every n≥0.f(3n+1)=f(3n+2)=f(3n+3)\quad\text{for every }n\ge 0.

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

f(3n+1)=f(3n+2)=f(3n+3)=n+1,n≥0.f(3n+1)=f(3n+2)=f(3n+3)=n+1,\qquad n\ge 0.

Now we check surjectivity. Given any natural number k∈Nk\in\mathbb N, set n=k−1n=k-1 (allowed because k≥1k\ge 1). Then f(3n+1)=kf(3n+1)=k, so kk 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 ff with f∘g=ff\circ g=f 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 g3=id⁡Ng^3=\operatorname{id}_{\mathbb N}, so

g∘g∘g=id⁡N≠g,g\circ g\circ g = \operatorname{id}_{\mathbb N}\neq g,

because no element is fixed by gg. Hence gogog=ggogog=g is incorrect, making Option C false.

Testing Option D. Here we seek an ff such that g∘f=fg\circ f=f. Writing this out we have

g(f(x))=f(x)for all x∈N.g\bigl(f(x)\bigr)=f(x)\quad\text{for all }x\in\mathbb N.

This means every value taken by ff must be a fixed point of gg. Yet we saw earlier that gg possesses no fixed point at all. Consequently no such ff 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.

ChapterFunctions
TopicOne-one, onto functions and counting functions
TypeMultiple choice