हिंदी

Mark the Correct Alternative in the Following Question: Let F : R → R Be Given by F(X) = Tanx. Then, F1(1) is (A) π 4 (B) { N π + π 4 : N ∈ Z } (C) Does Not Exist (D) None of These

Advertisements
Advertisements

प्रश्न

Mark the correct alternative in the following question:

Let f : → R be given by f(x) = tanx. Then, f-1(1) is

 

 

विकल्प

  •  \[\frac{\pi}{4}\]   

  • \[\left\{ n\pi + \frac{\pi}{4}: n \in Z \right\}\]

  • does not exist    

  • none of these

MCQ
Advertisements

उत्तर

We have, 

f : R → R is given by 

f (x) = tan x 

⇒ f-1 (x) = tan-1 x

∴ f-1 (1) = tan-1 1 = {nπ + π /4 : n ∈ Z}

Hence, the correct alternative is option (b).

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 2: Functions - Exercise 2.6 [पृष्ठ ७९]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
अध्याय 2 Functions
Exercise 2.6 | Q 50 | पृष्ठ ७९

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

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

In the following case, state whether the function is one-one, onto or bijective. Justify your answer.

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


Let f : N → N be defined by f(n) = `{((n+1)/2", if n is odd"),(n/2", if n is even"):}` for all n ∈ N.

State whether the function f is bijective. Justify your answer.


Let fR → be defined as f(x) = 10x + 7. Find the function gR → R such that g o f = f o = 1R.


Give examples of two functions fN → Z and gZ → Z such that g o f is injective but gis not injective.

(Hint: Consider f(x) = x and g(x) =|x|)


Let S = {abc} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

F = {(a, 2), (b, 1), (c, 1)}


Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f, g : A → B be functions defined by f(x) = x2 – x, x ∈ A and g(x) = `2|x - 1/2| – 1`, x ∈ A. Are f and g equal?

Justify your answer. (Hint: One may note that two functions f : A → B and g : A → B such that f(a) = g(a) ∀ a ∈ A are called equal functions.)


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


Classify the following function as injection, surjection or bijection :

 f : Z → Z, defined by f(x) = x − 5 


Classify the following function as injection, surjection or bijection :

 f : R → R, defined by f(x) = sinx


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}


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = 2x + x2 and  g(x) = x3


   if `f (x) = sqrt(1-x)` and g(x) = `log_e` x are two real functions, then describe functions fog and gof.


If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1(24) and f−1 (5).


A function f : R → R is defined as f(x) = x3 + 4. Is it a bijection or not? In case it is a bijection, find f−1 (3).


If f : A → Ag : A → A are two bijections, then prove that fog is an injection ?


Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {abc}.


If f : R → R is given by f(x) = x3, write f−1 (1).


Let C denote the set of all complex numbers. A function f : C → C is defined by f(x) = x3. Write f−1(1).


Let f : R → R be defined as  `f (x) = (2x - 3)/4.` write fo f-1 (1) .


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


Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. State whether f is one-one or not.


If the mapping f : {1, 3, 4} → {1, 2, 5} and g : {1, 2, 5} → {1, 3}, given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then write fog. [NCERT EXEMPLAR]


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},\]
 

The function

\[f : R \to R, f\left( x \right) = x^2\]
 

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

 


Write about strcmp() function.


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

h(x) = x|x|


Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.


The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers is ____________.


Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` 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 find the number of injective functions from B to G. How many numbers of injective functions are possible?

Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found that the swing traced the path of a Parabola as given by y = x2.

Answer the following questions using the above information.

  • Let f: N → N be defined by f(x) = x2 is ____________.

Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found that the swing traced the path of a Parabola as given by y = x2.

Answer the following questions using the above information.

  • Let f: {1,2,3,....} → {1,4,9,....} be defined by f(x) = x2 is ____________.

If f: R→R is a function defined by f(x) = `[x - 1]cos((2x - 1)/2)π`, where [ ] denotes the greatest integer function, then f 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 ______.


ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.

REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.


A function is onto when every element of the codomain has:


A function is called bijective if it is both:


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×