def is_prime(n):    if n % 2 == 0 and n > 2:        return False    return all(n % i for i in xrange(3, int(math.sqrt(n)) + 1, 2))The code works fine for a range of numbers after that it shows:OverflowError: Python int too large to convert to C longHow can my code be made faster and more efficient?
Checking for Prime Numbers
python;primes;python 2.7