हिंदी

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. State Whether F is One-one Or Not.

Advertisements
Advertisements

प्रश्न

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. State whether f is one-one or not.

Advertisements

उत्तर

f = {(1, 4), (2, 5), (3, 6)}
Here, different elements of the domain have different images in the co-domain.
So, f is one-one .

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 2: Functions - Exercise 2.5 [पृष्ठ ७४]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
अध्याय 2 Functions
Exercise 2.5 | Q 36 | पृष्ठ ७४

वीडियो ट्यूटोरियलVIEW ALL [5]

संबंधित प्रश्न

Check the injectivity and surjectivity of the following function:

f : N → N given by f(x) = x2


Let f : N → N be defined by f(n) = `{((n+1)/2", if n is odd"),(n/2", if n is even"):}` for all n ∈ N.

State whether the function f is bijective. Justify your answer.


Let fR → be defined as f(x) = 10x + 7. Find the function gR → R such that g o f = f o = 1R.


Give examples of two functions fN → Z and gZ → Z such that g o f is injective but gis not injective.

(Hint: Consider f(x) = x and g(x) =|x|)


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?

 f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {abc}


Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto


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


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


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


Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.


Let f = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}. Show that gof is defined while fog is not defined. Also, find gof.


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) = x2 and g(x) = x + 1. Show that fog ≠ gof.


If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(1) fog
(2) gof
(3) fof
(4) f2
Also, show that fof ≠ f2


Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.


A function f : R → R is defined as f(x) = x3 + 4. Is it a bijection or not? In case it is a bijection, find f−1 (3).


Let A = R - {3} and B = R - {1}. Consider the function f : A → B defined by f(x) = `(x-2)/(x-3).`Show that f is one-one and onto and hence find f-1.

                    [CBSE 2012, 2014]


Which one of the following graphs represents a function?


If f : C → C is defined by f(x) = x2, write f−1 (−4). Here, C denotes the set of all complex numbers.


Let A = {abcd} and f : A → A be given by f = {( a,b ),( b , d ),( c , a ) , ( d , c )} write `f^-1`. [NCERT EXEMPLAR]


If the mapping f : {1, 3, 4} → {1, 2, 5} and g : {1, 2, 5} → {1, 3}, given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then write fog. [NCERT EXEMPLAR]


A function f from the set of natural numbers to the set of integers defined by

\[f\left( n \right)\begin{cases}\frac{n - 1}{2}, & \text{when n is odd} \\ - \frac{n}{2}, & \text{when n is even}\end{cases}\]

 


The inverse of the function

\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by

\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is 

 


The distinct linear functions that map [−1, 1] onto [0, 2] are


Let \[f\left(x\right) = x^3\] be a function with domain {0, 1, 2, 3}. Then domain of \[f^{-1}\] 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 ______.


Consider the set A containing n elements. Then, the total number of injective functions from A onto itself 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.


Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:

g(x) = |x|


Let f : R → R be defind by f(x) = `1/"x"  AA  "x" in "R".` Then f is ____________.


Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f is ____________.


Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then


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


Let f: R → R defined by f(x) = 3x. Choose the correct answer


'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:


Let f(x) be a polynomial of degree 3 such that f(k) = `-2/k` for k = 2, 3, 4, 5. Then the value of 52 – 10f(10) is equal to ______.


ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.

REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×