Sign inSign in
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.
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Nickolai Zeldovich

    MIT · Undergraduate

    A function that counts the positive integers up to a given integer n that are relatively prime to n.
    • 9:25Side-Channel Attacks

Lectures that assume it

2

Connections

13

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.