198 views
1 votes
1 votes
Let A, B, C are k element sets and let S be an n element set where k<=n. How many triples of functions f:A->S, g:B->S, h:C->S are there such that f, g and h are all injective and f(A) =g(B) =h(C) =?

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
1
mcjoshi asked Sep 23, 2016
930 views
In a cache organized memory there exist $30$% of compulsory misses, $10$% capacity misses, $12$% conflict misses. If cache is fully associative Find the average access ti...
0 votes
0 votes
1 answer
2
Devasish Ghosh asked Nov 12, 2016
332 views
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
0 votes
0 votes
0 answers
3
Devasish Ghosh asked Nov 12, 2016
273 views
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?