Many, many primes. Calculate thousands of primes in a matter of seconds. (Over 5 thousand of them in the first 10 seconds) What you do with them is your decision. P.S. due to the computation speed some early primes may be skipped. You will need to double-click the green flag; If you don't, the number 29 may not appear on the list. P.S.S Turbo mode does NOT increase computation speed. P.S.S.S Megaprimes (primes over one million) will take a while (a very long time) to compute.
Euler proved that there are an infinite amount of primes. A short version of his proof is below: Assume that the only primes are a, b, c, d, ... all the way to y. Then calculate a*b*c*d...*x*y. After that, add 1. That new number is not divisible by a, b, c, d, or any of the other prime numbers, so it must be a multiple of a new prime number. You can add this new prime to the list to make the list a, b, c, d, ... all the way to z. This can be repeated forever, so there is no limit to the number of primes.
