In this exercise we will use Bayes' Theorem to solve the | StudySoup
Discrete Mathematics and Its Applications | 6th Edition | ISBN: 9780073229720 | Authors: Kenneth Rosen

Table of Contents

A-1
Axioms for the Real Numbers and the Positive Integers

A-2
Exponential and Logarithmic Functions

A-3
Pseudocode

1
The Foundations: Logic and Proofs
1.1
The Foundations: Logic and Proofs
1.2
The Foundations: Logic and Proofs
1.3
The Foundations: Logic and Proofs
1.4
The Foundations: Logic and Proofs
1.5
The Foundations: Logic and Proofs
1.6
The Foundations: Logic and Proofs
1.7
The Foundations: Logic and Proofs

2
Basic Structures: Sets, Functions, Sequences, and Sums
2.1
Basic Structures: Sets, Functions, Sequences, and Sums
2.2
Basic Structures: Sets, Functions, Sequences, and Sums
2.3
Basic Structures: Sets, Functions, Sequences, and Sums
2.4
Basic Structures: Sets, Functions, Sequences, and Sums

3
The Fundamentals: Algorithms, the Integers, and Matrices
3.1
The Fundamentals: Algorithms, the Integers, and Matrices
3.2
The Fundamentals: Algorithms, the Integers, and Matrices
3.3
The Fundamentals: Algorithms, the Integers, and Matrices
3.4
The Fundamentals: Algorithms, the Integers, and Matrices
3.5
The Fundamentals: Algorithms, the Integers, and Matrices
3.6
The Fundamentals: Algorithms, the Integers, and Matrices
3.7
The Fundamentals: Algorithms, the Integers, and Matrices
3.8
The Fundamentals: Algorithms, the Integers, and Matrices

4
Induction and Recursion
4.1
Induction and Recursion
4.2
Induction and Recursion
4.3
Induction and Recursion
4.4
Induction and Recursion
4.5
Induction and Recursion

5
Counting
5.1
Counting
5.2
Counting
5.3
Counting
5.4
Counting
5.5
Counting
5.6
Counting

6
Discrete Probability
6.1
Discrete Probability
6.2
Discrete Probability
6.3
Discrete Probability
6.4
Discrete Probability

7
Advanced Counting Techniques
7.1
Advanced Counting Techniques
7.2
Advanced Counting Techniques
7.3
Advanced Counting Techniques
7.4
Advanced Counting Techniques
7.5
Advanced Counting Techniques
7.6
Advanced Counting Techniques

8
Relations
8.1
Relations
8.2
Relations
8.3
Relations
8.4
Relations
8.5
Relations
8.6
Relations

9
Graphs
9.1
Graphs
9.2
Graphs
9.3
Graphs
9.4
Graphs
9.5
Graphs
9.6
Graphs
9.7
Graphs
9.8
Graphs

10.1
Trees
10.2
Trees
10.3
Trees

11
Boolean Algebra
11.1
Boolean Algebra
11.2
Boolean Algebra
11.3
Boolean Algebra
11.4
Boolean Algebra

12
Modeling Computation
12.1
Modeling Computation
12.2
Modeling Computation
12.3
Modeling Computation
12.4
Modeling Computation
12.5
Modeling Computation

Textbook Solutions for Discrete Mathematics and Its Applications

Chapter 6.3 Problem 6.3.15

Question

In this exercise we will use Bayes' Theorem to solve the Monty Hall puzzle (Example lO in Section 6. 1). Recall that in this puzzle you are asked to select one of three doors to open. There is a large prize behind one of the three doors and the other two doors are losers. After you select a door, Monty Hall opens one of the two doors you did not select that he knows is a losing door, selecting at random if both are losing doors. Monty asks you whether you would like to switch to this door. Suppose that the three doors in the puzzle are labeled 1, 2, and 3. Let W be the random variable whose value is the number of the winning door; assume that p(W = k) = 1/3 for k = 1 , 2, 3. Let M denote the random variable whose value is the number of the door that Monty opens. Suppose you choose door i. a) What is the probability that you will win the prize if the game ends before Monty asks you whether you want to change doors? b) Find p(M = j I W = k) for j = 1 , 2,3 and k = 1 , 2, 3. c) Use Bayes' Theorem to find p(W = j i M = k) where i and j and k are distinct values. d) Explain why the answer to part (c) tells you whether you should chang

Solution

Step 1 of 6)

The first step in solving 6.3 problem number 97 trying to solve the problem we have to refer to the textbook question: In this exercise we will use Bayes' Theorem to solve the Monty Hall puzzle (Example lO in Section 6. 1). Recall that in this puzzle you are asked to select one of three doors to open. There is a large prize behind one of the three doors and the other two doors are losers. After you select a door, Monty Hall opens one of the two doors you did not select that he knows is a losing door, selecting at random if both are losing doors. Monty asks you whether you would like to switch to this door. Suppose that the three doors in the puzzle are labeled 1, 2, and 3. Let W be the random variable whose value is the number of the winning door; assume that p(W = k) = 1/3 for k = 1 , 2, 3. Let M denote the random variable whose value is the number of the door that Monty opens. Suppose you choose door i. a) What is the probability that you will win the prize if the game ends before Monty asks you whether you want to change doors? b) Find p(M = j I W = k) for j = 1 , 2,3 and k = 1 , 2, 3. c) Use Bayes' Theorem to find p(W = j i M = k) where i and j and k are distinct values. d) Explain why the answer to part (c) tells you whether you should chang
From the textbook chapter Discrete Probability you will find a few key concepts needed to solve this.

Step 2 of 7)

Visible to paid subscribers only

Step 3 of 7)

Visible to paid subscribers only

Subscribe to view the
full solution

Title Discrete Mathematics and Its Applications 6 
Author Kenneth Rosen
ISBN 9780073229720

In this exercise we will use Bayes' Theorem to solve the

Chapter 6.3 textbook questions

×

Login

Organize all study tools for free

Or continue with
×

Register

Sign up for access to all content on our site!

Or continue with

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back