ISSN: 2995-5823

Volume 3, Number 1 (2018)

Year Launched: 2016

Journal Menu

■ About The Journal

■ Aims & Scope

■ Editorial Board

■ Article Processing Charge

■ Archive

Previous Issues

■ Volume 10, Number 4 (2025)

■ Volume 10, Number 3 (2025)

■ Volume 10, Number 2 (2025)

■ Volume 10, Number 1 (2025)

■ Volume 9, Number 5 (2024)

■ Volume 9, Number 4 (2024)

■ Volume 9, Number 3 (2024)

■ Volume 9, Number 2 (2024)

■ Volume 9, Number 1 (2024)

■ Volume 8, Number 5 (2023)

■ Volume 8, Number 4 (2023)

■ Volume 8, Number 3 (2023)

■ Volume 8, Number 2 (2023)

■ Volume 8, Number 1 (2023)

■ Volume 7, Number 6 (2022)

■ Volume 7, Number 5 (2022)

■ Volume 7, Number 4 (2022)

■ Volume 7, Number 3 (2022)

■ Volume 7, Number 2 (2022)

■ Volume 7, Number 1 (2022)

■ Volume 6, Number 6 (2021)

■ Volume 6, Number 5 (2021)

■ Volume 6, Number 4 (2021)

■ Volume 6, Number 3 (2021)

■ Volume 6, Number 2 (2021)

■ Volume 6, Number 1 (2021)

■ Volume 5, Number 5 (2020)

■ Volume 5, Number 4 (2020)

■ Volume 5, Number 3 (2020)

■ Volume 5, Number 2 (2020)

■ Volume 5, Number 1 (2020)

■ Volume 4, Number 6 (2019)

■ Volume 4, Number 5 (2019)

■ Volume 4, Number 4 (2019)

■ Volume 4, Number 3 (2019)

■ Volume 4, Number 2 (2019)

■ Volume 4, Number 1 (2019)

■ Volume 3, Number 3 (2018)

■ Volume 3, Number 2 (2018)

■ Volume 3, Number 1 (2018)

■ Volume 2, Number 3 (2017)

■ Volume 2, Number 2 (2017)

■ Volume 2, Number 1 (2017)

■ Volume 1, Number 2 (2016)

■ Volume 1, Number 1 (2016)

Exhaustive Monty Hall Problems and Solutions

Volume 3, Issue 1, February 2018 | PP. 57-66 | PDF (346 K) | Pub. Date: January 14, 2018
DOI: 334 Downloads 14866 Views

Author(s)

Xiwu Han, Queen’s University Belfast

Abstract
This paper at first isolates a group of Monty Hall problems, in which all doors are exhaustively chosen, swapped and revealed one by one, then introduces a new variant of briefer tree diagrams for the conditional probability calculation of three-doors and four-doors, and finally gives the recurrence form for n-doors and its closed generation function. Some resulted defusing advantages and interesting properties have also been discussed.

Keywords
Exhaustive; Monty Hall Problem; Probability Tree Diagram; Recurrence

Cite this paper
Xiwu Han, Exhaustive Monty Hall Problems and Solutions , SCIREA Journal of Mathematics. Volume 3, Issue 1, February 2018 | PP. 57-66.

References

[ 1 ]	Carlton, Matthew (2005). "Pedigrees, Prizes, and Prisoners: The Misuse of Conditional Probability". Journal of Statistics Education [online] 13 (2).
[ 2 ]	Mlodinow, Leonard (2008). The Drunkard's Walk – How Randomness Rules Our Lives, chapter 3 p. 53–56.
[ 3 ]	Selvin, Steve (1975). "A problem in probability (letter to the editor)", American Statistician 29(1): p. 67.
[ 4 ]	vos Savant, Marilyn (1990). "Ask Marilyn" column, Parade Magazine, p. 16.
[ 5 ]	vos Savant, Marilyn (1991). "Ask Marilyn" column, Parade Magazine p. 12.