GCD

GCD articles on the Math Mental blog, with worked examples solved step by step.

Subscribe via RSS
  1. LCM and GCD: fast methods, from primes to Euclid

    Find the LCM and GCD by prime factorization, by the ladder method and with the Euclidean algorithm, use lcm · gcd = a · b and solve the classic word problems.

    · 6 min read Read the article