{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

MIT6_042JF10_rec21

# MIT6_042JF10_rec21 - 6.042/18.062J Mathematics for Computer...

This preview shows pages 1–3. Sign up to view the full content.

6.042/18.062J Mathematics for Computer Science December 1, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 21 Problem 1. [ points] Here’s yet another fun 6.042 game! You pick a number between 1 and 6. Then you roll three fair, independent dice. If your number never comes up, then you lose a dollar. If your number comes up once, then you win a dollar. If your number comes up twice, then you win two dollars. If your number comes up three times, you win four dollars! What is your expected payoff? Is playing this game likely to be profitable for you or not?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Recitation 21 Problem 2. [ points] The number of squares that a piece advances in one turn of the game Monopoly is determined as follows: Roll two dice, take the sum of the numbers that come up, and advance that number of squares. If you roll doubles (that is, the same number comes up on both dice), then you roll a second time, take the sum, and advance that number of additional squares.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

MIT6_042JF10_rec21 - 6.042/18.062J Mathematics for Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online