*There is no way of predicting what the next prime number is, given any other number. If there was, then current cryptography methods wouldn't work. All prime number generators are, for the most part, variations on brute force. The method you're looking at is probably as good as any.*
Huh?!? You're joking, aren't you? The same fact that you say *"all prime number generators are, for the most part, variations on brute force"* is in contradiction with the claim that *"there is no way of predicting what the next prime number is, given any other number"*.
More precisely if I have *any* `isprime()` sub, e.g.
`sub isprime {
my $n=shift;
return undef if abs $n == 1;
return isprime -$n if $n<0;
return 0 if $n == 0;
$n%$_ or return 0 for (2..sqrt $n);
1;
}
`
(I'm not posting a better one for others already have, and even better ones are available elsewhere.)
or the witty
`sub isprime {
(1 x shift) !~ /^1?$|^(11+?)\1+$/;
}
`
(this is Abigail's - who else?)
then a sub like this:
`sub nearest_prime {
my $n=my $m=shift;
return $n if isprime $n;
while (1) {
return $n if isprime ++$n;
return $m if isprime --$m;
}
}
`
would answer the OP's question.
**Important:** not only primality testing algorithms *do* exist, but *fast ones* exist too. What *in some sense* there is "no way" to do is to *factorize* a composite number which is a different problem. But really even for the latter problem there are perfectly deterministic algorithms. "Only" it is *believed* to be *computationally "hard"* (in a mathematically precise sense), whereas the former is not. It is on this last *conjecture* (not proved yet!) that many cryptography methods rely.
Since the OP did not specify the size of a problem, but gave an example with small numbers, an effective answer in terms of some efficient sieving algorithm *can* be given. |
Comment onRe: a close prime number