Euler's totient function
Builds on Coprime integers
Definition
Let be a positive integer. Euler's totient function is the number of integers with such that and are coprime.
Remarks
For example, , and . The integers coprime to in are . The number is the number of elements of a reduced residue system modulo . If with distinct primes , then . The Lean library Mathlib sets .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Greatest common divisor definition
- Coprime integers definition
- Euler's totient function definition
Where this leads
17 pages build on this one.
- Diffie–Hellman key exchange
- Existence of primitive roots modulo a prime
- Number of invertible residues modulo n
- Discrete logarithm
- Sum of the totient over the divisors
- Totient of a prime power
- Primitive root theorem
- Multiplicativity of the totient function
- RSA cryptosystem
- Totient of a prime
- Primitive root modulo n
- Multiplicative order
- Euler's theorem
- The order modulo p divides p − 1
- Lambert series
- Primitive polynomial over a finite field
- Integer factorization
Further reading
About this page
| Tag | 0VV04M41AN |
|---|---|
| URI | m2://0VV04M41AN |
| Aliases | euler-phi-function, totient-function, phi-function |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11A25 |
| Defines | Euler's totient function |
| Uses | Coprime integers |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.