Fungrim home page

Fungrim entry: da45c0

gcd⁡ ⁣(Fm,Fn)=Fgcd⁡(m,n)\gcd\!\left(F_{m}, F_{n}\right) = F_{\gcd\left(m, n\right)}
Assumptions:m∈Z and⁡ n∈Zm \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, n \in \mathbb{Z}
TeX:
\gcd\!\left(F_{m}, F_{n}\right) = F_{\gcd\left(m, n\right)}

m \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("da45c0"),
    Formula(Equal(GCD(Fibonacci(m), Fibonacci(n)), Fibonacci(GCD(m, n)))),
    Variables(m, n),
    Assumptions(And(Element(m, 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