Minimum Totient Quotient

Number Theory Level 4

Let \(\phi(n)\) be the Euler Phi Function. If \(1 \leq n \leq 1000\), what is the smallest integer value of \(n\) that minimizes \(\frac{\phi(n)}{n}\)?

You may choose to read Euler's theorem.

Details and assumptions

Clarification: You are asked to find the value of \(n\), not \( \frac {\phi(n) } {n} \).

\(\phi(1) = 1 \) by definition.


Problem Loading...

Note Loading...

Set Loading...