Losing Lotto, a mathematical approach
Degree GrantorUniversity of Canterbury
Degree NameBachelor of Science with Honours
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.
SubjectsField of Research::01 - Mathematical Sciences::0102 - Applied Mathematics
- Engineering: Reports