: Matemáticas: Euler's totient function

number > number theory > arithmetic function > multiplicative function > Euler's totient function

Euler's totient function

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as ${\\displaystyle \\varphi (n)}$ or ${\\displaystyle \\phi (n)}$ , and may also be called Euler's phi function. In other words, it is the number of integers $k$ in the range $1 \leq k \leq n$ for which the greatest common divisor $gcd(n, k)$ is equal to 1. The integers $k$ of this form are sometimes referred to as totatives of $n$ .
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Euler%27s_totient_function)

http://data.loterre.fr/ark:/67375/PSR-PD794NH6-5

RDF/XML TURTLE JSON-LD Creado 26/7/23, última modificación 18/10/24

Loterre