Prime detect (Python recipe) by mitnk king

ActiveState Code (http://code.activestate.com/recipes/577079/)

There is another variant without using sqrt:

def isPrime(n):
    if n <= 1:
        return False

    i = 2
    while i*i <= n:
        if n % i == 0:
            return False
        i += 1

    return True

Looks nicer if you use count from the itertools module:

from itertools import count
def isPrime(n):
    if n <= 1:
        return False

    for i in count(2):
        if i * i > n:
            return True
        if n % i == 0:
            return False

You can save half the calculations by skipping the even numbers:

def isPrime(n):
    if n <= 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    i = 3
    while i * i <= n:
        if n % i == 0:
            return False
        i += 2
    return True

yeah, thx guys!

This is the fastest python prime detecting function I've found:

def isPrimeNumber(number): if number <= 1: return False

if number == 2:
    return True

for divisor in xrange(3, int(sqrt(number))+1, 2):
    if number % divisor == 0:
        return False

return True

Sorry, it got messed up, and apparently won't let me edit it:

from math import sqrt

def isPrimeNumber(number):

    if number <= 1 or number % 2 == 0:
        return False

    if number == 2:
        return True

    for divisor in xrange(3, int(sqrt(number))+1, 2):
        if number % divisor == 0:
            return False
    return True`