Advertisements
Advertisements
प्रश्न
Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if "n is even"):}` Is the function injective? Justify your answer.
Advertisements
उत्तर
Let y ∈ N(codomain). Then ∃ 2y ∈ N(domain) such that f(2y) = `(2y)/2` = y. Hence, f is surjective.
1, 2 ∈ N(domain) such that f(1) = 1 = f(2)
Hence, f is not injective.
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x2
In the following case, state whether the function is one-one, onto or bijective. Justify your answer.
f : R → R defined by f(x) = 3 – 4x
Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is bijective function.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
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
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
Show that the logarithmic function f : R0+ → R given by f (x) loga x ,a> 0 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 .
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.
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Consider the function f : R+ → [-9 , ∞ ]given by f(x) = 5x2 + 6x - 9. Prove that f is invertible with f -1 (y) = `(sqrt(54 + 5y) -3)/5` [CBSE 2015]
Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (x).
Let A = {a, b, c, d} and f : A → A be given by f = {( a,b ),( b , d ),( c , a ) , ( d , c )} write `f^-1`. [NCERT EXEMPLAR]
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
Let
\[A = \left\{ x : - 1 \leq x \leq 1 \right\} \text{and} f : A \to \text{A such that f}\left( x \right) = x|x|\]
Let
\[f : R \to R\] be a function defined by
The distinct linear functions that map [−1, 1] onto [0, 2] are
Let
\[f : [2, \infty ) \to X\] be defined by
\[f\left( x \right) = 4x - x^2\] Then, f is invertible if X =
Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is
Let f: R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are ______.
Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, 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:
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: N → N be defined by f(x) = x2 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 ______.
The given function f : R → R is not ‘onto’ function. Give reason.
A function is called many-one if two or more different elements of the domain have:
A perfect one-to-one matching between users and unique IDs is similar to:
Which condition represents an into function?
