An Introductory Course in Elementary Number Theory

but fundamental concept of a greatest common divisor (gcd) of two integers, and the Euclidean algorithm for finding the gcd of two integers. We end this chap-ter with Lame’s Lemma on an estimate of the number of steps in the Euclidean algorithm needed to …

  Course, Number, Elementary, Introductory, Integre, An introductory course in elementary number, Two integers