Fungrim home page

Fungrim entry: b9c36d

φ ⁣(k=1mpkek)=k=1mφ ⁣(pkek)\varphi\!\left(\prod_{k=1}^{m} {p_{k}}^{{e}_{k}}\right) = \prod_{k=1}^{m} \varphi\!\left({p_{k}}^{{e}_{k}}\right)
Assumptions:ekZ0andmZ0{e}_{k} \in \mathbb{Z}_{\ge 0} \,\mathbin{\operatorname{and}}\, m \in \mathbb{Z}_{\ge 0}
\varphi\!\left(\prod_{k=1}^{m} {p_{k}}^{{e}_{k}}\right) = \prod_{k=1}^{m} \varphi\!\left({p_{k}}^{{e}_{k}}\right)

{e}_{k} \in \mathbb{Z}_{\ge 0} \,\mathbin{\operatorname{and}}\, m \in \mathbb{Z}_{\ge 0}
Fungrim symbol Notation Short description
Totientφ ⁣(n)\varphi\!\left(n\right) Euler totient function
Productnf ⁣(n)\prod_{n} f\!\left(n\right) Product
Powab{a}^{b} Power
PrimeNumberpnp_{n} nth prime number
ZZGreaterEqualZn\mathbb{Z}_{\ge n} Integers greater than or equal to n
Source code for this entry:
    Formula(Equal(Totient(Product(Pow(PrimeNumber(k), Subscript(e, k)), Tuple(k, 1, m))), Product(Totient(Pow(PrimeNumber(k), Subscript(e, k))), Tuple(k, 1, m)))),
    Variables(e, m),
    Assumptions(And(Element(Subscript(e, k), ZZGreaterEqual(0)), Element(m, 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.

2019-08-17 11:32:46.829430 UTC