Advertisements
Advertisements
Question
Give an example of a function which is not one-one but onto ?
Advertisements
Solution
which is not one-one but onto
f: Z → N ∪ {0} given by f(x) = |x|
njectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
⇒ |x| = |y|
⇒ x= ± y
So, different elements of domain f may give the same image.
So, f is not one-one.
Surjectivity:
Let y be any element in the co domain (Z), such that f(x) = y for some element x in Z(domain).
f(x) = y
⇒ |x| = y
⇒ x = ± y
which is an element in Z (domain).
So, for every element in the co-domain, there exists a pre-image in the domain.
Thus, f is onto.
APPEARS IN
RELATED QUESTIONS
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x3
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) = 3x. Choose the correct answer.
Show that the function f : R → {x ∈ R : −1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.
Show that the function f : R → R given by f(x) = x3 is injective.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x3
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and g(x) = x2 + 5 .
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 2x − 3 and g(x) = 3x − 4 .
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 : R → R and g : R → R be defined by f(x) = x + 1 and g (x) = x − 1. Show that fog = gof = IR.
Give examples of two functions f : N → N and g : N → N, such that gof is onto but f is not onto.
If f(x) = sin x and g(x) = 2x be two real functions, then describe gof and fog. Are these equal functions?
if `f (x) = sqrt(1-x)` and g(x) = `log_e` x are two real functions, then describe functions fog and gof.
Let f be a real function given by f (x)=`sqrt (x-2)`
Find each of the following:
(i) fof
(ii) fofof
(iii) (fofof) (38)
(iv) f2
Also, show that fof ≠ `f^2` .
If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1(24) and f−1 (5).
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).
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
The range of the function
\[f\left( x \right) =^{7 - x} P_{x - 3}\]
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
Let \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]
If the function
\[f : R \to R\] be such that
\[f\left( x \right) = x - \left[ x \right]\] where [x] denotes the greatest integer less than or equal to x, then \[f^{- 1} \left( x \right)\]
Let [x] denote the greatest integer less than or equal to x. If \[f\left( x \right) = \sin^{- 1} x, g\left( x \right) = \left[ x^2 \right]\text{ and } h\left( x \right) = 2x, \frac{1}{2} \leq x \leq \frac{1}{\sqrt{2}}\]
Let f : R `->` R be a function defined by f(x) = x3 + 4, then f is ______.
The domain of the function `"f"("x") = 1/(sqrt ({"sin x"} + {"sin" ( pi + "x")}))` where {.} denotes fractional part, is
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wants to know among those relations, how many functions can be formed from B to G?
A function f: x → y is/are called onto (or surjective) if x under f.
Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' 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 ______.
Consider a set containing function A= {cos–1cosx, sin(sin–1x), sinx((sinx)2 – 1), etan{x}, `e^(|cosx| + |sinx|)`, sin(tan(cosx)), sin(tanx)}. B, C, D, are subsets of A, such that B contains periodic functions, C contains even functions, D contains odd functions then the value of n(B ∩ C) + n(B ∩ D) is ______ where {.} denotes the fractional part of functions)
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 ______.
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.
The given function f : R → R is not ‘onto’ function. Give reason.
