Losing Lotto, a mathematical approach

Type of content
Publisher's DOI/URI
Thesis discipline
Degree name
Bachelor of Science with Honours
Publisher
University of Canterbury. Mathematics and Statistics
Journal Title
Journal ISSN
Volume Title
Language
Date
2008
Authors
Snook, Michael
Abstract

An (n, k, p, t) lotto design is a set of k sets (called blocks) of an n set such that any p set intersects at least one block in at least t points. We will denote the minimal number of blocks needed to make an (n, k,p, t) lotto design by L(n, k, p, t). This paper lists a few known theorems for upper and lower bounds for lotto designs. We then apply these theorems to the New Zealand lotto system and calculate upper and lower bounds for each of the six divisions of the New Zealand system.

Description
Citation
Keywords
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Field of Research::01 - Mathematical Sciences::0102 - Applied Mathematics
Rights
Copyright Michael Snook