Register

Set theory : Number of functions

208 views
0 votes
0 votes

The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B are ??

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
2
Prince Sindhiya asked Nov 11, 2018
1,285 views
Zeal Test Series 2019: Set Theory & Algebra - Functions
Let f : A → B be function, where A = {1,2,3,4,5,6} and B = {1,2,3,4,5}. If f(1) = 4 then how many surjective (onto) functions are possible ?
Let f : A → B be function, where A = {1,2,3,4,5,6} and B = {1,2,3,4,5}.If f(1) = 4 then how many surjective (onto) functions are possible ?
User Avatar
0 votes
0 votes
1 answer
4
Tushar Shinde asked Jan 24, 2016
637 views
Ace Test Series: Set Theory & Algebra - Functions
I thought answer would be (C). Because, inner 'f' is outputting values 8, 9, 3, 1, 2. So, outer 'f' should take these values for final output. But as these values are not in its domain [S], so that should be undefined.. Right?
I thought answer would be (C). Because, inner 'f' is outputting values 8, 9, 3, 1, 2. So, outer 'f' should take these values for final output. But as these values are not...
User Avatar
Link Copied!