This page allows you to generate a list of Prime Numbers, as a series. You may choose between a numbered list, or an unformatted sequence of results. Both will have exactly the same entries. Please note that this task requires a lot of memory to run. The actual computation is carried out indirectly: a list of non-prime numbers is produced by generating a set of multiplication tables from the known primes (there is no need to list multiples of the non-prime numbers) and then cross-checking each integer in sequence to see if it exists in the non-prime list.
Click on any of the links at the top of the page to reveal (or hide) more information about this calculator.
This technique works relatively quickly for small to medium sized lists, but is not very efficient for calculating single, large Prime numbers, for which a number of formulae exist. As the Prime numbers get larger, the length of both lists get longer, and the average size of the contents also increases, meaning that if the list of Primes gets ten times longer, the amount of storage (computer memory) required gets approximately fifty times larger.
If you think that you can assist with this project in any way, then please visit the Support section and leave a message.
© Copyright Mike Brockington 2004 - 2019 All Rights Reserved