Quote:
Originally Posted by myself
There is a smarter way to get those "k"'s without a prime: break a loop if a PrP (or prime) is found; Check they are prime afterwards; List those "k"s that do not have a prime.
|
With a little searching on PrimeForm's messages, as far as I can tell, the PFGW loop Gary gives is "breaking". I apologize for the confusion.