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 - The Fusion of Science and Community**

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

Loading...

Similar Threads - elements finite integers | Date |
---|---|

I Can an ordered pair have identical elements? | Dec 18, 2016 |

I Why can sets contain duplicate elements? | Nov 13, 2015 |

Examples of A intersection B being an element of A | Oct 30, 2014 |

What is the precise definition of, "Differs in exactly one element"? | Sep 11, 2014 |

An element of a finite group | Dec 15, 2012 |

**Physics Forums - The Fusion of Science and Community**