def check_prime(n, pool, nbr_processes): from_i = 3 to_i = int(math.sqrt(n)) + 1 ranges_to_check = create_range.create(from_i, to_i, nbr_processes) ranges_to_check = zip(len(ranges_to_check) * [n], ranges_to_check) assert len(ranges_to_check) == nbr_processes results = pool.map(check_prime_in_range, ranges_to_check) if False in results: return False return True
def check_prime(n, pool, nbr_processes): # cheaply check high probability set of possible factors from_i = 3 to_i = 21 if not check_prime_in_range((n, (from_i, to_i))): return False from_i = to_i to_i = int(math.sqrt(n)) + 1 ranges_to_check = create_range.create(from_i, to_i, nbr_processes) ranges_to_check = zip(len(ranges_to_check) * [n], ranges_to_check) assert len(ranges_to_check) == nbr_processes results = pool.map(check_prime_in_range, ranges_to_check) if False in results: return False return True
def check_prime(n, pool, nbr_processes): # cheaply check high probability set of possible factors from_i = 3 to_i = SERIAL_CHECK_CUTOFF value.value = FLAG_CLEAR if not check_prime_in_range((n, (from_i, to_i))): return False value.value = FLAG_CLEAR from_i = to_i to_i = int(math.sqrt(n)) + 1 ranges_to_check = create_range.create(from_i, to_i, nbr_processes) ranges_to_check = list(zip(len(ranges_to_check) * [n], ranges_to_check)) assert len(ranges_to_check) == nbr_processes results = pool.map(check_prime_in_range, ranges_to_check) if False in results: return False return True
def check_prime(n, pool, nbr_processes, value): # cheaply check high probability set of possible factors from_i = 3 to_i = SERIAL_CHECK_CUTOFF value.value = FLAG_CLEAR if not check_prime_in_range((n, (from_i, to_i), value)): return False value.value = FLAG_CLEAR from_i = to_i to_i = int(math.sqrt(n)) + 1 ranges_to_check = create_range.create(from_i, to_i, nbr_processes) ranges_to_check = zip(len(ranges_to_check) * [n], ranges_to_check, len(ranges_to_check) * [value]) assert len(ranges_to_check) == nbr_processes results = pool.map(check_prime_in_range, ranges_to_check) if False in results: return False return True
def check_prime(n, pool, nbr_processes): # cheaply check high probability set of possible factors from_i = 3 to_i = SERIAL_CHECK_CUTOFF sh_mem.seek(0) sh_mem.write_byte(FLAG_CLEAR) if not check_prime_in_range((n, (from_i, to_i))): return False sh_mem.seek(0) sh_mem.write_byte(FLAG_CLEAR) from_i = to_i to_i = int(math.sqrt(n)) + 1 ranges_to_check = create_range.create(from_i, to_i, nbr_processes) ranges_to_check = zip(len(ranges_to_check) * [n], ranges_to_check) assert len(ranges_to_check) == nbr_processes results = pool.map(check_prime_in_range, ranges_to_check) if False in results: return False return True