The general problem I'm trying to solve is the probability of rolling a total t on n s-sided dice. A good chunk of the problem is easy enough, but where I run into difficulty is this:(adsbygoogle = window.adsbygoogle || []).push({});

How many combinations of dice will yield a sum total of t? Because the number set is limited, [tex]{a \choose n-1}[/tex] (where [tex]a={n(s+1) \over 2} - \left|{n(s+1) \over 2} - t\right|[/tex]) no longer works when [tex]n+s \leq t \leq (n-1)s[/tex]. It is this region in the middle that interests me. Enumerating all combinations could be time-consuming, and, I expect, is entirely unnecessary. Is there a known formula for computing these numbers?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Sum of n elements of a finite set of integers, 1 through s

**Physics Forums | Science Articles, Homework Help, Discussion**