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

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

Let f,g:N→Nf, g : N \to N such that f(n+1)=f(n)+f(1)f(n + 1) = f(n) + f(1) ∀n∈N\forall n \in N and gg be any arbitrary function. Which of the following statements is NOT true?

SOLUTION

Given f(n+1)=f(n)+f(1)f(n + 1) = f(n) + f(1) for all n∈Nn \in \mathbb{N}, we can deduce that f(n)=n⋅f(1)f(n) = n \cdot f(1) for all n∈Nn \in \mathbb{N} (by induction). Let f(1)=kf(1) = k where k∈Nk \in \mathbb{N}, so f(n)=knf(n) = kn.

Checking Option A: If ff is onto, then every natural number must be in the range. Since f(n)=knf(n) = kn, the range is {k,2k,3k,…}\{k, 2k, 3k, \ldots\}. For this to equal N\mathbb{N}, we need k=1k = 1, so f(n)=nf(n) = n. This statement is TRUE.

Checking Option C: ff is one-one. Since f(n)=knf(n) = kn and k≥1k \geq 1, if f(m)=f(n)f(m) = f(n) then km=knkm = kn so m=nm = n. This statement is TRUE.

Checking Option D: If f∘gf \circ g is one-one, then gg is one-one. If g(m)=g(n)g(m) = g(n), then f(g(m))=f(g(n))f(g(m)) = f(g(n)), and since f∘gf \circ g is one-one, we must have m=nm = n. This statement is TRUE.

Checking Option B: If gg is onto, then f∘gf \circ g is one-one. Consider the counterexample where k=1k = 1 (so f(n)=nf(n) = n) and define gg as: g(1)=g(2)=1g(1) = g(2) = 1 and g(n)=n−1g(n) = n - 1 for n≥3n \geq 3. Then gg is onto (every natural number is in the range), but f(g(1))=f(1)=1=f(1)=f(g(2))f(g(1)) = f(1) = 1 = f(1) = f(g(2)) while 1≠21 \neq 2, so f∘gf \circ g is NOT one-one. This statement is NOT TRUE.

Therefore, the statement that is NOT true is: if gg is onto, then f∘gf \circ g is one-one.

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