Problem:
How many ways are there to choose 2010 functions from to such that is constant? Note: a function is constant if for all in the domain of .
Problem:
How many ways are there to choose 2010 functions from to such that is constant? Note: a function is constant if for all in the domain of .
Solution:
If all 2010 functions are bijective, then the composition will be bijective also, and therefore not constant. If, however, one of is not bijective, say , then , so . So the composition will be constant unless all are bijective. Since there are 4 possible functions from to and 2 of them are bijective, we subtract the cases where all the functions are bijective from the total to get .