Number Theory

Part (a) — GCD

Find $\gcd(396, 168)$ using Euclid’s algorithm.

Part (b) — Extended Euclidean

Find integers $x$ and $y$ such that $396x + 168y = \gcd(396, 168) = 12$.