Ubehage's Prime Number Finder
It is quite simple:
When you start the process, it will begin from 1 and count up towards infinity, and find any prime number on the way.
This process can be stopped at any time, or it will stop when the application can't count any higher :)
After the process has ended, you will have the option of saving the result; all the prime numbers; to a text-file.
Or you can start all over again :)
This program requires .NET 3.5
|
|
|
||||||||
|
||||||||
|
