ConceptSystems & CS
Euler's totient function
Euler's totient function evaluated at n denotes the number of integers in 1 to n minus 1 that are relatively prime to n.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Nickolai Zeldovich
A function that counts the positive integers up to a given integer n that are relatively prime to n.
Lectures that assume it
2Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Modular arithmetic
- Greatest common divisor
- Integer
- RSA
- Euler's theorem
- Euler's totient function for two primes