SOLVER7 Study. Nothing Else.
2026 Board Paper Q20

Assertion (A) : A function \(f :N\rightarrow N\) given by \(f(x)=x^3+2,\forall\ x\in N\) is one-one but not onto. Reason (R) : Since \(\forall\ y\in N\) (Codomain), there does not exist \(x=(y-2)^{1/3}\) in \(N\) (Domain) such that \(f(x)=x^3+2=y.\)
(A)Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
(B)Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
(C)Assertion (A) is true, but Reason (R) is false.
(D)Assertion (A) is false, but Reason (R) is true.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that takes any natural number, cubes it, and adds 2. Put in 1, get 3. Put in 2, get 10. No two inputs ever give the same output, so the machine is one-one. But not every natural number comes out — for example, 1 or 4 can never pop out, no matter what you feed in. So the machine is NOT onto. The reason given wrongly says no output has an input at all, but actually some outputs do have inputs.

Answer: Option (C): Assertion (A) is true, but Reason (R) is false. The function \( f(x) = x^3 + 2 \) is one-one but not onto; the Reason wrongly claims no \( y \in N \) has a pre-image, whereas only some do.

📖 Detailed Explanation: One-One and Onto Nature of f(x) = x^3 + 2

Detailed Explanation

A function \( f: N \to N \) is one-one (injective) if different inputs always give different outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is onto (surjective) if every element of the codomain has at least one pre-image in the domain, that is for every \( y \in N \) there exists \( x \in N \) with \( f(x) = y \). Here \( N \) is the set of natural numbers. The function \( f(x) = x^3 + 2 \) is strictly increasing, so it never repeats values, making it one-one. To check onto, we must see whether every natural number \( y \) can be written as \( x^3 + 2 \) for some natural number \( x \). Many values of \( y \) (for example \( y = 1, 2, 4, 5, \dots \)) do not give a natural number cube root, so the function is not onto.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \in N \), there exists \( x \in N \) with \( f(x) = y \). Given: \( f(x) = x^3 + 2 \).

Solution

  1. Step 1: Check one-one. Assume \( f(x_1) = f(x_2) \). Then \( x_1^3 + 2 = x_2^3 + 2 \), which gives \( x_1^3 = x_2^3 \). Taking cube roots, \( x_1 = x_2 \). Hence \( f \) is one-one (injective).
  2. Step 2: Check onto. For \( f \) to be onto, every \( y \in N \) must have a pre-image \( x \in N \) satisfying \( x^3 + 2 = y \). Solving for \( x \) gives \( x = (y - 2)^{1/3} \).
  3. Step 3: Test whether \( x = (y - 2)^{1/3} \) is always a natural number. For \( y = 1 \), \( x = (1 - 2)^{1/3} = (-1)^{1/3} \), which is not a natural number. For \( y = 4 \), \( x = (4 - 2)^{1/3} = 2^{1/3} \), which is not a natural number either. So many natural numbers have no pre-image.
  4. Step 4: Conclusion about the function. Since some \( y \in N \) have no \( x \in N \) with \( f(x) = y \), the function is not onto. Therefore \( f \) is one-one but not onto, so the Assertion (A) is true.
  5. Step 5: Analyse the Reason. The Reason states that for all \( y \in N \) there does not exist \( x = (y - 2)^{1/3} \in N \) such that \( f(x) = y \). This wording claims NO natural number \( y \) has a pre-image, which is false, because for \( y = 3 \) we get \( x = (3 - 2)^{1/3} = 1 \in N \), and for \( y = 10 \) we get \( x = 2 \in N \). Onto fails because SOME (not all) values of \( y \) lack a pre-image, so the Reason as stated is false.
  6. Step 6: Match with the options. Assertion (A) is true, but Reason (R) is false. This corresponds to option (C).

Final Answer

Option (C): Assertion (A) is true, but Reason (R) is false. The function \( f(x) = x^3 + 2 \) is one-one but not onto; the Reason wrongly claims no \( y \in N \) has a pre-image, whereas only some do.

Common Mistake

A common mistake is to accept the Reason as correct because it correctly concludes the function is not onto. But 'not onto' only requires that SOME element of the codomain has no pre-image, not ALL. Since values like \( y = 3 \) and \( y = 10 \) do have natural pre-images, the Reason's universal claim is false.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Set up the one-one check by assuming two inputs give the same output: \( f(x_1) = f(x_2) \). This means \( x_1^3 + 2 = x_2^3 + 2 \). — Reason: The standard method to verify injectivity is to start with equal outputs and see if it forces equal inputs.
  2. Step 2: Simplify the equation by subtracting 2 from both sides: \( x_1^3 = x_2^3 \). Taking cube roots on both sides gives \( x_1 = x_2 \). — Reason: Since the cube root function is one-to-one over all reals (and in particular over N), equal cubes imply equal bases, confirming f is one-one (injective).
  3. Step 3: Now check onto. For f to be onto, every \( y \in N \) must satisfy \( x^3 + 2 = y \) for some \( x \in N \). Solving for x: \[ x = (y - 2)^{1/3} \] — Reason: We need to determine whether an integer cube-root solution in N always exists for an arbitrary natural number y.
  4. Step 4: Test a specific value to look for a counterexample. Try \( y = 1 \): \[ x = (1 - 2)^{1/3} = (-1)^{1/3} = -1 \] Since \( -1 \notin N \), this y has no pre-image in N. — Reason: A single counterexample is enough to prove a function is NOT onto.
  5. Step 5: Contrast with a value that does have a pre-image. Try \( y = 10 \): \[ x = (10 - 2)^{1/3} = 8^{1/3} = 2 \] Here \( 2 \in N \), so \( y = 10 \) does have a pre-image. — Reason: This confirms that some (not all, and not none) elements of N have a pre-image, which is the key point against Reason (R).
  6. Step 6: Evaluate Assertion (A): f is one-one but not onto — True, as shown in Steps 1–4. Evaluate Reason (R): R claims that no element of N has a pre-image under f, which would mean the range is completely disjoint from N. Step 5 directly contradicts this, so Reason (R) is False. — Reason: We must judge each statement independently before selecting the MCQ option.
  7. Step 7: Match the findings to the standard MCQ format. Assertion (A) is TRUE; Reason (R) is FALSE. This corresponds to Option (C). — Reason: Option (C) is chosen when the assertion is correct but the reason given to support or explain it is incorrect.

Final Answer

Option (C): Assertion (A) is true, but Reason (R) is false. The function \( f(x) = x^3 + 2 \) is one-one but not onto; the Reason wrongly claims no \( y \in N \) has a pre-image, whereas only some do.

Common Mistake

One common mistake: Students often confuse 'not onto' with 'no element has a pre-image.' The function f(x) = x^3 + 2 is not onto because SOME natural numbers (like y = 1, 2, 4, 5) lack a natural-number pre-image — not because ALL of them do. Reason (R) makes this exact error by claiming no element of N has a pre-image, which is too strong and incorrect.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check one-one: \( f(x_1) = f(x_2) \Rightarrow x_1^3 + 2 = x_2^3 + 2 \Rightarrow x_1^3 = x_2^3 \Rightarrow x_1 = x_2 \). Hence \( f \) is one-one.
  2. Step 2: Check onto: For onto, need \( x = (y - 2)^{1/3} \in N \) for every \( y \in N \). For \( y = 1 \): \( x = (-1)^{1/3} \notin N \). For \( y = 4 \): \( x = (2)^{1/3} \notin N \). Hence \( f \) is NOT onto.
  3. Step 3: Evaluate Assertion and Reason: Assertion (A): \( f \) is one-one but not onto — TRUE. Reason (R): claims no \( y \in N \) has a pre-image — FALSE, since e.g. \( y = 3 \Rightarrow x = 1 \in N \) satisfies \( f(1) = 3 \).

Answer: Option (C): Assertion (A) is true, but Reason (R) is false. The function \( f(x) = x^3 + 2 \) is one-one but not onto; the Reason wrongly claims no \( y \in N \) has a pre-image, whereas only some do.

➕ More Examples

More Examples

Example 1

Question: Assertion (A): The function \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = 2x + 1 \) for all \( x \in \mathbb{N} \) is one-one but not onto. Reason (R): For any \( y \in \mathbb{N} \) (codomain), the value \( x = \frac{y-1}{2} \) does not always belong to \( \mathbb{N} \) (domain), so not every \( y \in \mathbb{N} \) has a pre-image. Hence \( f \) is not onto. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1 — Check whether Assertion (A) is true. One-one: Suppose \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{N} \). Then \( 2x_1 + 1 = 2x_2 + 1 \), which gives \( x_1 = x_2 \). So \( f \) is one-one. Onto: Consider \( y = 2 \in \mathbb{N} \). We need \( x \in \mathbb{N} \) such that \( f(x) = 2 \), i.e. \( 2x + 1 = 2 \). This gives \( x = \frac{1}{2} \), which does not belong to \( \mathbb{N} \). Also note that the range of \( f \) contains only odd natural numbers \( \{3, 5, 7, \ldots\} \) (taking \( \mathbb{N} = \{1, 2, 3, \ldots\} \)), so even numbers like 2, 4, 6, … are never achieved. Hence \( f \) is not onto. Assertion (A) is TRUE. Step 2 — Check whether Reason (R) is true. For \( f(x) = y \), we need \( x = \frac{y-1}{2} \). When \( y \) is even (e.g. \( y = 2 \)), \( x = \frac{1}{2} \notin \mathbb{N} \). When \( y = 1 \), \( x = 0 \notin \mathbb{N} \). So not every \( y \in \mathbb{N} \) yields an \( x \in \mathbb{N} \). Reason (R) is TRUE. Step 3 — Does R correctly explain A? R directly identifies why every \( y \in \mathbb{N} \) does not have a pre-image in \( \mathbb{N} \), which is precisely the reason \( f \) fails to be onto. This is the correct explanation of the onto-failure part of A. Conclusion: Both A and R are true, and R is the correct explanation of A.

Answer: (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).

Example 2

Question: Assertion (A): The function \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = x^2 + 3 \) for all \( x \in \mathbb{N} \) is one-one but not onto. Reason (R): The function \( f \) is not onto because \( f \) is a strictly increasing function on \( \mathbb{N} \). (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1 — Check whether Assertion (A) is true. One-one: Suppose \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{N} \). Then \( x_1^2 + 3 = x_2^2 + 3 \), so \( x_1^2 = x_2^2 \). Since \( x_1, x_2 \in \mathbb{N} \) (positive integers), this gives \( x_1 = x_2 \). Hence \( f \) is one-one. Onto: For \( f(x) = y \), we need \( x = \sqrt{y - 3} \in \mathbb{N} \). Consider \( y = 4 \in \mathbb{N} \). Then \( x = \sqrt{1} = 1 \in \mathbb{N} \), so \( y = 4 \) has a pre-image. But consider \( y = 5 \): \( x = \sqrt{2} \notin \mathbb{N} \). Also, \( y = 1, 2, 3 \in \mathbb{N} \) give \( x = \sqrt{-2}, \sqrt{-1}, 0 \), none of which belong to \( \mathbb{N} \). Since many elements of the codomain \( \mathbb{N} \) (such as 1, 2, 3, 5, 6, ...) have no pre-image, \( f \) is not onto. Assertion (A) is TRUE. Step 2 — Check whether Reason (R) is true. R claims that \( f \) is not onto because it is strictly increasing on \( \mathbb{N} \). While it is true that \( f \) is strictly increasing on \( \mathbb{N} \) (since \( x_1 < x_2 \Rightarrow x_1^2 < x_2^2 \Rightarrow f(x_1) < f(x_2) \)), being strictly increasing does NOT by itself mean a function is not onto. For example, \( g : \mathbb{N} \to \mathbb{N} \) given by \( g(x) = x \) is strictly increasing and also onto. The real reason \( f \) is not onto is that \( \sqrt{y - 3} \) is not a natural number for most \( y \in \mathbb{N} \). Reason (R) is FALSE. Step 3 — Conclusion. Assertion (A) is true. Reason (R) is false.

Answer: (C) Assertion (A) is true, but Reason (R) is false.

🎯 Try a Similar Question

Try a Similar Question

Question: Assertion (A): The function \( f: \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = 2x + 1 \) for all \( x \in \mathbb{N} \) is one-one but not onto. Reason (R): For every \( y \in \mathbb{N} \) (Codomain), there exists no \( x \in \mathbb{N} \) (Domain) such that \( f(x) = 2x + 1 = y \). (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution

  1. Step 1: Check whether f is one-one: Suppose \( f(x_1) = f(x_2) \) for some \( x_1, x_2 \in \mathbb{N} \). Then \( 2x_1 + 1 = 2x_2 + 1 \), which gives \( x_1 = x_2 \). So \( f \) is one-one (injective).
  2. Step 2: Check whether f is onto: For \( f \) to be onto, every \( y \in \mathbb{N} \) must have a pre-image in \( \mathbb{N} \). Solving \( 2x + 1 = y \) gives \( x = \frac{y - 1}{2} \). For \( y = 2 \) (an even natural number), \( x = \frac{1}{2} \notin \mathbb{N} \). Since no even natural number has a pre-image in \( \mathbb{N} \), \( f \) is NOT onto. So Assertion (A) is TRUE.
  3. Step 3: Analyse the Reason (R): Reason (R) claims that for EVERY \( y \in \mathbb{N} \), there exists NO \( x \in \mathbb{N} \) with \( f(x) = y \). This is FALSE, because for odd values of \( y \) (for example \( y = 3 \)), we get \( x = 1 \in \mathbb{N} \) and \( f(1) = 3 \). So many elements of \( \mathbb{N} \) DO have a pre-image; it is only the even natural numbers that lack one.
  4. Step 4: Conclude: Assertion (A) is TRUE (the function is one-one but not onto), and Reason (R) is FALSE (it incorrectly claims no element of the codomain has a pre-image, whereas all odd natural numbers do). Therefore the correct option is (C).

Answer: Option (A): Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). Wait — re-examining: Assertion (A) is TRUE and Reason (R) is FALSE, so the correct answer is Option (C): Assertion (A) is true, but Reason (R) is false.

Everything you get with Solver7

More questions in Relations and Functions