def sold_quad_Dio_2(D,limit): x_range_min = 2 x_range_max = limit/10 while True: for ii in range(x_range_min,x_range_max+1): A = pow(ii,2) #print A t = (A-1.0)/D #print t if mwmath.perfect_square(t): #print ii return [ii] x_range_min = x_range_max x_range_max = x_range_max*2 if x_range_min>limit: print 'hit limit' return [1,1]
potential_primes_1.append(6*ii+1) ii+=1 potential_primes_2 = [2,5] print time.time()-s for kk in potential_primes_1: if mwmath.is_prime(kk): potential_primes_2.append(kk) jj = 9 check = True while jj<limit and check: if jj in potential_primes_2: jj+=2 else: for m in potential_primes_2: if m>jj: print jj check=False break else: diff = (jj-m)/2 if mwmath.perfect_square(diff): break jj+=2 print time.time()-s
while 6 * ii <= limit: potential_primes_1.append(6 * ii - 1) potential_primes_1.append(6 * ii + 1) ii += 1 potential_primes_2 = [2, 5] print time.time() - s for kk in potential_primes_1: if mwmath.is_prime(kk): potential_primes_2.append(kk) jj = 9 check = True while jj < limit and check: if jj in potential_primes_2: jj += 2 else: for m in potential_primes_2: if m > jj: print jj check = False break else: diff = (jj - m) / 2 if mwmath.perfect_square(diff): break jj += 2 print time.time() - s