Euler would love programming

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

What is the minimum value of phi function for 99<n<11199<n<111?

Note: nn is a natural number.

×

Problem Loading...

Note Loading...

Set Loading...