Browse · MathNet
PrintTHE 68th ROMANIAN MATHEMATICAL OLYMPIAD
Romania algebra
Problem
Let and be two finite sets. Find the number of functions satisfying the property that there exist two functions and such that , , and , .
Solution
Let , , be three functions satisfying the properties in the problem. Because , it is clear that is surjective and is injective. As , we also get that .
As we get , . From here, any function with the property from the problem has the following form where is any function.
Let , such that (supposing that ). We define where is any function.
Noticing that we prove that has the property from the problem. Let an arbitrary bijection and defined by It is easy to check that , , and , .
Now we can choose the subset in ways, and the function in ways, and thus, the number of functions with the requested property is .
As we get , . From here, any function with the property from the problem has the following form where is any function.
Let , such that (supposing that ). We define where is any function.
Noticing that we prove that has the property from the problem. Let an arbitrary bijection and defined by It is easy to check that , , and , .
Now we can choose the subset in ways, and the function in ways, and thus, the number of functions with the requested property is .
Final answer
binom(|A|,|B|) * |B|^{|A|-|B|}
Techniques
Injectivity / surjectivity