How to Find One Poisoned Bottle with the Fewest Mice
A binary-encoding solution to a one-round identification puzzle.
A binary-encoding solution to a one-round identification puzzle.
A short graph-theoretic proof using the pigeonhole principle.
A simple agreement rule on Yes and No forms the cyclic group of order two.
A counting argument reveals the minimum storage required for categorical vectors and images.