That bit of programming is a simple verification of Goldbach's conjecture:
"Every even number can be expressed as the sum of two primes."
The program (if you add the correct braces) searches for small counterexamples. It needs some editing, since it needs to make output when it finds a counterexample, and a number of limits have been omitted.
They use the list of primes as a way to avoid repeatedly testing numbers for primality. Undoubtedly, the function IsPrime() also uses the list.
Last fiddled with by Christenson on 20110901 at 00:49
