Match List-I with List-II
Where ℝ is set of real numbers
List-I List-II (A) f: ℝ → ℝ s.t f(x) = x⁴ is (I) one-one, Into (B) f: ℝ → [0, ∞) s.t f(x) = x⁴ is (II) many-one, into (C) f: [0, ∞) → ℝ s.t f(x) = x⁴ is (III) one-one, onto (D) f: [0, ∞) → [0, ∞) s.t f(x) = x⁴ is (IV) many-one, onto
Choose the correct answer from the options given below:
Match List-I with List-II
Where ℝ is set of real numbers
| List-I | List-II |
|---|---|
| (A) f: ℝ → ℝ s.t f(x) = x⁴ is | (I) one-one, Into |
| (B) f: ℝ → [0, ∞) s.t f(x) = x⁴ is | (II) many-one, into |
| (C) f: [0, ∞) → ℝ s.t f(x) = x⁴ is | (III) one-one, onto |
| (D) f: [0, ∞) → [0, ∞) s.t f(x) = x⁴ is | (IV) many-one, onto |
Choose the correct answer from the options given below:
Solution
For , recall:
One-one means every different input gives a different output.
Many-one means two or more different inputs give the same output.
Onto means Range = Codomain.
Into means Range ⊊ Codomain (some values in codomain are never reached).
(A)
Domain is all of , so:
Two different inputs gave the same output → Many-one
When , always, so:
→ Into
(A) = Many-one, Into = (II)
(B)
Domain is still all of , so → Many-one
→ Onto
(B) = Many-one, Onto = (IV)
(C)
Domain is — only non-negative numbers.
On , is strictly increasing, so no two different non-negative inputs can give the same output → One-one
→ Into
(C) = One-one, Into = (I)
(D)
Domain is → is strictly increasing here → One-one
→ Onto
(D) = One-one, Onto = (III)
Final matching:
(A) → (II) Many-one, Into
(B) → (IV) Many-one, Onto
(C) → (I) One-one, Into
(D) → (III) One-one, Onto
Related questions:
2025: 3 June Shift 1