Fungrim home page

Fungrim entry: 36fe36

(xy(modφ(n)))    (axay(modn))\left(x \equiv y \pmod {\varphi(n)}\right) \implies \left({a}^{x} \equiv {a}^{y} \pmod {n}\right)
Assumptions:aZandnZ1andgcd ⁣(a,n)=1andxZ0andyZ0a \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, n \in \mathbb{Z}_{\ge 1} \,\mathbin{\operatorname{and}}\, \gcd\!\left(a, n\right) = 1 \,\mathbin{\operatorname{and}}\, x \in \mathbb{Z}_{\ge 0} \,\mathbin{\operatorname{and}}\, y \in \mathbb{Z}_{\ge 0}
\left(x \equiv y \pmod {\varphi(n)}\right) \implies \left({a}^{x} \equiv {a}^{y} \pmod {n}\right)

a \in \mathbb{Z} \,\mathbin{\operatorname{and}}\, n \in \mathbb{Z}_{\ge 1} \,\mathbin{\operatorname{and}}\, \gcd\!\left(a, n\right) = 1 \,\mathbin{\operatorname{and}}\, x \in \mathbb{Z}_{\ge 0} \,\mathbin{\operatorname{and}}\, y \in \mathbb{Z}_{\ge 0}
Fungrim symbol Notation Short description
Totientφ(n)\varphi(n) Euler totient function
Powab{a}^{b} Power
ZZZ\mathbb{Z} Integers
ZZGreaterEqualZn\mathbb{Z}_{\ge n} Integers greater than or equal to n
GCDgcd ⁣(a,b)\gcd\!\left(a, b\right) Greatest common divisor
Source code for this entry:
    Formula(Implies(CongruentMod(x, y, Totient(n)), CongruentMod(Pow(a, x), Pow(a, y), n))),
    Variables(a, x, y, n),
    Assumptions(And(Element(a, ZZ), Element(n, ZZGreaterEqual(1)), Equal(GCD(a, n), 1), Element(x, ZZGreaterEqual(0)), Element(y, ZZGreaterEqual(0)))))

Topics using this entry

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

2020-01-31 18:09:28.494564 UTC