Q1: Is on one-one or onto?
A function (where is the set of all non-negative real numbers) defined by is :
(A) one-one but not onto
(B) onto but not one-one
(C) both one-one and onto
(D) neither one-one nor onto
Let .
Why?
To prove one-one, start from and show that it forces . Then two different inputs can never give the same output.
Here we subtract from both sides, then divide by .
So is one-one.
For , .
Take . Then gives .
Why?
Onto means every element of the codomain is the image of some in the domain .
Why : start from and do the same to both sides.
Solving one move at a time:
The smallest value is , so the range is . A number below , such as , is never reached: the only that would give it is negative, and negative numbers are not in the domain.
Watch out: the codomain is , not . The same rule from to would be onto.
So has no pre-image in , and is not onto.
One-one but not onto rules out (B), (C) and (D).
Answer: (A) one-one but not onto
Chapter 1, Relations and Functions: One-one and onto functions.
Question type: Prove one-one and onto
How to spot it: click to see
Type 5. Prove one-one and onto: the bijective function
Spot it: "show that is one-one and onto", or "is bijective?", with a formula like .
Here: gives , so is one-one. For onto, needs , which fails the domain check, as has no negative numbers.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Relations and Functions in past papers: question 4 of 18 · see them all