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.
This can be solved via evalutaing arithemtic sums using inclusion/exclusion principle. We have to handle special case where there are no odd prime factors in phi. The most challenging part is derive conditions for candidates e and properly evaluate sums using inclusion/exlcusion principle.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #182: RSA encryption
You are viewing a single comment's thread. Return to all comments →
This can be solved via evalutaing arithemtic sums using inclusion/exclusion principle. We have to handle special case where there are no odd prime factors in phi. The most challenging part is derive conditions for candidates e and properly evaluate sums using inclusion/exlcusion principle.