import numpy
import math
import multiprocessing
import random

def calculate_primes(n):
    crivo = numpy.ones(int(n/2), dtype=numpy.bool)
    limit = int(math.sqrt(n)) + 1

    for i in range(3, limit, 2):
        if crivo[int(i/2)]:
            crivo[int(i*i/2) :: i] = False

    prime_indexes = numpy.nonzero(crivo)[0][1::]
    primes  = 2 * prime_indexes.astype(numpy.int32) + 1
    return primes

def check_prime(num):
    if num in range(3):
        return (num, True)
    elif num in calculate_primes(num+1):
        return (num, True)
    else:
        return (num, False)

# Multiprocessing for identifying prime in list of numbers

pool = multiprocessing.Pool()

result = pool.map(check_prime, [random.randint(1, 3000) for i in range(200)])