Emirp primE2 Problem 157 question
Back to Problem Solutions forum
I just wonder how far can be a solution offset from the starting value? On one sample I have waited for 2 hours, my program calculated up to offset 1.44 billion from initial value, and solution was not found.
Should I switch to heavy approach kind of CUDA or just I have to have a patience and wait a little more?
Well, CUDA brute force approach didn't helped me, only more attentiveness did :) .
I'm having the same problem and I'm using an implementation of Miller-Rabin primality algorithm. In the test set for the problem solution some are found 1-2 seconds and some I have let run for multiple hours and no solution. I'm wondering if the algorighm sometimes just misses one of the prime or emirp? Any advice?
Are you incrementing the starting value, checking for primality, and looping over that? If yes, I'd suggest the problem requires (broadly speaking) two insights, not one.