Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Prime Number implementation

Name: Anonymous 2011-03-20 8:29



def factors(x):

    '''returns the factors for an integer'''

    facts=[]

    for i in range(x+1):

        if i==0:

            continue

        elif x%i==0:

            facts.append(i)

    return facts



def isprime(x):

    y=factors(x)

    if len(y)==2:

        return True

    else:

        return False

Name: Anonymous 2011-03-20 13:38

def factors(x):

    div = lambda j: (x % j) == 0

    values = range(2, int(math.sqrt(x))+1)

    return filter(div, values)



def isprime(x):

    return not bool(len(factors))

Newer Posts