Q.Which of the following functions from into are bijections?
(A)
(B)
(C)
(D)
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →A bijection must be both one-to-one (injective) and onto (surjective). Among the given functions from to , only satisfies both. The correct option is (B).
Why a Bijection Proof Works
A bijection is a function that pairs every element of the domain with exactly one element of the codomain, and vice versa — no element is left out, and no element is paired twice. For a function , we need to check two things:
- Injective (one-to-one): If , then . No two different inputs map to the same output.
- Surjective (onto): For every integer in the codomain, there is some integer in the domain such that . Every output is actually hit.
If either condition fails, the function is not a bijection. Let’s test each option.
-
Option (A):
Is it injective? If , then taking cube roots (which is a one-to-one operation on integers) gives . So yes, it’s injective.
Is it surjective? For to be onto, every integer must be a perfect cube. But , for example, is not a cube of any integer — there is no integer with . So surjectivity fails.
Watch outA common mistake is to think is onto because it’s onto on the reals. But on , cubes skip many integers (like , , , , , , , …). The range is only , which is a proper subset of .
Conclusion: Not a bijection.
-
Option (B):
Injectivity: If , then subtracting gives . So it’s one-to-one.
Surjectivity: Given any integer , choose , which is also an integer. Then . Every integer is hit.
Since both conditions hold, this is a bijection. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.