Hello Monks, I am looking at making a faster, more logical prime number generator than simply brite forcing all available numbers. I am looking into a Miller-Rabin primality test, but I don't know how to do modular exponentiation in perl.
Another idea I had was to use the fact that n is prime if (n-1)!+1 is divisable by n. This worked, but the facotorialization created numbers too large for my computer to handle after n=23. If you are interested in this approach, this is the code i used:
print "Number to test: ";
$prime=<>;
$t=($prime-1);
sub fac {
my ($n) = @_;
if ($n < 2) {
return $n;
}
else {
return $n *fac($n-1);
}
}
$r = ((fac($t))+1);
if ($r % $prime) {
print "not prime\n";
} else {
print "prime\n";
}
Any help in making a faster, more logical prime number generator than brute-forcing the whole thing would be appreciated. Thanks for the help, monks.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.