The Gateway to Computer Science Excellence
+1 vote
28 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 by (147 points) | 28 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,309 answers
198,326 comments
105,019 users