search
Log In
1 vote
60 views
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) =?
in Set Theory & Algebra 60 views

Please log in or register to answer this question.

Related questions

4 votes
1 answer
1
482 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 time? ($t_{c} = 10ns$, $t_{m} = 100ns$) a). $10ns$ b). $40ns$ c). $50ns$ d). $62ns$
asked Sep 23, 2016 in CO and Architecture mcjoshi 482 views
0 votes
1 answer
2
151 views
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
asked Nov 12, 2016 in Graph Theory Devasish Ghosh 151 views
0 votes
0 answers
3
159 views
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?
asked Nov 12, 2016 in Graph Theory Devasish Ghosh 159 views
0 votes
0 answers
4
37 views
Find the domain and range of these functions. the function that assigns to each pair of positive integers the first integer of the pair the function that assigns to each positive integer its largest decimal digit the function that assigns to a bit string the number of ... not exceeding the square root of the integer the function that assigns to a bit string the longest string of ones in the string
asked Apr 9, 2019 in Set Theory & Algebra Pooja Khatri 37 views
...