Q. 64.5( 15 Votes )

# Give examples of

Answer :

Define f: N Z as f(x) = x and g: Z Z as g(x) = |x|

Now, we can see that

g(-1) = |-1| = 1

g(1) = |1| = 1

g(-1) = g(1) , but -1 ≠ 1

g is not injective.

Now, gof: N Z is defined as gof(x) = g(f(x)) = g(x) = |x|

Let x, y ϵ N such that gof(x) = gof(y).

|x| = |y|

x = y

Therefore, gof is injective.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation view all courses RELATED QUESTIONS :

Fill in theMathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

Let A = {1, 2, 3}Mathematics - Exemplar

Show that the relMathematics - Board Papers

Let N denote the Mathematics - Board Papers