Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
goelp14
GitHub Repository: goelp14/easyctf-iv-problems
Path: blob/master/souper_strong_primes/solution.txt
650 views
1
We know that the p and q are strong primes. Looking through wikipedia, you see that twin primes are always strong primes. However, these obviously can be guessed simply by taking the square root of N to obtain the littler prime. From there, the rest is easy.
2
3