Fungrim home page

Fungrim entry: 6572c5

gcd ⁣(a,b)=ablcm ⁣(a,b)\gcd\!\left(a, b\right) = \frac{\left|a b\right|}{\operatorname{lcm}\!\left(a, b\right)}
Assumptions:aZandbZanda0andb0a \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, b \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, a \ne 0 \,\mathbin{\operatorname{and}}\, b \ne 0
\gcd\!\left(a, b\right) = \frac{\left|a b\right|}{\operatorname{lcm}\!\left(a, b\right)}

a \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, b \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, a \ne 0 \,\mathbin{\operatorname{and}}\, b \ne 0
Fungrim symbol Notation Short description
GCDgcd ⁣(a,b)\gcd\!\left(a, b\right) Greatest common divisor
Absz\left|z\right| Absolute value
LCMlcm ⁣(a,b)\operatorname{lcm}\!\left(a, b\right) Least common multiple
ZZZ\mathbb{Z} Integers
Source code for this entry:
    Formula(Equal(GCD(a, b), Div(Abs(Mul(a, b)), LCM(a, b)))),
    Variables(a, b),
    Assumptions(And(Element(a, ZZ), Element(b, ZZ), Unequal(a, 0), Unequal(b, 0))))

Topics using this entry

Copyright (C) Fredrik Johansson and contributors. Fungrim is provided under the MIT license. The source code is on GitHub.

2019-10-05 13:11:19.856591 UTC