Metraipolis › archive › dc_49863640e477
Euler's totient function — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Euler%27s_totient_function
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T16:15:18.322Z
- SHA-256 of the archived text
5253e9772832cf53dd60b3150a123a45d474a92200d16f080363a619c98db085- Stable URL of this page
https://metraipolis.com/documento/dc_49863640e477
How to cite
Euler's totient function — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Euler%27s_totient_function (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_49863640e477 (Metraipolis archive dc_49863640e477, sha256 5253e9772832cf53dd60b3150a123a45d474a92200d16f080363a619c98db085)
BibTeX
@misc{dc49863640e477,
title = {Euler's totient function — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Euler%27s_totient_function},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_49863640e477; sha256 5253e9772832cf53dd60b3150a123a45d474a92200d16f080363a619c98db085},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Euler%27s_totient_function. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In number theory, Euler's totient function counts the positive integers up to a given integer n {\displaystyle n} that are relatively prime to n {\displaystyle n} . It is written using the Greek letter phi as φ ( n ) {\displaystyle \varphi (n)} or ϕ ( n ) {\displaystyle \phi (n)} , and may also be called Euler's phi function. In other words, it is the number of integers k {\displaystyle k} in the range 1 ≤ k ≤ n {\displaystyle 1\leq k\leq n} for which the greatest common divisor gcd ( n , k ) {\displaystyle \gcd(n,k)} is equal to 1. The integers k {\displaystyle k} of this form are sometimes referred to as totatives of n {\displaystyle n} . For example, the totatives of n = 9 {\displaystyle n=9} are the six numbers 1, 2, 4, 5, 7 and 8. They are all relatively prime to 9, but the other three numbers in this range, 3, 6, and 9 are not, since gcd ( 9 , 3 ) = gcd ( 9 , 6 ) = 3 {\displaystyle \gcd(9,3)=\gcd(9,6)=3} and gcd ( 9 , 9 ) = 9 {\displaystyle \gcd(9,9)=9} . Therefore, φ ( 9 ) = 6 {\displaystyle \varphi (9)=6} . As another example, φ ( 1 ) = 1 {\displaystyle \varphi (1)=1} since for n = 1 {\displaystyle n=1} the only integer in the range from 1 to n {\displaystyle n} is 1 itself, and gcd ( 1 , 1 ) = 1 {\displaystyle \gcd(1,1)=1} . Euler's totient function is a multiplicative function, meaning that if two numbers m {\displaystyle m} and n {\displaystyle n} are relatively prime, then φ ( m n ) = φ ( m ) φ ( n ) {\displaystyle \varphi (mn)=\varphi (m)\varphi (n)} . This function gives the order of the multiplicative group of integers modulo n (the group of units of the ring Z / n Z {\displaystyle \mathbb {Z} /n\mathbb {Z} } ). It is also used for defining the RSA encryption system.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Euler's totient function» — https://en.wikipedia.org/wiki/Euler%27s_totient_function
Wikidata Q190026 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q190026
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Euler%27s_totient_function?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1380350952, consultata il 2026-10-15T15:43:31.317Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1ed5bfb57b61801a184030cb36432e9b60ee358c71512fa45983e880295683b7