Abstract
AbstractWe 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.
Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. Bate, J. A., & van Rees, G. H. J. (1998). Lotto designs. Vol. 28. Papers in honour of Anne Penfold Street (pp. 15–39).
2. Colbourn, C. J. & Dinitz, J. H. (Eds.) Handbook of combinatorial designs. Second. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. xxii+984. isbn: 978-1-58488-506-1; 1-58488-506-8.
3. Carlsson, M., & Mildner, P. (2012). SICStus Prolog-the first 25 years. Theory and Practice of Logic Programming, 12(1–2), 35–66. issn: 1471-0684. https://doi.org/10.1017/S1471068411000482
4. Carlsson, M., Ottosson, G., & Carlson, B. (1997). An open-ended finite domain constraint solver. English. Vol. 1292. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 191–206).
5. Cushing, D., Stagg, G. W., & Stewart, D. I. (2023). A Prolog assisted search for new simple Lie algebras. Math. Comp., to appear. arXiv:2207.01094. https://arxiv.org/pdf/2207.01094.pdf