We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #69: Totient maximum

# Project Euler #69: Totient maximum

+ 0 comments attention : if p is prime p^k/phi(p^k) = p^(k-1)/phi(p^(k-1))=...= p/p-1;

+ 0 comments I draw a diagram which shows step-by-step solution here

Hope it helps you understand easier

+ 0 comments hint:- if we see here from the description table ,the prime no. has more no. of relative primes. 1 is considered as relative prime for every no. for n/phi(n) should be large ,phi(n) should be small and n should be large. just consider n as product of prime no.and check whether its smaller than the given limit. phi(n)=n*(1-(1/p)), where p is prime.

+ 3 comments I wonder how people would attempt to solve this problem if the ratio itself is required as part of the output.

+ 1 comment what is runtime error

Load more conversations

Sort 11 Discussions, By:

Please Login in order to post a comment