in reply to Prime Numbers
One of the fastest ways would be to use a math library like PARI. It uses very good primality tests internally. I don't have it installed right now, but you should be able to use:
Even if you are looking for the practice of implementing a nice primality test by hand, pari would be a good tool, as it supports all sorts of abstract algebra things (including fast modular arithmetic). If you want to do even that by hand, the above FAQ lists several primality test algorithms that you can use as starting points.use Math::Pari 'isprime'; my $num = shift || '12345678901'; print isprime($num) ? "$num is prime!\n" : "$num is composite!\n";
blokhead
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Prime Numbers
by KurtSchwind (Chaplain) on Dec 10, 2007 at 01:34 UTC | |
by syphilis (Archbishop) on Dec 10, 2007 at 05:10 UTC | |
by KurtSchwind (Chaplain) on Dec 10, 2007 at 16:41 UTC | |
by CountZero (Bishop) on Dec 10, 2007 at 22:22 UTC | |
by KurtSchwind (Chaplain) on Dec 11, 2007 at 00:24 UTC | |
by syphilis (Archbishop) on Dec 11, 2007 at 01:43 UTC |
In Section
Seekers of Perl Wisdom