Advertisements
Advertisements
प्रश्न
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
Advertisements
उत्तर
f : R → R is defined by f(x) = 1 + x2
Let x1, x2 ∈ R such that f(x1) = f(x2)
⇒ `1 + x_1^2 = 1 + x_2^2`
⇒ `x_1^2 = x_2^2`
⇒ x1 = ±x2
∴ f(x1) = f(x2) does not imply that x1 = x2.
For instance, f(1) = f(–1) = 2
∴ f is not one-one.
Consider the element –2 in co-domain R.
It is seen that f(x) = 1 + x2 is positive for all x ∈ R.
Thus, there does not exist any x in domain R such that f(x) = –2.
∴ f is not onto.
Hence, f is neither one-one nor onto and hence not bijective.
APPEARS IN
संबंधित प्रश्न
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 f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
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) = `x/(x^2 +1)`
If A = {1, 2, 3}, show that a onto function f : A → A must be one-one.
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
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
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.
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
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 verify that (gof)−1 = f−1 og−1.
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 : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
Let\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = \text{B and C} = \left\{ x \in R : x \geq 0 \right\} and\]\[S = \left\{ \left( x, y \right) \in A \times B : x^2 + y^2 = 1 \right\} \text{and } S_0 = \left\{ \left( x, y \right) \in A \times C : x^2 + y^2 = 1 \right\}\]
Then,
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 defined as, f(x) = \[\begin{cases}2x, if x > 3 \\ x^2 , if 1 < x \leq 3 \\ 3x, if x \leq 1\end{cases}\]
Then, find f( \[-\]1) + f(2) + f(4)
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, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f: N → A defined by f(2n – 1) = 0, f(2n) = 1, ∀ n ∈ N, is onto.
Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f is ____________.
The domain of the function `"f"("x") = 1/(sqrt ({"sin x"} + {"sin" ( pi + "x")}))` where {.} denotes fractional part, is
Range of `"f"("x") = sqrt((1 - "cos x") sqrt ((1 - "cos x")sqrt ((1 - "cos x")....infty))`
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 n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:
If f; R → R f(x) = 10x + 3 then f–1(x) is:
`x^(log_5x) > 5` implies ______.
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 ______.
The domain of function is f(x) = `sqrt(-log_0.3(x - 1))/sqrt(x^2 + 2x + 8)` is ______.
Let f(x) be a polynomial of degree 3 such that f(k) = `-2/k` for k = 2, 3, 4, 5. Then the value of 52 – 10f(10) is equal to ______.
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.
Which one of the following graphs is a function of x?
 |
 |
| Graph A | Graph B |
The function \(f:\mathbb{N}\to\mathbb{N}\) defined by \(f(x)=5x\) is:
