Home
Class 12
MATHS
Consider f : N ->N, g : N ->Nand h : N -...

Consider `f : N ->N`, `g : N ->N`and `h : N ->R`defined as`f (x) = 2x`, `g (y) = 3y + 4`and `h (z) = s in z`, `AA`x, y and z in N. Show that ho(gof ) = (hog) of.

Text Solution

Verified by Experts

The correct Answer is:
(hog) o f
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    NCERT GUJARATI|Exercise EXERCISE 1.1|16 Videos
  • RELATIONS AND FUNCTIONS

    NCERT GUJARATI|Exercise EXERCISE 1.2|12 Videos
  • PROBABILITY

    NCERT GUJARATI|Exercise MISCELLANEOUS EXERCISE ON CHAPTER 13|18 Videos
  • VECTOR ALGEBRA

    NCERT GUJARATI|Exercise Miscellaneous Exercise on chapter 10|18 Videos

Similar Questions

Explore conceptually related problems

Consider f: N rarr N,g :N rarr N and h: Nrarr R defined as f(x) = 2x, g(y) = 3y + 4 and h(z) = sin z, AAx, y and z in N. Show that ho(gof) = (hog)of .

Let f : N to N : f(x) =2 x for all x in N Show that f is one -one and into.

Let f:N rarr Y be a function defined as f(x) = 4x + 3, where, Y = { y in N:y = 4x + 3 for some x in N }. Show that f is invertible. Find the inverse.

If f : R rarr R , f(x) = [x] , g : R rarr R , g(x) = sinx , h : R rarr R , h(x) = 2x , then ho(gof) = ..........

If X and Y are two sets such that n ( X ) = 17, n ( Y ) = 23 and n ( X ∪ Y ) = 38 , find n ( X ∩ Y ) .

f : Z rarr Z and g : Z rarr Z . Defined as f(n) = 3n and g(n) = {{:(n/3",","If n is a multiple of 3"),(0",","If n is not a multiple of 3"):} AAninZ Then show that gof = I_z but fog ne I_z

Let f be a function satisfying f(x+y)=f(x) + f(y) for all x,y in R . If f (1)= k then f(n), n in N is equal to

R= {(x, y): x in N, y in N and x + y = 10} . Write domain and range of R.

Consider the identity function I_(N) : N rarr N defined as I_(N) (x) = x,AAx in N . Show that although I_(N) is onto but I_N + I_(N) :N rarr N defined as (I_(N) +I_(N))(x) = I_(N)(x) +I_(N) (x) = x+x=2x is not onto.

NCERT GUJARATI-RELATIONS AND FUNCTIONS -MISCLELLANEOUS EXERCISE ON CHAPTER 1
  1. Consider f : N ->N, g : N ->Nand h : N ->Rdefined asf (x) = 2x, g (y) ...

    Text Solution

    |

  2. Let f: R ->Rbe defined as f(x) = 10 x + 7. Find the function g: R ->R...

    Text Solution

    |

  3. Let f: W ->Wbe defined as f(n) = n - 1, if is odd and f(n) = n + 1, i...

    Text Solution

    |

  4. If f:R to R is defined by f(x) = x^(2)-3x+2, write f{f(x)}.

    Text Solution

    |

  5. Show that function f: R ->{x in R : -1 < x < 1}defined by f(x)=x/(1+...

    Text Solution

    |

  6. Show that the function f: R->Rgiven by f(x)=x^3is injective.

    Text Solution

    |

  7. Give examples of two functions f:" "N->Z" "a n dg:" "Z->Z such that o...

    Text Solution

    |

  8. Given examples of two functions f:" "N ->N" "a n d""""""g:" "N->N such...

    Text Solution

    |

  9. Given a non-empty set X , consider P\ (X) which is the set of all subj...

    Text Solution

    |

  10. Given a non-empty set X, consider the binary operation *: P(X)xx P(X)...

    Text Solution

    |

  11. Find the number of all onto functions from the set A={1,\ 2,\ 3,\ ...

    Text Solution

    |

  12. Let S = {a , b , c} a n d T = {1, 2, 3}. Find F^(-1)of the following ...

    Text Solution

    |

  13. Consider the binary operations *:" "RxxR ->R and o:" "R" "xx" "R->R de...

    Text Solution

    |

  14. Given a non -empty set X, let *:" "P(X)" "xx" "P(X) ->P(X) be defined ...

    Text Solution

    |

  15. Define a binary operation *on the set {0," "1," "2," "3," "4," "5} as ...

    Text Solution

    |

  16. Let A" "=" "{-1," "0," "1," "2} , B" "=" "{-4," "-2," "0," "2} and f,g...

    Text Solution

    |

  17. LetA = {1, 2, 3}Then number of relations containing (1, 2) a n d (1, 3...

    Text Solution

    |

  18. Let A = {1, 2, 3}. Then number of equivalence relations containing (1...

    Text Solution

    |

  19. Let f: R->Rbe the Signum Function defined as f(x)={1,x >0 0,x=0-1,x<1 ...

    Text Solution

    |

  20. Number of binary operations on the set {a, b} are (A) 10 (B) 16 (C)...

    Text Solution

    |