MIT6_042JS10_lec39_prob

MIT6_042JS10_lec39_prob - Massachusetts Institute of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Massachusetts Institute of Technology 6.042J/18.062J, Spring ’10 : Mathematics for Computer Science May 12 Prof. Albert R. Meyer revised May 9, 2010, 771 minutes In-Class Problems Week 14, Wed. Problem 1. A gambler is placing $1 bets on the “1st dozen” in roulette. This bet wins when a number from one to twelve comes in, and then the gambler gets his $1 back plus $3 more. Recall that there are 38 numbers on the roulette wheel. The gambler’s initial stake in $ n and his target is $ T . He will keep betting until he runs out of money (“goes broke”) or reachs his target. Let w n be the probability of the gambler winning, that is, reaching target $ T before going broke. (a) Write a linear recurrence for w n ; you need not solve the recurrence. (b) Let e n be the expected number of bets until the game ends. Write a linear recurrence for e n ; you need not solve the recurrence. Problem 2. Consider the following random-walk graph:
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

MIT6_042JS10_lec39_prob - Massachusetts Institute of...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online