Advertisements
Advertisements
प्रश्न
The function \[f : R \to R\] defined by
\[f\left( x \right) = 6^x + 6^{|x|}\] is
विकल्प
one-one and onto
many one and onto
one-one and into
many one and into
Advertisements
उत्तर
(d) many one and into
Graph of the given function is as follows :

A line parallel to X axis is cutting the graph at two different values.
Therefore, for two different values of x we are getting the same value of y .
That means it is many one function .
From the given graph we can see that the range is
\[[2, \infty )\]b
and R is the codomain of the given function .
Hence, Codomain
\[\neq\] Range
Therefore, the given function is into .
APPEARS IN
संबंधित प्रश्न
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?
Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but gis not injective.
(Hint: Consider f(x) = x and g(x) =|x|)
Let f: R → R be the Signum Function defined as
f(x) = `{(1,x>0), (0, x =0),(-1, x< 0):}`
and g: R → R be the Greatest Integer Function given by g(x) = [x], where [x] is greatest integer less than or equal to x. Then does fog and gof coincide in (0, 1]?
Which of the following functions from A to B are one-one and onto?
f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
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 : R → R, defined by f(x) = 1 + x2
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
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) = 2x + x2 and g(x) = x3
Consider f : N → N, g : N → N and h : N → R defined as f(x) = 2x, g(y) = 3y + 4 and h(z) = sin z for all x, y, z ∈ N. Show that ho (gof) = (hog) of.
Give examples of two functions f : N → N and g : N → N, such that gof is onto but f is not onto.
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) = ex g(x) = loge x .
Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1
Which one of the following graphs represents a function?

Which of the following graphs represents a one-one function?

Let f be a function from C (set of all complex numbers) to itself given by f(x) = x3. Write f−1 (−1).
If f : R → R is defined by f(x) = x2, find f−1 (−25).
Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (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.
Let
\[f : [2, \infty ) \to X\] be defined by
\[f\left( x \right) = 4x - x^2\] Then, f is invertible if X =
If \[g\left( x \right) = x^2 + x - 2\text{ and} \frac{1}{2} gof\left( x \right) = 2 x^2 - 5x + 2\] is equal to
Mark the correct alternative in the following question:
Let f : R → 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
Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1
Let A = R – {3}, B = R – {1}. Let f: A → B be defined by f(x) = `(x - 2)/(x - 3)` ∀ x ∈ A . Then show that f is bijective.
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
k(x) = x2
Let f: R → R be given by f(x) = tan x. Then f–1(1) 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?
Let f: R → R defined by f(x) = x4. Choose the correct answer
Let f: R → R defined by f(x) = 3x. Choose the correct answer
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 f: R→R be a continuous function such that f(x) + f(x + 1) = 2, for all x ∈ R. If I1 = `int_0^8f(x)dx` and I2 = `int_(-1)^3f(x)dx`, then the value of I1 + 2I2 is equal to ______.
Let S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f: S `rightarrow` S such that f(m.n) = f(m).f(n) for every m, n ∈ S and m.n ∈ S is equal to ______.
A function f : [– 4, 4] `rightarrow` [0, 4] is given by f(x) = `sqrt(16 - x^2)`. Show that f is an onto function but not a one-one function. Further, find all possible values of 'a' for which f(a) = `sqrt(7)`.
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.
