Probability of rolling a sum of 20

Click For Summary

Discussion Overview

The discussion revolves around calculating the probability of rolling a sum of 20 when rolling a fair die five times. Participants explore various methods, including the principle of inclusion and exclusion (PIE), to approach the problem, while addressing the complexities involved in counting combinations and permutations of dice rolls.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes that the problem can be approached by distributing 20 identical objects into 5 labeled containers, each containing between 1 and 6 objects.
  • Another participant questions this approach and suggests counting the number of ways to achieve the sum of 20 using combinations of the number 4.
  • A participant expresses difficulty in counting combinations with specific constraints, suggesting that a formula might be more efficient than manual counting.
  • There is a correction regarding the conditions for applying PIE, indicating that the condition should be for containers to have greater than 6 objects instead of greater than 5.
  • One participant acknowledges a realization of their earlier misunderstanding and recalculates the probability using the corrected conditions for PIE, arriving at a result that matches their textbook.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the best approach initially, with multiple competing views on how to calculate the probability. However, one participant later confirms their method aligns with the textbook solution.

Contextual Notes

Participants express uncertainty about the counting methods and the application of PIE, indicating that the problem's complexity may depend on the specific constraints of the dice rolls.

psilentist
Messages
4
Reaction score
0

Homework Statement


If you roll a fair die 5 times, what is the probability that the sum of the five rolls is 20?


Homework Equations





The Attempt at a Solution


I know the sample space is all possible permutations of 1 to 6 taken five at a time with repetition, which is 6^5 = 7776.

And I know this can be done with the principle of inclusion and exclusion.

The problem can be seen as distributing 20 identical objects into 5 labeled containers such that each has between 1 and 6 (inclusive) objects.

This reduces to distributing 15 objects such that each container has 0 to 5 (inclusive) objects.

So using PIE, the base set is all solutions to 15 objects into five labeled containers, C(15 + 5 - 1, 15), and the condition is that a container has 6 or more objects.

There are C(5, 1) = 5 ways the condition can be satisfied once, and in each case there are C(10 + 5 - 1, 10) solutions.

There are C(5, 2) = 10 ways the condition can be satisfied twice, and in each case there are C(5 + 5 - 1, 5) solutions.

So the answer should be [C(15 + 5 - 1, 15) - 5*C(10 + 5 - 1, 10) + 10*C(5 + 5 - 1, 5)]/7776 = 131/7776.

But the book says 651/7776.

Can anyone see a problem with what I'm doing?
 
Physics news on Phys.org
Welcome to PF!

Hi psilentist ! Welcome to PF! :smile:
psilentist said:
The problem can be seen as distributing 20 identical objects into 5 labeled containers such that each has between 1 and 6 (inclusive) objects.

No … why do you think that? :confused:

Hint: 20 = 5 x 4.

So count the number of ways of making 20 with exactly five 4s,

plus the number of ways of making 20 with exactly three 4s,

plus the number of ways of making 20 with exactly two 4s,

plus the number of ways of making 20 with exactly one 4. :smile:
 
How many sums with exactly one 4?

I started working through the problem as you suggested, but it becomes pretty painful counting the possible combinations with exactly one 4.

Permutations of 1 3 6 6, 2 2 6 6, 5 3 2 6, etc... With that many, how can you be sure you're covering all of them? And what if the 5 dice actually had 25 sides?, and we were looking at the probability of them summing to 65? There has to be a better way - a formula.

And this is from the chapter on the Principle of Inclusion and Exclusion.

If a set (the solutions to the problem of x1 + x2 + x3 + x4 + x5 = 15) has size N, and conditions ci, i from 1 to 5 (xi >= 5), the number of elements of S that satisfy none of the conditions ci (0 <= xi <= 5) can be found from:

N - [N(c1) + N(c2) + N(c3) + ... + N(c5)] + [N(c1c2) + N(c1c3) + ... + N(c4c5)] - [N(c1c2c3) + ...

Do you still think I'm on the wrong track?
 
oops... ci is x >= 6
 
tiny-tim said:
So count the number of ways of making 20 with exactly five 4s, ...
Tiny-time! You missed one possibility: :smile:

plus the number of ways of making 20 with exactly zero 4s. :smile:
 
Hi psilentist! :smile:
First … I've just noticed that I cut off the last line in my last post, which should be:
plus the number of ways of making 20 with no 4s.​

Sorry! :redface:
psilentist said:
I started working through the problem as you suggested, but it becomes pretty painful counting the possible combinations with exactly one 4.

Permutations of 1 3 6 6, 2 2 6 6, 5 3 2 6, etc... With that many, how can you be sure you're covering all of them?

Well, apart from 3355, and all the permutations, that is all with exactly one 4. :smile:
And what if the 5 dice actually had 25 sides?, and we were looking at the probability of them summing to 65? There has to be a better way - a formula.

25 sides … we'd probably need a computer!

Sorry, but there simply isn't a formula for everything.

There may be a PIE method, but I honestly can't see what it is.

EDIT: Thanks DH! … you just beat me to it!

erm … can you see a PIE method?
 
[solved]

Okay, I realized what I was doing wrong.

I had the right approach, but the condition we need to satisfy in order to use PIE is that each container contains GREATER THAN 6 objects, not greater than 5. That is, the die roll is greater than 6. (Then, by applying PIE, we find all solutions that do NOT satisfy the condition, i.e., the rolls are less than or equal to 6.)

So using PIE, the base set is all solutions to 15 objects into five labeled containers, C(15 + 5 - 1, 15), and the condition is that a container has 7 or more objects.

There are C(5, 1) = 5 ways the condition can be satisfied once, and in each case there are C(9 + 5 - 1, 9) solutions (take six objects from the 15, and place in one container).

There are C(5, 2) = 10 ways the condition can be satisfied twice, and in each case there are C(3 + 5 - 1, 3) solutions (subtract 6 again).

So the answer should be [C(15 + 5 - 1, 15) - 5*C(9 + 5 - 1, 9) + 10*C(3 + 5 - 1, 3)]/7776 = 651/7776, which agrees with my textbook.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
13
Views
8K