Fungrim home page

Fungrim entry: 250a45

lcm ⁣(r,s)=rs\operatorname{lcm}\!\left(r, s\right) = \left|r s\right|
Assumptions:rZ  and  sZ  and  gcd ⁣(r,s)=1r \in \mathbb{Z} \;\mathbin{\operatorname{and}}\; s \in \mathbb{Z} \;\mathbin{\operatorname{and}}\; \gcd\!\left(r, s\right) = 1
\operatorname{lcm}\!\left(r, s\right) = \left|r s\right|

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

Topics using this entry

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

2021-03-15 19:12:00.328586 UTC