Advertisements
Advertisements
प्रश्न
Let f : N → N be defined by
`f(n) = { (n+ 1, if n is odd),( n-1 , if n is even):}`
Show that f is a bijection.
[CBSE 2012, NCERT]
Advertisements
उत्तर
We have,
`f (n) = {(n + 1 , if n is odd),(n - 1, if n is even):}`
Injection test :
Case I: If n is odd,
Let x, y ∈ N such that f (x)=f (y)
As, f (x)=f (y)
⇒ x + 1= y + 1
⇒ x = y
Case II: If n is even,
Let x, y ∈ N such that f (x)=f (y)
As, f (x)=f (y)
⇒ x − 1 = y − 1
⇒ x = y
So, f is injective.
Surjection test:
Case I: If n is odd,
As, for every n ∈ N, there exists y = n − 1 in N such that
f (y) = f (n−1)=n −1+1= n
Case II: If n is even,
As, for every n ∈ N, there exists y = n + 1 in N such that f (y)=f (n+1)=n +1−1 = n
So, f is surjective.
So, f is a bijection.
APPEARS IN
संबंधित प्रश्न
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
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}
Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
If f : A → B is an injection, such that range of f = {a}, determine the number of elements in A.
Set of ordered pair of a function? If so, examine whether the mapping is injective or surjective :{(x, y) : x is a person, y is the mother of x}
Let A = {1, 2, 3}. Write all one-one from A to itself.
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x and g(x) = |x| .
If f : A → B and g : B → C are onto functions, show that gof is a onto function.
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
Let f be a function from R to R, such that f(x) = cos (x + 2). Is f invertible? Justify your answer.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Let f : R → R be defined as `f (x) = (2x - 3)/4.` write fo f-1 (1) .
Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write the total number of onto functions from A to B.
Which of the following functions form Z to itself are bijections?
The function
If \[g \left( f \left( x \right) \right) = \left| \sin x \right| \text{and} f \left( g \left( x \right) \right) = \left( \sin \sqrt{x} \right)^2 , \text{then}\]
Let \[f\left( x \right) = \frac{\alpha x}{x + 1}, x \neq - 1\] Then, for what value of α is \[f \left( f\left( x \right) \right) = x?\]
Mark the correct alternative in the following question:
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 the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.
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 A be a finite set. Then, each injective function from A into itself is not surjective.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(a, b): a is a person, b is an ancestor of a}
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
k(x) = x2
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 f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
If N be the set of all-natural numbers, consider f: N → N such that f(x) = 2x, ∀ x ∈ N, then f is ____________.
Range of `"f"("x") = sqrt((1 - "cos x") sqrt ((1 - "cos x")sqrt ((1 - "cos x")....infty))`
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 find the number of injective functions from B to G. How many numbers of injective functions are possible?
Let f: R → R defined by f(x) = 3x. Choose the correct answer
If f; R → R f(x) = 10x + 3 then f–1(x) is:
Let f: R→R be defined as f(x) = 2x – 1 and g: R – {1}→R be defined as g(x) = `(x - 1/2)/(x - 1)`. Then the composition function f (g(x)) is ______.
If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n" "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.
Let f(x) = ax (a > 0) be written as f(x) = f1(x) + f2(x), where f1(x) is an even function and f2(x) is an odd function. Then f1(x + y) + f1(x – y) equals ______.
If f : R `rightarrow` R is defined by `f(x) = (2x - 7)/4`, show that f(x) is one-one and onto.
