BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:The Archimedeans
SUMMARY:Partitions with Modular Forms - Nicky Wong
DTSTART;TZID=Europe/London:20220422T150000
DTEND;TZID=Europe/London:20220422T160000
UID:TALK173063AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/173063
DESCRIPTION:A very old question in combinatorics: for n>1\, wh
at can we say about p(n)\, the number of partition
s of n? In 1919\, Ramanujan proved that p(5n-1) is
always divisible by 5\, part of a collection of r
esults known as Ramanujan's congruences. In this t
alk\, we try to explore (a bit) the realm of modul
ar forms and how these functions allow us to obtai
n unexpected number theoretic and combinatorial re
sults. We will go through the proof sketch of one
of the theorems\, possibly with other unexpected f
ormulae along the way!
LOCATION:Zoom
CONTACT:
END:VEVENT
END:VCALENDAR