Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a simple form for the probability of rolling at least $n$ on $k$ 6-sided dice? Of course you can do it by recursion (see here). But is there a way to do it with just a few binomial coefficients, without the recursion?

share|cite|improve this question
If you're willing to sacrifice accuracy, you can use the normal approximation, if $k$ is large. There isn't much alternative apart form doing the calculation. – Calvin Lin Jan 27 '13 at 19:18

What you want to know is here.

The formula for a homogeneous and fair dice from 1 to D values is this


where S is the sum that you want, n is the number of dice you roll and D is the number of sides of the dice (D6, D8, etc.)

To know the sum of at least S just need sum what you want over S.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.