RankRizz
JEE MAIN 2019 · 10 JAN S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2019 Mathematics question — Composite functions

Let NN be the set of natural numbers and two functions ff and gg be defined as f,g:N→Nf, g: N \to N such that f(n)={n+12,if n is oddn2,if n is evenf(n) = \begin{cases} \frac{n+1}{2}, & \text{if n is odd} \\ \frac{n}{2}, & \text{if n is even} \end{cases} and g(n)=n−(−1)ng(n) = n - (-1)^n. Then fogfog is:

SOLUTION

We consider the set of natural numbers N={1,2,3,… }N=\{1,2,3,\dots\} and the two given functions

f:N→N,f(n)={n+12,if n is oddn2,if n is evenf:N\to N,\qquad f(n)= \begin{cases} \dfrac{n+1}{2}, & \text{if }n\text{ is odd}\\[6pt] \dfrac{n}{2}, & \text{if }n\text{ is even} \end{cases}

and

g:N→N,g(n)=n−(−1)n.g:N\to N,\qquad g(n)=n-(-1)^n.

First we rewrite gg separately for even and odd inputs. We know the elementary fact (−1)n={1,n even−1,n odd.(-1)^n=\begin{cases}1,& n\text{ even}\\-1,& n\text{ odd.}\end{cases} Using this fact, we have

For even n,n, say n=2k,n=2k,

g(2k)=2k−1.g(2k)=2k-1.

For odd n,n, say n=2k−1,n=2k-1,

g(2k−1)=2k−1−(−1)2k−1=2k−1−(−1)=2k.g(2k-1)=2k-1-(-1)^{2k-1}=2k-1-(-1)=2k.

So

g(n)={n−1,n evenn+1,n odd.g(n)=\begin{cases} n-1,& n \text{ even}\\ n+1,& n \text{ odd}. \end{cases}

Now we evaluate the composition f∘g,f\circ g, that is, (f∘g)(n)=f(g(n)).\bigl(f\circ g\bigr)(n)=f\bigl(g(n)\bigr). We again consider the parity of n.n.

Case 1 : nn is even. Write n=2k.n=2k. Then

g(n)=g(2k)=2k−1,g(n)=g(2k)=2k-1,

and this number 2k−12k-1 is odd. When the input to ff is odd we use the first branch of f,f, hence

f(g(2k))=f(2k−1)=(2k−1)+12=2k2=k.f\bigl(g(2k)\bigr)=f(2k-1)=\dfrac{(2k-1)+1}{2}=\dfrac{2k}{2}=k.

Because n=2k,n=2k, we can rewrite this result as

(f∘g)(n)=n2,n even.\bigl(f\circ g\bigr)(n)=\dfrac{n}{2},\qquad n\text{ even}.

Case 2 : nn is odd. Write n=2k−1.n=2k-1. Then

g(n)=g(2k−1)=2k,g(n)=g(2k-1)=2k,

and this output 2k2k is even. For an even input, ff takes its second branch, giving

f(g(2k−1))=f(2k)=2k2=k.f\bigl(g(2k-1)\bigr)=f(2k)=\dfrac{2k}{2}=k.

Because n=2k−1,n=2k-1, this can be rewritten as

(f∘g)(n)=n+12,n odd.\bigl(f\circ g\bigr)(n)=\dfrac{n+1}{2},\qquad n\text{ odd}.

Combining the two cases, we obtain the explicit expression

(f∘g)(n)={n+12,n oddn2,n even\boxed{\bigl(f\circ g\bigr)(n)= \begin{cases} \dfrac{n+1}{2}, & n\text{ odd}\\[6pt] \dfrac{n}{2}, & n\text{ even} \end{cases}}

We notice that this is exactly the same rule that defines ff itself. Hence f∘g=f.f\circ g=f. To decide between the options we must examine whether this function is one-one (injective) and/or onto (surjective) as a map from NN to N.N.

Injectivity test. We compute two different inputs that yield the same output:

f(1)=1+12=1,f(2)=22=1.f(1)=\dfrac{1+1}{2}=1,\qquad f(2)=\dfrac{2}{2}=1.

The values 11 and 22 are distinct, yet f(1)=f(2).f(1)=f(2). Therefore ff is not one-one. Since f∘g=f,f\circ g=f, the composition is also not one-one.

Surjectivity test. Take any arbitrary natural number m∈N.m\in N. Choosing n=2mn=2m (which is even) gives

f(2m)=2m2=m.f(2m)=\dfrac{2m}{2}=m.

Thus every element mm in the codomain NN is hit by some element of the domain, so ff is onto, and therefore f∘gf\circ g is also onto.

We have proved that f∘gf\circ g is onto but not one-one.

Hence, the correct answer is Option A.

Tagged Composite functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

ChapterFunctions
TopicComposite functions
TypeMultiple choice