On the Lottery Problem: Tracing Stefan Mandel's Combinatorial Condensation
Ralph St\"ommer

TL;DR
This paper investigates Stefan Mandel's secret lottery strategy, combinatorial condensation, hypothesizing he pioneered a specific covering design in the 1960s, which contributed to his multiple lottery wins.
Contribution
The work reconstructs and assesses Mandel's combinatorial condensation method, proposing he developed a pioneering covering design before formal theories emerged.
Findings
Mandel likely created a (15, 6, 5) covering design in the 1960s.
He took significant risks by limiting his number subset, risking method failure.
He shifted strategies from combinatorial condensation to buying the pot later.
Abstract
Stefan Mandel is said to have won the lottery 14 times. He never disclosed the recipe he called combinatorial condensation, which enabled him to hit the Romanian lottery jackpot in the early phase of his betting career. Combinatorial condensation is frequently mixed up with another strategy known as buying the pot, which Stefan Mandel was pursuing later on. On occasion, he dropped a few hints on combinatorial condensation. The hints are applied in this work to narrow down and assess his initial recipe. The underlying theory resembles what a weekend mathematician, as he once referred to himself, may have encountered in the 1960s. The cardinality of the (15, 6, 6, 5) and (49, 6, 6, 5) lottery schemes shows that Stefan Mandel probably wasn't aware of lottery designs. First concepts on such topics had been available at that time, but coherent theories on combinatorial designs took off only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematics and Applications · Semantic Web and Ontologies
