GCD And LCM Calculator
GCD And LCM: a planned Super Calculator tool. Covers two or more integers. Stub page: the tool, its formula and a worked example are not published yet.
GCD And LCM Calculator is a planned calculator in the mathematics section of Super Calculator, covering algebra and number theory.
What this calculator will compute
Inputs: two or more integers, method (Euclidean, prime factorization and listing).
Outputs: GCD, LCM, Bezout coefficients, prime factorizations and algorithm steps.
Formula, recorded as scope and not yet verified against a primary source: Greatest common divisor by the Euclidean algorithm gcd(a, b) = gcd(b, a mod b). Least common multiple from lcm(a, b) = |ab| / gcd(a, b). Extended Euclidean algorithm additionally returns the Bezout coefficients x and y satisfying ax + by = gcd(a, b).
Status
This page is a stub. The calculator is not built, no figure on this page has been verified against the authority that sets it, and nothing here should be used to make a decision. The page exists so that the site structure is complete and so that articles can link this concept on first mention.
The stub carries noindex, nofollow and is excluded from the sitemap.