MHB Rolling 5 Dice: Probability of At Least 3 Sixes

veronica1999
Messages
61
Reaction score
0
Five standard 6-sided dice are rolled. What is the probability that at least 3 of them show a six?

I am surprised my answer is wrong.

First the total outcomes are 6x6x6x6x6=7776

Successful outcomes 10x6x6=360
There are 10 ways to choose 3 from 5 and then the remaining 2 can be any number.

360/7776 is not the answer.

The answer is 276/7776.:confused:
 
Mathematics news on Phys.org
Re: dice problem

veronica1999 said:
Five standard 6-sided dice are rolled. What is the probability that at least 3 of them show a six?

I am surprised my answer is wrong.

First the total outcomes are 6x6x6x6x6=7776

Successful outcomes 10x6x6=360
There are 10 ways to choose 3 from 5 and then the remaining 2 can be any number.

360/7776 is not the answer.

The answer is 276/7776.:confused:
You have double-counted the ways in which four or five sixes can occur. What you should do is to count the number of ways in which exactly three sixes can occur (10x5x5), then add the number of ways in which four sixes can occur (5x5), and finally the one way in which five sixes can occur.
 
Re: dice problem

Oops...
Thanks!:D
 
Re: dice problem

I would use the complements rule:

$$P(X)=1-\frac{{5 \choose 0}5^5+{5 \choose 1}5^4+{5 \choose 2}5^3}{6^5}=\frac{23}{648}$$
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top