This shows you the differences between two versions of the page.
pow:start [2024/03/25 22:42] mazur |
pow:start [2024/05/07 15:59] (current) mazur |
||
---|---|---|---|
Line 2: | Line 2: | ||
====== Problem of the Week ====== | ====== Problem of the Week ====== | ||
~~NOTOC~~ | ~~NOTOC~~ | ||
- | <box 85% round orange|Problem 5 (due Monday, April 8) > | + | <box 85% round orange| > |
- | An investor in a casino is offered a choice of getting a return each time a certain game is played. | + | The problem of the week will return in the Fall 2024 semester. We thank everyone who participated this Spring. For the Summer, we suggest reviewing problems from past semesters and working on the additional problems posted at the bottom of the provided solutions. |
- | The game is played by tossing $N$ times a fair coin and recording the sequence of heads (H) and tails (T). | + | |
- | Let $h$ be the number of appearances of HH in the recorded sequence and let $t$ be the number of | + | |
- | appearances of HT. For example, when $N=5$ and THHHT is recorded then $h=2$ and $t=1$. The investor | + | |
- | can choose to either get $h$ cents each time the game is played, or to get $t$ cents each time the game is played. Which choice offers a better expected return? | + | |
</box> | </box> | ||
Line 24: | Line 20: | ||
===== Previous Problems and Solutions===== | ===== Previous Problems and Solutions===== | ||
- | * [[pow:Problem4s24|Problem 4]] | + | * [[pow:Problem7s24|Problem 7]] Solved by Sasha Aksenchuk. |
+ | |||
+ | * [[pow:Problem6s24|Problem 6]] Solved by Sasha Aksenchuk. | ||
+ | |||
+ | * [[pow:Problem5s24|Problem 5]] We did not receive any solutions. | ||
+ | |||
+ | * [[pow:Problem4s24|Problem 4]] A solution submitted by Beatrice Antoinette. | ||
* [[pow:Problem3s24|Problem 3]] Solved by Mithun Padinhare Veettil. | * [[pow:Problem3s24|Problem 3]] Solved by Mithun Padinhare Veettil. |