def batch(start,end,k=2,bases=[]): primesFound = 0 if bases==[]: for n in xrange(start,end): if(solovaystrassen(n,k)): primesFound+=1 else: for n in xrange(start,end): if(solovaystrassen(n,bases=bases)): primesFound+=1 return primesFound
#!/usr/bin/env python # Find all primes in the given range using the Solovay-Strassen Primality Test import sys from solovaystrassen import solovaystrassen from writeresults import writeresults args = xrange(int(sys.argv[1]),int(sys.argv[2])+1) primesFound = 0 for num in args: if (solovaystrassen(num)): primesFound += 1 writeresults("solovaystrassen",int(sys.argv[2])-int(sys.argv[1])+1,int(primesFound))