University of Cambridge > Talks.cam > Churchill CompSci Talks > The AKS primality test explained

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

The AKS primality test explained

Download to your calendar using vCal

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

One of the simplest decision problems you can state in number theory is: “is this number prime?”. The first algorithm capable of answering this question efficiently – AKS – was only published in 2002.

I will explain how the algorithm works and prove its correctness. At the end, we will reflect on what general lessons Computer Science students can take away from AKS .

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

CaMedia Online (Zoom meeting). For details, please contact events@slcu.cam.ac.uk Cambridge Assessment Network Seminars

Other talks

title abstract tba Organiser Welcome TBC Cambridge RNA Club - ONLINE Title to be confirmed Title tbc
 

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