closed by
453 views
0 votes
0 votes
closed with the note: duplicate: https://gateoverflow.in/170311/discrete-maths-functions

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

closed by

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
2
Ray Tomlinson asked Nov 30, 2023
255 views
why option 2 is not a distributive lattice ? i solved this and found that there are each vertex has only either one or zero complement i think it is distributive lattic...
1 votes
1 votes
1 answer
4