Advertisements
Advertisements
Question
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Options
True
False
Solution
This statement is False.
APPEARS IN
RELATED QUESTIONS
Show that the Signum Function f: R → R, given by `f(x) = {(1, if x > 0), (0, if x = 0), (-1, if x < 0):}` is neither one-one nor onto
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}
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x2
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 − x
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sin2x + cos2x
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : g(x) = |x|
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Let R+ be the set of all non-negative real numbers. If f : R+ → R+ and g : R+ → R+ are defined as `f(x)=x^2` and `g(x)=+sqrtx` , find fog and gof. Are they equal functions ?
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.
If f : Q → Q, g : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −1.
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
The function \[f : R \to R\] defined by
\[f\left( x \right) = 6^x + 6^{|x|}\] is
Write about strlen() function.
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 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.
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
h(x) = x|x|
Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is ______.
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers 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:
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` 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.
The trigonometric equation tan–1x = 3tan–1 a has solution for ______.
