NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.
All the Perl that's Practical to Extract and Report
several minutes ago. We don't need no stinkin' tactical nukes.
(By the way, do you have change for 10 million people?) --lwall
Stories, comments, journals, and other submissions on use Perl; are Copyright 1998-2006, their respective owners.
The Updated AKS primality test is slow? (Score:1)
http://en.wikipedia.org/wiki/AKS_primality_test [wikipedia.org]
The key significance of AKS is that it was the first published primality-proving algorithm to be simultaneously general, polynomial, deterministic, and unconditional. Previous algorithms have achieved any three of these properties, but not all four.
I haven't seen an implementation (in perl or otherwise), but I thought it put to bed the problem of determining if a number was prime or not. The real problem is factorizing a composite.
Reply to This