Intermediate
Discrete Mathematics & Math
Q43 / 100
What is Euler's totient function φ(n)?
Correct! Well done.
Incorrect.
The correct answer is B) The count of integers from 1 to n-1 that are coprime to n
B
Correct Answer
The count of integers from 1 to n-1 that are coprime to n
Explanation
φ(n) counts integers ≤ n coprime to n. φ(p)=p-1 for prime p. φ(pq)=(p-1)(q-1) for distinct primes. Used in RSA: d·e ≡ 1 (mod φ(n)).
Progress
43/100