Fungrim home page

Fungrim entry: fbe121

lcm ⁣(rs,c)=lcm ⁣(r,c)lcm ⁣(s,c)c\operatorname{lcm}\!\left(r s, c\right) = \frac{\operatorname{lcm}\!\left(r, c\right) \operatorname{lcm}\!\left(s, c\right)}{\left|c\right|}
Assumptions:rZandsZandcZandgcd ⁣(r,s)=1andc0r \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, s \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, c \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, \gcd\!\left(r, s\right) = 1 \,\mathbin{\operatorname{and}}\, c \ne 0
TeX:
\operatorname{lcm}\!\left(r s, c\right) = \frac{\operatorname{lcm}\!\left(r, c\right) \operatorname{lcm}\!\left(s, c\right)}{\left|c\right|}

r \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, s \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, c \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, \gcd\!\left(r, s\right) = 1 \,\mathbin{\operatorname{and}}\, c \ne 0
Definitions:
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 ⁣(n,k)\gcd\!\left(n, k\right) Greatest common divisor
Source code for this entry:
Entry(ID("fbe121"),
    Formula(Equal(LCM(Mul(r, s), c), Div(Mul(LCM(r, c), LCM(s, c)), Abs(c)))),
    Variables(r, s, c),
    Assumptions(And(Element(r, ZZ), Element(s, ZZ), Element(c, ZZ), Equal(GCD(r, s), 1), Unequal(c, 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-06-18 07:49:59.356594 UTC