# FA18:Lecture 15 GCD algorithm

From CS2800 wiki

We will define Euclid's gcd algorithm to find the greatest common divisor of two numbers. We will also prove Bézout's identity.

- Reading: MCS 9-9.2
- Last semester's notes
- File:Fa18-lec15-board.pdf