My math class went over the original Monty Hall problem a few days ago, then looked at a related question where the number of doors was increased to five. There was a struggle to figure out what the answer to the problem is, and after coming back to it a few more times we’re still […]

Everybody knows the famous Monty Hall problem; way too much ink has been spilled over it already. Let’s take it as a given and consider the following variant of the problem that I thought up this morning. Suppose Monty has three apples. Two of them have worms in them, and one doesn’t. (For the purposes […]

We’ve all heard of the famous Monty Hall problem. However, what if Monty always picks the leftmost goat (and the player knows this)? Does this change the problem? I don’t think it does because Monty is always picking a goat door anyway. Does that make sense?

Many of us know the Monty Hall Problem But the other day I was asked a variation of this riddle. The answer of the original question is, of course, $ 66\% $ in favor of changing doors, but this is based on the fact that the game show host knows where the prize is. Suppose […]

I just learned about the Monty Hall problem and found it quite amazing. So I thought about extending the problem a bit to understand more about it. In this modification of the Monty Hall Problem, instead of three doors, we have four (or maybe $n$) doors, one with a car and the other three (or […]

Intereting Posts

Question on problem: Equivalence of two metrics $\iff$ same convergent sequences
If $R$ is an infinite ring, then $R$ has either infinitely many zero divisors, or no zero divisors
Exact value of $\sum_{n=1}^\infty \frac{1}{n(n+k)(n+l)}$ for $k \in \Bbb{N}-\{0\}$ and $l \in \Bbb{N}-\{0,k\}$
Let $a,b \in {\mathbb{Z_+}}$ such that $a|b^2, b^3|a^4, a^5|b^6, b^7|a^8 \cdots$, Prove $a=b$
Non-finitely generated, non-projective flat module, over a polynomial ring
Exterior Derivative vs. Covariant Derivative vs. Lie Derivative
Justification of ZFC without using Con(ZFC)?
Integer solutions to nonlinear system of equations $(x+1)^2+y^2 = (x+2)^2+z^2$ and $(x+2)^2+z^2 = (x+3)^2+w^2$
Problem with an algorithm to $3$-colour the edges of cubic graphs
Prove $\exists T\in\mathfrak{L}(V,W)$ s.t. $\text{null}(T)=U$ iff $\text{dim}(U)\geq\text{dim}(V)-\text{dim}(W)$.
Why do we need to learn Set Theory?
Why is it that $\mathscr{F} \ne 2^{\Omega}$?
Is the number of primes congruent to 1 mod 6 equal to the number of primes congruent to 5 mod 6?
Periodic functions and limit at infinity
Limit of 1/x as x approaches infinity