Q. 74.1( 14 Votes )

# Give examples of two functions f: N → N and g : N → N such that g o f is onto but f is not onto.

(Hint: Consider f (x) = x + 1 and

Answer :

It is given that f: N → N by, f(x) = x + 1

And, g : N → N by,

Now, consider element 1 in co-domain N. So, it is clear that this element is not an image of any of the elements in domain N.

⇒ f is onto.

Now, gof: N → N is defined as:

gof(x) = g(f(x)) = g(x+1) = (x + 1) – 1 [x ϵ N = > (x+1) > 1]

Then we can see that for y ϵ N, there exists x = y ϵ N such that gof(x) = y.

Therefore, gof is onto.

Rate this question :

Fill in the blanks in each of the

Let the relation R be defined on the set

A = {1, 2, 3, 4, 5} by R = {(a, b) : |a^{2} – b^{2}| < 8}. Then R is given by _______.

State True or False for the statements

Every relation which is symmetric and transitive is also reflexive.

Mathematics - ExemplarState True or False for the statements

Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.

Mathematics - ExemplarState True or False for the statements

An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.

Mathematics - Exemplar