For integers a, b, there exist integers x, y such that gcd(a,b) = ax + by. The Extended Euclidean Algorithm finds such x, y.. The key formula is gcd(a,b) = ax + by. This concept is typically introduced in College. Understanding this concept builds a strong foundation for more advanced mathematics.