MHB Expected Value of Rolling a Pair of Dice - Fair Price to Play

rymatson406
Messages
3
Reaction score
0
We roll a pair of dice. If the sum of the dice is 7, you pay me $28. If the sum is not 7, I pay you the number of dollars indicated by the sum of the dice. What is the price that you should pay to play the game that would make the game fair?
 
Mathematics news on Phys.org
I deleted the duplicate of this thread in the Advanced Probability subforum. We ask that you post a question only once, as doing otherwise can lead to duplication of effort on the part of our helpers. I'm sure you can understand that the time and effort of our helpers is valuable, and we don't want to see it wasted. :D

edit: I did the same with your other question.
 
rymatson406 said:
We roll a pair of dice. If the sum of the dice is 7, you pay me $28. If the sum is not 7, I pay you the number of dollars indicated by the sum of the dice. What is the price that you should pay to play the game that would make the game fair?

Among the 36 possible results of the roll of two dice, those whose sum is k are k-1 for k ranging from 2 to 7 and 12 - (k-1) for k ranging from 8 to 12. The expected win your opponent is ...

$\displaystyle E\ \{ O \} = \frac{(1 + 2 + 3 + 4 + 5)\ 14}{36} = 5.833... \text{dollars}$

Your expected win is...

$\displaystyle E\ \{ Y \} = \frac{28}{6} = 4.666... \text{dollars}$

... and it is lower. For a fair game You should ask 35 dollars...

Kind regards

$\chi$ $\sigma$
 
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