⭐ in reply to Rotationally Prime Numbers Revisited
I was going to suggest, as usual, that you use Math::Pari and the function isprime(), but your clever adjust method skips so many cases that even the brute-force prime checker you have is good enough. Math::Pari only buys you a fraction of a second.
|Replies are listed 'Best First'.|
Re^2: Rotationally Prime Numbers Revisited⭐
by Limbic~Region (Chancellor) on Mar 25, 2005 at 00:30 UTC