A function is defined by mapping f:A→B such that A contains m eleme – McqOptions

MCQOPTIONS

1.	A function is defined by mapping f:A→B such that A contains m elements and B contains n elements and m > n then number of bijections are ________
A.	nCm x m!
B.	nCm x n!
C.	0
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

No Comment Found

Related MCQs

A bijection is a function which is many-one and onto.
A function is defined by mapping f:A→B such that A contains m elements and B contains n elements and m > n then number of bijections are ________
A function is defined by mapping f : A → B such that A contains m elements and B contains n elements and 1≤n≤m then number of onto functions are ________
Set A has 3 elements and set B has 4 elements then number of injections defined from A to B are?
Onto function are known as injection.
For an onto function range is equivalent to codomain.
A function is defined by mapping f : A -> B such that A contains m elements and B contains n elements and m>n then number of one one functions are ________
A function is defined by mapping f : A → B such that A contains m elements and B contains n elements and m ≤ n then number of one one functions are _________
A mapping f : X → Y is one one if __________
An injection is a function which is?