• Publications
  • Influence
Lehmer's GCD algorithm
In this thesis we briefly look at the rules related to the greatest common divisor and the lowest common multiple of two integers and we describe the Euclidean algorithm. We study connections between