KnowraGreatest common divisorLinked fromLinked fromThe 38 pages that link to Greatest common divisor, each with the reason it gives.All 38Broader topic 4Related 30Narrower topic 3Compared with 1Euclidean algorithmNarrower topic: The algorithm’s invariant is that every pair has the same greatest common divisor.Bézout's identityNarrower topic: It is the specific integer represented by the linear combination.Extended Euclidean algorithmNarrower topic: This is the quantity the extended algorithm computes alongside its coefficients.