Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Finding Primes

by jarich (Curate)
on Aug 20, 2003 at 08:29 UTC ( [id://285131]=note: print w/replies, xml ) Need Help??


in reply to Finding Primes

I don't know if you've seen it (it seems to get way more hits than I'd expect it to) but I did a final year project on Prime numbers and their generation (with source code for Pari gp) that you might be interested in.

If I remember correctly I was able to generate probable primes of 200 digits very rapidly with the code I provided. So you should be able to get lots of 400 composite numbers if you want to. You'll have to download Pari gp though, but that shouldn't be too hard. ;)

Have a look over at: http://perltraining.com.au/~jarich/Primes/index.html

I hope that helps.

jarich.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://285131]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (3)
As of 2024-04-25 23:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found