2009-01-18, 04:46 PM
Something I thought about later... sqrt is not cheap (iirc it uses Newton's method to approximate?).
primesList.get(i) <= Math.sqrt(n)
Use
primeslist.get(i)**2 <= n
primesList.get(i) <= Math.sqrt(n)
Use
primeslist.get(i)**2 <= n

