I currently looked it up on the internet and my answer matched the same answer on a website. However, though I am confident that my solution is right, I am curious if there"s an approach in which I could compute this much faster considering that the photo listed below reflects exactly how time consuming that sort of technique would be. Thanks in advance.

You are watching: What is the probability of rolling a 7

For $7$, view that the initially roll doesn"t matter. Why? If we roll anything from $1$ to $6$, then the second roll have the right to always acquire a sum of $7$. The second dice has probability $frac16$ that it matches with the first roll.

Then, for $11$, I choose to think of it as the probcapability of rolling a $3$. It"s much less complicated. Why? Try inverting all the numbers in your die table you had actually in the image. Instead of $1, 2, 3, 4, 5, 6$, go $6, 5, 4, 3, 2, 1$. You need to see that $11$ and $3$ overlap. From below, simply calculate that tbelow are $2$ methods to roll a $3$: either $1, 2$ or $2, 1$. So it"s $frac236 = frac118$.

Key takeaways:

$7$ is constantly $frac16$ probabilityWhen asked to find probcapability of a larger number (choose $11$), discover the smaller sized equivalent (in this instance, $3$).Share

Cite

Follow

answered Aug 14 "20 at 2:33

FruDeFruDe

1,81411 gold badge44 silver badges2020 bronze badges

$endgroup$

Add a comment |

3

$egingroup$

To calculate the possibility of rolling a $7$, roll the dice one at a time. Notice that

*it does not matter*what the first roll is. Whatever before it is, there"s one possible roll of the second die that offers you a $7$. So the chance of rolling a $7$ has to be $frac 16$.

To calculate the chance of rolling an $11$, roll the dice one at a time. If the initially roll is $4$ or less, you have actually no possibility. The first roll will certainly be $5$ or more, keeping you in the ball game, through probcapacity $frac 13$. If you"re still in the round game, your opportunity of acquiring the second roll you need for an $11$ is aget $frac 16$, so the total chance that you will roll an $11$ is $frac 13 cdot frac 16 = frac118$.

Adding these two independent probabilities, the possibility of rolling either a $7$ or $11$ is $frac 16+ frac118=frac 29$.

Share

Cite

Follow

answered Aug 14 "20 at 2:21

Robert ShoreRobert Shore

14.2k22 gold badges1111 silver badges3434 bronze badges

$endgroup$

Add a comment |

1

$egingroup$

Gotta love stars and bars approach.

The number of positive integer solutions to $a_1+a_2=7$ is $inom7-12-1=6$. Therefore the probcapacity of acquiring $7$ from two dice is $frac636=frac16$.

For $11$ or any type of number better than $7$, we cannot continue exactly like this, given that $1+10=11$ is likewise a solution for instance, and we recognize that each roll cannot produce greater number than $6$. So we modify the equation a tiny to be $7-a_1+7-a_2=11$ where each $a$ is less than 7. This is equivalent to finding the variety of positive integers solution to $a_1+a_2=3$, which is $inom3-12-1=2$. Thus, the probcapability of gaining $11$ from two dice is $frac236=frac118$

Try to experiment through various numbers, calculate manually and also using various other approaches, then compare the result.

Share

Cite

Follow

answered Aug 14 "20 at 2:33

Rezha Adrian TanuharjaRezha Adrian Tanuharja

7,09555 silver badges2121 bronze badges

$endgroup$

Add a comment |

0

$egingroup$

Welinvolved the jiyuushikan.org Stack Exchange.

Tbelow certain is a quicker way; you simply have to easily enumerate the possibilities for each by treating the roll of each die as independent events.

There are 6 feasible methods to obtain 7 - one for each outcome of the initially die - and two possible ways to obtain 11 - one each in the occasion that the first die is 5 or 6 - interpretation you have actually eight total possibilities . Tbelow are $6^2=36$ possibilities for just how the two dice can roll, so you have actually a $frac836=frac29$ opportunity of rolling either one.

See more: What Is A Levin Tube Used For Gastric Decompression, What Is A Levin Tube Used For

Share

Cite

Follow

answered Aug 14 "20 at 2:26

Stephen GoreeStephen Goree

38022 silver badges1010 bronze badges

$endgroup$

Add a comment |

0

$egingroup$

In basic, the trouble of

**minimal partitions**is fairly tough. I"ll frame the difficulty in a more general setting:

Suppose we have $n$ dice, having $k$ deals with numbered as necessary. How many type of ways are there to roll some positive integer $m$?

This trouble have the right to be de-worded as:

How many type of remedies are there to the equation$$sum_i=1^n x_i=m$$With the problem that $x_iin jiyuushikan.orgbbN_leq k~forall iin1,...,k.$

The solution to this trouble is not so easy. In small situations, like $n=2, k=6, m=7$, this have the right to be easily checked via a table; a so dubbed brute pressure approach. But for larger values of $n,k$ this is sindicate not feasible. Based on this write-up I think in basic the solution to this problem is the coefficient of $x^m$ in the multinomial growth of$$left(sum_j=1^k x^j
ight)^n=x^nleft(frac1-x^k1-x
ight)^n$$In reality, let us define the **multinomial coefficient**:$$jiyuushikan.orgrmC(n,(r_1,...,r_k))=fracn!prod_j=1^k r_j!$$And state that$$left(sum_j=1^k x_j
ight)^n=sum_(r_1,...,r_k)in Sjiyuushikan.orgrmC(n,(r_1,...,r_k))prod_t=1^k x_t^r_t$$Where $S$ is the collection of services to the equation$$sum_j=1^k r_j=n$$With the restriction that $r_jin jiyuushikan.orgbbN~forall jin1,...,k.$ However, herein lies the problem: In order to compute the variety of ways to roll $m$ via $n$ $k$ sided die, which is a problem of *computer restricted partitions* of the number $m$, we need to discover the coefficient of $x^m$ in a multinomial development. But, in order to compute this multinomial growth, we should *compute restricted partitions* of $n$. As you can watch the problem is a bit circular. But, $n$ is normally smaller sized than $m$, so it could speed up the computation procedure a tiny. But at the finish of the day some amount of brute-force grunt work will certainly be forced.