Notifications
Clear all
Topic starter
When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n is called ______.
- A . Mersenne's number
B. Fermat's number
C. Euler's totient
D. Fermat's prime
Suggested Answer: C
Explanation:
Euler's totient
https://en.wikipedia.org/wiki/Euler%27s_totient_function
In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n.
Explanation:
Euler's totient
https://en.wikipedia.org/wiki/Euler%27s_totient_function
In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n.
Posted : 20/11/2022 1:02 pm