Euler would love programming

In number theory, Euler's totient or phi function, \(φ(n)\), is an arithmetic function that counts the totatives of \(n\), that is, the positive integers less than or equal to \(n\) that are relatively prime to \(n\).

What is the minimum value of phi function for \(99<n<111\)?

Note: \(n\) is a natural number.

×

Problem Loading...

Note Loading...

Set Loading...