Tricky Totient
Find the total number of positive integers such that .
Details and assumptions
The Euler's totient function is the number of integers from to that are coprime to
The answer is 2.
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.
1 solution
For every 10 natural numbers we have a minimum of 2 prime numbers .. So if the minimum number of prime numbers exceed the number co primes expected then we dont need to check those numbers.. The limit comes down to 30.. now n^2 + 1 >=6n .. implies n>=6 ; By inspection we get 2 possible answers 6 and 8...