학술논문
On the lotto problem.
Document Type
Journal
Author
Droesbeke, F. AMS Author Profile; Loréa, M. AMS Author Profile
Source
Subject
05 Combinatorics -- 05A Enumerative combinatorics
05A20Combinatorial inequalities
05Combinatorics -- 05C Graph theory
05C65Hypergraphs
05A20
05
05C65
Language
English
Abstract
Authors' introduction and summary: ``The general principle of the lotto problem is as follows. A lotto form contains a sequence of the $n$ first integers. Filling a form consists in choosing $k$ numbers in this sequence. $l$ numbers are chosen (without replacement) by the `national lottery' and a prize is won if at least $t$ of the $l$ numbers belong to the form of $k$ numbers. Evidently a player may fill in as many forms as he wants. The choice of $n$, $k$, $l$ and $t$ is not the same for each country. For example, in Belgium, $n=40$, $k=l=6$, $t=3$. The `lotto problem' asks the following question: `What is the minimal number of lotto forms to be filled in to be sure of obtaining a prize, whatever the drawing?' \par ``The lotto problem generalizes the covering problem and the so-called Turán problem. We present original results concerning lower and upper bounds to the lotto number.''