Advertisements
Advertisements
प्रश्न
Let C be the set of complex numbers. Prove that the mapping f: C → R given by f(z) = |z|, ∀ z ∈ C, is neither one-one nor onto.
उत्तर
Given, f: C → R such that f(z) = |z|, ∀ z ∈ C
Now, let take z = 6 + 8i
Then,
f(6 + 8i) = |6 + 8i|
= `sqrt(6^2 + 8^2)`
= `sqrt(100)`
= 10
And, for z = 6 – 8i
f(6 – 8i) = |6 – 8i|
= `sqrt(6^2 - 8^2)`
= `sqrt(100)`
= 10
Hence, f(z) is many-one.
Also, |z| ≥ 0, ∀ z ∈ C
But the co-domain given is ‘R’
Therefore, f(z) is not onto.
APPEARS IN
संबंधित प्रश्न
Following the 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: R → R be defined as f(x) = x4. Choose the correct answer.
Find the number of all onto functions from the set {1, 2, 3, …, n} to itself.
Show that the logarithmic function f : R0+ → R given by f (x) loga x ,a> 0 is a bijection.
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.
Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1
Consider the function f : R+ → [-9 , ∞ ]given by f(x) = 5x2 + 6x - 9. Prove that f is invertible with f -1 (y) = `(sqrt(54 + 5y) -3)/5` [CBSE 2015]
If A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
If f : R → R is given by f(x) = x3, write f−1 (1).
If f : C → C is defined by f(x) = x4, write f−1 (1).
If f : R → R, g : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).
Let f be an invertible real function. Write ( f-1 of ) (1) + ( f-1 of ) (2) +..... +( f-1 of ) (100 )
If a function g = {(1, 1), (2, 3), (3, 5), (4, 7)} is described by g(x) = \[\alpha x + \beta\] then find the values of \[\alpha\] and \[ \beta\] . [NCERT EXEMPLAR]
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,
The function
\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
The distinct linear functions that map [−1, 1] onto [0, 2] are
Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1
If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))
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 X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
h = {(1,4), (2, 5), (3, 5)}
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:
f(x) = `x/2`
The domain of the function `"f"("x") = 1/(sqrt ({"sin x"} + {"sin" ( pi + "x")}))` where {.} denotes fractional part, is
A function f: x → y is/are called onto (or surjective) if x under f.
Let [x] denote the greatest integer ≤ x, where x ∈ R. If the domain of the real valued function f(x) = `sqrt((|[x]| - 2)/(|[x]| - 3)` is (–∞, a) ∪ [b, c) ∪ [4, ∞), a < b < c, then the value of a + b + c is ______.
Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.
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 function `f: N rightarrow N` be defined by
f(n) = `{:[(2n",", n = 2"," 4"," 6"," 8","......),(n - 1",", n = 3"," 7"," 11"," 15","......),((n + 1)/2",", n = 1"," 5"," 9"," 13","......):}`
then f is ______.
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 ______.
