English

Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} And F : A → B, G : B → C Be Defined As F(X) = 2x + 1 And G(X) = X2 − 2. Express (Gof)−1 And F−1 Og−1 As the Sets of Ordered Pairs and

Advertisements
Advertisements

Question

Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → Bg : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.

Advertisements

Solution

f(x)=2x+1

⇒ f{(1, 2(1)+1), (2, 2(2)+1), (3, 2(3)+1), (4, 2(4)+1)}={(1, 3), (2, 5), (3, 7), (4, 9)}g(x)=x22

⇒ g{(3, 322), (5, 522), (7, 722), (9, 922)}={(3, 7), (5, 23), (7, 47), (9, 79)}

Clearly and g are bijections and, hence, f1BA and g1: CB exist.

So, f1{(3, 1), (5, 2), (7, 3), (9, 4)} 

and g1{(7, 3), (23, 5), (47, 7), (79, 9)}

Now, (f1 o g1CA

f1 o g1={(7, 1), (23, 2), (47, 3), (79, 4)}        ...(1)

Also, AB and → C,

⇒ go→ C, (gof1 CA

So, f1 o g1and (gof)1 have same domains.

(gof)(x)=g (f (x))=g (2x+1)=(2x+1)22

 (gof(x4x24+12

 (gof(x4x241

Then, (gof(1g (f (1)4+4=7,

(gof)(2)=g (f (2))=4+41=23,

(gof)(3)=g (f (3))=4+41=47 and 

(gof)(4)=g (f (4))=4+41=79

So, gof={(1, 7), (2, 23), (3, 47), (4, 79)}

(gof)1={(7, 1), (23, 2), (47, 3), (79, 4)}     ......(2)

From (1) and (2), we get:

 (gof)f1 o g1

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

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 2 Functions
Exercise 2.4 | Q 4 | Page 68

RELATED QUESTIONS

Check the injectivity and surjectivity of the following function:

f : N → N given by f(x) = x3


Show that the function f : R → {x ∈ R : –1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.


 Which of the following functions from A to B are one-one and onto ?  

f3 = {(ax), (bx), (cz), (dz)} ; A = {abcd,}, B = {xyz}. 


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}


Suppose f1 and f2 are non-zero one-one functions from R to R. Is `f_1 / f^2` necessarily one - one? Justify your answer. Here,`f_1/f_2 : R → R   is   given   by   (f_1/f_2) (x) = (f_1(x))/(f_2 (x))  for all  x in R .`


Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2xg(x) = 1/x and h(x) = ex.


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.


If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.


Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.


If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(1) fog
(2) gof
(3) fof
(4) f2
Also, show that fof ≠ f2


Find f −1 if it exists : f : A → B, where A = {0, −1, −3, 2}; B = {−9, −3, 0, 6} and f(x) = 3 x.


Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2


Let f : [−1, ∞) → [−1, ∞) be given by f(x) = (x + 1)2 − 1, x ≥ −1. Show that f is invertible. Also, find the set S = {x : f(x) = f−1 (x)}.


If f : R → R is defined by f(x) = x2, write f−1 (25)


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


If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).


Let A = {x ∈ R : −4 ≤ x ≤ 4 and x ≠ 0} and f : A → R be defined by \[f\left( x \right) = \frac{\left| x \right|}{x}\]Write the range of f.


Let `f : R - {- 3/5}` → R be a function defined as `f  (x) = (2x)/(5x +3).` 

f-1 : Range of f → `R -{-3/5}`.


Let f : R → R be the function defined by f(x) = 4x − 3 for all x ∈ R Then write f .   [NCERT EXEMPLAR]


The function f : R → R defined by

`f (x) = 2^x + 2^(|x|)` is 

 


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 

 


Which of the following functions form Z to itself are bijections?

 

 

 
 

If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\] 

 


If  \[f\left( x \right) = \sin^2 x\] and the composite function   \[g\left( f\left( x \right) \right) = \left| \sin x \right|\] then g(x) is equal to


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 f : → R be given by f(x) = tanx. Then, f-1(1) 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


Mark the correct alternative in the following question:
Let f :  \[-\] \[\left\{ \frac{3}{5} \right\}\] \[\to\]  R be defined by f(x) = \[\frac{3x + 2}{5x - 3}\] Then,

 


Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1 


Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:

f(x) = `x/2`


Let f: R → R be defined by f(x) = `1/x` ∀ x ∈ R. Then f is ______.


Let f : R `->` R be a function defined by f(x) = x3 + 4, then f is ______.


Let f : R → R, g : R → R be two functions such that f(x) = 2x – 3, g(x) = x3 + 5. The function (fog)-1 (x) is equal to ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Raji wants to know the number of functions from A to B. How many number of functions are possible?

If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n"  "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.


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 ______.


Which real-life situation resembles a one-one idea when no roll number is repeated?


Which condition represents an onto (surjective) function?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×