English

Find Fog And Gof If : F(X) = Sin−1 X, G(X) = X2

Advertisements
Advertisements

Question

Find fog and gof  if : f(x) = sin−1 x, g(x) = x2

Advertisements

Solution

f (x) = sin −1 x, g(x) = x2

f : [−1,1]→ `[(-π)/2 ,π/2]`  ; g : R → [0, ∞) 

Computing fog:

Clearly, the range of g is not a subset of the domain of f.

Domain (fog) = {x: x ∈ domain of g and g (x) ∈ domain of f }

Domain (fog)={ x: x ∈ R and x2 ∈ [−1,1] }

Domain (fog)={ x : x ∈ R and x ∈ [−1,1] }

Domain of (fog)= [−1,1]

fog : [−1,1] → R 

(fog) (x) = f (g (x))

= f (x2)

= sin−1 ( x2)

Computing gof:

Clearly, the range of f is a subset of the domain of g.

fog : [−1,1] → R

(gof) (x) = g (f (x))

= g (sin−1 x )

= ( sin−1 x)2

shaalaa.com
  Is there an error in this question or solution?
Chapter 2: Functions - Exercise 2.3 [Page 54]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 2 Functions
Exercise 2.3 | Q 1.5 | Page 54

RELATED QUESTIONS

Show that the function f : R* → R* defined by f(x) = `1/x` is one-one and onto, where R* is the set of all non-zero real numbers. Is the result true, if the domain R* is replaced by N with co-domain being same as R?


Check the injectivity and surjectivity of the following function:

f : R → R given by f(x) = x2


Show that the modulus function f : R → R, given by f(x) = |x|, is neither one-one nor onto, where |x| is x, if x is positive or 0 and |x| is –x, if x is negative.


Given examples of two functions fN → N and gN → N such that gof is onto but is not onto.

(Hint: Consider f(x) = x + 1 and `g(x) = {(x-1, ifx >1),(1, if x = 1):}`


Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x2


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = x3 + 1


Classify the following function as injection, surjection or bijection :

 f : R → R, defined by f(x) = x3 − x


Set of ordered pair of  a function? If so, examine whether the mapping is injective or surjective :{(xy) : x is a person, y is the mother of x}


Let f : N → N be defined by

`f(n) = { (n+ 1, if n  is  odd),( n-1 , if n  is  even):}`

Show that f is a bijection. 

                      [CBSE 2012, NCERT]


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = x and g(x) = |x| .


Find  fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → Rg(x) = 3x3 + 1.


Consider f : N → Ng : N → N and h : N → R defined as f(x) = 2xg(y) = 3y + 4 and h(z) = sin z for all xyz ∈ N. Show that ho (gof) = (hogof.


Find fog and gof  if : f (x) = x+1, g(x) = `e^x`

.


Find fog and gof  if : f(x)= x + 1, g (x) = 2x + 3 .


Let f : R `{- 4/3} `- 43 →">→ R be a function defined as f(x) = `(4x)/(3x +4)` . Show that f : R - `{-4/3}`→ Rang (f) is one-one and onto. Hence, find f -1.


If f : C → C is defined by f(x) = x4, write f−1 (1).


Let 

\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is 

 


The range of the function

\[f\left( x \right) =^{7 - x} P_{x - 3}\]

 


A function f from the set of natural numbers to the set of integers defined by

\[f\left( n \right)\begin{cases}\frac{n - 1}{2}, & \text{when n is odd} \\ - \frac{n}{2}, & \text{when n is even}\end{cases}\]

 


\[f : Z \to Z\]  be given by

 ` f (x) = {(x/2, ", if  x is even" ) ,(0 , ", if  x  is  odd "):}`

Then,  f is


Let \[f\left(x\right) = x^3\] be a function with domain {0, 1, 2, 3}. Then domain of \[f^{-1}\] is ______.


Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is


Mark the correct alternative in the following question:

If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is


Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is


If f(x) = `(x+3)/(4x−5) , "g"(x) = (3+5x)/(4x−1)` then verify that `("fog") (x)` = x.


Write about strlen() function.


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.


Show that the function f: R → R defined by f(x) = `x/(x^2 + 1)`, ∀ ∈ + R , is neither one-one nor onto


Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be defined from A to B is ______.


For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is injective. Then both f and g are injective functions.


If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is ______.


Let f: `[2, oo)` → R be the function defined by f(x) = x2 – 4x + 5, then the range of f is ______.


Let f : R → R be a function defined by f(x) `= ("e"^abs"x" - "e"^-"x")/("e"^"x" + "e"^-"x")` then f(x) is


If N be the set of all-natural numbers, consider f: N → N such that f(x) = 2x, ∀ x ∈ N, then f is ____________.


An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wants to know among those relations, how many functions can be formed from B to G?

An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wants to find the number of injective functions from B to G. How many numbers of injective functions are possible?

Let f: R → R defined by f(x) = 3x. Choose the correct answer


Let A = {1, 2, 3, ..., 10} and f : A `rightarrow` A be defined as

f(k) = `{{:(k + 1, if k  "is odd"),(     k, if k  "is even"):}`.

Then the number of possible functions g : A `rightarrow` A such that gof = f is ______.


For x ∈ R, x ≠ 0, let f0(x) = `1/(1 - x)` and fn+1 (x) = f0(fn(x)), n = 0, 1, 2, .... Then the value of `f_100(3) + f_1(2/3) + f_2(3/2)` is equal to ______.


Let f: R→Rbe defined as f (x) = `(x^2 + 1)/2`, then ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×