A summary is given of how to purchase a minimum number of lottery tickets in order to be sure of matching at least \(t\) of the numbers in the lottery. A lottery scheme is a collection of lottery tickets that ensure this happens. The question then is to determine the minimal number of tickets needed for a lottery scheme. Lower bound estimates are given for this number based on Turán designs and \(t\)-\((n,k,1)\) coverings. Furthermore, examples are given which give an upper bound for some cases.
For the entire collection see [Zbl 0836.00010].