Bézout's Identity: Integers and Polynomials over a Field
Why the gcd of two integers is an integer linear combination, with a least-positive-combination proof and the field-only polynomial analogue.
Category
Number Theory
2 articles.
2022-04-12
The Euclidean Algorithm: Computing a Greatest Common Divisor
A proof and worked trace of the Euclidean algorithm, including its nonnegative-input C++ implementation and logarithmic step count.