trouble is with this approach to find all the primes smaller than 2 million it takes 45 seconds without stopping once past the square root of the number being tested. with an extra if statement to limit the search to a maximum of the square root of the number whole thing now takes 0.36 125 times faster!!