| Abstract: | ![]()
A Lotto Systems bet allows the player to nominate n numbers from which (s)he believes the winning six numbers will be drawn, and to bet on all combinations of six of these n numbers. Assume that the winning six numbers come from the nominated n. How many combinations must be entered to guarantee that one combination will include at least five of the winning six numbers? The problem is generalized in this paper, and the method of simulated annealing is used to find solutions for various situations. The case where two supplementary numbers are drawn after the initial six winning numbers is also considered. |
