A mapping $f : N \to N$ where N is the set of natural numbers is defined as
$f(n)={n2,fornodd2n+1,forneven\$ .For $n □ N$ .Then f is

Surjective but not injective

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Injective but not surjective

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Bijective

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Neither injective nor surjective

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is C Neither injective nor surjective
As $f (3) = f (4) = 9$
we can say that function is not one-one and $y = 2$ does not exists.we can say that function is not onto. Therefore option D is correct.

Suggest Corrections

Similar questions

f : N \to N

f (n) = 1 + n^{2}, n \in N

N

N

f : N ⟶ N

f (n) = {(n + 5)}^{2}, n \in N

N

f (n) = \{\begin{cases} \frac{n - 1}{2}, when n is odd \\ - \frac{n}{2}, when n is even \end{cases} is

f : N \to N

f (x) = 3 x^{2} + 2.

f (x)

{\begin{matrix} \frac{n - 1}{2}, & where n is odd - \frac{n}{2}, & where n is even \end{matrix}

Join BYJU'S Learning Program