What is the value of for which Euler's Totient Function is maximum, for
Details and assumptions :-
gives the number of positive integers less than which are coprime to .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It's quite obvious that the answer will be the largest prime number less than 1 0 5 0 0 0 , because every larger number than the prime and ≤ 1 0 5 0 0 0 will have more numbers which aren't coprime.
This is proved using the fact that for primes p i , φ ( p ) = p − 1 and if any number x − p 1 a 1 × p 2 a 2 × . . . p n a n , then φ ( x ) = ∏ ( p i a i − p )
The largest prime number ≤ 1 0 5 0 0 0 is 1 0 4 9 9 9 .