Advertisements
Advertisements
प्रश्न
Set of ordered pair of a function ? If so, examine whether the mapping is injective or surjective :{(a, b) : a is a person, b is an ancestor of a}
Advertisements
उत्तर
g = {(a, b) : a is a person, b is an ancestor of a}
Since, the ordered map (a, b) does not map 'a' - a person to a living person.
So, g is not a function.
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x2
Check the injectivity and surjectivity of the following function:
f : R → R given by f(x) = x2
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x3
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.
Let f : R → R be defined as f(x) = 3x. Choose the correct answer.
Give an example of a function which is neither one-one nor onto ?
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 : Z → Z given by f(x) = x2
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, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x|- x, ∀x∈R" .Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).
Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
If f : A → A, g : A → A are two bijections, then prove that fog is a surjection ?
Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {a, b, c}.
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write the total number of onto functions from A to B.
\[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, then
The function f : R → R defined by
`f (x) = 2^x + 2^(|x|)` is
\[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
A function f from the set of natural numbers to the set of integers defined by
\[f\left( n \right)\begin{cases}\frac{n - 1}{2}, & \text{when n is odd} \\ - \frac{n}{2}, & \text{when n is even}\end{cases}\]
If \[f : R \to \left( - 1, 1 \right)\] is defined by
\[f\left( x \right) = \frac{- x|x|}{1 + x^2}, \text{ then } f^{- 1} \left( x \right)\] equals
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
Mark the correct alternative in the following question:
Let f : R → R be given by f(x) = tanx. Then, f-1(1) is
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 ______.
For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.
If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
h(x) = x|x|
Let g(x) = x2 – 4x – 5, 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 R be a relation on the set L of lines defined by l1 R l2 if l1 is perpendicular to l2, then relation R is ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- The function f: R → R defined by f(x) = x − 4 is ____________.
Function f: R → R, defined by f(x) = `x/(x^2 + 1)` ∀ x ∈ R is not
If A = {x ∈ R: |x – 2| > 1}, B = `{x ∈ R : sqrt(x^2 - 3) > 1}`, C = {x ∈ R : |x – 4| ≥ 2} and Z is the set of all integers, then the number of subsets of the set (A ∩ B ∩ C) C ∩ Z 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 ______.
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.
A function is onto when every element of the codomain has:
In the function from \(X\) to \(Y\), if \(6\in Y\) is not the image of any element of \(X\), the function is:
Which condition represents an onto (surjective) function?
