What is this?
PrimeIdentified is a light-weight script used to find a lot of prime numbers, really fast. It's less than 4 kB, yet it can produce several million prime numbers in just a few hours. It's useful for educational purposes, or if you just love prime numbers. All found numbers are written to a file named "Primes.txt".
How does it work?
PrimeIdentified uses a simple algorithm to find prime numbers. First, it checks whether the number is less than 2. If it is, it is automatically discarded as not being a prime. If it's greater than 2, it checks if it's divisible by 2. If it isn't, the script calculates the square root of the number, and checks if the number is divisible by any odd numbers between 2 and the square root. If it isn't divisible by any of them, the number is qualified as a prime number, displayed to the user and saved to a file.
- Finds millions of prime numbers in just a few hours
- Logs all the numbers to a file
- Displays how many numbers have been found yet
- Light-weight: Less than 4 kB size