Watch, Follow, &
Connect with Us

For forums, blogs and more please visit our
Developer Tools Community.

ID: 20825, Fastest prime number search

by zhang li Email: Anonymous

Fastest prime number find formula.
Download Details
FTP  download also available 0 bytes
CDN Login Required to Download. (You will be redirected to the login page if you click on the Download Link)
To download this, you must have registered:
A free membership

For C++Builder, Version 2.0  to 2.0 4 downloads
Copyright: Open Source or other

Size: 0 bytes
Updated on Tue, 21 Oct 2003 17:59:09 GMT
Originally uploaded on Tue, 21 Oct 2003 17:42:22 GMT

Prime number have some formula.

set a number [p], if [p] cannot divide by 2, any number between (p/2) to [p] also cannot be divide with [p]. next if [p] cannot divide by 3, any number between (p/3) to (p/2) also connot be divide with [p]. final, (max-divisor * max-divisor) <= prime. this is first formula.

prime number table use to find prime, if a number [p] cannot divide by 2, any (2*n) also cannot be divide. also on (3*n), (5*n). the remain try number is prime only. this is second formula.

The C++ source are miss.

Have fun in programming.

my mailbox:

   Latest Comments  View All Add New

Move mouse over comment to see the full text

Could not retrieve comments. Please try again later.

Server Response from: ETNACDC04