Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “为什么质数 p 满足 φ(p) = p − 1?”

1 keyword matches

Understanding your question. You can explore the search results below now.

Meet the concept

↗

Euler's totient function φ(n)\varphi(n) is defined as the number of integers from 1 to nn that are coprime to nn. Two integers are coprime if their greatest common divisor is 1.

Conditions: nn is a positive integer.; The counting range is from 1 to nn inclusive.; Coprimality is determined by the greatest common divisor being 1.