Formula applied
The exact method behind this answer
CalculationTime keeps the method visible so the number can be checked instead of blindly trusted.
For two positive integers a and b, repeatedly replace the larger number by its remainder after division until the remainder is 0; the last non-zero divisor is GCF(a,b). For three numbers, calculate GCF(GCF(a,b),c).- Apply the formulaFor two positive integers a and b, repeatedly replace the larger number by its remainder after division until the remainder is 0; the last non-zero divisor is GCF(a,b). For three numbers, calculate GCF(GCF(a,b),c).12 GCF24, 36 share greatest factor 12 · two-number check: 24 × 36 ÷ LCM = GCF relationship; LCM(24, 36) = 72 · shared factors up to 120: 1, 2, 3, 4, 6, 12