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.
Can anyone give a hint to the next step? I observed that the minimum sum is always 9. So I have to find e such that
1. gcd(e, t) == 1
2. gcd(e-1, p-1) == 2
3. gcd(e-1, q-1) == 2
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 →
Can anyone give a hint to the next step? I observed that the minimum sum is always 9. So I have to find e such that 1. gcd(e, t) == 1 2. gcd(e-1, p-1) == 2 3. gcd(e-1, q-1) == 2