KnowraBézout's identityLinked fromLinked fromThe 10 pages that link to Bézout's identity, each with the reason it gives.All 10Related 10DivisibilityRelated: It connects common divisors to integer combinations and proves key divisibility claims.Number theoryRelated: It links the Euclidean algorithm to solvability of linear Diophantine equations.Greatest common divisorRelated: It characterizes the divisor through combinations, not just divisibility.Euclidean algorithmRelated: Reversing the remainder equations expresses the final gcd as a combination of the inputs.Chinese remainder theoremRelated: Its coefficients construct inverses used to combine congruences.Fermat's little theoremRelated: When p does not divide a, this identity guarantees an inverse for a modulo p.Congruence (number theory)Related: It constructs modular inverses when the relevant integers are coprime.Coprime integersRelated: A pair is coprime exactly when some integer combination equals 1.Euclid's lemmaRelated: A Bézout combination proves the prime must divide the other factor.Extended Euclidean algorithmRelated: The algorithm constructs the coefficients whose existence this identity guarantees.