Fungrim home page

Fungrim entry: 07ac4a

gcd⁡ ⁣(a+nb,b)=gcd⁡ ⁣(a,b)\gcd\!\left(a + n b, b\right) = \gcd\!\left(a, b\right)
Assumptions:a∈Z and⁡ b∈Z and⁡ n∈Za \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, b \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, n \in \mathbb{Z}
TeX:
\gcd\!\left(a + n b, b\right) = \gcd\!\left(a, b\right)

a \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, b \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, n \in \mathbb{Z}
Definitions:
Fungrim symbol Notation Short description
GCDgcd⁡ ⁣(n,k)\gcd\!\left(n, k\right) Greatest common divisor
ZZZ\mathbb{Z} Integers
Source code for this entry:
Entry(ID("07ac4a"),
    Formula(Equal(GCD(Add(a, Mul(n, b)), b), GCD(a, b))),
    Variables(a, b, n),
    Assumptions(And(Element(a, ZZ), Element(b, ZZ), Element(n, ZZ))))

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