Revision #160 → #1276 · back to history
addedGreatest common divisor (informal)1b72e2791bb7
addedgcd(8, 12) = 4196d611fc000
addedGCD of integers a and bb24a3d416916
addedGCD when one argument is zero3a7cad41ffaa
addedConvention gcd(0, 0) = 04a8c81bc424b
addedCommon divisors are divisors of the GCD0578c50329cb
addedGCD of 54 and 242389e3f05679
addedCoprime numbers95fcbb765bcc
addedGeometric view of gcd(24, 60)c81ddf857279
addedReducing fractions with the GCD0a1813e49c68
addedLCM from GCD relationb1c1092ce21e
addedGCD via prime factorizations9f9f2bef0684
addedEuclid's subtraction principle88a9b07b30aa
addedEuclidean algorithm with remainder875b54811f0f
addedBinary GCD algorithm09d746935b43
addedBinary GCD computational complexityf0c872c56c10
addedLehmer's GCD algorithm5d06110efa82
addedGCD via LCM59ec42b54ad2
addedGCD via Thomae's functiond011213ca08c
addedSlavin's formula for odd a6b03492601b8
addedSchramm's entire-function formula3c31e79621cf
addedEuclidean GCD complexity O(n^2)623ed5a38c48
addedFast-multiplication GCD complexity4f3b91894311
addedGCD solvable in quasilinear time1d80e9680e5d
addedChor–Goldreich parallel algorithm2c5894c6af96
addedgcd(a, a) = acc091b634981
addedCommon divisor divides the GCD86a98318d8e9
addedBézout's identityf8f424fe5933
addedgcd(a, 0) = |a|4d70b7e33628
addedEuclid's lemma consequenceb6fdbeb4a0dd
addedGCD scaling by m2d6099ee8fb6
addedGCD invariance under translatione3f2ac7d5cb6
addedGCD of quotients by common divisor2389d9cea742
addedQuotients by GCD are coprimec753470f23e7
addedGCD is commutative5d9442225c02
addedGCD is associativee46f188ec923
addedGCD is multiplicative89c5d7e22277
addedGCD–LCM product relationd9050a27d2c6
addedGCD–LCM distributivity9f8be728d322
addedGCD from prime factorizations7d3677bd92f7
addedNaturals form a distributive lattice57234a0bca34
addedGCD as lattice points on a segment190fb5f033c4
addedGCD of n^a − 1 and n^b − 1db75cbe9b3d1
addedIdentity with Euler's totient5987801b7b4e
addedPillai's GCD summatory functionff191f7d07fa
addedNymann's coprimality probabilityed8a784df654
addedProbability GCD equals d497128d6a810
addedExpected GCD undefined for k = 2c0dc5b8496fb
addedExpected GCD well-defined for k ≥ 36a8477613283
addedGCD in a commutative ring2459b21b1491
addedCommon divisor in a ring1e525f4f01db
addedGreatest common divisor in a ringddc108c0e607
addedGCDs are associate in integral domains4be2c2b0cacf
addedGCD existence not assuredc99e4cfe496f
addedGCD exists in UFD / GCD domain31beadee6b46
addedGCD via Euclidean algorithm in Euclidean domains1fd1bcc306ac
addedIntegral domain with no GCD31da8764f803
addedGCD as principal ideal generator in a PID406909461b51