Fungrim home page

Fungrim entry: 062423

gcd ⁣(p,q)=1\gcd\!\left(p, q\right) = 1
Assumptions:pPandqPandpqp \in \mathbb{P} \,\mathbin{\operatorname{and}}\, q \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \ne q
\gcd\!\left(p, q\right) = 1

p \in \mathbb{P} \,\mathbin{\operatorname{and}}\, q \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \ne q
Fungrim symbol Notation Short description
GCDgcd ⁣(n,k)\gcd\!\left(n, k\right) Greatest common divisor
PPP\mathbb{P} Prime numbers
Source code for this entry:
    Formula(Equal(GCD(p, q), 1)),
    Variables(p, q),
    Assumptions(And(Element(p, PP), Element(q, PP), Unequal(p, q))))

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