Re: Simple primality testing

The following Perl 6 implementation probably isn't the fastest you can find, but it certainly one of the shortest:

sub is_prime (Int $n) {
    $n % all(2 .. sqrt($n)+1);
}
[download]

Comment on Re: Simple primality testing Download Code

Replies are listed 'Best First'.
Re^2: Simple primality testing by ambrus (Abbot) on Nov 22, 2005 at 21:32 UTC
I don't have perl6 handy, but wouldn't that fail for 2? In that case, `sqrt(1) + 1` is greater then 2 so 2 is included in the range.	[reply] [d/l]
Re^3: Simple primality testing by gaal (Parson) on Nov 23, 2005 at 06:13 UTC
You are correct. Nice catch!	[reply]
Re^2: Simple primality testing by gu (Beadle) on Nov 27, 2005 at 22:12 UTC
The `all()` method originally comes from the Quantum::Superpositions module. This one and other primality tests were also discussed in Prime Number Finder. Gu	[reply] [d/l]