Problem

Source: Taiwan 3rd TST 2005, final exam, first day, problem 3

Tags: function, combinatorics proposed, combinatorics



The set $\{1,2,\dots\>,n\}$ is called $P$. The function $f: P \to \{1,2,\dots\>,m\}$ satisfies \[f(A\cap B)=\min (f(A), f(B)).\] What is the relationship between the number of possible functions $f$ with the sum $\displaystyle \sum_{j=1}^m j^n$? There is a nice and easy solution to this. Too bad I did not think of it...