How do I find the amount of possible ordered partition of $n$, given set of positive integer $S$? Here's an example,
With $n = 4$ and $S = \{1, 3, 4\}$, we should have $4$, as $(1,1,1,1)$, $(1, 3)$, $(3, 1)$, and $(4)$ are the solutions.
I've seen this page but didn't have a clue how he transformed the equation to functions of $x$. Neither do I know the name of the transformation technique nor what is $x$.