Search arXivSearch

arXiv · 2408.06857

On the Lottery Problem: Tracing Stefan Mandel's Combinatorial Condensation

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 in later decades. There is no absolute evidence beyond doubt, but the size of actual covering designs and the associated efforts allow the following hypothesis: Stefan Mandel most likely pioneered in constructing a (15, 6, 5) covering design many years before others published about it, which he applied in the Romanian lottery. Calculations indicate that he took considerable risks that his method might fail, because he limited himself to a subset of 15 numbers out of 49 numbers. The risks explain why he later changed his strategy from combinatorial condensation to buying the pot.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ralph Stömmer. 2025-06-23. On the Lottery Problem: Tracing Stefan Mandel's Combinatorial Condensation. https://arxiv.org/abs/2408.06857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO