Is there any general formula for the following problem? (Repetition of numbers is allowed).
How many ways can $n$ numbers be chosen, each of which is between $1$ and $m$, such that the sum of the $n$ numbers equals $k$?
Is there any general formula for the following problem? (Repetition of numbers is allowed).
How many ways can $n$ numbers be chosen, each of which is between $1$ and $m$, such that the sum of the $n$ numbers equals $k$?