Lec 5 | MIT 6.042J Mathematics for Computer Science, Fall 2010
211,344 views
About this video
Intermediate · Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-coursesTeaches modular arithmetic, Fermat's little theorem and RSA public-key encryption. Tom Leighton and Marten van Dijk's 6.042J is the standard MIT course on discrete maths for computer scientists; topics follow the OCW syllabus because the upload titles carry only lecture numbers.
MIT 6.042J, lecture 5: Modular arithmetic, Fermat's little theorem and RSA public-key encryption.
Video by MIT OpenCourseWare, played through YouTube's embedded player.
Part of MIT 6.042J Mathematics for Computer Science, Fall 2010