Hello everybody,
I have written in Delphi a program for finding big prime numbers, like
this
one: 90019999973. The program uses the "Erastothenes sieve".
I want to find all primes in the biggest range possible. (for fun and out
of
curiosity) In ordrd to do it faster, I had an idea to divide the work
between many separate machines. I wrote a program-client-screensaver,
which
connects to my server, requests a range (a "package") to process,
disconnects, find the primes, sends back the results, connets again, asks
for another "package", finds primes, sends back results...and so on, and
so
forth. I have used the indy components.
Now I need volunteers to take part in this funny, private project. The
details and the application are here:
http://www.mikolajherda.com/Primes%20Project%20ENG.html
I invite all people interested.
|
