RankRizz
JEE ADVANCED 2025 · PAPER 1+4 / −2HARDTRANSCRIBED

JEE Advanced 2025 Mathematics question — Composite functions

Let N\mathbb{N} denote the set of all natural numbers, and Z\mathbb{Z} denote the set of all integers. Consider the functions f:N→Zf: \mathbb{N} \to \mathbb{Z} and g:Z→Ng: \mathbb{Z} \to \mathbb{N} defined by

f(n)={(n+1)/2if n is odd,(4−n)/2if n is even,f(n) = \begin{cases} (n+1)/2 & \text{if } n \text{ is odd}, \\ (4-n)/2 & \text{if } n \text{ is even}, \end{cases}

and

g(n)={3+2nif n≥0,−2nif n<0.g(n) = \begin{cases} 3 + 2n & \text{if } n \geq 0, \\ -2n & \text{if } n < 0. \end{cases}

Define (g∘f)(n)=g(f(n))(g \circ f)(n) = g(f(n)) for all n∈Nn \in \mathbb{N}, and (f∘g)(n)=f(g(n))(f \circ g)(n) = f(g(n)) for all n∈Zn \in \mathbb{Z}.

Then which of the following statements is (are) TRUE?

SOLUTION

For convenience let N={1,2,3,… }\mathbb{N}=\{1,2,3,\dots\} and Z={…,−2,−1,0,1,2,… }\mathbb{Z}=\{\dots,-2,-1,0,1,2,\dots\}.

1. Properties of f:N→Zf:\mathbb{N}\to\mathbb{Z}
  • If nn is odd, write n=2k−1  (k≥1)n=2k-1\;(k\ge 1). Then f(n)=n+12=2k−1+12=k,f(n)=\frac{n+1}{2}=\frac{2k-1+1}{2}=k, which produces all positive integers 1,2,3,…1,2,3,\dots.
  • If nn is even, write n=2k  (k≥1)n=2k\;(k\ge 1). Then f(n)=4−n2=4−2k2=2−k,f(n)=\frac{4-n}{2}=\frac{4-2k}{2}=2-k, which produces the values 1,0,−1,−2,−3,…1,0,-1,-2,-3,\dots.
Combining the two cases, the image of ff is all of Z\mathbb{Z}, so ff is onto.

However, f(1)=1+12=1,f(2)=4−22=1,f(1)=\frac{1+1}{2}=1,\quad f(2)=\frac{4-2}{2}=1, and 1≠21\ne 2. Hence distinct inputs can give the same output, so ff is not one-one.

Conclusion for ff: not one-one, but onto  ⇒\Rightarrow  Option D is true.

2. Properties of g:Z→Ng:\mathbb{Z}\to\mathbb{N}
  • n≥0n\ge 0: g(n)=3+2n=3,5,7,9,…g(n)=3+2n=3,5,7,9,\dots (all odd numbers ≥3\ge 3).
  • n<0n\lt 0: write n=−k  (k≥1)n=-k\;(k\ge 1), then g(n)=−2(−k)=2k=2,4,6,8,…g(n)=-2(-k)=2k=2,4,6,8,\dots (all even numbers ≥2\ge 2).
Thus Im⁡(g)={2,3,4,5,6,… }=N∖{1}\operatorname{Im}(g)=\{2,3,4,5,6,\dots\}=\mathbb{N}\setminus\{1\}, so gg is not onto.

To test injectivity, suppose g(n1)=g(n2)g(n_1)=g(n_2).
  • If both n1,n2≥0n_1,n_2\ge 0, then 3+2n1=3+2n2⇒n1=n23+2n_1=3+2n_2\Rightarrow n_1=n_2(strictly increasing).
  • If both n1,n2<0n_1,n_2\lt 0, write them as −k1,−k2-k_1,-k_2. Then 2k1=2k2⇒k1=k2⇒n1=n22k_1=2k_2\Rightarrow k_1=k_2\Rightarrow n_1=n_2.
  • If one is ≥0\ge 0 and the other <0\lt 0, their images have opposite parity (odd vs even), so equality is impossible.
Therefore gg is one-one.

Conclusion for gg: one-one, but not onto  ⇒\Rightarrow  Option C is false.

3. The composition g∘f:N→Ng\circ f:\mathbb{N}\to\mathbb{N}
First compute the value explicitly.

Case 1: n=2k−1n=2k-1 (odd, k≥1k\ge 1).

f(n)=k(positive)f(n)=k\quad(\text{positive})
g(f(n))=g(k)=3+2kg(f(n))=g(k)=3+2k Hence g∘f(n)=3+2kg\circ f(n)=3+2k, i.e. the numbers 5,7,9,…5,7,9,\dots.

Case 2: n=2kn=2k (even, k≥1k\ge 1).

f(n)=2−kf(n)=2-k
If k=1k=1, f(n)=1,  g(1)=5f(n)=1,\;g(1)=5 (already obtained).
If k=2k=2, f(n)=0,  g(0)=3f(n)=0,\;g(0)=3.
If k≥3k\ge 3, f(n)=2−k≤−1,  g(2−k)=2k−4f(n)=2-k\le -1,\;g(2-k)=2k-4 (even numbers 2,4,6,8,…2,4,6,8,\dots).

The total image of g∘fg\circ f is therefore {2,3,4,5,6,7,8,9,… }=N∖{1},\{2,3,4,5,6,7,8,9,\dots\}=\mathbb{N}\setminus\{1\}, so g∘fg\circ f is not onto.

Also g∘f(1)=5g\circ f(1)=5 and g∘f(2)=5g\circ f(2)=5, yet 1≠21\ne 2, so the composition is not one-one.

Conclusion for g∘fg\circ f: neither one-one nor onto  ⇒\Rightarrow  Option A is true.

4. The composition f∘g:Z→Zf\circ g:\mathbb{Z}\to\mathbb{Z}

Case 1: n≥0n\ge 0.

g(n)=3+2n  (odd)g(n)=3+2n\;(\text{odd})
f(g(n))=(3+2n)+12=n+2.f(g(n))=\frac{(3+2n)+1}{2}=n+2. So for n=0,1,2,…n=0,1,2,\dots we obtain 2,3,4,…2,3,4,\dots.

Case 2: n=−kn=-k with k≥1k\ge 1.

g(n)=2k  (even)g(n)=2k\;(\text{even})
f(g(n))=4−2k2=2−k.f(g(n))=\frac{4-2k}{2}=2-k. For k=1,2,3,…k=1,2,3,\dots this gives 1,0,−1,−2,…1,0,-1,-2,\dots.

The union of the two cases yields every integer, so f∘gf\circ g is onto. To check injectivity, observe:   • n≥0  ⇒f∘g(n)=n+2n\ge 0\; \Rightarrow f\circ g(n)=n+2 (strictly increasing).   • n<0  ⇒f∘g(n)=2−nn\lt 0\; \Rightarrow f\circ g(n)=2-n (strictly decreasing). No non-negative input can share an image with a negative input, so different arguments always give different values. Hence f∘gf\circ g is one-one. Therefore Option B is false.

Final result: Only Option A and Option D are correct.

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

ChapterFunctions
TopicComposite functions
TypeMultiple correct