A study of a dice problem (Q1908249)

The authors give an analysis of the following problem: given \(m\) dice, each of which has \(n\) faces, how many arrangements of those dice are there such that the sum of their outcomes equals \(p\)? The number of arrangements, \(N(m, n, p)\), is studied in connection with the multinomial coefficients and generating functions. An effective calculation procedure is proposed using Prolog, and some numerical results are demonstrated.