Lehmer's GCD algorithm uses the same general principle as the binary algorithm to speed up GCD computations in arbitrary bases.
Algorithme GƏD ən Lehmer amitkalan dǎɣ iyandǎɣ oɣadan atiwazay dǎɣ algorithme nəsin fal atrub ən alɣisab GCD dǎɣ winsanto imahadan.