Eratosthenes Sieve algorithm -- Fast JAVA implementation
computes the first N primes, and returns P(N) and SUM(P(N)) with N<=900 million
HOME (Traveling Salesman, Quadratic Assignment)