EntityQ622328· pop 10· linked from 74 articlesbinary GCD algorithmSign in to savealgorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtractionConnectionsdivision algorithmEntitymultiplication algorithmEntitybig O notationEntitylong divisionEntityRichard P. BrentEntityInternational Standard Book NumberEntityQ15777EntityalgorithmEntityMalmöEntityHan dynastyEntitynumber theoryEntitydigital object identifierEntityInternational Standard Serial NumberEntityDonald KnuthEntityBurlingtonEntitygreatest common divisorEntityleast common multipleEntitysieve of EratosthenesEntityEuclidean algorithmEntitybibcodeEntityCategoriesNumber theoretic algorithms