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.
There are only 4 numbers under 5000 whose totient number is a permutation of n. is that right?
If that's true, the brute forcing and the semi prime methods of my code gives same result.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #70: Totient permutation
You are viewing a single comment's thread. Return to all comments →
There are only 4 numbers under 5000 whose totient number is a permutation of n. is that right?
If that's true, the brute forcing and the semi prime methods of my code gives same result.