मराठी

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

Advertisements
Advertisements

प्रश्न

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

बेरीज
Advertisements

उत्तर

Onto functions from the set {1, 2, 3, ..., n} to itself are simply permutations on the n symbols 1, 2, ..., n.

Thus, the total number of onto maps from {1, 2, ..., n} to itself is the same as the total number of permutations on n symbols 1, 2, ..., n, which is n!.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations and Functions - Miscellaneous Exercise on Chapter 1 [पृष्ठ १५]

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
पाठ 1 Relations and Functions
Miscellaneous Exercise on Chapter 1 | Q 4. | पृष्ठ १५

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

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

Let fR → R be the Signum Function defined as

f(x) = `{(1,x>0), (0, x =0),(-1, x< 0):}`

and gR → be the Greatest Integer Function given by g(x) = [x], where [x] is greatest integer less than or equal to x. Then does fog and gof coincide in (0, 1]?


Give an example of a function which is neither one-one nor onto ?


 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 : Q → Q, defined by f(x) = x3 + 1


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


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


Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.


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.


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = 2x + x2 and  g(x) = x3


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 fgh be real functions given by f(x) = sin xg (x) = 2x and h (x) = cos x. Prove that fog = go (fh).


State with reason whether the following functions have inverse :
f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}


Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2


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.


Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1


If f : Q → Qg : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −1.


If f : R → (0, 2) defined by `f (x) =(e^x - e^(x))/(e^x +e^(-x))+1`is invertible , find f-1.


Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.


If f : A → Ag : A → A are two bijections, then prove that fog is a surjection ?


If f : R → R is defined by f(x) = x2, write f−1 (25)


Let \[f : \left[ - \frac{\pi}{2}, \frac{\pi}{2} \right] \to\] A be defined by f(x) = sin x. If f is a bijection, write set A.


Let fg : R → R be defined by f(x) = 2x + l and g(x) = x2−2 for all x

∈ R, respectively. Then, find gof.  [NCERT EXEMPLAR]


If a function g = {(1, 1), (2, 3), (3, 5), (4, 7)} is described by g(x) = \[\alpha x + \beta\]  then find the values of \[\alpha\] and \[ \beta\] . [NCERT EXEMPLAR]


The range of the function

\[f\left( x \right) =^{7 - x} P_{x - 3}\]

 


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.


Let N be the set of natural numbers and the function f: N → N be defined by f(n) = 2n + 3 ∀ n ∈ N. Then f 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 ______.


Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, is ____________.


Let g(x) = x2 – 4x – 5, then ____________.


Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:


If f; R → R f(x) = 10x + 3 then f–1(x) 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 ______.


Consider a set containing function A= {cos–1cosx, sin(sin–1x), sinx((sinx)2 – 1), etan{x}, `e^(|cosx| + |sinx|)`, sin(tan(cosx)), sin(tanx)}. B, C, D, are subsets of A, such that B contains periodic functions, C contains even functions, D contains odd functions then the value of n(B ∩ C) + n(B ∩ D) is ______ where {.} denotes the fractional part of functions)


Let f: R→R be a polynomial function satisfying f(x + y) = f(x) + f(y) + 3xy(x + y) –1 ∀ x, y ∈ R and f'(0) = 1, then `lim_(x→∞)(f(2x))/(f(x)` is equal to ______.


The graph of the function y = f(x) is symmetrical about the line x = 2, then ______.


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 trigonometric equation tan–1x = 3tan–1 a has solution for ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×