
Gambling Suppose a casino offers a gambling game involving a European roulette wheel, which has 37 slots numbered 0 through 36. The gambler's chance of winning depends on the number of chips he has when the wheel is spun. If the number of chips is a multiple of three, he wins one chip if the roulette wheel comes up 1, 2, or 3; otherwise he loses one chip. If the number of chips is not a multiple of 3 he wins one chip if the roulette wheel is any number between 1 and 28, inclusive; otherwise he loses one chip. Source: Math Horizons.
(a) Find the average chance of winning if one assumes that the number of chips the gambler possesses is a multiple of three one-third of the time.
(b) In fact, the number of chips the gambler possesses is not a multiple of three one-third of the time. To see this, let the number of chips the player has be modeled by a Markov chain with states 0, 1, and 2, based on the remainder when the player's chips are divided by three. Find the transition matrix for this Markov chain.
(c) Find the probability of being in state 0, 1, and 2 in the long run.
(d) Based on the long run probabilities from part (c), find the gambler's average chance of winning.

Want to see the full answer?
Check out a sample textbook solution
Chapter 10 Solutions
Finite Mathematics (11th Edition)
- Q4: Discuss the stability critical point of the ODES x + sin(x) = 0 and draw phase portrait.arrow_forwardUsing Karnaugh maps and Gray coding, reduce the following circuit represented as a table and write the final circuit in simplest form (first in terms of number of gates then in terms of fan-in of those gates). HINT: Pay closeattention to both the 1’s and the 0’s of the function.arrow_forwardRecall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)arrow_forward
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal LittellCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL




