Advertisements
Advertisements
Question
Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto
Advertisements
Solution
f : N → N, defined by f(x) = x2 + x + 1
Injectivity:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
⇒ `x^2 + x +1 = y^2 + y +1`
⇒ `(x^2 - y^2 ) + (x - y ) = 0 `
⇒ (x +y) (x- y ) + (x-y ) = 0
⇒ ( x - y) ( x + y + 1) = 0
⇒ x - y = 0 [ x + y + 1 can not be zero because x and y are natural numbers
⇒ x =y
So, f is one-one.
Surjectivity:
when x = 1
`x^2 + x +1 = 1 +1 +1 = 3`
⇒ x + x +1 ≥ 3 , for every x in N.
⇒ f(x) will not assume the values 1 and 2.
So, F is not onto.
RELATED QUESTIONS
Show that the function f: ℝ → ℝ defined by f(x) = `x/(x^2 + 1), ∀x in R`is neither one-one nor onto. Also, if g: ℝ → ℝ is defined as g(x) = 2x - 1. Find fog(x)
Give an example of a function which is not one-one but onto ?
Which of the following functions from A to B are one-one and onto ?
f3 = {(a, x), (b, x), (c, z), (d, z)} ; A = {a, b, c, d,}, B = {x, y, z}.
Show that the function f : R − {3} → R − {2} given by f(x) = `(x-2)/(x-3)` is a bijection.
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
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]
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 8 and g(x) = 3x3 + 1 .
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
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.
Find fog and gof if : f (x) = x+1, g (x) = sin x .
Consider f : {1, 2, 3} → {a, b, c} and g : {a, b, c} → {apple, ball, cat} defined as f (1) = a, f (2) = b, f (3) = c, g (a) = apple, g (b) = ball and g (c) = cat. Show that f, g and gof are invertible. Find f−1, g−1 and gof−1and show that (gof)−1 = f −1o g−1
If f : R → (0, 2) defined by `f (x) =(e^x - e^(x))/(e^x +e^(-x))+1`is invertible , find f-1.
Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {a, b, c}.
Let C denote the set of all complex numbers. A function f : C → C is defined by f(x) = x3. Write f−1(1).
Let \[f : \left( - \frac{\pi}{2}, \frac{\pi}{2} \right) \to R\] be a function defined by f(x) = cos [x]. Write range (f).
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
If f : {5, 6} → {2, 3} and g : {2, 3} → {5, 6} are given by f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, then find fog. [NCERT EXEMPLAR]
Let f, g : R → R be defined by f(x) = 2x + l and g(x) = x2−2 for all x
∈ R, respectively. Then, find gof. [NCERT EXEMPLAR]
\[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, then
The function
f : A → B defined by
f (x) = - x2 + 6x - 8 is a bijection if
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|\]
The function
\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
The function
If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\]
Mark the correct alternative in the following question:
Let f : R \[-\] \[\left\{ \frac{3}{5} \right\}\] \[\to\] R be defined by f(x) = \[\frac{3x + 2}{5x - 3}\] Then,
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.
Let f: `[2, oo)` → R be the function defined by f(x) = x2 – 4x + 5, then the range of f is ______.
Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.
The function f : A → B defined by f(x) = 4x + 7, x ∈ R is ____________.
Range of `"f"("x") = sqrt((1 - "cos x") sqrt ((1 - "cos x")sqrt ((1 - "cos x")....infty))`
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:
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 ____________.
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.
- Let R: B → G be defined by R = { (b1,g1), (b2,g2),(b3,g1)}, then R is ____________.
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?
A function f: x → y is said to be one – one (or injective) if:
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is
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 ______.
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` 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 ______.
