Advertisements
Advertisements
Question
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x3
Advertisements
Solution
f : N → N, given by f(x) = x3
njection test :
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
f(x) = f(y)
x3 = y3
x = y
So, f is an injection
Surjection test :
Let y be any element in the co-domain (N), such that f(x) = y for some element x in N (domain).
f(x) = y
x3= y
x=`3sqrty ` which may not be in N.
For example, if y = 3,
x= `3sqrt3` is not in N .
So, f is not a surjection and f is not a bijection.
APPEARS IN
RELATED QUESTIONS
Let A = R − {3} and B = R − {1}. Consider the function f : A → B defined by f(x) = `((x- 2)/(x -3))`. Is f one-one and onto? Justify your answer.
Give an example of a function which is one-one but not onto ?
Which of the following functions from A to B are one-one and onto?
f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {a, b, c}
Let A = {−1, 0, 1} and f = {(x, x2) : x ∈ A}. Show that f : A → A is neither one-one nor onto.
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = |x|
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x − 5
Show that the exponential function f : R → R, given by f(x) = ex, is one-one but not onto. What happens if the co-domain is replaced by`R0^+` (set of all positive real numbers)?
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Let f = {(3, 1), (9, 3), (12, 4)} and g = {(1, 3), (3, 3) (4, 9) (5, 9)}. Show that gof and fog are both defined. Also, find fog and gof.
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
Find fog and gof if : f (x) = ex g(x) = loge x .
Find fog and gof if : f (x) = x+1, g (x) = sin x .
Find fog and gof if : f(x) = c, c ∈ R, g(x) = sin `x^2`
If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(1) fog
(2) gof
(3) fof
(4) f2
Also, show that fof ≠ f2
State with reason whether the following functions have inverse:
h : {2, 3, 4, 5} → {7, 9, 11, 13} with h = {(2, 7), (3, 9), (4, 11), (5, 13)}
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.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Let \[f : \left( - \frac{\pi}{2}, \frac{\pi}{2} \right) \to R\] be a function defined by f(x) = cos [x]. Write range (f).
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 f : R → R, g : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).
Write the domain of the real function
`f (x) = sqrt([x] - x) .`
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,
Let the function
\[f : R - \left\{ - b \right\} \to R - \left\{ 1 \right\}\]
\[f\left( x \right) = \frac{x + a}{x + b}, a \neq b .\text{Then},\]
Which of the following functions from
to itself are bijections?
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\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]
Let \[f\left( x \right) = \frac{\alpha x}{x + 1}, x \neq - 1\] Then, for what value of α is \[f \left( f\left( x \right) \right) = x?\]
If \[f : R \to R\] is given by \[f\left( x \right) = x^3 + 3, \text{then} f^{- 1} \left( x \right)\] is equal to
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
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.
Let N be the set of natural numbers and the function f: N → N be defined by f(n) = 2n + 3 ∀ n ∈ N. Then f is ______.
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(x, y): x is a person, y is the mother of x}
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 ____________.
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. Based on the given information, f is best defined as:
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 ______.
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.
