University of Cambridge > Talks.cam > The Archimedeans > Partitions with Modular Forms

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Partitions with Modular Forms

Download to your calendar using vCal

If you have a question about this talk, please contact .

A very old question in combinatorics: for n>1, what can we say about p(n), the number of partitions of n? In 1919, Ramanujan proved that p(5n-1) is always divisible by 5, part of a collection of results known as Ramanujan’s congruences. In this talk, we try to explore (a bit) the realm of modular forms and how these functions allow us to obtain unexpected number theoretic and combinatorial results. We will go through the proof sketch of one of the theorems, possibly with other unexpected formulae along the way!

This talk is part of the The Archimedeans series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Pippard Lecture Theater (**Note non-standard location**) Hybrid: JDB Teaching Room, Engineering Department or Zoom: https://eng-cam.zoom.us/j/89099723911?pwd=581793 Kapitza Building Seminar Room (16), Cavendish Laboratory, Department of Physics

Other talks

Alicia Anderson discussing some exciting news about HARPS3 Tea and Coffee Break Title TBC Title TBC Online Causal Inference Seminar Security Cooperation within Government and between Governments
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity