Applying constraint programming to minimal lottery designs
arXiv:2307.12430
Abstract
We develop and deploy a set of constraints for the purpose of calculating minimal sizes of lottery designs. Specifically, we find the minimum number of tickets of size six which are needed to match at least two balls on any draw of size six, whenever there are at most 70 balls.
21 pages; to appear in Constraints