Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

RE: redmist's Diabolical Scheme for Prime Domination

by larsen (Parson)
on Aug 02, 2000 at 20:26 UTC ( [id://25766]=note: print w/replies, xml ) Need Help??


in reply to redmist's Diabolical Scheme for Prime Domination

If you're interested in prime numbers, you should consider implementing a probabilistic primality test.
What does it mean? If a number fails this test, it is not a prime. If the number passes, it may be a prime.

Instead of providing a bunch of information, I suggest starting from this page, describing Rabin-Miller test.

I also invite you to visit my links page: it may be useful (well, someone said me it was :))

Larsen
  • Comment on RE: redmist's Diabolical Scheme for Prime Domination

Replies are listed 'Best First'.
Re: RE: redmist's Diabolical Scheme for Prime Domination
by Adam (Vicar) on May 23, 2001 at 00:58 UTC
    For an implementation of the Rabin-Miller test, see this node

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (2)
As of 2024-04-16 16:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found