divisibility
divisibility articles on the Math Mental blog, with worked examples solved step by step.
Subscribe via RSS-
LCM and GCD: fast methods (prime factorization, ladder and Euclid)
The GCD is the greatest common divisor and the LCM the least positive common multiple. With prime factorization, the GCD takes the shared primes with the smallest exponent and the LCM takes every prime with the largest exponent. For two numbers, lcm(a, b) · gcd(a, b) = a · b, and the Euclidean algorithm finds the GCD without factoring.
Your first lesson takes five minutes
Create an account, pick where to start and keep your streak from today.