3: Proof Techniques
( \newcommand{\kernel}{\mathrm{null}\,}\)
- 3.5: The Euclidean Algorithm
- One of the most important concepts in elementary number theory is that of the greatest common divisor of two integers. Let a and b be integers, not both 0. A common divisor of a and b is any nonzero integer that divides both a and b . The largest natural number that divides both a and b is called the greatest common divisor of a and b .