Finite fields and modular arithmetic: algebras, identities and inverses, GCD, LCM and Euclid's algorithm
Seminar, guided reading and a short written task: describe the key principles of modular arithmetic and finite fields.
Admitted students ask questions on this week’s page in the student portal: an AI assistant trained on the course answers first, and during the course’s timetabled classes Connect to your tutor brings your tutor into the chat, who may start a call if needed.
Open this week in the portal