Advertisements
Advertisements
Question
A function f from the set of natural numbers to integers defined by
`{([n-1]/2," when n is odd" is ),(-n/2,when n is even ) :}`
Options
neither one-one nor onto
one-one but not onto
onto but not one-one
one-one and onto both
Advertisements
Solution
one-one and onto both
Injectivity:
Let x and y be any two elements in the domain (N).
\[\text{Case}-1: \text{Bothxandyare even}.\]
\[\text{Let}f\left( x \right) = f\left( y \right)\]
\[ \Rightarrow \frac{- x}{2} = \frac{- y}{2}\]
\[ \Rightarrow - x = - y\]
\[ \Rightarrow x = y\]
\[\text{Case}-2: \text{Bothxandyare odd}.\]
\[Letf\left( x \right) = f\left( y \right)\]
\[ \Rightarrow \frac{x - 1}{2} = \frac{y - 1}{2}\]
\[ \Rightarrow x - 1 = y - 1\]
\[ \Rightarrow x = y\]
\[Case-3:\text{Let x be even andybe odd}.\]
\[\text{Then},f\left( x \right) = \frac{- x}{2}\text{and}f\left( y \right) = \frac{y - 1}{2}\]
\[\text{Then, clearly}\]
\[x \neq y \]
\[ \Rightarrow f\left( x \right) \neq f\left( y \right)\]
\[\text{From all the cases,f is one-one}.\]
Surjectivity:
\[\text{Co-domain of f} = Z = \left\{ . . . , - 3, - 2, - 1, 0, 1, 2, 3, . . . . \right\}\]
\[\text{Range of f } = \left\{ . . . , \frac{- 3 - 1}{2}, \frac{- \left( - 2 \right)}{2}, \frac{- 1 - 1}{2}, \frac{0}{2}, \frac{1 - 1}{2}, \frac{- 2}{2}, \frac{3 - 1}{2}, . . . \right\}\]
\[ \Rightarrow \text{Range of f} = \left\{ . . . , - 2, 1, - 1, 0, 0, - 1, 1, . . . \right\}\]
\[ \Rightarrow \text{Range of f} = \left\{ . . . , - 2, - 1, 0, 1, 2, . . . . \right\}\]
\[ \Rightarrow \text{Co-domain of f} = \text{Range of f}\]
⇒ f is onto.
APPEARS IN
RELATED QUESTIONS
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?
Check the injectivity and surjectivity of the following function:
f : R → R given by f(x) = x2
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.
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 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, defined by f(x) = x2 + x
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 one-one function f : A → A must be onto.
Let f : R → R and g : R → R be defined by f(x) = x + 1 and g (x) = x − 1. Show that fog = gof = IR.
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.
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
if `f (x) = sqrt(1-x)` and g(x) = `log_e` x are two real functions, then describe functions fog and gof.
Let A = {x &epsis; R | −1 ≤ x ≤ 1} and let f : A → A, g : A → A be two functions defined by f(x) = x2 and g(x) = sin (π x/2). Show that g−1 exists but f−1 does not exist. Also, find g−1.
Let f be a function from R to R, such that f(x) = cos (x + 2). Is f invertible? Justify your answer.
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
If f : A → A, g : A → A are two bijections, then prove that fog is a surjection ?
If f : R → R defined by f(x) = 3x − 4 is invertible, then write f−1 (x).
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).
If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).
The function f : R → R defined by
`f (x) = 2^x + 2^(|x|)` is
Which of the following functions from
to itself are bijections?
Let
\[f : R - \left\{ n \right\} \to R\]
\[f : R \to R\] is defined by
\[f\left( x \right) = \frac{e^{x^2} - e^{- x^2}}{e^{x^2 + e^{- x^2}}} is\]
The function
If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\]
The inverse of the function
\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by
\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is
Let
\[A = \left\{ x \in R : x \leq 1 \right\} and f : A \to A\] be defined as
\[f\left( x \right) = x \left( 2 - x \right)\] Then,
\[f^{- 1} \left( x \right)\] is
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
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.
If A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A onto A. Find 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 f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.
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?
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 ____________.
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R 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.
