Probability of 20 dice being divisible by 6

  • Thread starter Thread starter Gregg
  • Start date Start date
  • Tags Tags
    Dice Probability
Click For Summary

Homework Help Overview

The problem involves rolling 20 dice and determining the probability that the sum of the rolls is divisible by 6. The context includes considerations of probability theory and the use of Markov chains.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss various methods to approach the problem, including the use of the law of total probability and Markov chains. There are attempts to simplify the problem by considering fewer dice and the implications of their remainders when divided by 6.

Discussion Status

The discussion is active with participants exploring different interpretations and approaches. Some have suggested shortcuts and alternative reasoning, while others are questioning the assumptions about the distribution of remainders when rolling the dice.

Contextual Notes

There are indications of uncertainty regarding the assumptions made about the outcomes of the dice rolls and the implications of those outcomes on the overall probability calculation.

Gregg
Messages
452
Reaction score
0

Homework Statement



20 dice are rolled what's the probability that the sum will be divisible by 6?


Homework Equations



Law of total probability


The Attempt at a Solution



The possibilities are between 20x1 and 20x6:

24,30,36,42,48,54,60,66,72,78,84,90,96,102,108,114,120

In the beginning, trying to find out how many ways there are to get 24 from 20 dice makes me feel as though I can't possibly be expected to do it for all 17 totals. I have no idea how to do this
 
Physics news on Phys.org
Hi Gregg! :smile:

Well, they wouldn't ask a question as complicated as this if there wasn't a short-cut, would they? :biggrin:

Hint: try rolling 19 dice first … then what? :wink:
 
Let us create a Markov chain {X_n : X in N}. The Markov chain will stand for the sum of n dice modulo 6. X_0 = 0. The Markov chain then has the following transition probability matrix:

[tex] \begin{bmatrix}<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}\\<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}\\<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}\\<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}\\<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}\\<br /> \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6} & \frac{1}{6}<br /> \end{bmatrix}[/tex]

Hence, we have a doubly stochastic matrix whose transition probability is already the invariant probability measure. The probability must be 1/6 then.

If you have not studied Markov chains, then I recommend you ask yourself: "What is the probability of rolling a number divisible by 6 with 1 die." Then, bump it up to summing 2 dice. You should, by then, see the logic behind the probability always being 1/6 no matter how many dice you roll.
 
Last edited:
I can't see that! if the first 19 are divisible by 6 we require a 6 for the 20th. That's all I seem to be able to deduce - going further I bump into complications. Like considering 19 sixes, 19 fives, 19 twos etc.
 
Gregg said:
I can't see that! if the first 19 are divisible by 6 we require a 6 for the 20th.

and suppose the first 19 have remainder 1 on division by 6 ? :wink:
 
Ah... I could say that it is the same as the probability of getting divisible by 1,2,3,4 or 5, and further that the union of these is the sample space.

[tex]\text{P}(\Omega) = \sum_{k=1} ^{6} \text{ P(divisible by k)} = 6 \text{ P(divisible by 6)} = 1[/tex]
 
tiny-tim said:
and suppose the first 19 have remainder 1 on division by 6 ? :wink:

OK so the first 19 have remainder 1 on division by 6. Then we require 5, remainder 2, then we require 4, remainder 3, we require 3, remainder 4, we require 2, remainder 5, we require 1?
 
tiny-tim said:
Hi Gregg! :smile:

Well, they wouldn't ask a question as complicated as this if there wasn't a short-cut, would they? :biggrin:

You rock buddy! I too have the same evil smile sitting in an examination hall and wondering about the short-cuts
 
Gregg said:
Ah... I could say that it is the same as the probability of getting divisible by 1,2,3,4 or 5,

you mean that all remainders are equally likely? true, but how do you prove that? :confused:

what is P(divisible by 6 | remainder of first 19 is 1) ?​
 
  • #10
tiny-tim said:
you mean that all remainders are equally likely? true, but how do you prove that? :confused:

what is P(divisible by 6 | remainder of first 19 is 1) ?​

So

P(divisible by 6 | remainder of first 19 is i) = 1/6

i=1,2,3,4,5,6 ?
 
  • #11
[tex]\text{P( div. by 6)} = \sum_{k=1}^{6} \text{P(rem. of 1st 19 is k) P(div. by 6 |rem. of 1st 19 is k)}[/tex]

[tex]\text{P(rem. of 1st 19 is k)} = 1/6[/tex]
[tex]\text{P(div. by 6 |rem. of 1st 19 is k)}[/tex]

Which gives 1/6. If I could show that the [tex]\text{P(rem. of 1st 19 is k)} = 1/6[/tex]
 
  • #12
Gregg said:
Which gives 1/6. If I could show that the [tex]\text{P(rem. of 1st 19 is k)} = 1/6[/tex]

You don't need to!

Write out the whole P(A) = ∑ P(A|B)P(B) formula …

what do you notice? :wink:
 
  • #13
P(A|Bk) is constant = 1/6

Bkis a partition of the sample space so the sum adds to unity

P(A) = ∑P(A|Bk) P(Bk)

P(A) =P(A|Bk) ∑P(Bk)

P(A) = 1/6
 
  • #14
That's right! :smile:

(But clearer would be

P(A) = ∑P(A|Bk) P(Bk)

= ∑ (1/6) P(Bk)

= 1/6 :wink:)
 
  • #15
Thanks. very helpful - with stuff like this I never ever manage to catch the easy way of doing it
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
1K
  • · Replies 32 ·
2
Replies
32
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 53 ·
2
Replies
53
Views
10K
Replies
6
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
6
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K