English

If a = {1, 2, 3}, Show that a One-one Function F : a → a Must Be Onto.

Advertisements
Advertisements

Question

If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.

Sum
Advertisements

Solution

A ={1, 2, 3}
Number of elements in  = 3
Number of one - one functions = number of ways of arranging 3 elements = 3! = 6
So, the possible one -one functions can be the following:

(i) {(1, 1), (2, 2), (3, 3)}
(ii) {(1, 1), (2, 3), (3, 2)}
(iii) {(1, 2 ), (2, 2), (3, 3 )}
(iv) {(1, 2), (2, 1), (3, 3)}
(v) {(1, 3), (2, 2), (3, 1)}
(vi) {(1, 3), (2, 1), (3,2 )}
Here, in each function, range = {1, 2, 3}, which is same as the co-domain.
So, all the functions are onto.

shaalaa.com
  Is there an error in this question or solution?
Chapter 2: Functions - Exercise 2.1 [Page 32]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 2 Functions
Exercise 2.1 | Q 14 | Page 32

RELATED QUESTIONS

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


Let f : R → R be defined as f(x) = x4. Choose the correct answer.


Show that the function f : R → {x ∈ R : –1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.


Let S = {abc} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

F = {(a, 3), (b, 2), (c, 1)} 


 Which of the following functions from A to B are one-one and onto ?  

f3 = {(ax), (bx), (cz), (dz)} ; A = {abcd,}, B = {xyz}. 


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = x3 + 1


Classify the following function as injection, surjection or bijection :

 f : R → R, defined by f(x) = x3 − x


Classify the following function as injection, surjection or bijection :

f : Q − {3} → Q, defined by `f (x) = (2x +3)/(x-3)`


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = `x/(x^2 +1)`


Let A = [-1, 1]. Then, discuss whether the following functions from A to itself is one-one, onto or bijective : h(x) = x2 


If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.


Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.


Let A = {abc}, B = {u vw} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(av), (bu), (cw)}, g = {(ub), (va), (wc)}.
Show that f and g both are bijections and find fog and gof.


Let f : R → R and g : R → R be defined by f(x) = + 1 and (x) = x − 1. Show that fog = gof = IR.


Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.


If f : A → B and g : B → C are onto functions, show that gof is a onto function.


Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → Bg : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.


If f(x) = 4 −( x - 7)3 then write f-1 (x).


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

 


If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\] 

 


Let  \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]

 


 Let
\[g\left( x \right) = 1 + x - \left[ x \right] \text{and} f\left( x \right) = \begin{cases}- 1, & x < 0 \\ 0, & x = 0, \\ 1, & x > 0\end{cases}\] where [x] denotes the greatest integer less than or equal to x. Then for all \[x, f \left( g \left( x \right) \right)\] is equal to


Write about strcmp() function.


If A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A onto A. Find f–1


Let D be the domain of the real valued function f defined by f(x) = `sqrt(25 - x^2)`. Then, write D


If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))


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 A = {0, 1} and N be the set of natural numbers. Then the mapping f: N → A defined by f(2n – 1) = 0, f(2n) = 1, ∀ n ∈ N, is onto.


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 ____________.


A function f: x → y is said to be one – one (or injective) if:


Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' 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 ______.


Let a function `f: N rightarrow N` be defined by

f(n) = `{:[(2n",", n = 2","  4","  6","  8","......),(n - 1",", n = 3","  7","  11","  15","......),((n + 1)/2",", n = 1","  5","  9","  13","......):}`

then f 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 ______.


Let A = {1, 2, 3, ..., 10} and f : A `rightarrow` A be defined as

f(k) = `{{:(k + 1, if k  "is odd"),(     k, if k  "is even"):}`.

Then the number of possible functions g : A `rightarrow` A such that gof = f is ______.


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 f : [– 4, 4] `rightarrow` [0, 4] is given by f(x) = `sqrt(16 - x^2)`. Show that f is an onto function but not a one-one function. Further, find all possible values of 'a' for which f(a) = `sqrt(7)`.


The function f(x) = [x], where [x] denotes the greatest integer less than or equal to x; is continuous at ______.


Write the domain and range (principle value branch) of the following functions:

f(x) = tan–1 x.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×