Advertisements
Advertisements
प्रश्न
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
k = {(1,4), (2, 5)}
Advertisements
उत्तर
Given, X = {1, 2, 3} and Y = {4, 5}
So, X × Y = {(1, 4), (1, 5), (2, 4), (2, 5), (3, 4), (3, 5)}
k = {(1, 4),(2, 5)}
Function k is not a function as ‘3’ has not any image under the mapping.
APPEARS IN
संबंधित प्रश्न
Show that the function f in `A=R-{2/3} ` defined as `f(x)=(4x+3)/(6x-4)` is one-one and onto hence find f-1
Check the injectivity and surjectivity of the following function:
f : R → R given by f(x) = x2
Which of the following functions from A to B are one-one and onto?
f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 1 + x2
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
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 .
Find fog and gof if : f (x) = x+1, g(x) = `e^x`
.
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 and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.
Let \[f : \left( - \frac{\pi}{2}, \frac{\pi}{2} \right) \to R\] be a function defined by f(x) = cos [x]. Write range (f).
If f : R → R defined by f(x) = 3x − 4 is invertible, 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.
If a function g = {(1, 1), (2, 3), (3, 5), (4, 7)} is described by g(x) = \[\alpha x + \beta\] then find the values of \[\alpha\] and \[ \beta\] . [NCERT EXEMPLAR]
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
Show that the function f: R → R defined by f(x) = `x/(x^2 + 1)`, ∀ ∈ + R , is neither one-one nor onto
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 ______.
Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be defined from A to B is ______.
For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is injective. Then both f and g are injective functions.
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}
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 X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
g = {(1, 4), (2, 4), (3, 4)}
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 ______.
Let A = R – {3}, B = R – {1}. Let f : A → B be defined by `"f"("x") = ("x" - 2)/("x" - 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 ____________.
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
A function f: x → y is/are called onto (or surjective) if x under f.
If f: R→R is a function defined by f(x) = `[x - 1]cos((2x - 1)/2)π`, where [ ] denotes the greatest integer function, then f 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 ______.
Let x is a real number such that are functions involved are well defined then the value of `lim_(t→0)[max{(sin^-1 x/3 + cos^-1 x/3)^2, min(x^2 + 4x + 7)}]((sin^-1t)/t)` where [.] is greatest integer function and all other brackets are usual brackets.
Let f(n) = `[1/3 + (3n)/100]n`, where [n] denotes the greatest integer less than or equal to n. Then `sum_(n = 1)^56f(n)` is equal to ______.
For x ∈ R, x ≠ 0, let f0(x) = `1/(1 - x)` and fn+1 (x) = f0(fn(x)), n = 0, 1, 2, .... Then the value of `f_100(3) + f_1(2/3) + f_2(3/2)` is equal to ______.
A function is a rule that assigns each element of one set to exactly how many elements of another set?
A function is onto when every element of the codomain has:
A function is called into if:
A perfect one-to-one matching between users and unique IDs is similar to:
Which condition represents an onto (surjective) function?
