हिंदी

Let f, g: R → R be two functions defined as f(x) = |x| + x and g(x) = x – x ∀ x ∈ R. Then, find f o g and g o f

Advertisements
Advertisements

प्रश्न

Let f, g: R → R be two functions defined as f(x) = |x| + x and g(x) = x – x ∀ x ∈ R. Then, find f o g and g o f

योग
Advertisements

उत्तर

Here f(x) = |x| + x which can be redefined as

f(x) = `{(2x,  "if"  x ≥ 0),(0,  "if"  x < 0):}`

Similarly, the function g defined by g(x) = |x| – x may be redefined as

g(x) = `{(0,  "if"  x ≥ 0),(-2x,  "if"  x < 0):}`

Therefore, g o f gets defined as:

For x ≥ 0, (g o f) (x) = g (f(x) = g (2x) = 0

and for x < 0, (g o f) (x) = g (f(x) = g (0) = 0.

Consequently, we have (g o f) (x) = 0, ∀ x ∈ R.

Similarly, f o g gets defined as:

For x ≥ 0, (f o g) (x) = f (g(x) = f(0) = 0,

and for x < 0, (f o g) (x) = f (g(x)) = f(–2x) = – 4x.

i.e. (f o g) (x) = `{(0, x > 0),(-4x, x < 0):}`

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1: Relations And Functions - Solved Examples [पृष्ठ ६]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 12
अध्याय 1 Relations And Functions
Solved Examples | Q 14 | पृष्ठ ६

वीडियो ट्यूटोरियलVIEW ALL [5]

संबंधित प्रश्न

Give an example of a function which is one-one but not onto ?


Classify the following function as injection, surjection or bijection :

f : Z → Z, defined by f(x) = x2 + x


Classify the following function as injection, surjection or bijection :

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


Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`


Let A = {1, 2, 3}. Write all one-one from A to itself.


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


Let f = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}. Show that gof is defined while fog is not defined. Also, find gof.


Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.


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


Find fog and gof  if : f (x) = |x|, g (x) = sin x .


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


 If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x|- x, ∀x∈R" .Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).


If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.


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


Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (x).


If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).


The function 

f : A → B defined by 

f (x) = - x2 + 6x - 8 is a bijection if 

 

 

 

 


If the function\[f : R \to \text{A given by} f\left( x \right) = \frac{x^2}{x^2 + 1}\] is a surjection, then A =

 

 


Let

\[f : R \to R\]  be a function defined by

\[f\left( x \right) = \frac{e^{|x|} - e^{- x}}{e^x + e^{- x}} . \text{Then},\]
 

Let  \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]

 


Which function is used to check whether a character is alphanumeric or not?


Write about strcmp() function.


Let R be the set of real numbers and f: R → R be the function defined by f(x) = 4x + 5. Show that f is invertible and find f–1.


Consider the set A containing n elements. Then, the total number of injective functions from A onto itself is ______


Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not

g = {(1, 4), (2, 4), (3, 4)}


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


If f(x) = (4 – (x – 7)3}, then f–1(x) = ______.


A function f: x → y is/are called onto (or surjective) if x under f.


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is


If f; R → R f(x) = 10x + 3 then f–1(x) is:


Consider a function f: `[0, pi/2] ->` R, given by f(x) = sinx and `g[0, pi/2] ->` R given by g(x) = cosx then f and g are


Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if  "n is even"):}` Is the function injective? Justify your answer.


Let f: R→R be defined as f(x) = 2x – 1 and g: R – {1}→R be defined as g(x) = `(x - 1/2)/(x - 1)`. Then the composition function f (g(x)) is ______.


If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.


The solution set of the inequation log1/3(x2 + x + 1) + 1 > 0 is ______.


Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.


Let f(x) be a polynomial function of degree 6 such that `d/dx (f(x))` = (x – 1)3 (x – 3)2, then

Assertion (A): f(x) has a minimum at x = 1.

Reason (R): When `d/dx (f(x)) < 0, ∀  x ∈ (a - h, a)` and `d/dx (f(x)) > 0, ∀  x ∈ (a, a + h)`; where 'h' is an infinitesimally small positive quantity, then f(x) has a minimum at x = a, provided f(x) is continuous at x = a.


A perfect one-to-one matching between users and unique IDs is similar to:


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×