Your guides to the weird side of the web explain the Monty Hall problem and the math of probability.

A Markov chain is a sequence of random variables that satisfies P(X t+1 ∣X t ,X t−1 ,…,X 1 )=P(X t+1 ∣X t ). Simply put, it is a sequence in which X t+1 depends only on X t and appears before X t−1 ...

Your guides to the weird side of the web explain Markov chains and the math of probability.

The World Science Festival's panel on Probability and Risk started out in an unusual manner: MIT's Josh Tennenbaum strode onto a stage and flipped a coin five times, claiming he was psychically ...