Related papers: Conway's napkin problem
In this paper we study a variant of the Malicious Ma\^{i}tre d' problem. This problem, attributed to computer scientist Rob Pike in Peter Winkler's book "Mathematical Puzzles: A Connoisseur's Collection", involves seating diners around a…
The problem of the malicious ma\^{i}tre d' is introduced and solved by Peter Winkler in his book Mathematical Puzzles: A Connoisseur's Collection [1]. This problem is about a ma\^{i}tre d' seating diners around a table, trying to maximize…
In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a…
We give a solution of the following combinatorial problem: "Let one from $n$ married couples in the m\'enage problem (see Problem 1) be a couple of a known mathematician $M$ and his wife. After the ladies are seated at every other chair,…
The reader is reminded of several puzzles involving randomness. These may be ill-posed, and if well-posed there is sometimes a solution that uses probabilistic intuition in a special way. Various examples are presented including the well…
In this paper we study the Three Hat Problem which appeared in Puzzle Corner of the Technology Review magazine. This puzzle gives a scenario in which three players wearing hats are sitting together and each hat can be seen by everyone…
I present and discuss a puzzle about wizards invented by John H. Conway.
$n$ people are seated randomly at a rectangular table with $\lfloor n/2\rfloor$ and $\lceil n/2\rceil$ seats along the two opposite sides for two dinners. What's the probability that neighbors at the first dinner are no more neighbors at…
The probleme des menages (married couples problem) introduced by E.Lucas in 1891 is a classical problem that asks the number of ways to arrange n married couples around a circular table, so that husbands and wives are in alternate places…
In the classical secretary problem, $n$ ranked items arrive one by one, and each item's rank relative to its predecessors is noted. The observer must select or reject each item as it arrives, with the object of selecting the item of highest…
The article attempts to demonstrate the rich history of one truly remarkable problem situated at the confluence of probability theory and theory of numbers - finding the probability of co-primality of two randomly selected natural numbers.…
Fix two words over the binary alphabet $\{0,1\}$, and generate iid Bernoulli$(p)$ bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was popularized by Conway, who found (in unpublished work) a…
We give a proof of Willcocks's Conjecture, stating that if $p - q$ and $p + q$ are relatively prime, then there exists a Hamiltonian tour of a $(p, q)$-leaper on a square chessboard of side $2(p + q)$. The conjecture was formulated by T. H.…
The prediction of the final state probabilities of a general cuboid randomly thrown onto a surface is a problem that naturally arises in the minds of men and women familiar with regular cubic dice and the basic concepts of probability.…
A king invites n couples to sit around a round table with 2n+1 seats. For each couple, the king decides a prescribed distance d between 1 and n which the two spouses have to be seated from each other (distance d means that they are…
An ordered triple $(s,p,n)$ is called admissible if there exist two different multisets $X=\{x_1,x_2,\dotsc,x_n\}$ and $Y=\{y_1,y_2,\dotsc,y_n\}$ such that $X$ and $Y$ share the same sum $s$, the same product $p$, and the same size $n$. We…
Morley's Theorem about angle trisectors can be viewed as the statement that a certain diagram `exists', meaning that triangles of prescribed shapes meet in a prescribed pattern. This diagram is the case n=3 of a class of diagrams we call…
Penney's game is a two player zero-sum game in which each player chooses a three-flip pattern of heads and tails and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose…
A detailed study is made of the number of occupied seats in an unfriendly seating scheme with two rows of seats. An unusual identity is derived for the probability generating function, which is itself an asymptotic expansion. The identity…
In 1693, Isaac Newton answered a query from Samuel Pepys about a problem involving dice. Newton's analysis is discussed and attention is drawn to an error he made.