## Submission + - New formula massively reduces prime number memory requirements.

*Peruvian mathematician Harald Helfgott made his mark on the history of mathematics by solving Goldbach's Weak Conjecture, which every odd number greater than 5 can be expressed as the sum of three prime numbers. Now, according to Scientific American, he's found a better solution to the Sieve of Erasthones:*

In order to determine with this sieve all primes between 1 and 100, for example, one has to write down the list of numbers in numerical order and start crossing them out in a certain order: first, the multiples of 2 (except the 2); then, the multiples of 3, except the 3; and so on, starting by the next number that had not been crossed out. The numbers that survive this procedure will be the primes. The method can be formulated as an algorithm.

But now, Helfgott has found a method to drastically reduce the amount of RAM required to run the algorithm:

Helfgott was able to modify the sieve of Eratosthenes to work with less physical memory space. In mathematical terms: instead of needing a space N, now it is enough to have the cube root of N.

*So what will be the impact of this? Will we see cheaper, lower-power encryption devices? Or maybe quicker cracking times in brute force attacks?*