In this lecture on Euclid's Algorithm, you will learn about number theory and how it is used in public key cryptography. The lesson begins by introducing a puzzle involving two jugs of different sizes, and the different amounts of water that can be obtained by pouring water back and forth between them. The puzzle is connected to the fundamental first result in number theory, greatest common divisors and Euclid's algorithm, and the different values that can be obtained are multiples of the greatest common divisor. The lecture also discusses the connection between these numbers and how to calculate them quickly.
Learn about Euclid's Algorithm and how it is used.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/