Select Code to Download

#!perl

...
 2, 3, 5, 7, 11, 13, 17, 19, 
);

# primep($x) returns whether $x is a prime
sub primep_rm {
...
 }
 return 1;
}

# powmod($a, $f, $m) calculates $a**$f % $m,
...
}
my $greatest_prime_squared = $primes[-1]**2;

sub primep_div {
 my $cand = 0 + $_[0];
...
 }
 die "internal error: shouldn't fall through here";
}

}
...


__END__

begin serial tests at p line 125.
begin random tests at p line 129.
...
           s/iter  primep_rm primep_div
primep_rm    3.41         --       -30%
primep_div   2.37        44%         --