Euclidean Algorithm/Examples/34 and 102

Examples of Use of Euclidean Algorithm

The GCD of $34$ and $102$ is found to be:

$\gcd \set {34, 102} = 34$


Proof

\(\ds 102\) \(=\) \(\ds 3 \times 34\)


Thus:

$\gcd \set {34, 102} = 34$

$\blacksquare$


Sources

  • 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): Euclidean algorithm
  • 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Euclidean algorithm
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.