*Update 7 March 2022: This event is now full. If you would like to be added to the waiting list, please email Katherine Wright, Secretary to the аĿª½±Prizes Committee: katherine.wright@lms.ac.uk.*
The 2020 and 2022 Christopher Zeeman Medals will be awarded to Matt Parker and Simon Singh, respectively, at a ceremony on Wednesday 22 March 2023. The ceremony, which will be held at the Royal Society in London, will be followed by a lecture by each of the medal winners.
Registration will start at 6pm and the event proper will start at 6:30pm. The ceremony and lectures will be held in the Lecture Theatre and will be followed by a reception with drinks and bar snacks.
If you would like to attend this event, please email Katherine Wright, Society Business, Research & Communications Officer, at the London Mathematical Society – katherine.wright@lms.ac.uk – by 5pm on Wednesday 15th March. Please give a name for each person attending.
Simon Singh
Title: From Fermat’s Last Theorem to The Simpsons to Tutoring Online
Abstract: Simon Singh will discuss his three decades as a science journalist and a mathematics populariser. This will include a brief dip into each of his books, starting with Fermat’s Last Theorem and ending with The Simpsons and Their Mathematical Secrets. He will also talk about his current efforts to increase the number and diversity of excellent young mathematicians, based on online tutoring and large scale webinars.
Matt Parker
Title: Every Interesting Bit of Maths Ever
Abstract: In this talk Matt will cover all of the interesting bits of maths*. In a seemingly arbitrary (but actually systematic) order Matt will work through every surprising result, beautiful theorem, insightful proof, unexpected application and mesmerising visualisation. Based on the conjecture that mathematicians are not that different to normal people, Matt believes that anything a mathematician finds interesting other people will as well. And that anything in mathematics can be communicated to a wide audience with enough time, effort and a run-up. (*disclaimer: time constraints may require skipping infinitely many examples.)