BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:STANDARD
TZNAME:GMT
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:BST
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:670579cc13ef0
DTSTAMP:20241008T182828Z
DTSTART;TZID=Europe/London:20240328T130000
DTEND;TZID=Europe/London:20240328T140000
TZID:Europe/London
SUMMARY:CIRCA lunchtime seminar
DESCRIPTION:There will be a CIRCA lunchtime seminar on 28th March at 1pm in Theatre D of Maths. David Stewart (University of Manchester) will speak. Title: You need 27 tickets to guarantee a win on the UK National Lottery (Jt with David Cushing) Abstract: The authors came across the problem of finding minimal lottery design numbers j=L(n,k,p,t); that is, a set B_1, ..., B_j subsets of {1,..,n} each of size k, such that for any subset D of {1,..,n} of size p, one finds an intersection Dcap B_i with at least t elements. In the context of a lottery, n represents the. number of balls, k the number of choices of balls on a ticket, p the size of a draw. For the UK national lottery, n=59, k=p=6 and one gets a (rather meagre) prize as long as t is at least 2. Using the constraint solving library in Prolog, we calculated j for k=p=6, t=2 and n all the way up to 70. For example L(59,6,6,2)=27. This is the second paper where we have aimed to show the value of Prolog and constraint programming in pure mathematics. I'll give an overview of constraint programming, logic programming in Prolog, and describe how we used these tools to solve the problem described in the title. https://events.st-andrews.ac.uk/events/circa-lunchtime-seminar-20/
LOCATION:Mathematical Institute, Linton Road, St Andrews, Fife, Scotland, KY16 9SS
URL:https://events.st-andrews.ac.uk/events/circa-lunchtime-seminar-20/
End:VEVENT
End:VCALENDAR