Show that the function
f : N➔N, defined by
f(n) = n² + n + 1 for all n∈N is
one-one but not onto function.
Answers
Given that,
Step :- 1 One - One function
Let assume that x, y ∈ N such that
Step :- 2 Onto
Let if possible there exist an element y ∈ N such that
Now, its a quadratic in n, so as to get the value of n, we use Quadratic Formula, taking positive square root, we get
Let assume that, y = 1, so we get
Hence,
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
Additional Information :-
1. One - One or injective function :- If f is a function from A to B such that distinct elements in A has distinct images in B.
2. Onto or Surjective function :- If f is a function from A to B such that every element in B has atleast one pre - image in A.
3. Bijective function :- A function f from A to B is bijective iff function is one - one and onto.
Step-by-step explanation:
Given
f(x) = 2x
One-One
Putting
Onto
f(x) = 2x
learn more:
F:N to N defined by f(m)=m^2+m+3 is one one function