Let be defined as:
Find whether the function is bijective or not.
Confirming your payment
Previous Year Questions · Question 30 of 37
Let be defined as:
Find whether the function is bijective or not.
A function is bijective when it is both one-one and onto, so we check the two properties separately.
is not one-one.
is odd, so the first branch applies: .
is even, so the second branch applies: .
Thus although . Two distinct elements of the domain have the same image, so is not one-one. (The same thing happens with every consecutive pair: , , and so on.)
is onto.
Let be arbitrary. Then is a natural number and it is odd (for it is , for it is , for it is , and so on), so the odd branch applies:
So is a pre-image of . Since was arbitrary, every element of the codomain is the image of something, and is onto.
(The even branch supplies a second pre-image: is even, so as well. Every value therefore has two pre-images, and — which is exactly why fails to be one-one.)

Since is onto but not one-one, is not a bijective function.